{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MZH73BNG2EDLZOQTKXPGXKJRVR","short_pith_number":"pith:MZH73BNG","schema_version":"1.0","canonical_sha256":"664ffd85a6d106bcba1355de6ba931ac6d942f628fec80288bbbb17e68e0d651","source":{"kind":"arxiv","id":"1804.04005","version":1},"attestation_state":"computed","paper":{"title":"Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.CO"],"primary_cat":"cs.CC","authors_text":"Xin Li","submitted_at":"2018-04-09T18:38:25Z","abstract_excerpt":"The recent line of study on randomness extractors has been a great success, resulting in exciting new techniques, new connections, and breakthroughs to long standing open problems in several seemingly different topics. These include seeded non-malleable extractors, privacy amplification protocols with an active adversary, independent source extractors (and explicit Ramsey graphs), and non-malleable codes in the split state model. However, in all cases there is still a gap to optimum and the motivation to close this gap remains strong.\n  In this paper, we introduce a set of new techniques to fu"},"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":"1804.04005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-09T18:38:25Z","cross_cats_sorted":["cs.CR","math.CO"],"title_canon_sha256":"aac19bb1c2a2fca053319411dee41c4dec7cda6dde966334c5ae89ef21eae17b","abstract_canon_sha256":"79796a00017d240812750e5669570eabaedf20f5329fa40848db74057dd44da2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.407361Z","signature_b64":"GWAPz1C4YVYufvkqJCAIjoi72G4Is2ardLDHoWVOcZYhKJTlzDgKAwKzgvH3YViF5e/w3vFcbUCFHH0DeB7eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"664ffd85a6d106bcba1355de6ba931ac6d942f628fec80288bbbb17e68e0d651","last_reissued_at":"2026-05-18T00:18:42.406763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.406763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.CO"],"primary_cat":"cs.CC","authors_text":"Xin Li","submitted_at":"2018-04-09T18:38:25Z","abstract_excerpt":"The recent line of study on randomness extractors has been a great success, resulting in exciting new techniques, new connections, and breakthroughs to long standing open problems in several seemingly different topics. These include seeded non-malleable extractors, privacy amplification protocols with an active adversary, independent source extractors (and explicit Ramsey graphs), and non-malleable codes in the split state model. However, in all cases there is still a gap to optimum and the motivation to close this gap remains strong.\n  In this paper, we introduce a set of new techniques to fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04005","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.04005","created_at":"2026-05-18T00:18:42.406836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04005v1","created_at":"2026-05-18T00:18:42.406836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04005","created_at":"2026-05-18T00:18:42.406836+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZH73BNG2EDL","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZH73BNG2EDLZOQT","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZH73BNG","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02089","citing_title":"An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR","json":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR.json","graph_json":"https://pith.science/api/pith-number/MZH73BNG2EDLZOQTKXPGXKJRVR/graph.json","events_json":"https://pith.science/api/pith-number/MZH73BNG2EDLZOQTKXPGXKJRVR/events.json","paper":"https://pith.science/paper/MZH73BNG"},"agent_actions":{"view_html":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR","download_json":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR.json","view_paper":"https://pith.science/paper/MZH73BNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04005&json=true","fetch_graph":"https://pith.science/api/pith-number/MZH73BNG2EDLZOQTKXPGXKJRVR/graph.json","fetch_events":"https://pith.science/api/pith-number/MZH73BNG2EDLZOQTKXPGXKJRVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR/action/storage_attestation","attest_author":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR/action/author_attestation","sign_citation":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR/action/citation_signature","submit_replication":"https://pith.science/pith/MZH73BNG2EDLZOQTKXPGXKJRVR/action/replication_record"}},"created_at":"2026-05-18T00:18:42.406836+00:00","updated_at":"2026-05-18T00:18:42.406836+00:00"}