{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VHCPMPZPSTD2FFEWATK2S7UIM7","short_pith_number":"pith:VHCPMPZP","schema_version":"1.0","canonical_sha256":"a9c4f63f2f94c7a2949604d5a97e8867f6dd690f022b66bd09369632b700d8bc","source":{"kind":"arxiv","id":"1009.4447","version":2},"attestation_state":"computed","paper":{"title":"Adding a referee to an interconnection network: What can(not) be computed in one round","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Florent Becker, Ioan Todinca, Ivan Rapaport, Karol Suchan, Mart\\'in Matamala, Nicolas Nisse","submitted_at":"2010-09-22T19:01:17Z","abstract_excerpt":"In this paper we ask which properties of a distributed network can be computed from a little amount of local information provided by its nodes. The distributed model we consider is a restriction of the classical CONGEST (distributed) model and it is close to the simultaneous messages (communication complexity) model defined by Babai, Kimmel and Lokam. More precisely, each of these n nodes -which only knows its own ID and the IDs of its neighbors- is allowed to send a message of O(log n) bits to some central entity, called the referee. Is it possible for the referee to decide some basic structu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1009.4447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-22T19:01:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4615bfe19ed4c4405572e8b6876842d6cd782090309e7552f62af36fdef2cbd3","abstract_canon_sha256":"7aa1fe1ac59965f2a2e699411137529ba53da62e2e634a2dea48f2aa49993564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:51.036214Z","signature_b64":"h7yyZli7rx6VarwOalZ5QUahSadGJLDA5VyJw6I9x/pUL9r3wOCyyqYVh1lWeMxJZGu/UZbgXw8QMgfkk2sQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9c4f63f2f94c7a2949604d5a97e8867f6dd690f022b66bd09369632b700d8bc","last_reissued_at":"2026-05-18T04:39:51.035628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:51.035628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adding a referee to an interconnection network: What can(not) be computed in one round","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Florent Becker, Ioan Todinca, Ivan Rapaport, Karol Suchan, Mart\\'in Matamala, Nicolas Nisse","submitted_at":"2010-09-22T19:01:17Z","abstract_excerpt":"In this paper we ask which properties of a distributed network can be computed from a little amount of local information provided by its nodes. The distributed model we consider is a restriction of the classical CONGEST (distributed) model and it is close to the simultaneous messages (communication complexity) model defined by Babai, Kimmel and Lokam. More precisely, each of these n nodes -which only knows its own ID and the IDs of its neighbors- is allowed to send a message of O(log n) bits to some central entity, called the referee. Is it possible for the referee to decide some basic structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4447","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.4447","created_at":"2026-05-18T04:39:51.035742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4447v2","created_at":"2026-05-18T04:39:51.035742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4447","created_at":"2026-05-18T04:39:51.035742+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHCPMPZPSTD2","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHCPMPZPSTD2FFEW","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHCPMPZP","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7","json":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7.json","graph_json":"https://pith.science/api/pith-number/VHCPMPZPSTD2FFEWATK2S7UIM7/graph.json","events_json":"https://pith.science/api/pith-number/VHCPMPZPSTD2FFEWATK2S7UIM7/events.json","paper":"https://pith.science/paper/VHCPMPZP"},"agent_actions":{"view_html":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7","download_json":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7.json","view_paper":"https://pith.science/paper/VHCPMPZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4447&json=true","fetch_graph":"https://pith.science/api/pith-number/VHCPMPZPSTD2FFEWATK2S7UIM7/graph.json","fetch_events":"https://pith.science/api/pith-number/VHCPMPZPSTD2FFEWATK2S7UIM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/action/storage_attestation","attest_author":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/action/author_attestation","sign_citation":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/action/citation_signature","submit_replication":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/action/replication_record"}},"created_at":"2026-05-18T04:39:51.035742+00:00","updated_at":"2026-05-18T04:39:51.035742+00:00"}