{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DA3CFCD62XQJ7QXFSCZBJQMPBB","short_pith_number":"pith:DA3CFCD6","canonical_record":{"source":{"id":"1511.05770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-18T13:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"2a5b77b3be35d2ff12d1f9ad22c1de0fd04b764fa929a39e557bda2b6f2b8292","abstract_canon_sha256":"4fe8b5fcdbdda71e41edfb752f381dc924dfe762f40d3468ed7dbf2d58533793"},"schema_version":"1.0"},"canonical_sha256":"183622887ed5e09fc2e590b214c18f085502b52234524df7492e25177708b293","source":{"kind":"arxiv","id":"1511.05770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05770","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05770v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05770","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"DA3CFCD62XQJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DA3CFCD62XQJ7QXF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DA3CFCD6","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DA3CFCD62XQJ7QXFSCZBJQMPBB","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-18T13:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"2a5b77b3be35d2ff12d1f9ad22c1de0fd04b764fa929a39e557bda2b6f2b8292","abstract_canon_sha256":"4fe8b5fcdbdda71e41edfb752f381dc924dfe762f40d3468ed7dbf2d58533793"},"schema_version":"1.0"},"canonical_sha256":"183622887ed5e09fc2e590b214c18f085502b52234524df7492e25177708b293","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.767922Z","signature_b64":"FFJNMKdECVKLrpPvk+mlRT866xwlqvJOksVZSscVwFzzccW/D6NODCItap+/nUr4OcHL54Fr1NkPZ3Mw+JCmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183622887ed5e09fc2e590b214c18f085502b52234524df7492e25177708b293","last_reissued_at":"2026-05-18T01:26:32.767254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.767254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05770","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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DcS8jJ3wKhYRPfwRStn8a4RilEdRv/2XEyIUzbxZDzHVfuo77Rj4AhaB8birPpj+w8jk0GrKQ+yNskAV6ZnxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:59:48.478045Z"},"content_sha256":"2c1e41ce01432d96280a372f2d750670be101facd092afe5a71671a65f74bf1b","schema_version":"1.0","event_id":"sha256:2c1e41ce01432d96280a372f2d750670be101facd092afe5a71671a65f74bf1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DA3CFCD62XQJ7QXFSCZBJQMPBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On LR(k)-parsers of polynomial size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Norbert Blum","submitted_at":"2015-11-18T13:36:01Z","abstract_excerpt":"Usually, a parser for an $LR(k)$-grammar $G$ is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string $x \\in L(G)$. The best known upper bound for the size of such a parser is $O(2^{|G||\\Sigma|^k+k\\log |\\Sigma| + \\log |G|})$ where $|G|$ and $|\\Sigma|$ are the sizes of the grammar $G$ and the terminal alphabet $\\Sigma$, respectively. If we add to a parser the possibility to manipulate a directed graph of size $O(|G|n)$ where $n$ is the length of the input then we obtain an extended parser. The graph is used for an efficient paralle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05770","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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpR7Y4d4+22IxQNE7ynak9vkeevKbqrQYa7AMz88J+jgScgYxgzF6OzNht7m4LMtXIDqP0VHJ3dtAF28d9ReDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:59:48.478400Z"},"content_sha256":"348120e17e06f2b250b754185b538f2784013435917d7fd7b226976a18e33523","schema_version":"1.0","event_id":"sha256:348120e17e06f2b250b754185b538f2784013435917d7fd7b226976a18e33523"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/bundle.json","state_url":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/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-28T05:59:48Z","links":{"resolver":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB","bundle":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/bundle.json","state":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DA3CFCD62XQJ7QXFSCZBJQMPBB","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":"4fe8b5fcdbdda71e41edfb752f381dc924dfe762f40d3468ed7dbf2d58533793","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-18T13:36:01Z","title_canon_sha256":"2a5b77b3be35d2ff12d1f9ad22c1de0fd04b764fa929a39e557bda2b6f2b8292"},"schema_version":"1.0","source":{"id":"1511.05770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05770","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05770v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05770","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"DA3CFCD62XQJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DA3CFCD62XQJ7QXF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DA3CFCD6","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:348120e17e06f2b250b754185b538f2784013435917d7fd7b226976a18e33523","target":"graph","created_at":"2026-05-18T01:26:32Z","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":"Usually, a parser for an $LR(k)$-grammar $G$ is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string $x \\in L(G)$. The best known upper bound for the size of such a parser is $O(2^{|G||\\Sigma|^k+k\\log |\\Sigma| + \\log |G|})$ where $|G|$ and $|\\Sigma|$ are the sizes of the grammar $G$ and the terminal alphabet $\\Sigma$, respectively. If we add to a parser the possibility to manipulate a directed graph of size $O(|G|n)$ where $n$ is the length of the input then we obtain an extended parser. The graph is used for an efficient paralle","authors_text":"Norbert Blum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-18T13:36:01Z","title":"On LR(k)-parsers of polynomial size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05770","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:2c1e41ce01432d96280a372f2d750670be101facd092afe5a71671a65f74bf1b","target":"record","created_at":"2026-05-18T01:26:32Z","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":"4fe8b5fcdbdda71e41edfb752f381dc924dfe762f40d3468ed7dbf2d58533793","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-18T13:36:01Z","title_canon_sha256":"2a5b77b3be35d2ff12d1f9ad22c1de0fd04b764fa929a39e557bda2b6f2b8292"},"schema_version":"1.0","source":{"id":"1511.05770","kind":"arxiv","version":1}},"canonical_sha256":"183622887ed5e09fc2e590b214c18f085502b52234524df7492e25177708b293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"183622887ed5e09fc2e590b214c18f085502b52234524df7492e25177708b293","first_computed_at":"2026-05-18T01:26:32.767254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:32.767254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FFJNMKdECVKLrpPvk+mlRT866xwlqvJOksVZSscVwFzzccW/D6NODCItap+/nUr4OcHL54Fr1NkPZ3Mw+JCmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:32.767922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c1e41ce01432d96280a372f2d750670be101facd092afe5a71671a65f74bf1b","sha256:348120e17e06f2b250b754185b538f2784013435917d7fd7b226976a18e33523"],"state_sha256":"b587c84ee832623b9a84ed75ade32647e5b4e6a2767e0fcd4385641f256074a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBOn9y7lSdK2lXfHwmuyU0AlX/camSIrqXGuC43gCgwI7F0J8TlRTro5BwYVIf9+nT6Y8dTsyIeWOq1E8323Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:59:48.480212Z","bundle_sha256":"2aa420a6c02a33010dba800f349f2d62e99085d819844681cfbaa74dc16bf829"}}