{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Q4D6WD6KBQDIKOS7FPDI7JU4ZG","short_pith_number":"pith:Q4D6WD6K","schema_version":"1.0","canonical_sha256":"8707eb0fca0c06853a5f2bc68fa69cc9adb0a3ca2d5ab8079d7a6813c23f422b","source":{"kind":"arxiv","id":"2605.19402","version":1},"attestation_state":"computed","paper":{"title":"High-Rate Public-Key Pseudorandom Codes for Edit Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Shengtang Huang, Songtao Mao, Xin Li, Zhaienhe Zhou","submitted_at":"2026-05-19T05:57:25Z","abstract_excerpt":"Pseudorandom codes (PRCs), introduced by Christ and Gunn (CRYPTO '2024), are error-correcting codes whose codewords are computationally indistinguishable from uniformly random strings, while still being decodable by someone holding the key. They provide a natural primitive for robust and undetectable watermarking, particularly in applications to AI-generated content. Although recent works have obtained strong results for substitution errors, the edit-error setting remains much less understood, especially in the high-rate regime and over small alphabets.\n  We study public-key pseudorandom codes"},"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":"2605.19402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-05-19T05:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"3a5329b450a3b63f5b52cdec297e1b0b9ff540713268688a99dce14e695cc0a7","abstract_canon_sha256":"f2703b28e3d667b009fb96b145febe2c3b19dbd7a4d2f4805ce393ccca22e50d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:43.859518Z","signature_b64":"dzq6RR1M1M0yP0d6zLNyOcO1xxfIMr6ZXxe62T0uV4DtkB8iTAQtpOHgp+KLhfe7zgO8yix4kVJ+HapjNq+/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8707eb0fca0c06853a5f2bc68fa69cc9adb0a3ca2d5ab8079d7a6813c23f422b","last_reissued_at":"2026-05-20T01:05:43.858759Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:43.858759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Rate Public-Key Pseudorandom Codes for Edit Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Shengtang Huang, Songtao Mao, Xin Li, Zhaienhe Zhou","submitted_at":"2026-05-19T05:57:25Z","abstract_excerpt":"Pseudorandom codes (PRCs), introduced by Christ and Gunn (CRYPTO '2024), are error-correcting codes whose codewords are computationally indistinguishable from uniformly random strings, while still being decodable by someone holding the key. They provide a natural primitive for robust and undetectable watermarking, particularly in applications to AI-generated content. Although recent works have obtained strong results for substitution errors, the edit-error setting remains much less understood, especially in the high-rate regime and over small alphabets.\n  We study public-key pseudorandom codes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19402","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19402/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.19402","created_at":"2026-05-20T01:05:43.858879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19402v1","created_at":"2026-05-20T01:05:43.858879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19402","created_at":"2026-05-20T01:05:43.858879+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4D6WD6KBQDI","created_at":"2026-05-20T01:05:43.858879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4D6WD6KBQDIKOS7","created_at":"2026-05-20T01:05:43.858879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4D6WD6K","created_at":"2026-05-20T01:05:43.858879+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/Q4D6WD6KBQDIKOS7FPDI7JU4ZG","json":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG.json","graph_json":"https://pith.science/api/pith-number/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/graph.json","events_json":"https://pith.science/api/pith-number/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/events.json","paper":"https://pith.science/paper/Q4D6WD6K"},"agent_actions":{"view_html":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG","download_json":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG.json","view_paper":"https://pith.science/paper/Q4D6WD6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19402&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/action/storage_attestation","attest_author":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/action/author_attestation","sign_citation":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/action/citation_signature","submit_replication":"https://pith.science/pith/Q4D6WD6KBQDIKOS7FPDI7JU4ZG/action/replication_record"}},"created_at":"2026-05-20T01:05:43.858879+00:00","updated_at":"2026-05-20T01:05:43.858879+00:00"}