{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OT7TSAHI77OARGTGL6TSB2I7PQ","short_pith_number":"pith:OT7TSAHI","canonical_record":{"source":{"id":"1605.01658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T17:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"899133806f94a842d6d1845d1e5d294fbbe926a8b56d22e0bcd76f00cbc71b3f","abstract_canon_sha256":"6b55dee223e6a268fdbebced979ad526763df8cb1565b934b9cee19602370abe"},"schema_version":"1.0"},"canonical_sha256":"74ff3900e8ffdc089a665fa720e91f7c0b4c191389bfa1460eb227887b9a470f","source":{"kind":"arxiv","id":"1605.01658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01658","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01658v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01658","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"OT7TSAHI77OA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OT7TSAHI77OARGTG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OT7TSAHI","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OT7TSAHI77OARGTGL6TSB2I7PQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T17:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"899133806f94a842d6d1845d1e5d294fbbe926a8b56d22e0bcd76f00cbc71b3f","abstract_canon_sha256":"6b55dee223e6a268fdbebced979ad526763df8cb1565b934b9cee19602370abe"},"schema_version":"1.0"},"canonical_sha256":"74ff3900e8ffdc089a665fa720e91f7c0b4c191389bfa1460eb227887b9a470f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.053832Z","signature_b64":"UeuVuTa9WIoLBeVvihJrXADmtc4W1Ioz/5vHtpon64zUgiehdNiOgkgsieDyBlrgR5TIZqq0uoaYXnIW1vYXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ff3900e8ffdc089a665fa720e91f7c0b4c191389bfa1460eb227887b9a470f","last_reissued_at":"2026-05-18T01:15:33.053182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.053182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01658","source_version":1,"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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmNHjGk6UNKyrC9zXdHwFfBE2EzJZj/p/c4j/018l8V9Tn99cfXoT9A47RqbNX8gFzBcg+vFKHl12iz6Uqp+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:52:02.466665Z"},"content_sha256":"6a2ee952a9ea98e3b26df80bab1b366571d24699d1f5c59448a9b5997594a3f1","schema_version":"1.0","event_id":"sha256:6a2ee952a9ea98e3b26df80bab1b366571d24699d1f5c59448a9b5997594a3f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OT7TSAHI77OARGTGL6TSB2I7PQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Equality in Communication Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Klim Efremenko, Noga Alon","submitted_at":"2016-05-05T17:20:00Z","abstract_excerpt":"Let $G=(V,E)$ be a connected undirected graph with $k$ vertices. Suppose that on each vertex of the graph there is a player having an $n$-bit string. Each player is allowed to communicate with its neighbors according to an agreed communication protocol, and the players must decide, deterministically, if their inputs are all equal. What is the minimum possible total number of bits transmitted in a protocol solving this problem ? We determine this minimum up to a lower order additive term in many cases (but not for all graphs). In particular, we show that it is $kn/2+o(n)$ for any Hamiltonian $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01658","kind":"arxiv","version":1},"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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88U4ldl1DOCkWjiM0dbJ9YPjC+0xjYMhB/1NCsXNc2FOfnkv+ywEnjKcxuA2fIFV3gY+fl/Dj8ZYkV9QlJ7+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:52:02.467023Z"},"content_sha256":"5ed7c4949b07573c24014c25f2cf01313115699821e6c195ceb19ba53f69a4d5","schema_version":"1.0","event_id":"sha256:5ed7c4949b07573c24014c25f2cf01313115699821e6c195ceb19ba53f69a4d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OT7TSAHI77OARGTGL6TSB2I7PQ/bundle.json","state_url":"https://pith.science/pith/OT7TSAHI77OARGTGL6TSB2I7PQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OT7TSAHI77OARGTGL6TSB2I7PQ/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-31T02:52:02Z","links":{"resolver":"https://pith.science/pith/OT7TSAHI77OARGTGL6TSB2I7PQ","bundle":"https://pith.science/pith/OT7TSAHI77OARGTGL6TSB2I7PQ/bundle.json","state":"https://pith.science/pith/OT7TSAHI77OARGTGL6TSB2I7PQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OT7TSAHI77OARGTGL6TSB2I7PQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OT7TSAHI77OARGTGL6TSB2I7PQ","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":"6b55dee223e6a268fdbebced979ad526763df8cb1565b934b9cee19602370abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T17:20:00Z","title_canon_sha256":"899133806f94a842d6d1845d1e5d294fbbe926a8b56d22e0bcd76f00cbc71b3f"},"schema_version":"1.0","source":{"id":"1605.01658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01658","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01658v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01658","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"OT7TSAHI77OA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OT7TSAHI77OARGTG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OT7TSAHI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:5ed7c4949b07573c24014c25f2cf01313115699821e6c195ceb19ba53f69a4d5","target":"graph","created_at":"2026-05-18T01:15:33Z","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":"Let $G=(V,E)$ be a connected undirected graph with $k$ vertices. Suppose that on each vertex of the graph there is a player having an $n$-bit string. Each player is allowed to communicate with its neighbors according to an agreed communication protocol, and the players must decide, deterministically, if their inputs are all equal. What is the minimum possible total number of bits transmitted in a protocol solving this problem ? We determine this minimum up to a lower order additive term in many cases (but not for all graphs). In particular, we show that it is $kn/2+o(n)$ for any Hamiltonian $k","authors_text":"Benny Sudakov, Klim Efremenko, Noga Alon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T17:20:00Z","title":"Testing Equality in Communication Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01658","kind":"arxiv","version":1},"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:6a2ee952a9ea98e3b26df80bab1b366571d24699d1f5c59448a9b5997594a3f1","target":"record","created_at":"2026-05-18T01:15:33Z","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":"6b55dee223e6a268fdbebced979ad526763df8cb1565b934b9cee19602370abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T17:20:00Z","title_canon_sha256":"899133806f94a842d6d1845d1e5d294fbbe926a8b56d22e0bcd76f00cbc71b3f"},"schema_version":"1.0","source":{"id":"1605.01658","kind":"arxiv","version":1}},"canonical_sha256":"74ff3900e8ffdc089a665fa720e91f7c0b4c191389bfa1460eb227887b9a470f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74ff3900e8ffdc089a665fa720e91f7c0b4c191389bfa1460eb227887b9a470f","first_computed_at":"2026-05-18T01:15:33.053182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:33.053182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UeuVuTa9WIoLBeVvihJrXADmtc4W1Ioz/5vHtpon64zUgiehdNiOgkgsieDyBlrgR5TIZqq0uoaYXnIW1vYXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:33.053832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a2ee952a9ea98e3b26df80bab1b366571d24699d1f5c59448a9b5997594a3f1","sha256:5ed7c4949b07573c24014c25f2cf01313115699821e6c195ceb19ba53f69a4d5"],"state_sha256":"3a82f8193517f43f9af4e0c383892b7c6c4eb8d9ceb5e1f65711e0fbdec3e977"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aAz15+ypAb6ZgZHl44n+ts2fJRHQ3HsxMchCQkS8mPCDpL0CttCb/EuG5IwLxAlfKPhemsIpZJMoqMMqLWzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:52:02.469117Z","bundle_sha256":"45bba284e6d64bcdc97f7048e01369225234318ee9665bc021adaefb92408cb7"}}