{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VHCPMPZPSTD2FFEWATK2S7UIM7","short_pith_number":"pith:VHCPMPZP","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"},"canonical_sha256":"a9c4f63f2f94c7a2949604d5a97e8867f6dd690f022b66bd09369632b700d8bc","source":{"kind":"arxiv","id":"1009.4447","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4447","created_at":"2026-05-18T04:39:51Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4447v2","created_at":"2026-05-18T04:39:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4447","created_at":"2026-05-18T04:39:51Z"},{"alias_kind":"pith_short_12","alias_value":"VHCPMPZPSTD2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VHCPMPZPSTD2FFEW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VHCPMPZP","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VHCPMPZPSTD2FFEWATK2S7UIM7","target":"record","payload":{"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"},"canonical_sha256":"a9c4f63f2f94c7a2949604d5a97e8867f6dd690f022b66bd09369632b700d8bc","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"},"source_kind":"arxiv","source_id":"1009.4447","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:39:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5tgryL1fK+f2IGQ49XN5/PrNChZpiG1VdKWL368l3Lc4qBmpqAUssM3WtV7hwjc8xzHc6znTPJhpF5zi5f1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:28:33.544549Z"},"content_sha256":"9d20695ae4aea0af8634835884f5ed331b16692e6e6ddb20fa2a4c5e4eef4a45","schema_version":"1.0","event_id":"sha256:9d20695ae4aea0af8634835884f5ed331b16692e6e6ddb20fa2a4c5e4eef4a45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VHCPMPZPSTD2FFEWATK2S7UIM7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:39:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKLZttZBN4X13JznS/BtekKX/Ltwg3+V8U7aQLYAWO34MzQadNoV/H0WH47AizkH9W7uMh4cV6uRiDb+NZgeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:28:33.545142Z"},"content_sha256":"9457083fa9caee8ab3fe8ac490bf77bc67b03c455e96862d990fd026f26b0b75","schema_version":"1.0","event_id":"sha256:9457083fa9caee8ab3fe8ac490bf77bc67b03c455e96862d990fd026f26b0b75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/bundle.json","state_url":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T16:28:33Z","links":{"resolver":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7","bundle":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/bundle.json","state":"https://pith.science/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHCPMPZPSTD2FFEWATK2S7UIM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VHCPMPZPSTD2FFEWATK2S7UIM7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7aa1fe1ac59965f2a2e699411137529ba53da62e2e634a2dea48f2aa49993564","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-22T19:01:17Z","title_canon_sha256":"4615bfe19ed4c4405572e8b6876842d6cd782090309e7552f62af36fdef2cbd3"},"schema_version":"1.0","source":{"id":"1009.4447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4447","created_at":"2026-05-18T04:39:51Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4447v2","created_at":"2026-05-18T04:39:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4447","created_at":"2026-05-18T04:39:51Z"},{"alias_kind":"pith_short_12","alias_value":"VHCPMPZPSTD2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VHCPMPZPSTD2FFEW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VHCPMPZP","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:9457083fa9caee8ab3fe8ac490bf77bc67b03c455e96862d990fd026f26b0b75","target":"graph","created_at":"2026-05-18T04:39:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Florent Becker, Ioan Todinca, Ivan Rapaport, Karol Suchan, Mart\\'in Matamala, Nicolas Nisse","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-22T19:01:17Z","title":"Adding a referee to an interconnection network: What can(not) be computed in one round"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4447","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d20695ae4aea0af8634835884f5ed331b16692e6e6ddb20fa2a4c5e4eef4a45","target":"record","created_at":"2026-05-18T04:39:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7aa1fe1ac59965f2a2e699411137529ba53da62e2e634a2dea48f2aa49993564","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-22T19:01:17Z","title_canon_sha256":"4615bfe19ed4c4405572e8b6876842d6cd782090309e7552f62af36fdef2cbd3"},"schema_version":"1.0","source":{"id":"1009.4447","kind":"arxiv","version":2}},"canonical_sha256":"a9c4f63f2f94c7a2949604d5a97e8867f6dd690f022b66bd09369632b700d8bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9c4f63f2f94c7a2949604d5a97e8867f6dd690f022b66bd09369632b700d8bc","first_computed_at":"2026-05-18T04:39:51.035628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:51.035628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7yyZli7rx6VarwOalZ5QUahSadGJLDA5VyJw6I9x/pUL9r3wOCyyqYVh1lWeMxJZGu/UZbgXw8QMgfkk2sQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:51.036214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d20695ae4aea0af8634835884f5ed331b16692e6e6ddb20fa2a4c5e4eef4a45","sha256:9457083fa9caee8ab3fe8ac490bf77bc67b03c455e96862d990fd026f26b0b75"],"state_sha256":"afa6c703c9c79bf0649854ed6a6702780383723b9cddf4befb0913e88b762159"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxN2TRvzhq281+j7i7gCI+080VP/PTjGfoIdzHJZTZeyXJzqj2at88UT3me+sPVhD9nVnp2hxb6EhodbPS5QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:28:33.548622Z","bundle_sha256":"a1f360977be30ca8bb4e93800ba4c1961519562fef7eb6f459e208fae86cbfc5"}}