{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3LKPK77FXCGSCR7FTINEIXT436","short_pith_number":"pith:3LKPK77F","schema_version":"1.0","canonical_sha256":"dad4f57fe5b88d2147e59a1a445e7cdfa8a1f2761ed6894aca95259e759ff550","source":{"kind":"arxiv","id":"2208.00029","version":2},"attestation_state":"computed","paper":{"title":"Communication Complexity of Collision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mika G\\\"o\\\"os, Siddhartha Jain","submitted_at":"2022-07-29T18:20:03Z","abstract_excerpt":"The Collision problem is to decide whether a given list of numbers $(x_1,\\ldots,x_n)\\in[n]^n$ is $1$-to-$1$ or $2$-to-$1$ when promised one of them is the case. We show an $n^{\\Omega(1)}$ randomised communication lower bound for the natural two-party version of Collision where Alice holds the first half of the bits of each $x_i$ and Bob holds the second half. As an application, we also show a similar lower bound for a weak bit-pigeonhole search problem, which answers a question of Itsykson and Riazanov (CCC 2021)."},"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":"2208.00029","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-07-29T18:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"62a8e680df34c7b6d69a156239aef83025688dfa6b164e249de65a448429092c","abstract_canon_sha256":"c2e78fb00e7b2137b2bea6922576304286a82d8f240afb5e5059031dbf45e971"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:29.208040Z","signature_b64":"RbyV9w2vW9ICojChhZYLv4y5j+hwLrYqEvyno9soqx/ggf8fMyvkjNjOAuXYD0mKzc3fpMZ+y+3ftpdcEp64BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dad4f57fe5b88d2147e59a1a445e7cdfa8a1f2761ed6894aca95259e759ff550","last_reissued_at":"2026-07-05T04:47:29.207607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:29.207607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Complexity of Collision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mika G\\\"o\\\"os, Siddhartha Jain","submitted_at":"2022-07-29T18:20:03Z","abstract_excerpt":"The Collision problem is to decide whether a given list of numbers $(x_1,\\ldots,x_n)\\in[n]^n$ is $1$-to-$1$ or $2$-to-$1$ when promised one of them is the case. We show an $n^{\\Omega(1)}$ randomised communication lower bound for the natural two-party version of Collision where Alice holds the first half of the bits of each $x_i$ and Bob holds the second half. As an application, we also show a similar lower bound for a weak bit-pigeonhole search problem, which answers a question of Itsykson and Riazanov (CCC 2021)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00029","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.00029/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.00029","created_at":"2026-07-05T04:47:29.207664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.00029v2","created_at":"2026-07-05T04:47:29.207664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00029","created_at":"2026-07-05T04:47:29.207664+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LKPK77FXCGS","created_at":"2026-07-05T04:47:29.207664+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LKPK77FXCGSCR7F","created_at":"2026-07-05T04:47:29.207664+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LKPK77F","created_at":"2026-07-05T04:47:29.207664+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436","json":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436.json","graph_json":"https://pith.science/api/pith-number/3LKPK77FXCGSCR7FTINEIXT436/graph.json","events_json":"https://pith.science/api/pith-number/3LKPK77FXCGSCR7FTINEIXT436/events.json","paper":"https://pith.science/paper/3LKPK77F"},"agent_actions":{"view_html":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436","download_json":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436.json","view_paper":"https://pith.science/paper/3LKPK77F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.00029&json=true","fetch_graph":"https://pith.science/api/pith-number/3LKPK77FXCGSCR7FTINEIXT436/graph.json","fetch_events":"https://pith.science/api/pith-number/3LKPK77FXCGSCR7FTINEIXT436/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436/action/storage_attestation","attest_author":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436/action/author_attestation","sign_citation":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436/action/citation_signature","submit_replication":"https://pith.science/pith/3LKPK77FXCGSCR7FTINEIXT436/action/replication_record"}},"created_at":"2026-07-05T04:47:29.207664+00:00","updated_at":"2026-07-05T04:47:29.207664+00:00"}