{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","short_pith_number":"pith:Y2S7GRPO","schema_version":"1.0","canonical_sha256":"c6a5f345eec68b6546b0dc32f8730ad556434c2ab661bd40843115300b6d3eba","source":{"kind":"arxiv","id":"1702.06698","version":2},"attestation_state":"computed","paper":{"title":"Computing the longest common prefix of a context-free language in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Helmut Seidl, Michael Luttenberger, Raphaela Palenta","submitted_at":"2017-02-22T08:03:41Z","abstract_excerpt":"We present two structural results concerning longest common prefixes of non-empty languages. First, we show that the longest common prefix of the language generated by a context-free grammar of size $N$ equals the longest common prefix of the same grammar where the heights of the derivation trees are bounded by $4N$. Second, we show that each nonempty language $L$ has a representative subset of at most three elements which behaves like $L$ w.r.t. the longest common prefix as well as w.r.t. longest common prefixes of $L$ after unions or concatenations with arbitrary other languages. From that, "},"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":"1702.06698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T08:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"b8681ab96e793d6ada732c76ca1cc062a0e40fcf2c8d49778111c99fd8462030","abstract_canon_sha256":"7d0b8821fb11e2ea99ad502e3c58d715a096a24558a0586b856e9c3eb24288f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:37.340553Z","signature_b64":"3l9Ev+StKPbwLpqM7gqUM1rJi/RCVIN/n9tx4KNTWH5lrsMq6uJi+FLLB7LEFDRp4lAmv6SS5j8/p9Jzvo7gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a5f345eec68b6546b0dc32f8730ad556434c2ab661bd40843115300b6d3eba","last_reissued_at":"2026-05-18T00:26:37.339757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:37.339757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the longest common prefix of a context-free language in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Helmut Seidl, Michael Luttenberger, Raphaela Palenta","submitted_at":"2017-02-22T08:03:41Z","abstract_excerpt":"We present two structural results concerning longest common prefixes of non-empty languages. First, we show that the longest common prefix of the language generated by a context-free grammar of size $N$ equals the longest common prefix of the same grammar where the heights of the derivation trees are bounded by $4N$. Second, we show that each nonempty language $L$ has a representative subset of at most three elements which behaves like $L$ w.r.t. the longest common prefix as well as w.r.t. longest common prefixes of $L$ after unions or concatenations with arbitrary other languages. From that, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06698","kind":"arxiv","version":2},"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":"1702.06698","created_at":"2026-05-18T00:26:37.339882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06698v2","created_at":"2026-05-18T00:26:37.339882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06698","created_at":"2026-05-18T00:26:37.339882+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2S7GRPOY2FW","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2S7GRPOY2FWKRVQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2S7GRPO","created_at":"2026-05-18T12:31:56.362134+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/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","json":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V.json","graph_json":"https://pith.science/api/pith-number/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/graph.json","events_json":"https://pith.science/api/pith-number/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/events.json","paper":"https://pith.science/paper/Y2S7GRPO"},"agent_actions":{"view_html":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","download_json":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V.json","view_paper":"https://pith.science/paper/Y2S7GRPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06698&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/action/storage_attestation","attest_author":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/action/author_attestation","sign_citation":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/action/citation_signature","submit_replication":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/action/replication_record"}},"created_at":"2026-05-18T00:26:37.339882+00:00","updated_at":"2026-05-18T00:26:37.339882+00:00"}