{"id":"https://openalex.org/W1563286165","doi":"https://doi.org/10.37236/962","title":"Information Flows, Graphs and their Guessing Numbers","display_name":"Information Flows, Graphs and their Guessing Numbers","publication_year":2007,"publication_date":"2007-06-07","ids":{"openalex":"https://openalex.org/W1563286165","doi":"https://doi.org/10.37236/962","mag":"1563286165"},"language":"en","primary_location":{"id":"doi:10.37236/962","is_oa":true,"landing_page_url":"https://doi.org/10.37236/962","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r44/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r44/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005137861","display_name":"S\u00f8ren Riis","orcid":"https://orcid.org/0000-0003-0697-4116"},"institutions":[{"id":"https://openalex.org/I4210160447","display_name":"Universidad de Londres","ror":"https://ror.org/054v4yq51","country_code":"MX","type":"education","lineage":["https://openalex.org/I4210160447"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"S\u00f8ren Riis","raw_affiliation_strings":["University of London"],"affiliations":[{"raw_affiliation_string":"University of London","institution_ids":["https://openalex.org/I4210160447"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005137861"],"corresponding_institution_ids":["https://openalex.org/I4210160447"],"apc_list":null,"apc_paid":null,"fwci":1.3464,"has_fulltext":true,"cited_by_count":53,"citation_normalized_percentile":{"value":0.82031492,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.697062611579895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6407315731048584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5660742521286011},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5508629083633423},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5293577313423157},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5199548006057739},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5046221017837524},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5036985278129578},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4582989811897278},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45044034719467163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23008093237876892},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.195265531539917}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.697062611579895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6407315731048584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5660742521286011},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5508629083633423},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5293577313423157},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5199548006057739},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5046221017837524},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5036985278129578},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4582989811897278},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45044034719467163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23008093237876892},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.195265531539917},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/962","is_oa":true,"landing_page_url":"https://doi.org/10.37236/962","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r44/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.7435","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.7435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.qmul.ac.uk/~smriis/NetCod06.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.184","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_14/PDF/v14i1r44.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/962","is_oa":true,"landing_page_url":"https://doi.org/10.37236/962","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1r44/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1563286165.pdf"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1530008367","https://openalex.org/W1804057676","https://openalex.org/W2120085609","https://openalex.org/W2130512442","https://openalex.org/W2138928022","https://openalex.org/W2152664953","https://openalex.org/W2153049854","https://openalex.org/W2160254188","https://openalex.org/W2170184107"],"related_works":["https://openalex.org/W2542610836","https://openalex.org/W2003104918","https://openalex.org/W2289649099","https://openalex.org/W2128020755","https://openalex.org/W2394746612","https://openalex.org/W1997643965","https://openalex.org/W2753798687","https://openalex.org/W2917327790","https://openalex.org/W4288555402","https://openalex.org/W2898680372"],"abstract_inverted_index":{"Valiant's":[0],"shift":[1,132],"problem":[2],"asks":[3],"whether":[4],"all":[5,40,82],"$n$":[6,10],"cyclic":[7,83],"shifts":[8,84],"on":[9],"bits":[11,32,61],"can":[12,35],"be":[13,36,46],"realized":[14],"if":[15],"$n^{(1+\\epsilon)}$":[16],"input":[17],"output":[18],"pairs":[19],"($\\epsilon":[20],"<":[21,97,109],"1$)":[22],"are":[23,28,85],"directly":[24],"connected":[25],"and":[26,103,173],"there":[27],"additionally":[29],"$m$":[30],"common":[31,60,90,140],"available":[33],"that":[34,48,78,107],"arbitrary":[37],"functions":[38],"of":[39,121,127,138,157,179],"the":[41,125,131,136,139,154,163],"inputs.":[42],"If":[43],"it":[44,75],"could":[45],"shown":[47,77],"this":[49,73],"is":[50,76],"not":[51,112],"realizable":[52,86],"with":[53,87,95],"$m":[54,96,108],"=":[55],"O({n\\over":[56],"\\log":[57,58],"n})$":[59],"then":[62],"a":[63,118,161,176],"significant":[64],"breakthrough":[65],"in":[66,79,124,147,181],"Boolean":[67],"circuit":[68],"complexity":[69],"would":[70],"follow.":[71],"In":[72],"paper":[74,164],"certain":[80],"cases":[81],"$m=(n-":[88],"n^{\\epsilon})/2$":[89],"bits.":[91],"Previously,":[92],"no":[93],"solution":[94],"n":[98],"-":[99],"o(n)$":[100],"was":[101,111],"known,":[102],"Valiant":[104],"had":[105],"conjectured":[106],"n/2$":[110],"achievable.":[113],"The":[114,151],"construction":[115,152],"therefore":[116],"establishes":[117],"novel":[119],"way":[120],"realizing":[122],"communication":[123],"manner":[126],"Network":[128,174],"Coding":[129],"for":[130],"problem,":[133],"but":[134],"leaves":[135],"viability":[137],"information":[141,183],"approach":[142],"to":[143],"proving":[144],"lower":[145],"bounds":[146],"Circuit":[148,171],"Complexity":[149,172],"open.":[150],"uses":[153],"graph-theoretic":[155],"notion":[156],"guessing":[158],"number.":[159],"As":[160],"by-product":[162],"also":[165],"establish":[166],"an":[167],"interesting":[168],"link":[169],"between":[170],"Coding,":[175],"new":[177],"direction":[178],"research":[180],"multiuser":[182],"theory.":[184]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}