{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VZTJKT26Q2QPIDOTRXVHWNTRDB","short_pith_number":"pith:VZTJKT26","schema_version":"1.0","canonical_sha256":"ae66954f5e86a0f40dd38dea7b367118426accd64ebb21304ca93807ddd06e14","source":{"kind":"arxiv","id":"2510.18479","version":3},"attestation_state":"computed","paper":{"title":"Formally Verified Linear-Time Invertible Lexing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.PL","authors_text":"Samuel Chassot, Viktor Kun\\v{c}ak","submitted_at":"2025-10-21T09:58:08Z","abstract_excerpt":"We present ZipLex, a verified framework for invertible linear-time lexical analysis following the longest match (maximal munch) semantics. Unlike past verified lexers that focus only on satisfying the semantics of regular expressions and the longest match property, ZipLex also guarantees that lexing and printing are mutual inverses. Thanks to verified memoization, it also ensures that the lexical analysis of a string is linear in the size of the string. Our design and implementation rely on two sets of ideas: (1) a new abstraction of token sequences that captures the separability of tokens in "},"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":"2510.18479","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-10-21T09:58:08Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"134f1c2c205239e867d0bc8fba7968d2c8a0b244a7ffffcf3a49c3c9dd6e72d0","abstract_canon_sha256":"2e2da6ba9e8dc6cdfb9b1f600d4c08772abb2b64babaedbe4125e08c34f83edb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:48.454596Z","signature_b64":"9/OIZX9egXCho+jhnfhZuAGDy9f84ORGTopYUVBVgG8tIstmQSjcYsHEJ3NxHriuNDfGZX1gi5YChMpLmUZhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae66954f5e86a0f40dd38dea7b367118426accd64ebb21304ca93807ddd06e14","last_reissued_at":"2026-05-22T01:03:48.453707Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:48.453707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formally Verified Linear-Time Invertible Lexing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.PL","authors_text":"Samuel Chassot, Viktor Kun\\v{c}ak","submitted_at":"2025-10-21T09:58:08Z","abstract_excerpt":"We present ZipLex, a verified framework for invertible linear-time lexical analysis following the longest match (maximal munch) semantics. Unlike past verified lexers that focus only on satisfying the semantics of regular expressions and the longest match property, ZipLex also guarantees that lexing and printing are mutual inverses. Thanks to verified memoization, it also ensures that the lexical analysis of a string is linear in the size of the string. Our design and implementation rely on two sets of ideas: (1) a new abstraction of token sequences that captures the separability of tokens in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.18479","kind":"arxiv","version":3},"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/2510.18479/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":"2510.18479","created_at":"2026-05-22T01:03:48.453832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.18479v3","created_at":"2026-05-22T01:03:48.453832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.18479","created_at":"2026-05-22T01:03:48.453832+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZTJKT26Q2QP","created_at":"2026-05-22T01:03:48.453832+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZTJKT26Q2QPIDOT","created_at":"2026-05-22T01:03:48.453832+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZTJKT26","created_at":"2026-05-22T01:03:48.453832+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/VZTJKT26Q2QPIDOTRXVHWNTRDB","json":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB.json","graph_json":"https://pith.science/api/pith-number/VZTJKT26Q2QPIDOTRXVHWNTRDB/graph.json","events_json":"https://pith.science/api/pith-number/VZTJKT26Q2QPIDOTRXVHWNTRDB/events.json","paper":"https://pith.science/paper/VZTJKT26"},"agent_actions":{"view_html":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB","download_json":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB.json","view_paper":"https://pith.science/paper/VZTJKT26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.18479&json=true","fetch_graph":"https://pith.science/api/pith-number/VZTJKT26Q2QPIDOTRXVHWNTRDB/graph.json","fetch_events":"https://pith.science/api/pith-number/VZTJKT26Q2QPIDOTRXVHWNTRDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB/action/storage_attestation","attest_author":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB/action/author_attestation","sign_citation":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB/action/citation_signature","submit_replication":"https://pith.science/pith/VZTJKT26Q2QPIDOTRXVHWNTRDB/action/replication_record"}},"created_at":"2026-05-22T01:03:48.453832+00:00","updated_at":"2026-05-22T01:03:48.453832+00:00"}