{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Y5WI4KGQV37FH2IVSCLKRL7QHL","short_pith_number":"pith:Y5WI4KGQ","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"},"canonical_sha256":"c76c8e28d0aefe53e9159096a8aff03aca2f7cdb5b7eae18eefbe0ee9721303f","source":{"kind":"arxiv","id":"1902.06591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06591","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06591v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06591","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"Y5WI4KGQV37F","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y5WI4KGQV37FH2IV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y5WI4KGQ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Y5WI4KGQV37FH2IVSCLKRL7QHL","target":"record","payload":{"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"},"canonical_sha256":"c76c8e28d0aefe53e9159096a8aff03aca2f7cdb5b7eae18eefbe0ee9721303f","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"},"source_kind":"arxiv","source_id":"1902.06591","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPaTgGblMBcJAfaL0M92naUwLfBJRyqGP/LCNlagiLMasjAei7xy4aXSvaZ88tioQq7HpbtHCBJejpsaV38xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:14:11.042826Z"},"content_sha256":"e5570967886511c92d220653e140e805edfc7e3c897486652e469084485b3784","schema_version":"1.0","event_id":"sha256:e5570967886511c92d220653e140e805edfc7e3c897486652e469084485b3784"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Y5WI4KGQV37FH2IVSCLKRL7QHL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjM9IEaVXnhdxahvNGvTNWXbwjjiKNMIDm7VVTo3PlQP1hwZ7COPyNuebDc+xt6NiVZuvfecXedY7Wxz0YThAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:14:11.043160Z"},"content_sha256":"c3839d20466ac351f557016f1d3c91cf716635fb5b00766c5f7715a3367bef97","schema_version":"1.0","event_id":"sha256:c3839d20466ac351f557016f1d3c91cf716635fb5b00766c5f7715a3367bef97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/bundle.json","state_url":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T08:14:11Z","links":{"resolver":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL","bundle":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/bundle.json","state":"https://pith.science/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5WI4KGQV37FH2IVSCLKRL7QHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Y5WI4KGQV37FH2IVSCLKRL7QHL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"47c918167181b3f74ea310fd8762b981e0d67b916a50ecb91f97b4b8265d53ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-18T14:40:16Z","title_canon_sha256":"12719ea4ec89c3bbee6485cadd3d22f053ec6f52938fb014482c7ce397f6d648"},"schema_version":"1.0","source":{"id":"1902.06591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06591","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06591v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06591","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"Y5WI4KGQV37F","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y5WI4KGQV37FH2IV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y5WI4KGQ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c3839d20466ac351f557016f1d3c91cf716635fb5b00766c5f7715a3367bef97","target":"graph","created_at":"2026-05-17T23:53:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Grzegorz Herman","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-18T14:40:16Z","title":"Relational parsing: a clean, fast parsing strategy for all context-free languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06591","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5570967886511c92d220653e140e805edfc7e3c897486652e469084485b3784","target":"record","created_at":"2026-05-17T23:53:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"47c918167181b3f74ea310fd8762b981e0d67b916a50ecb91f97b4b8265d53ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-02-18T14:40:16Z","title_canon_sha256":"12719ea4ec89c3bbee6485cadd3d22f053ec6f52938fb014482c7ce397f6d648"},"schema_version":"1.0","source":{"id":"1902.06591","kind":"arxiv","version":1}},"canonical_sha256":"c76c8e28d0aefe53e9159096a8aff03aca2f7cdb5b7eae18eefbe0ee9721303f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c76c8e28d0aefe53e9159096a8aff03aca2f7cdb5b7eae18eefbe0ee9721303f","first_computed_at":"2026-05-17T23:53:45.053042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:45.053042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4gjOi+oahfumPL+FyiptdP9srosytLKJP36Bb8iisSWRCb/r41n26ImQa7g8GQ8OUwFJDUSA7ZOE7QQWAeJUDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:45.053644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5570967886511c92d220653e140e805edfc7e3c897486652e469084485b3784","sha256:c3839d20466ac351f557016f1d3c91cf716635fb5b00766c5f7715a3367bef97"],"state_sha256":"f59d3e23634cd74cabc5f3940708c196afa9ec783e65fb69a9c7d71d9c696253"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSM7DEAzmpH5tSJ0HxLaEYZRkn9GQL1x86Mi5Qu4CWuMs/b0pwfzFz7c2s9nBnOOZLJl0tztmBmN1iCdV3BoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:14:11.045038Z","bundle_sha256":"f1b36ac32645eb76efba68db762e6e22a8988ae049e4084c9c724d6225ea915a"}}