{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4DLTHNMPMRRDGO5JBPMRLHTHW4","short_pith_number":"pith:4DLTHNMP","schema_version":"1.0","canonical_sha256":"e0d733b58f6462333ba90bd9159e67b72a9b01f6a2fc4d987ef00a471c18ce25","source":{"kind":"arxiv","id":"2406.02633","version":2},"attestation_state":"computed","paper":{"title":"Edit Distance Robust Watermarks via Indexing Pseudorandom Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CR","authors_text":"Ankur Moitra, Noah Golowich","submitted_at":"2024-06-04T04:03:17Z","abstract_excerpt":"Motivated by the problem of detecting AI-generated text, we consider the problem of watermarking the output of language models with provable guarantees. We aim for watermarks which satisfy: (a) undetectability, a cryptographic notion introduced by Christ, Gunn & Zamir (2024) which stipulates that it is computationally hard to distinguish watermarked language model outputs from the model's actual output distribution; and (b) robustness to channels which introduce a constant fraction of adversarial insertions, substitutions, and deletions to the watermarked text. Earlier schemes could only handl"},"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":"2406.02633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-06-04T04:03:17Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c525f12cf71432c645a62d59813d807dd7ec65c63b8feba17694e657cc501ccb","abstract_canon_sha256":"92ec81924ec3d8fffbea1667fef6b5f9ab11c89c4a1c2afdbfdf9a33d555a65e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:46.069430Z","signature_b64":"LNlB9/eq5uBQh71dA9uqo2MfUCf2X1p4qH2QP/qOEWVlGtjHtPAKAaVcQZD8hT8GiBlz6I0/oRAzhT4wmJRXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d733b58f6462333ba90bd9159e67b72a9b01f6a2fc4d987ef00a471c18ce25","last_reissued_at":"2026-07-05T11:10:46.068948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:46.068948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edit Distance Robust Watermarks via Indexing Pseudorandom Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CR","authors_text":"Ankur Moitra, Noah Golowich","submitted_at":"2024-06-04T04:03:17Z","abstract_excerpt":"Motivated by the problem of detecting AI-generated text, we consider the problem of watermarking the output of language models with provable guarantees. We aim for watermarks which satisfy: (a) undetectability, a cryptographic notion introduced by Christ, Gunn & Zamir (2024) which stipulates that it is computationally hard to distinguish watermarked language model outputs from the model's actual output distribution; and (b) robustness to channels which introduce a constant fraction of adversarial insertions, substitutions, and deletions to the watermarked text. Earlier schemes could only handl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02633","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.02633/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":"2406.02633","created_at":"2026-07-05T11:10:46.069002+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02633v2","created_at":"2026-07-05T11:10:46.069002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02633","created_at":"2026-07-05T11:10:46.069002+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DLTHNMPMRRD","created_at":"2026-07-05T11:10:46.069002+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DLTHNMPMRRDGO5J","created_at":"2026-07-05T11:10:46.069002+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DLTHNMP","created_at":"2026-07-05T11:10:46.069002+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01532","citing_title":"Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12051","citing_title":"Can we Watermark Low-Entropy LLM Outputs?","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4","json":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4.json","graph_json":"https://pith.science/api/pith-number/4DLTHNMPMRRDGO5JBPMRLHTHW4/graph.json","events_json":"https://pith.science/api/pith-number/4DLTHNMPMRRDGO5JBPMRLHTHW4/events.json","paper":"https://pith.science/paper/4DLTHNMP"},"agent_actions":{"view_html":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4","download_json":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4.json","view_paper":"https://pith.science/paper/4DLTHNMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02633&json=true","fetch_graph":"https://pith.science/api/pith-number/4DLTHNMPMRRDGO5JBPMRLHTHW4/graph.json","fetch_events":"https://pith.science/api/pith-number/4DLTHNMPMRRDGO5JBPMRLHTHW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4/action/storage_attestation","attest_author":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4/action/author_attestation","sign_citation":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4/action/citation_signature","submit_replication":"https://pith.science/pith/4DLTHNMPMRRDGO5JBPMRLHTHW4/action/replication_record"}},"created_at":"2026-07-05T11:10:46.069002+00:00","updated_at":"2026-07-05T11:10:46.069002+00:00"}