{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VTVDEW523MEPQQAD4GQ5BOF23K","short_pith_number":"pith:VTVDEW52","canonical_record":{"source":{"id":"1212.0927","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-12-05T03:50:46Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"00d4cd82cdc422c5bdd322b43800d4d32a955728e56008cb0e55ec8e4d76d321","abstract_canon_sha256":"211923b69b5b85d98cd85377515e5fd7dd02426b87d5915fec75e966125c76f0"},"schema_version":"1.0"},"canonical_sha256":"acea325bbadb08f84003e1a1d0b8badaa9b82eb8408aa9745d5b588b0aec7c2c","source":{"kind":"arxiv","id":"1212.0927","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0927","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0927v3","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0927","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"VTVDEW523MEP","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VTVDEW523MEPQQAD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VTVDEW52","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VTVDEW523MEPQQAD4GQ5BOF23K","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0927","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-12-05T03:50:46Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"00d4cd82cdc422c5bdd322b43800d4d32a955728e56008cb0e55ec8e4d76d321","abstract_canon_sha256":"211923b69b5b85d98cd85377515e5fd7dd02426b87d5915fec75e966125c76f0"},"schema_version":"1.0"},"canonical_sha256":"acea325bbadb08f84003e1a1d0b8badaa9b82eb8408aa9745d5b588b0aec7c2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:35.127382Z","signature_b64":"rc5N1VFsom90DHUDcylLw6TY68bJP6uM7AGW81BWfiH1qYqOqUL1pvBsnYafqaolIBWsLVOTes+TyTwJQhAZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acea325bbadb08f84003e1a1d0b8badaa9b82eb8408aa9745d5b588b0aec7c2c","last_reissued_at":"2026-05-18T03:34:35.126941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:35.126941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0927","source_version":3,"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-18T03:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+3ervRfgj3CE6STTpNR2ea5i8LrGHO8/Xg+nWsCrdgt1GAzOZGf0FMeOS/CS+Kwblf9q6z2gsiKmjuRcYOaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:32:05.987421Z"},"content_sha256":"dbb5edeff95ae521ea1132805d29e01e908d7fe6db797541e1e92d2aacad0a76","schema_version":"1.0","event_id":"sha256:dbb5edeff95ae521ea1132805d29e01e908d7fe6db797541e1e92d2aacad0a76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VTVDEW523MEPQQAD4GQ5BOF23K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two Algorithms for Finding $k$ Shortest Paths of a Weighted Pushdown Automaton","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL"],"primary_cat":"cs.CL","authors_text":"Ke Wu, Philip Resnik","submitted_at":"2012-12-05T03:50:46Z","abstract_excerpt":"We introduce efficient algorithms for finding the $k$ shortest paths of a weighted pushdown automaton (WPDA), a compact representation of a weighted set of strings with potential applications in parsing and machine translation. Both of our algorithms are derived from the same weighted deductive logic description of the execution of a WPDA using different search strategies. Experimental results show our Algorithm 2 adds very little overhead vs. the single shortest path algorithm, even with a large $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0927","kind":"arxiv","version":3},"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-18T03:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uslvNA/0PcLiTyXIa4uSHGluchdVA6LpA0yWBjGBC6gXigfSZ7/7EAg3MniSF5zzJdz1Ihq81ubX8SMLAtfIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:32:05.987785Z"},"content_sha256":"80f87c7fc4922b48bece7ab73a2ce43c7403e5ca0d3966fb787cd0353531a3d8","schema_version":"1.0","event_id":"sha256:80f87c7fc4922b48bece7ab73a2ce43c7403e5ca0d3966fb787cd0353531a3d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/bundle.json","state_url":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTVDEW523MEPQQAD4GQ5BOF23K/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-07-05T02:32:05Z","links":{"resolver":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K","bundle":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/bundle.json","state":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTVDEW523MEPQQAD4GQ5BOF23K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VTVDEW523MEPQQAD4GQ5BOF23K","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":"211923b69b5b85d98cd85377515e5fd7dd02426b87d5915fec75e966125c76f0","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-12-05T03:50:46Z","title_canon_sha256":"00d4cd82cdc422c5bdd322b43800d4d32a955728e56008cb0e55ec8e4d76d321"},"schema_version":"1.0","source":{"id":"1212.0927","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0927","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0927v3","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0927","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"VTVDEW523MEP","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VTVDEW523MEPQQAD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VTVDEW52","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:80f87c7fc4922b48bece7ab73a2ce43c7403e5ca0d3966fb787cd0353531a3d8","target":"graph","created_at":"2026-05-18T03:34:35Z","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 introduce efficient algorithms for finding the $k$ shortest paths of a weighted pushdown automaton (WPDA), a compact representation of a weighted set of strings with potential applications in parsing and machine translation. Both of our algorithms are derived from the same weighted deductive logic description of the execution of a WPDA using different search strategies. Experimental results show our Algorithm 2 adds very little overhead vs. the single shortest path algorithm, even with a large $k$.","authors_text":"Ke Wu, Philip Resnik","cross_cats":["cs.DS","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-12-05T03:50:46Z","title":"Two Algorithms for Finding $k$ Shortest Paths of a Weighted Pushdown Automaton"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0927","kind":"arxiv","version":3},"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:dbb5edeff95ae521ea1132805d29e01e908d7fe6db797541e1e92d2aacad0a76","target":"record","created_at":"2026-05-18T03:34:35Z","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":"211923b69b5b85d98cd85377515e5fd7dd02426b87d5915fec75e966125c76f0","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-12-05T03:50:46Z","title_canon_sha256":"00d4cd82cdc422c5bdd322b43800d4d32a955728e56008cb0e55ec8e4d76d321"},"schema_version":"1.0","source":{"id":"1212.0927","kind":"arxiv","version":3}},"canonical_sha256":"acea325bbadb08f84003e1a1d0b8badaa9b82eb8408aa9745d5b588b0aec7c2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acea325bbadb08f84003e1a1d0b8badaa9b82eb8408aa9745d5b588b0aec7c2c","first_computed_at":"2026-05-18T03:34:35.126941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:35.126941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rc5N1VFsom90DHUDcylLw6TY68bJP6uM7AGW81BWfiH1qYqOqUL1pvBsnYafqaolIBWsLVOTes+TyTwJQhAZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:35.127382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0927","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbb5edeff95ae521ea1132805d29e01e908d7fe6db797541e1e92d2aacad0a76","sha256:80f87c7fc4922b48bece7ab73a2ce43c7403e5ca0d3966fb787cd0353531a3d8"],"state_sha256":"99f9847906c869559b221a08d8644fc1ed6a6f21c534a5546b7c898265cb2783"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UecFX2jbUtICvC8J+DHwSc4n8HmOmStBIGV/opbM5XEY2GJF1Vn468Q0fvTMII5yt7Ig+k9MVwGE6x3evO3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T02:32:05.989970Z","bundle_sha256":"4c258ebc0f0154c5e95748b69f0f629817b02072f50dee3d24e9bfc4bf992902"}}