{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VTVDEW523MEPQQAD4GQ5BOF23K","short_pith_number":"pith:VTVDEW52","schema_version":"1.0","canonical_sha256":"acea325bbadb08f84003e1a1d0b8badaa9b82eb8408aa9745d5b588b0aec7c2c","source":{"kind":"arxiv","id":"1212.0927","version":3},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.0927","created_at":"2026-05-18T03:34:35.127014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0927v3","created_at":"2026-05-18T03:34:35.127014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0927","created_at":"2026-05-18T03:34:35.127014+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTVDEW523MEP","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTVDEW523MEPQQAD","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTVDEW52","created_at":"2026-05-18T12:27:25.539911+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/VTVDEW523MEPQQAD4GQ5BOF23K","json":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K.json","graph_json":"https://pith.science/api/pith-number/VTVDEW523MEPQQAD4GQ5BOF23K/graph.json","events_json":"https://pith.science/api/pith-number/VTVDEW523MEPQQAD4GQ5BOF23K/events.json","paper":"https://pith.science/paper/VTVDEW52"},"agent_actions":{"view_html":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K","download_json":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K.json","view_paper":"https://pith.science/paper/VTVDEW52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0927&json=true","fetch_graph":"https://pith.science/api/pith-number/VTVDEW523MEPQQAD4GQ5BOF23K/graph.json","fetch_events":"https://pith.science/api/pith-number/VTVDEW523MEPQQAD4GQ5BOF23K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/action/storage_attestation","attest_author":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/action/author_attestation","sign_citation":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/action/citation_signature","submit_replication":"https://pith.science/pith/VTVDEW523MEPQQAD4GQ5BOF23K/action/replication_record"}},"created_at":"2026-05-18T03:34:35.127014+00:00","updated_at":"2026-05-18T03:34:35.127014+00:00"}