{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X4PT3VXNGJPOCDDUWP2SLV3UXT","short_pith_number":"pith:X4PT3VXN","schema_version":"1.0","canonical_sha256":"bf1f3dd6ed325ee10c74b3f525d774bcf18e589265cb59f5bd29f63da7af1dc0","source":{"kind":"arxiv","id":"1701.07914","version":1},"attestation_state":"computed","paper":{"title":"Non-Malleable Codes Against Affine Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ryota Iwamoto, Takeshi Koshiba","submitted_at":"2017-01-27T00:47:35Z","abstract_excerpt":"Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original message or a completely unrelated value. Thus, if an adversary corrupts a codeword then he cannot get any information from the codeword. This means that non-malleable codes are useful to provide a security guarantee in such situations that the adversary can overwrite the encoded message. In 2010, Dziembowski et al. showed a construction for non-malleable codes against the adversary who can falsify codewords bitwise independently. In this paper, we consider an extende"},"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":"1701.07914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-27T00:47:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"339cc2664183162bfac059d3384a6beec37a057462494eff9d32728869484940","abstract_canon_sha256":"988c20ac429b45d8e51da316e1b5e2d1be92ddf6b7e2a3dd9e34bc3550a9e1c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:59.397361Z","signature_b64":"mptJ5DfmqvRLuyskfbleTcb6fwwI74V8vC2jiN9nwVWX3BwURwaCmg8EoK7F7q8g/+sSZjBZiELvwCR5BadKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf1f3dd6ed325ee10c74b3f525d774bcf18e589265cb59f5bd29f63da7af1dc0","last_reissued_at":"2026-05-18T00:51:59.396742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:59.396742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Malleable Codes Against Affine Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ryota Iwamoto, Takeshi Koshiba","submitted_at":"2017-01-27T00:47:35Z","abstract_excerpt":"Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original message or a completely unrelated value. Thus, if an adversary corrupts a codeword then he cannot get any information from the codeword. This means that non-malleable codes are useful to provide a security guarantee in such situations that the adversary can overwrite the encoded message. In 2010, Dziembowski et al. showed a construction for non-malleable codes against the adversary who can falsify codewords bitwise independently. In this paper, we consider an extende"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07914","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":"1701.07914","created_at":"2026-05-18T00:51:59.396843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07914v1","created_at":"2026-05-18T00:51:59.396843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07914","created_at":"2026-05-18T00:51:59.396843+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4PT3VXNGJPO","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4PT3VXNGJPOCDDU","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4PT3VXN","created_at":"2026-05-18T12:31:53.515858+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/X4PT3VXNGJPOCDDUWP2SLV3UXT","json":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT.json","graph_json":"https://pith.science/api/pith-number/X4PT3VXNGJPOCDDUWP2SLV3UXT/graph.json","events_json":"https://pith.science/api/pith-number/X4PT3VXNGJPOCDDUWP2SLV3UXT/events.json","paper":"https://pith.science/paper/X4PT3VXN"},"agent_actions":{"view_html":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT","download_json":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT.json","view_paper":"https://pith.science/paper/X4PT3VXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07914&json=true","fetch_graph":"https://pith.science/api/pith-number/X4PT3VXNGJPOCDDUWP2SLV3UXT/graph.json","fetch_events":"https://pith.science/api/pith-number/X4PT3VXNGJPOCDDUWP2SLV3UXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT/action/storage_attestation","attest_author":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT/action/author_attestation","sign_citation":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT/action/citation_signature","submit_replication":"https://pith.science/pith/X4PT3VXNGJPOCDDUWP2SLV3UXT/action/replication_record"}},"created_at":"2026-05-18T00:51:59.396843+00:00","updated_at":"2026-05-18T00:51:59.396843+00:00"}