{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:I2ELEPSU3W4G7XTWDZ6H4QLZGN","short_pith_number":"pith:I2ELEPSU","schema_version":"1.0","canonical_sha256":"4688b23e54ddb86fde761e7c7e4179336da8976c7c66998ca88deb3b9efbfa1a","source":{"kind":"arxiv","id":"1502.07314","version":3},"attestation_state":"computed","paper":{"title":"Path Finding under Uncertainty through Probabilistic Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brooks Paige, David Tolpin, Frank Wood, Jan Willem van de Meent","submitted_at":"2015-02-25T19:21:04Z","abstract_excerpt":"We introduce a new approach to solving path-finding problems under uncertainty by representing them as probabilistic models and applying domain-independent inference algorithms to the models. This approach separates problem representation from the inference algorithm and provides a framework for efficient learning of path-finding policies. We evaluate the new approach on the Canadian Traveler Problem, which we formulate as a probabilistic model, and show how probabilistic inference allows high performance stochastic policies to be obtained for this problem."},"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":"1502.07314","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-25T19:21:04Z","cross_cats_sorted":[],"title_canon_sha256":"5fbb1bf780cc1496d10f607d2ff60ee236c9619d7f284b3da0c05c5f57cdd4aa","abstract_canon_sha256":"c8722644bc20a882cc8aca22f08ca6efbf9a1fdaf1d2e2117436c7cc852fd02a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.686241Z","signature_b64":"aHB+AvKyg3zMPaRvs/bWYjrBWVDcG/8GDSgl/NP9/lraidTTIWgUe/E/exne7mVb8I5in8PIOnFET0+coGm4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4688b23e54ddb86fde761e7c7e4179336da8976c7c66998ca88deb3b9efbfa1a","last_reissued_at":"2026-05-18T01:55:52.685741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.685741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Finding under Uncertainty through Probabilistic Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brooks Paige, David Tolpin, Frank Wood, Jan Willem van de Meent","submitted_at":"2015-02-25T19:21:04Z","abstract_excerpt":"We introduce a new approach to solving path-finding problems under uncertainty by representing them as probabilistic models and applying domain-independent inference algorithms to the models. This approach separates problem representation from the inference algorithm and provides a framework for efficient learning of path-finding policies. We evaluate the new approach on the Canadian Traveler Problem, which we formulate as a probabilistic model, and show how probabilistic inference allows high performance stochastic policies to be obtained for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07314","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":"1502.07314","created_at":"2026-05-18T01:55:52.685812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07314v3","created_at":"2026-05-18T01:55:52.685812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07314","created_at":"2026-05-18T01:55:52.685812+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2ELEPSU3W4G","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2ELEPSU3W4G7XTW","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2ELEPSU","created_at":"2026-05-18T12:29:25.134429+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/I2ELEPSU3W4G7XTWDZ6H4QLZGN","json":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN.json","graph_json":"https://pith.science/api/pith-number/I2ELEPSU3W4G7XTWDZ6H4QLZGN/graph.json","events_json":"https://pith.science/api/pith-number/I2ELEPSU3W4G7XTWDZ6H4QLZGN/events.json","paper":"https://pith.science/paper/I2ELEPSU"},"agent_actions":{"view_html":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN","download_json":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN.json","view_paper":"https://pith.science/paper/I2ELEPSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07314&json=true","fetch_graph":"https://pith.science/api/pith-number/I2ELEPSU3W4G7XTWDZ6H4QLZGN/graph.json","fetch_events":"https://pith.science/api/pith-number/I2ELEPSU3W4G7XTWDZ6H4QLZGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN/action/storage_attestation","attest_author":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN/action/author_attestation","sign_citation":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN/action/citation_signature","submit_replication":"https://pith.science/pith/I2ELEPSU3W4G7XTWDZ6H4QLZGN/action/replication_record"}},"created_at":"2026-05-18T01:55:52.685812+00:00","updated_at":"2026-05-18T01:55:52.685812+00:00"}