{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TL5EVE7RVJR77T5OX5BTSD3M2C","short_pith_number":"pith:TL5EVE7R","canonical_record":{"source":{"id":"1504.08259","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-30T14:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"69ea454fbc895e42c280d166b43b8ed4893f8c876b3e67133010718977056e59","abstract_canon_sha256":"1380094f6e7405e7b26cd41872d5cc975c8e77277e740863d408062fa97086f2"},"schema_version":"1.0"},"canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","source":{"kind":"arxiv","id":"1504.08259","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08259","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08259v4","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08259","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"TL5EVE7RVJR7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TL5EVE7RVJR77T5O","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TL5EVE7R","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TL5EVE7RVJR77T5OX5BTSD3M2C","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08259","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-30T14:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"69ea454fbc895e42c280d166b43b8ed4893f8c876b3e67133010718977056e59","abstract_canon_sha256":"1380094f6e7405e7b26cd41872d5cc975c8e77277e740863d408062fa97086f2"},"schema_version":"1.0"},"canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.915697Z","signature_b64":"wRhKIXvUyACpsNDkg5lpOkoPChme3CN3CG1MlUlmpYZj2gHTK8ZA044m/FRxhjNVhPPJKfBplQ0A0tWXrI+gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","last_reissued_at":"2026-05-17T23:51:23.915054Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.915054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08259","source_version":4,"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:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAUah8rR888GSZeEPLNWsjANLmck+kdlNQV6KJLXYGwmCmJvxGTJUXhumnJpZ62R2p62MYk4yl6njDofyoX4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:22.796140Z"},"content_sha256":"1f15a631575953d33810ec4d0f1fd7f42fac37916b28a86633b4f644d30b19e4","schema_version":"1.0","event_id":"sha256:1f15a631575953d33810ec4d0f1fd7f42fac37916b28a86633b4f644d30b19e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TL5EVE7RVJR77T5OX5BTSD3M2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edit Distance for Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jan Otop, Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Thomas A. Henzinger","submitted_at":"2015-04-30T14:56:25Z","abstract_excerpt":"The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$. The edit distance generalizes to languages $\\mathcal{L}_1, \\mathcal{L}_2$, where the edit distance from $\\mathcal{L}_1$ to $\\mathcal{L}_2$ is the minimal number $k$ such that for every word from $\\mathcal{L}_1$ there exists a word in $\\mathcal{L}_2$ with edit distance at most $k$. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08259","kind":"arxiv","version":4},"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:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4u+UpJ1cMr4jaKRNxKmr2IgDsooW5yw6Doo/xxVcj8dNzEyR6uN/2dt3+pmduPIfFbn0uRjhnpz6kpXgedmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:22.796874Z"},"content_sha256":"12f3daac35484418960dc632179472b6eef2d99e3ff768dea866a504a95a48fd","schema_version":"1.0","event_id":"sha256:12f3daac35484418960dc632179472b6eef2d99e3ff768dea866a504a95a48fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/bundle.json","state_url":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/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-05-25T19:22:22Z","links":{"resolver":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C","bundle":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/bundle.json","state":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TL5EVE7RVJR77T5OX5BTSD3M2C","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":"1380094f6e7405e7b26cd41872d5cc975c8e77277e740863d408062fa97086f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-30T14:56:25Z","title_canon_sha256":"69ea454fbc895e42c280d166b43b8ed4893f8c876b3e67133010718977056e59"},"schema_version":"1.0","source":{"id":"1504.08259","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08259","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08259v4","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08259","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"TL5EVE7RVJR7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TL5EVE7RVJR77T5O","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TL5EVE7R","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:12f3daac35484418960dc632179472b6eef2d99e3ff768dea866a504a95a48fd","target":"graph","created_at":"2026-05-17T23:51:23Z","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":"The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$. The edit distance generalizes to languages $\\mathcal{L}_1, \\mathcal{L}_2$, where the edit distance from $\\mathcal{L}_1$ to $\\mathcal{L}_2$ is the minimal number $k$ such that for every word from $\\mathcal{L}_1$ there exists a word in $\\mathcal{L}_2$ with edit distance at most $k$. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pu","authors_text":"Jan Otop, Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Thomas A. Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-30T14:56:25Z","title":"Edit Distance for Pushdown Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08259","kind":"arxiv","version":4},"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:1f15a631575953d33810ec4d0f1fd7f42fac37916b28a86633b4f644d30b19e4","target":"record","created_at":"2026-05-17T23:51:23Z","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":"1380094f6e7405e7b26cd41872d5cc975c8e77277e740863d408062fa97086f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-30T14:56:25Z","title_canon_sha256":"69ea454fbc895e42c280d166b43b8ed4893f8c876b3e67133010718977056e59"},"schema_version":"1.0","source":{"id":"1504.08259","kind":"arxiv","version":4}},"canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","first_computed_at":"2026-05-17T23:51:23.915054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:23.915054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wRhKIXvUyACpsNDkg5lpOkoPChme3CN3CG1MlUlmpYZj2gHTK8ZA044m/FRxhjNVhPPJKfBplQ0A0tWXrI+gBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:23.915697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08259","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f15a631575953d33810ec4d0f1fd7f42fac37916b28a86633b4f644d30b19e4","sha256:12f3daac35484418960dc632179472b6eef2d99e3ff768dea866a504a95a48fd"],"state_sha256":"2458b22c28208bcfc648831b359ad419d33e920c4d3f80d9a7f447e9e5064440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhXP9j75GzV8rtKbzH+sFhFdRBMWJTBZzRArodB4veLtzl99bihIO+7P8rEfSxSV7EBkOjSvyifYoswGPJoIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:22:22.800707Z","bundle_sha256":"08626fcfb233da88fea8c795cdd8f57e85de617f3381ef8a02460d62d306fc04"}}