{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DA3CFCD62XQJ7QXFSCZBJQMPBB","short_pith_number":"pith:DA3CFCD6","schema_version":"1.0","canonical_sha256":"183622887ed5e09fc2e590b214c18f085502b52234524df7492e25177708b293","source":{"kind":"arxiv","id":"1511.05770","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.05770","created_at":"2026-05-18T01:26:32.767358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05770v1","created_at":"2026-05-18T01:26:32.767358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05770","created_at":"2026-05-18T01:26:32.767358+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA3CFCD62XQJ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA3CFCD62XQJ7QXF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA3CFCD6","created_at":"2026-05-18T12:29:17.054201+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/DA3CFCD62XQJ7QXFSCZBJQMPBB","json":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB.json","graph_json":"https://pith.science/api/pith-number/DA3CFCD62XQJ7QXFSCZBJQMPBB/graph.json","events_json":"https://pith.science/api/pith-number/DA3CFCD62XQJ7QXFSCZBJQMPBB/events.json","paper":"https://pith.science/paper/DA3CFCD6"},"agent_actions":{"view_html":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB","download_json":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB.json","view_paper":"https://pith.science/paper/DA3CFCD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05770&json=true","fetch_graph":"https://pith.science/api/pith-number/DA3CFCD62XQJ7QXFSCZBJQMPBB/graph.json","fetch_events":"https://pith.science/api/pith-number/DA3CFCD62XQJ7QXFSCZBJQMPBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/action/storage_attestation","attest_author":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/action/author_attestation","sign_citation":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/action/citation_signature","submit_replication":"https://pith.science/pith/DA3CFCD62XQJ7QXFSCZBJQMPBB/action/replication_record"}},"created_at":"2026-05-18T01:26:32.767358+00:00","updated_at":"2026-05-18T01:26:32.767358+00:00"}