{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4PBN35YAJ3VBSNSKZW2BNVARMX","short_pith_number":"pith:4PBN35YA","canonical_record":{"source":{"id":"1802.07673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T17:11:52Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"dedf9aaa752f3008f59825914f06dbabd99f5c9688d1c43a10f1bbd95fe20ab8","abstract_canon_sha256":"92e489e2a85f70717b886313ff2e3420e03529d2311a98f2b9d5159519ababc6"},"schema_version":"1.0"},"canonical_sha256":"e3c2ddf7004eea19364acdb416d41165f55eee437fa7132340005e3ecd581311","source":{"kind":"arxiv","id":"1802.07673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07673","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07673v1","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07673","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"4PBN35YAJ3VB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PBN35YAJ3VBSNSK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PBN35YA","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4PBN35YAJ3VBSNSKZW2BNVARMX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T17:11:52Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"dedf9aaa752f3008f59825914f06dbabd99f5c9688d1c43a10f1bbd95fe20ab8","abstract_canon_sha256":"92e489e2a85f70717b886313ff2e3420e03529d2311a98f2b9d5159519ababc6"},"schema_version":"1.0"},"canonical_sha256":"e3c2ddf7004eea19364acdb416d41165f55eee437fa7132340005e3ecd581311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.651745Z","signature_b64":"/uTnaNyz2i4jOPX1KZUBmtlr79yUMxJj/6i4a3iYvSIx3roe3BtvvaSugFVJkZtFWIosntFGmfy/H8UdfHDkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3c2ddf7004eea19364acdb416d41165f55eee437fa7132340005e3ecd581311","last_reissued_at":"2026-05-18T00:22:49.651339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.651339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07673","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-05-18T00:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/EoTAH8ATc92pZPaKfjs8heGvKWHFbVSpUmDMez3TkgPA2ri8fK06fzJ5tYjMCQFc24oJaeOSI4FYshnS5+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:48:01.273686Z"},"content_sha256":"774e7385aa8a54bb54cf31c8da409e933234b6ec395439a96106c18984a222d6","schema_version":"1.0","event_id":"sha256:774e7385aa8a54bb54cf31c8da409e933234b6ec395439a96106c18984a222d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4PBN35YAJ3VBSNSKZW2BNVARMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Malleable Codes for Small-Depth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Dana Dachman-Soled, Li-Yang Tan, Marshall Ball, Siyao Guo, Tal Malkin","submitted_at":"2018-02-21T17:11:52Z","abstract_excerpt":"We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by small-depth circuits. For constant-depth circuits of polynomial size (i.e. $\\mathsf{AC^0}$ tampering functions), our codes have codeword length $n = k^{1+o(1)}$ for a $k$-bit message. This is an exponential improvement of the previous best construction due to Chattopadhyay and Li (STOC 2017), which had codeword length $2^{O(\\sqrt{k})}$. Our construction remains efficient for circuit depths as large as $\\Theta(\\log(n)/\\log\\log(n))$ (indeed, our codeword length remains $n\\leq k^{1+\\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07673","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":""},"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-05-18T00:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QXWPIgcImE/YsLiYihUUQa+zLZVzlL9uOROhZjRTI247TLpHi5B95J31jQrkqt7crQSZxe3WSjPI9LO37cRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:48:01.274364Z"},"content_sha256":"c28a235c0a70a30337333ca2d43422682bce7da416a5a69e5677d2fcf9a03212","schema_version":"1.0","event_id":"sha256:c28a235c0a70a30337333ca2d43422682bce7da416a5a69e5677d2fcf9a03212"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PBN35YAJ3VBSNSKZW2BNVARMX/bundle.json","state_url":"https://pith.science/pith/4PBN35YAJ3VBSNSKZW2BNVARMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PBN35YAJ3VBSNSKZW2BNVARMX/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-05-27T20:48:01Z","links":{"resolver":"https://pith.science/pith/4PBN35YAJ3VBSNSKZW2BNVARMX","bundle":"https://pith.science/pith/4PBN35YAJ3VBSNSKZW2BNVARMX/bundle.json","state":"https://pith.science/pith/4PBN35YAJ3VBSNSKZW2BNVARMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PBN35YAJ3VBSNSKZW2BNVARMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4PBN35YAJ3VBSNSKZW2BNVARMX","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":"92e489e2a85f70717b886313ff2e3420e03529d2311a98f2b9d5159519ababc6","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T17:11:52Z","title_canon_sha256":"dedf9aaa752f3008f59825914f06dbabd99f5c9688d1c43a10f1bbd95fe20ab8"},"schema_version":"1.0","source":{"id":"1802.07673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07673","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07673v1","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07673","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"4PBN35YAJ3VB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PBN35YAJ3VBSNSK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PBN35YA","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:c28a235c0a70a30337333ca2d43422682bce7da416a5a69e5677d2fcf9a03212","target":"graph","created_at":"2026-05-18T00:22:49Z","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":"We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by small-depth circuits. For constant-depth circuits of polynomial size (i.e. $\\mathsf{AC^0}$ tampering functions), our codes have codeword length $n = k^{1+o(1)}$ for a $k$-bit message. This is an exponential improvement of the previous best construction due to Chattopadhyay and Li (STOC 2017), which had codeword length $2^{O(\\sqrt{k})}$. Our construction remains efficient for circuit depths as large as $\\Theta(\\log(n)/\\log\\log(n))$ (indeed, our codeword length remains $n\\leq k^{1+\\e","authors_text":"Dana Dachman-Soled, Li-Yang Tan, Marshall Ball, Siyao Guo, Tal Malkin","cross_cats":["cs.CR","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T17:11:52Z","title":"Non-Malleable Codes for Small-Depth Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07673","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:774e7385aa8a54bb54cf31c8da409e933234b6ec395439a96106c18984a222d6","target":"record","created_at":"2026-05-18T00:22:49Z","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":"92e489e2a85f70717b886313ff2e3420e03529d2311a98f2b9d5159519ababc6","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-21T17:11:52Z","title_canon_sha256":"dedf9aaa752f3008f59825914f06dbabd99f5c9688d1c43a10f1bbd95fe20ab8"},"schema_version":"1.0","source":{"id":"1802.07673","kind":"arxiv","version":1}},"canonical_sha256":"e3c2ddf7004eea19364acdb416d41165f55eee437fa7132340005e3ecd581311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3c2ddf7004eea19364acdb416d41165f55eee437fa7132340005e3ecd581311","first_computed_at":"2026-05-18T00:22:49.651339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:49.651339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/uTnaNyz2i4jOPX1KZUBmtlr79yUMxJj/6i4a3iYvSIx3roe3BtvvaSugFVJkZtFWIosntFGmfy/H8UdfHDkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:49.651745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:774e7385aa8a54bb54cf31c8da409e933234b6ec395439a96106c18984a222d6","sha256:c28a235c0a70a30337333ca2d43422682bce7da416a5a69e5677d2fcf9a03212"],"state_sha256":"2ac44ec9a5a68c92b244eae0030e60e570cbb26e579ff97f9b6f1482ee6b3281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyx0U8oKxghxL13oxOANj2N8rc9l+WMQKELbE8QnyHMDZakfvilm1KlnOYXgZSJ+pkeMO1dFnEem8PwiNc0ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:48:01.278166Z","bundle_sha256":"8542d24632f044d5badb948d7eae570d8b127265edcef9e1bb3f44ad84d87bcb"}}