{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y5WI4KGQV37FH2IVSCLKRL7QHL","short_pith_number":"pith:Y5WI4KGQ","schema_version":"1.0","canonical_sha256":"c76c8e28d0aefe53e9159096a8aff03aca2f7cdb5b7eae18eefbe0ee9721303f","source":{"kind":"arxiv","id":"1902.06591","version":1},"attestation_state":"computed","paper":{"title":"Relational parsing: a clean, fast parsing strategy for all context-free languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Grzegorz Herman","submitted_at":"2019-02-18T14:40:16Z","abstract_excerpt":"We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network. Parsing complexity w.r.t. input length matches the state of the art: it is worst-case cubic, quadratic for unambiguous grammars, and linear for LR-regular ones. What distinguishes our algorithm is its clean mathematical formulation: parsing is expressed as a composition of simple operations on languages and relations, and can therefore be implemented using only immutable data structures. With a proper choice of t"},"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":"1902.06591","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-18T14:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"12719ea4ec89c3bbee6485cadd3d22f053ec6f52938fb014482c7ce397f6d648","abstract_canon_sha256":"47c918167181b3f74ea310fd8762b981e0d67b916a50ecb91f97b4b8265d53ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.053644Z","signature_b64":"4gjOi+oahfumPL+FyiptdP9srosytLKJP36Bb8iisSWRCb/r41n26ImQa7g8GQ8OUwFJDUSA7ZOE7QQWAeJUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c76c8e28d0aefe53e9159096a8aff03aca2f7cdb5b7eae18eefbe0ee9721303f","last_reissued_at":"2026-05-17T23:53:45.053042Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.053042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relational parsing: a clean, fast parsing strategy for all context-free languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Grzegorz Herman","submitted_at":"2019-02-18T14:40:16Z","abstract_excerpt":"We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network. Parsing complexity w.r.t. input length matches the state of the art: it is worst-case cubic, quadratic for unambiguous grammars, and linear for LR-regular ones. What distinguishes our algorithm is its clean mathematical formulation: parsing is expressed as a composition of simple operations on languages and relations, and can therefore be implemented using only immutable data structures. With a proper choice of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06591","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":"1902.06591","created_at":"2026-05-17T23:53:45.053138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06591v1","created_at":"2026-05-17T23:53:45.053138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06591","created_at":"2026-05-17T23:53:45.053138+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5WI4KGQV37F","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5WI4KGQV37FH2IV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5WI4KGQ","created_at":"2026-05-18T12:33:33.725879+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/Y5WI4KGQV37FH2IVSCLKRL7QHL","json":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL.json","graph_json":"https://pith.science/api/pith-number/Y5WI4KGQV37FH2IVSCLKRL7QHL/graph.json","events_json":"https://pith.science/api/pith-number/Y5WI4KGQV37FH2IVSCLKRL7QHL/events.json","paper":"https://pith.science/paper/Y5WI4KGQ"},"agent_actions":{"view_html":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL","download_json":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL.json","view_paper":"https://pith.science/paper/Y5WI4KGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06591&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5WI4KGQV37FH2IVSCLKRL7QHL/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5WI4KGQV37FH2IVSCLKRL7QHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/action/storage_attestation","attest_author":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/action/author_attestation","sign_citation":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/action/citation_signature","submit_replication":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/action/replication_record"}},"created_at":"2026-05-17T23:53:45.053138+00:00","updated_at":"2026-05-17T23:53:45.053138+00:00"}