{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7NBQ26H446E45CYASU7EITABEI","short_pith_number":"pith:7NBQ26H4","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"},"canonical_sha256":"fb430d78fce789ce8b00953e444c01220cbb8e2a13ccfa8b0d73d7420e240c54","source":{"kind":"arxiv","id":"2507.11162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11162","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11162v1","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11162","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"7NBQ26H446E4","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"7NBQ26H446E45CYA","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"7NBQ26H4","created_at":"2026-07-05T11:37:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7NBQ26H446E45CYASU7EITABEI","target":"record","payload":{"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"},"canonical_sha256":"fb430d78fce789ce8b00953e444c01220cbb8e2a13ccfa8b0d73d7420e240c54","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"},"source_kind":"arxiv","source_id":"2507.11162","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5sbObfTNrIEpKBm1OQ3wtNEqq+huo7NW+BehdILWvNE1ZikUKbNvV/OJRcyH/z7OiGVsgtn7WwdNnJDtYAWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:51:30.618968Z"},"content_sha256":"5ce3ddc3b378d19608d8af4b7a3a2652bacfb7b38e53e88ef6c7337d6f9ac24c","schema_version":"1.0","event_id":"sha256:5ce3ddc3b378d19608d8af4b7a3a2652bacfb7b38e53e88ef6c7337d6f9ac24c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7NBQ26H446E45CYASU7EITABEI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAzJaRrCFOyhf4nvCSZ0WQhhgWmvN4EKzkE3/kRZ3sBe+WejG72V0Wc1BMbHthiIOGTsgudjq5ES9NeARBc2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T22:51:30.619459Z"},"content_sha256":"7157f7dc066600a72354291e36f1335670f477a6e5d15988a36e0f1ab07b5cc3","schema_version":"1.0","event_id":"sha256:7157f7dc066600a72354291e36f1335670f477a6e5d15988a36e0f1ab07b5cc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/bundle.json","state_url":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NBQ26H446E45CYASU7EITABEI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T22:51:30Z","links":{"resolver":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI","bundle":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/bundle.json","state":"https://pith.science/pith/7NBQ26H446E45CYASU7EITABEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NBQ26H446E45CYASU7EITABEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7NBQ26H446E45CYASU7EITABEI","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":"64e58bc260b1e3ebde9068e8cfc85b3fcae46334ebcb73f453dd53861d1e83aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-15T10:10:21Z","title_canon_sha256":"160de26ee2a8decd7cb16e1224d7c3a861f3a35f4b4fbd907083463f43d505cc"},"schema_version":"1.0","source":{"id":"2507.11162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11162","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11162v1","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11162","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"7NBQ26H446E4","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"7NBQ26H446E45CYA","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"7NBQ26H4","created_at":"2026-07-05T11:37:33Z"}],"graph_snapshots":[{"event_id":"sha256:7157f7dc066600a72354291e36f1335670f477a6e5d15988a36e0f1ab07b5cc3","target":"graph","created_at":"2026-07-05T11:37:33Z","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/2507.11162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Artur Riazanov, Mika G\\\"o\\\"os, Nathaniel Harms","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-15T10:10:21Z","title":"Equality is Far Weaker than Constant-Cost Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11162","kind":"arxiv","version":1},"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:5ce3ddc3b378d19608d8af4b7a3a2652bacfb7b38e53e88ef6c7337d6f9ac24c","target":"record","created_at":"2026-07-05T11:37:33Z","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":"64e58bc260b1e3ebde9068e8cfc85b3fcae46334ebcb73f453dd53861d1e83aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-15T10:10:21Z","title_canon_sha256":"160de26ee2a8decd7cb16e1224d7c3a861f3a35f4b4fbd907083463f43d505cc"},"schema_version":"1.0","source":{"id":"2507.11162","kind":"arxiv","version":1}},"canonical_sha256":"fb430d78fce789ce8b00953e444c01220cbb8e2a13ccfa8b0d73d7420e240c54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb430d78fce789ce8b00953e444c01220cbb8e2a13ccfa8b0d73d7420e240c54","first_computed_at":"2026-07-05T11:37:33.510931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:33.510931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUJICE4l0/IjYuK0DNALqPXQzol8bF5A9lUymnJQ8Ck6PSt2xoTq5NC/zOsShXq8kpPA+3fhplAm/GrqscbFBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:33.511423Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ce3ddc3b378d19608d8af4b7a3a2652bacfb7b38e53e88ef6c7337d6f9ac24c","sha256:7157f7dc066600a72354291e36f1335670f477a6e5d15988a36e0f1ab07b5cc3"],"state_sha256":"905c17b00532b892ee5046a685b83b6deb0c6a368c9111807a88b3ada056d7e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hcrtzL+AHhQpUuAcluOZ9xaCpcxRZfcf0JD48J2HoCbTScEQEhpmL3TYT+VamI1H8HA+4ZSU7ytdIj8oQGKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T22:51:30.623225Z","bundle_sha256":"c1c9349fbfcf88299bca2f87427f3091b0127e515b06a21bbaedbc2e745f76d7"}}