{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IPXPF523WDDPMKICDHQKZMW2CW","short_pith_number":"pith:IPXPF523","schema_version":"1.0","canonical_sha256":"43eef2f75bb0c6f6290219e0acb2da15be07d65e8b17d8f88363e18881bbb067","source":{"kind":"arxiv","id":"1212.1941","version":2},"attestation_state":"computed","paper":{"title":"Amortized communication complexity of an equality predicate","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Vladimir Nikishkin","submitted_at":"2012-12-10T00:13:19Z","abstract_excerpt":"We study the communication complexity of a direct sum of independent copies of the equality predicate. We prove that the probabilistic communication complexity of this problem is equal to O(N); computational complexity of the proposed protocol is polynomial in size of inputs. Our protocol improves the result achieved in 1995(Feder, Kushilevitz, Naor, Nisan). Our construction is based on two techniques: Nisan's pseudorandom generator (1992) and Smith's string synchronization algorithm (2007)."},"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":"1212.1941","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CC","submitted_at":"2012-12-10T00:13:19Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d8559d1df55e9ffa10a1b0118b85160e49323c622810a4b5aa5fa6c6550414d1","abstract_canon_sha256":"e022440f8f1ef7d8038d76139200249ead026f002ed9079d80cba4f7a3407520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:45.648424Z","signature_b64":"2wbL+/mvxeIoeoLvVYTmDUCDB/THJKxeBquRjW/UnZqpRY1X+LJkk1Xi63YaLH+qhtkVfyeZKwxbc+i3/c9oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43eef2f75bb0c6f6290219e0acb2da15be07d65e8b17d8f88363e18881bbb067","last_reissued_at":"2026-05-18T03:38:45.647822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:45.647822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amortized communication complexity of an equality predicate","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Vladimir Nikishkin","submitted_at":"2012-12-10T00:13:19Z","abstract_excerpt":"We study the communication complexity of a direct sum of independent copies of the equality predicate. We prove that the probabilistic communication complexity of this problem is equal to O(N); computational complexity of the proposed protocol is polynomial in size of inputs. Our protocol improves the result achieved in 1995(Feder, Kushilevitz, Naor, Nisan). Our construction is based on two techniques: Nisan's pseudorandom generator (1992) and Smith's string synchronization algorithm (2007)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1941","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":"1212.1941","created_at":"2026-05-18T03:38:45.647900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1941v2","created_at":"2026-05-18T03:38:45.647900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1941","created_at":"2026-05-18T03:38:45.647900+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPXPF523WDDP","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPXPF523WDDPMKIC","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPXPF523","created_at":"2026-05-18T12:27:09.501522+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/IPXPF523WDDPMKICDHQKZMW2CW","json":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW.json","graph_json":"https://pith.science/api/pith-number/IPXPF523WDDPMKICDHQKZMW2CW/graph.json","events_json":"https://pith.science/api/pith-number/IPXPF523WDDPMKICDHQKZMW2CW/events.json","paper":"https://pith.science/paper/IPXPF523"},"agent_actions":{"view_html":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW","download_json":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW.json","view_paper":"https://pith.science/paper/IPXPF523","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1941&json=true","fetch_graph":"https://pith.science/api/pith-number/IPXPF523WDDPMKICDHQKZMW2CW/graph.json","fetch_events":"https://pith.science/api/pith-number/IPXPF523WDDPMKICDHQKZMW2CW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW/action/storage_attestation","attest_author":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW/action/author_attestation","sign_citation":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW/action/citation_signature","submit_replication":"https://pith.science/pith/IPXPF523WDDPMKICDHQKZMW2CW/action/replication_record"}},"created_at":"2026-05-18T03:38:45.647900+00:00","updated_at":"2026-05-18T03:38:45.647900+00:00"}