{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q5WALT3FURHTE4UQ4PDRCHELZD","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":"b900d9bc7404df6d81497607f51aa9f10e380e97dac8e01064bdee4e831e0786","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-04T19:52:59Z","title_canon_sha256":"ccdf2723674b225211515d648ad2366952e89a3f0719f1d6159dadf034a3ccb2"},"schema_version":"1.0","source":{"id":"1309.1151","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1151","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1151v2","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1151","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q5WALT3FURHT","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q5WALT3FURHTE4UQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q5WALT3F","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:90a5ba86454cc622c34e1c4fc92f02f0980c135c0b6b31c77ad15b47ba4b1562","target":"graph","created_at":"2026-05-18T02:44:00Z","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 coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where error-detection is impossible. Intuitively, information encoded by a non-malleable code either decodes to the original message or, in presence of any tampering, to an unrelated message. Dziembowski et al. show existence of non-malleable codes for any class of tampering functions of bounded size.\n  We consider constructions of coding schemes against two well-studied classes of tampering functions: bit-wise tampering functi","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-04T19:52:59Z","title":"Non-Malleable Coding Against Bit-wise and Split-State Tampering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1151","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:5c9dfa3022d22eed3d9f334161c52c5a94a970e7d9b118ffb4b9ca574297f5e8","target":"record","created_at":"2026-05-18T02:44:00Z","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":"b900d9bc7404df6d81497607f51aa9f10e380e97dac8e01064bdee4e831e0786","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-04T19:52:59Z","title_canon_sha256":"ccdf2723674b225211515d648ad2366952e89a3f0719f1d6159dadf034a3ccb2"},"schema_version":"1.0","source":{"id":"1309.1151","kind":"arxiv","version":2}},"canonical_sha256":"876c05cf65a44f327290e3c7111c8bc8f2e19f4ba10bbbe8cab32dd560f4de6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"876c05cf65a44f327290e3c7111c8bc8f2e19f4ba10bbbe8cab32dd560f4de6a","first_computed_at":"2026-05-18T02:44:00.612106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:00.612106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZDxqeeE5AzH+U0FyhAVwwR/KVFpSgfUp2aXP6IGop58aiIJQ3VUWrVjvQk4AyDzzCfamUJE3X4aMSRAdQHkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:00.612470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1151","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c9dfa3022d22eed3d9f334161c52c5a94a970e7d9b118ffb4b9ca574297f5e8","sha256:90a5ba86454cc622c34e1c4fc92f02f0980c135c0b6b31c77ad15b47ba4b1562"],"state_sha256":"b2c8b23cdfa2dfd364b656dcf2a56e0b8ca3e506a8b52db2ceb98a24e30a4432"}