{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EXMGK3U4WWNGCUBJ3TDMUQYXWX","short_pith_number":"pith:EXMGK3U4","schema_version":"1.0","canonical_sha256":"25d8656e9cb59a615029dcc6ca4317b5d7766a3ff23f40a272cb49115bd8f52d","source":{"kind":"arxiv","id":"2407.20204","version":2},"attestation_state":"computed","paper":{"title":"Constant-Cost Communication is not Reducible to k-Hamming Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mika G\\\"o\\\"os, Nathaniel Harms, Pooya Hatami, Yuting Fang","submitted_at":"2024-07-29T17:35:19Z","abstract_excerpt":"Every known communication problem whose randomized communication cost is constant (independent of the input size) can be reduced to $k$-Hamming Distance, that is, solved with a constant number of deterministic queries to some $k$-Hamming Distance oracle. We exhibit the first examples of constant-cost problems which cannot be reduced to $k$-Hamming Distance.\n  To prove this separation, we relate it to a natural coding-theoretic question. For $f : \\{2, 4, 6\\} \\to \\mathbb{N}$, we say an encoding function $E : \\{0, 1\\}^n \\to \\{0, 1\\}^m$ is an $f$-code if it transforms Hamming distances according t"},"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":"2407.20204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-07-29T17:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"2b896cc1ae84d8c755beea7849e32ca6fa558853e70f2fbb9e5193d2d2cc44a8","abstract_canon_sha256":"65716b8255953af514f44a69bc0212abf4bba661645f3c899ed431dbe2a6d8f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:01.291548Z","signature_b64":"Kf5LopAIXkXc6DDKjBo3f9wjnh7xi/sNO1aGJiyBpkn81bjd9dPlhL2+lFz94wyARlmGU2NpEHVeI2TbzH5kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d8656e9cb59a615029dcc6ca4317b5d7766a3ff23f40a272cb49115bd8f52d","last_reissued_at":"2026-07-05T10:59:01.291035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:01.291035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Cost Communication is not Reducible to k-Hamming Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mika G\\\"o\\\"os, Nathaniel Harms, Pooya Hatami, Yuting Fang","submitted_at":"2024-07-29T17:35:19Z","abstract_excerpt":"Every known communication problem whose randomized communication cost is constant (independent of the input size) can be reduced to $k$-Hamming Distance, that is, solved with a constant number of deterministic queries to some $k$-Hamming Distance oracle. We exhibit the first examples of constant-cost problems which cannot be reduced to $k$-Hamming Distance.\n  To prove this separation, we relate it to a natural coding-theoretic question. For $f : \\{2, 4, 6\\} \\to \\mathbb{N}$, we say an encoding function $E : \\{0, 1\\}^n \\to \\{0, 1\\}^m$ is an $f$-code if it transforms Hamming distances according t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20204","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/2407.20204/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":"2407.20204","created_at":"2026-07-05T10:59:01.291088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.20204v2","created_at":"2026-07-05T10:59:01.291088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20204","created_at":"2026-07-05T10:59:01.291088+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXMGK3U4WWNG","created_at":"2026-07-05T10:59:01.291088+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXMGK3U4WWNGCUBJ","created_at":"2026-07-05T10:59:01.291088+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXMGK3U4","created_at":"2026-07-05T10:59:01.291088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03805","citing_title":"No Constant-Cost Protocol for Point--Line Incidence","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX","json":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX.json","graph_json":"https://pith.science/api/pith-number/EXMGK3U4WWNGCUBJ3TDMUQYXWX/graph.json","events_json":"https://pith.science/api/pith-number/EXMGK3U4WWNGCUBJ3TDMUQYXWX/events.json","paper":"https://pith.science/paper/EXMGK3U4"},"agent_actions":{"view_html":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX","download_json":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX.json","view_paper":"https://pith.science/paper/EXMGK3U4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.20204&json=true","fetch_graph":"https://pith.science/api/pith-number/EXMGK3U4WWNGCUBJ3TDMUQYXWX/graph.json","fetch_events":"https://pith.science/api/pith-number/EXMGK3U4WWNGCUBJ3TDMUQYXWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX/action/storage_attestation","attest_author":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX/action/author_attestation","sign_citation":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX/action/citation_signature","submit_replication":"https://pith.science/pith/EXMGK3U4WWNGCUBJ3TDMUQYXWX/action/replication_record"}},"created_at":"2026-07-05T10:59:01.291088+00:00","updated_at":"2026-07-05T10:59:01.291088+00:00"}