{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XCW7FHPOZVPAF3R47MIKJFMNLT","short_pith_number":"pith:XCW7FHPO","schema_version":"1.0","canonical_sha256":"b8adf29deecd5e02ee3cfb10a4958d5cf054c817aae79389f3775c988e9eec8b","source":{"kind":"arxiv","id":"2506.12193","version":2},"attestation_state":"computed","paper":{"title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzad Farnoud, Ryan Gabrys, Yuting Li","submitted_at":"2025-06-13T19:42:38Z","abstract_excerpt":"Linear codes correcting one deletions have rate at most $1/2$. In this paper, we construct linear list decodable codes correcting edits with rate approaching $1$ and reasonable list size. Our encoder and decoder run in polynomial time."},"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":"2506.12193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-13T19:42:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d3c00377106365b9a9dc2ee6c9c91c601a2e4de51d460cc97b98eaf8496f3188","abstract_canon_sha256":"c66d803cd670224d4ba94aacfb02c56db2ce897c1b6526c557b6cc22bd48f6a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:12.300926Z","signature_b64":"PLNAq7i8ayZZ3c6m7oKiPKTfzXXOInPpq0BhDz+ss55PtaOhS26Fy04L1kcgd5EC5kVP0KUudb8pfJBG8LaJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8adf29deecd5e02ee3cfb10a4958d5cf054c817aae79389f3775c988e9eec8b","last_reissued_at":"2026-07-05T11:39:12.299961Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:12.299961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzad Farnoud, Ryan Gabrys, Yuting Li","submitted_at":"2025-06-13T19:42:38Z","abstract_excerpt":"Linear codes correcting one deletions have rate at most $1/2$. In this paper, we construct linear list decodable codes correcting edits with rate approaching $1$ and reasonable list size. Our encoder and decoder run in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12193","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/2506.12193/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":"2506.12193","created_at":"2026-07-05T11:39:12.300276+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12193v2","created_at":"2026-07-05T11:39:12.300276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12193","created_at":"2026-07-05T11:39:12.300276+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCW7FHPOZVPA","created_at":"2026-07-05T11:39:12.300276+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCW7FHPOZVPAF3R4","created_at":"2026-07-05T11:39:12.300276+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCW7FHPO","created_at":"2026-07-05T11:39:12.300276+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/XCW7FHPOZVPAF3R47MIKJFMNLT","json":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT.json","graph_json":"https://pith.science/api/pith-number/XCW7FHPOZVPAF3R47MIKJFMNLT/graph.json","events_json":"https://pith.science/api/pith-number/XCW7FHPOZVPAF3R47MIKJFMNLT/events.json","paper":"https://pith.science/paper/XCW7FHPO"},"agent_actions":{"view_html":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT","download_json":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT.json","view_paper":"https://pith.science/paper/XCW7FHPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12193&json=true","fetch_graph":"https://pith.science/api/pith-number/XCW7FHPOZVPAF3R47MIKJFMNLT/graph.json","fetch_events":"https://pith.science/api/pith-number/XCW7FHPOZVPAF3R47MIKJFMNLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT/action/storage_attestation","attest_author":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT/action/author_attestation","sign_citation":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT/action/citation_signature","submit_replication":"https://pith.science/pith/XCW7FHPOZVPAF3R47MIKJFMNLT/action/replication_record"}},"created_at":"2026-07-05T11:39:12.300276+00:00","updated_at":"2026-07-05T11:39:12.300276+00:00"}