{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7NBQ26H446E45CYASU7EITABEI","short_pith_number":"pith:7NBQ26H4","schema_version":"1.0","canonical_sha256":"fb430d78fce789ce8b00953e444c01220cbb8e2a13ccfa8b0d73d7420e240c54","source":{"kind":"arxiv","id":"2507.11162","version":1},"attestation_state":"computed","paper":{"title":"Equality is Far Weaker than Constant-Cost Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Artur Riazanov, Mika G\\\"o\\\"os, Nathaniel Harms","submitted_at":"2025-07-15T10:10:21Z","abstract_excerpt":"We exhibit an $n$-bit communication problem with a constant-cost randomized protocol but which requires $n^{\\Omega(1)}$ deterministic (or even non-deterministic) queries to an Equality oracle. Therefore, even constant-cost randomized protocols cannot be efficiently \"derandomized\" using Equality oracles. This improves on several recent results and answers a question from the survey of Hatami and Hatami (SIGACT News 2024). It also gives a significantly simpler and quantitatively superior proof of the main result of Fang, G\\\"o\\\"os, Harms, and Hatami ( STOC 2025), that constant-cost communication "},"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":"2507.11162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-15T10:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"160de26ee2a8decd7cb16e1224d7c3a861f3a35f4b4fbd907083463f43d505cc","abstract_canon_sha256":"64e58bc260b1e3ebde9068e8cfc85b3fcae46334ebcb73f453dd53861d1e83aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:33.511423Z","signature_b64":"fUJICE4l0/IjYuK0DNALqPXQzol8bF5A9lUymnJQ8Ck6PSt2xoTq5NC/zOsShXq8kpPA+3fhplAm/GrqscbFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb430d78fce789ce8b00953e444c01220cbb8e2a13ccfa8b0d73d7420e240c54","last_reissued_at":"2026-07-05T11:37:33.510931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:33.510931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equality is Far Weaker than Constant-Cost Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Artur Riazanov, Mika G\\\"o\\\"os, Nathaniel Harms","submitted_at":"2025-07-15T10:10:21Z","abstract_excerpt":"We exhibit an $n$-bit communication problem with a constant-cost randomized protocol but which requires $n^{\\Omega(1)}$ deterministic (or even non-deterministic) queries to an Equality oracle. Therefore, even constant-cost randomized protocols cannot be efficiently \"derandomized\" using Equality oracles. This improves on several recent results and answers a question from the survey of Hatami and Hatami (SIGACT News 2024). It also gives a significantly simpler and quantitatively superior proof of the main result of Fang, G\\\"o\\\"os, Harms, and Hatami ( STOC 2025), that constant-cost communication "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11162","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11162/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":"2507.11162","created_at":"2026-07-05T11:37:33.511008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11162v1","created_at":"2026-07-05T11:37:33.511008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11162","created_at":"2026-07-05T11:37:33.511008+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NBQ26H446E4","created_at":"2026-07-05T11:37:33.511008+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NBQ26H446E45CYA","created_at":"2026-07-05T11:37:33.511008+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NBQ26H4","created_at":"2026-07-05T11:37:33.511008+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25192","citing_title":"Communication complexity of point-line incidences over the reals","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25192","citing_title":"Communication complexity of point-line incidences over the reals","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI","json":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI.json","graph_json":"https://pith.science/api/pith-number/7NBQ26H446E45CYASU7EITABEI/graph.json","events_json":"https://pith.science/api/pith-number/7NBQ26H446E45CYASU7EITABEI/events.json","paper":"https://pith.science/paper/7NBQ26H4"},"agent_actions":{"view_html":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI","download_json":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI.json","view_paper":"https://pith.science/paper/7NBQ26H4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11162&json=true","fetch_graph":"https://pith.science/api/pith-number/7NBQ26H446E45CYASU7EITABEI/graph.json","fetch_events":"https://pith.science/api/pith-number/7NBQ26H446E45CYASU7EITABEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/action/storage_attestation","attest_author":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/action/author_attestation","sign_citation":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/action/citation_signature","submit_replication":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/action/replication_record"}},"created_at":"2026-07-05T11:37:33.511008+00:00","updated_at":"2026-07-05T11:37:33.511008+00:00"}