{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VYOTYFZU2PA6G6LZBSUOFF7LN2","short_pith_number":"pith:VYOTYFZU","schema_version":"1.0","canonical_sha256":"ae1d3c1734d3c1e379790ca8e297eb6eb634fdef06cca4a8943ec2e945436b19","source":{"kind":"arxiv","id":"2606.27849","version":1},"attestation_state":"computed","paper":{"title":"Differential Privacy over Hamming Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Borzoo Rassouli, Morteza Varasteh","submitted_at":"2026-06-26T08:42:34Z","abstract_excerpt":"We consider the transmission of the outputs of counting queries over a binary symmetric channel (BSC), where Hamming codes are employed as the channel encoder. Since the channel is inherently noisy, this transmission already provides a degree of privacy protection ``for free'', albeit at the cost of reduced utility in the form of decoding errors. A natural question is whether this privacy can be further improved (i) without any additional real-time obfuscation of the data, such as injecting artificial noise prior to transmission, and (ii) without increasing the end-to-end error probability. In"},"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":"2606.27849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-26T08:42:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"62ff810ea38e9fe679575b1e66818e0565946077fe260bc07042ff2cc69aefc9","abstract_canon_sha256":"1fe0d0d56c8cba7dd4849b910fd00c2fd1b16ea3971dfce387b13c9cdcd8154f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:50.300537Z","signature_b64":"4QuXfYB8AS/Jbip8dExuOfIyWRYjnyU1B7ArJY0iZ7Eotug98IuhICvpYeK4x4BVof/tf5+9nv84nqIR9HtnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1d3c1734d3c1e379790ca8e297eb6eb634fdef06cca4a8943ec2e945436b19","last_reissued_at":"2026-06-29T01:14:50.300118Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:50.300118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differential Privacy over Hamming Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Borzoo Rassouli, Morteza Varasteh","submitted_at":"2026-06-26T08:42:34Z","abstract_excerpt":"We consider the transmission of the outputs of counting queries over a binary symmetric channel (BSC), where Hamming codes are employed as the channel encoder. Since the channel is inherently noisy, this transmission already provides a degree of privacy protection ``for free'', albeit at the cost of reduced utility in the form of decoding errors. A natural question is whether this privacy can be further improved (i) without any additional real-time obfuscation of the data, such as injecting artificial noise prior to transmission, and (ii) without increasing the end-to-end error probability. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27849","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/2606.27849/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":"2606.27849","created_at":"2026-06-29T01:14:50.300185+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27849v1","created_at":"2026-06-29T01:14:50.300185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27849","created_at":"2026-06-29T01:14:50.300185+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYOTYFZU2PA6","created_at":"2026-06-29T01:14:50.300185+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYOTYFZU2PA6G6LZ","created_at":"2026-06-29T01:14:50.300185+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYOTYFZU","created_at":"2026-06-29T01:14:50.300185+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2","json":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2.json","graph_json":"https://pith.science/api/pith-number/VYOTYFZU2PA6G6LZBSUOFF7LN2/graph.json","events_json":"https://pith.science/api/pith-number/VYOTYFZU2PA6G6LZBSUOFF7LN2/events.json","paper":"https://pith.science/paper/VYOTYFZU"},"agent_actions":{"view_html":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2","download_json":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2.json","view_paper":"https://pith.science/paper/VYOTYFZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27849&json=true","fetch_graph":"https://pith.science/api/pith-number/VYOTYFZU2PA6G6LZBSUOFF7LN2/graph.json","fetch_events":"https://pith.science/api/pith-number/VYOTYFZU2PA6G6LZBSUOFF7LN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2/action/storage_attestation","attest_author":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2/action/author_attestation","sign_citation":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2/action/citation_signature","submit_replication":"https://pith.science/pith/VYOTYFZU2PA6G6LZBSUOFF7LN2/action/replication_record"}},"created_at":"2026-06-29T01:14:50.300185+00:00","updated_at":"2026-06-29T01:14:50.300185+00:00"}