{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TKDF7DMTAFMU6M6EGZXOP4BDEO","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":"bd14f6c52f0ec0a12924de882bc712f809ac39b1091dd6feeace49b36edeb4bb","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-02T16:29:26Z","title_canon_sha256":"c621f69ab5b9d8db5cd46f3a4a8649fe501f24d76f1ce6bdbacede1bbf34b5fc"},"schema_version":"1.0","source":{"id":"1309.0458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0458","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0458v1","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0458","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"TKDF7DMTAFMU","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TKDF7DMTAFMU6M6E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TKDF7DMT","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:b4ea7af3220bd3db4a70b52bea938079f70a914e9146f2dc6136ee829f366c6d","target":"graph","created_at":"2026-05-18T03:14:27Z","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"},"paper":{"abstract_excerpt":"Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages $s$ in a manner so that tampering the codeword causes the decoder to either output $s$ or a message that is independent of $s$. While this is an impossible goal to achieve against unrestricted tampering functions, rather surprisingly non-malleable coding becomes possible against every fixed family $F$ of tampering functions that is not too large (for instance, when $|F| \\le \\exp(2^{\\alpha n})$ for some $\\alpha \\in [0, 1)$ where $n$ is the number of bits in a codeword).\n  In this work, we study the \"c","authors_text":"Mahdi Cheraghchi, Venkatesan Guruswami","cross_cats":["cs.CC","cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-02T16:29:26Z","title":"Capacity of Non-Malleable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0458","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:f39222c3196e29cd957704a2581b460e4c15f6d7247f1b5bbf6b4aeb712e9cdb","target":"record","created_at":"2026-05-18T03:14:27Z","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":"bd14f6c52f0ec0a12924de882bc712f809ac39b1091dd6feeace49b36edeb4bb","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-02T16:29:26Z","title_canon_sha256":"c621f69ab5b9d8db5cd46f3a4a8649fe501f24d76f1ce6bdbacede1bbf34b5fc"},"schema_version":"1.0","source":{"id":"1309.0458","kind":"arxiv","version":1}},"canonical_sha256":"9a865f8d9301594f33c4366ee7f0232397fe12e7d3b166dfe1669a718bbfee1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a865f8d9301594f33c4366ee7f0232397fe12e7d3b166dfe1669a718bbfee1b","first_computed_at":"2026-05-18T03:14:27.248104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:27.248104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"74aop5WrOvOmB2VUaGVSeURdrxdeYXwM3fwsTXTeySqzcfD88EpDHquw91sRYZ9Ih2nVQnpINzVYGQzImj07DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:27.248669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f39222c3196e29cd957704a2581b460e4c15f6d7247f1b5bbf6b4aeb712e9cdb","sha256:b4ea7af3220bd3db4a70b52bea938079f70a914e9146f2dc6136ee829f366c6d"],"state_sha256":"f06f4b82410da287f0a87da98fd06c6556d3170c8ec102d26564afe9b6f42878"}