{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CIX5HYLVXGA7PXOWKTM5HKI2RM","short_pith_number":"pith:CIX5HYLV","schema_version":"1.0","canonical_sha256":"122fd3e175b981f7ddd654d9d3a91a8b0c80a48e75c4a66c58ec75df578f202e","source":{"kind":"arxiv","id":"1810.00106","version":2},"attestation_state":"computed","paper":{"title":"Expander Graphs are Non-Malleable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CR","authors_text":"Amit Sahai, Peter M. R. Rasmussen","submitted_at":"2018-09-28T22:19:23Z","abstract_excerpt":"Any $d$-regular graph on $n$ vertices with spectral expansion $\\lambda$ satisfying $n = \\Omega(d^3\\log(d)/\\lambda)$ yields a $O\\left(\\frac{\\lambda^{3/2}}{d}\\right)$-non-malleable code for single-bit messages in the split-state model."},"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":"1810.00106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-28T22:19:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2dd96f70e5ef5ae54a2f1959fab344f21ea6f8081f7e9589734d57bcd781b84c","abstract_canon_sha256":"289fcaa94c3e19f3a2bef215030683e778d1e681ea292df5df7055382c517b69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:48.904273Z","signature_b64":"VHxA+tp0QzXfNr34exrpNpzjzWis2R5hmvyBzhKPv0KGnMrO381iPHaN2VyWPLjlfG7It4vNbl6Z8wo1QRF+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122fd3e175b981f7ddd654d9d3a91a8b0c80a48e75c4a66c58ec75df578f202e","last_reissued_at":"2026-05-17T23:50:48.903638Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:48.903638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expander Graphs are Non-Malleable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CR","authors_text":"Amit Sahai, Peter M. R. Rasmussen","submitted_at":"2018-09-28T22:19:23Z","abstract_excerpt":"Any $d$-regular graph on $n$ vertices with spectral expansion $\\lambda$ satisfying $n = \\Omega(d^3\\log(d)/\\lambda)$ yields a $O\\left(\\frac{\\lambda^{3/2}}{d}\\right)$-non-malleable code for single-bit messages in the split-state model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00106","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.00106","created_at":"2026-05-17T23:50:48.903731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00106v2","created_at":"2026-05-17T23:50:48.903731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00106","created_at":"2026-05-17T23:50:48.903731+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIX5HYLVXGA7","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIX5HYLVXGA7PXOW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIX5HYLV","created_at":"2026-05-18T12:32:16.446611+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/CIX5HYLVXGA7PXOWKTM5HKI2RM","json":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM.json","graph_json":"https://pith.science/api/pith-number/CIX5HYLVXGA7PXOWKTM5HKI2RM/graph.json","events_json":"https://pith.science/api/pith-number/CIX5HYLVXGA7PXOWKTM5HKI2RM/events.json","paper":"https://pith.science/paper/CIX5HYLV"},"agent_actions":{"view_html":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM","download_json":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM.json","view_paper":"https://pith.science/paper/CIX5HYLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00106&json=true","fetch_graph":"https://pith.science/api/pith-number/CIX5HYLVXGA7PXOWKTM5HKI2RM/graph.json","fetch_events":"https://pith.science/api/pith-number/CIX5HYLVXGA7PXOWKTM5HKI2RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM/action/storage_attestation","attest_author":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM/action/author_attestation","sign_citation":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM/action/citation_signature","submit_replication":"https://pith.science/pith/CIX5HYLVXGA7PXOWKTM5HKI2RM/action/replication_record"}},"created_at":"2026-05-17T23:50:48.903731+00:00","updated_at":"2026-05-17T23:50:48.903731+00:00"}