{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","short_pith_number":"pith:Y2S7GRPO","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"},"canonical_sha256":"c6a5f345eec68b6546b0dc32f8730ad556434c2ab661bd40843115300b6d3eba","source":{"kind":"arxiv","id":"1702.06698","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06698","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06698v2","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06698","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"Y2S7GRPOY2FW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2S7GRPOY2FWKRVQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2S7GRPO","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","target":"record","payload":{"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"},"canonical_sha256":"c6a5f345eec68b6546b0dc32f8730ad556434c2ab661bd40843115300b6d3eba","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"},"source_kind":"arxiv","source_id":"1702.06698","source_version":2,"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-18T00:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2K0JPkwdZinXaAJRcX4ZBuj/+Q3N5VT9fqhtTqPQMbjug4wFGu0LWlypla72d8prSdMbOJZzlJSWlqb76PRqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:00:29.167838Z"},"content_sha256":"5f0a1d8a9311f4334f637f1e4ad3764bb311bf8121d9921abbaf08fe28de7c38","schema_version":"1.0","event_id":"sha256:5f0a1d8a9311f4334f637f1e4ad3764bb311bf8121d9921abbaf08fe28de7c38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","target":"graph","payload":{"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"},"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-18T00:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haYhyeQJoPxlnnDgSwMC5VT8S7r5jzhQuLwpknbqvJ9ioin8HR+YY4Ikqa+x1eNW1CiYSx4NEbzte0riMQzkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:00:29.168181Z"},"content_sha256":"6e7d99ffb262e13f0df7fbddc7b83d5fcbd7fe53bd38a0905263f9ca6e8bb8cb","schema_version":"1.0","event_id":"sha256:6e7d99ffb262e13f0df7fbddc7b83d5fcbd7fe53bd38a0905263f9ca6e8bb8cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/bundle.json","state_url":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/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-20T23:00:29Z","links":{"resolver":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","bundle":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/bundle.json","state":"https://pith.science/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2S7GRPOY2FWKRVQ3QZPQ4YK2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y2S7GRPOY2FWKRVQ3QZPQ4YK2V","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":"7d0b8821fb11e2ea99ad502e3c58d715a096a24558a0586b856e9c3eb24288f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T08:03:41Z","title_canon_sha256":"b8681ab96e793d6ada732c76ca1cc062a0e40fcf2c8d49778111c99fd8462030"},"schema_version":"1.0","source":{"id":"1702.06698","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06698","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06698v2","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06698","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"Y2S7GRPOY2FW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2S7GRPOY2FWKRVQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2S7GRPO","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:6e7d99ffb262e13f0df7fbddc7b83d5fcbd7fe53bd38a0905263f9ca6e8bb8cb","target":"graph","created_at":"2026-05-18T00:26:37Z","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 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, ","authors_text":"Helmut Seidl, Michael Luttenberger, Raphaela Palenta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T08:03:41Z","title":"Computing the longest common prefix of a context-free language in polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06698","kind":"arxiv","version":2},"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:5f0a1d8a9311f4334f637f1e4ad3764bb311bf8121d9921abbaf08fe28de7c38","target":"record","created_at":"2026-05-18T00:26:37Z","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":"7d0b8821fb11e2ea99ad502e3c58d715a096a24558a0586b856e9c3eb24288f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T08:03:41Z","title_canon_sha256":"b8681ab96e793d6ada732c76ca1cc062a0e40fcf2c8d49778111c99fd8462030"},"schema_version":"1.0","source":{"id":"1702.06698","kind":"arxiv","version":2}},"canonical_sha256":"c6a5f345eec68b6546b0dc32f8730ad556434c2ab661bd40843115300b6d3eba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6a5f345eec68b6546b0dc32f8730ad556434c2ab661bd40843115300b6d3eba","first_computed_at":"2026-05-18T00:26:37.339757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:37.339757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3l9Ev+StKPbwLpqM7gqUM1rJi/RCVIN/n9tx4KNTWH5lrsMq6uJi+FLLB7LEFDRp4lAmv6SS5j8/p9Jzvo7gCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:37.340553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06698","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f0a1d8a9311f4334f637f1e4ad3764bb311bf8121d9921abbaf08fe28de7c38","sha256:6e7d99ffb262e13f0df7fbddc7b83d5fcbd7fe53bd38a0905263f9ca6e8bb8cb"],"state_sha256":"d647a15cdcb1481b0725ed73c3fc19e6afd186a57eaff2903594fe32d87b9e45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wyb5ErD6+9KJc2hx1ZyIbOi++qQGDtiiyHsu1Qoq/FaRnNnCQSfljFUmKqn0REG2G+kHAy5WLXniiw4EmAkEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:00:29.170063Z","bundle_sha256":"99c571d3448305b08b2bb0f600f439ffde3935ca5524d7462f569e8e5c44da52"}}