{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EXMGK3U4WWNGCUBJ3TDMUQYXWX","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":"65716b8255953af514f44a69bc0212abf4bba661645f3c899ed431dbe2a6d8f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-07-29T17:35:19Z","title_canon_sha256":"2b896cc1ae84d8c755beea7849e32ca6fa558853e70f2fbb9e5193d2d2cc44a8"},"schema_version":"1.0","source":{"id":"2407.20204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.20204","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"2407.20204v2","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20204","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"EXMGK3U4WWNG","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"EXMGK3U4WWNGCUBJ","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"EXMGK3U4","created_at":"2026-07-05T10:59:01Z"}],"graph_snapshots":[{"event_id":"sha256:307a960f2bc72b62f9686c19e203583bbb74b27265be69c8480eceeb34698beb","target":"graph","created_at":"2026-07-05T10:59:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.20204/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mika G\\\"o\\\"os, Nathaniel Harms, Pooya Hatami, Yuting Fang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-07-29T17:35:19Z","title":"Constant-Cost Communication is not Reducible to k-Hamming Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20204","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:09f4742ab9f86920c7d5c60ce1c3d0ccecd752ba71197b0e1921b1e01b3bf873","target":"record","created_at":"2026-07-05T10:59:01Z","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":"65716b8255953af514f44a69bc0212abf4bba661645f3c899ed431dbe2a6d8f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-07-29T17:35:19Z","title_canon_sha256":"2b896cc1ae84d8c755beea7849e32ca6fa558853e70f2fbb9e5193d2d2cc44a8"},"schema_version":"1.0","source":{"id":"2407.20204","kind":"arxiv","version":2}},"canonical_sha256":"25d8656e9cb59a615029dcc6ca4317b5d7766a3ff23f40a272cb49115bd8f52d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25d8656e9cb59a615029dcc6ca4317b5d7766a3ff23f40a272cb49115bd8f52d","first_computed_at":"2026-07-05T10:59:01.291035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:01.291035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kf5LopAIXkXc6DDKjBo3f9wjnh7xi/sNO1aGJiyBpkn81bjd9dPlhL2+lFz94wyARlmGU2NpEHVeI2TbzH5kAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:01.291548Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.20204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09f4742ab9f86920c7d5c60ce1c3d0ccecd752ba71197b0e1921b1e01b3bf873","sha256:307a960f2bc72b62f9686c19e203583bbb74b27265be69c8480eceeb34698beb"],"state_sha256":"1dcdde52d78f762eb6bc8a6067f0017703d5ca7602e7a65826746c71c4ba7ff1"}