{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O62DL44YPG2V3SAGONYH4YCKVB","short_pith_number":"pith:O62DL44Y","schema_version":"1.0","canonical_sha256":"77b435f39879b55dc80673707e604aa8431d40dbeb678e0873ab6757ed987956","source":{"kind":"arxiv","id":"1302.4987","version":1},"attestation_state":"computed","paper":{"title":"Path Planning under Time-Dependent Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kenneth Larson, Matthew Ford, Michael P. Wellman","submitted_at":"2013-02-20T15:24:00Z","abstract_excerpt":"Standard algorithms for finding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are deterministic.  We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs.  Although these dependencies violate the standard dynamic-programming decomposition, we identify a weaker stochastic consistency condition that justifies a generalized dynamic-programming approach based on stochastic dominance.  We present a revised path-planning algorithm and prove that it produces optimal paths under"},"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":"1302.4987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"497ac165f245f588c076c2822ae7d4f80c1a6d6ccc3be2c2eaa2956ac6108c0d","abstract_canon_sha256":"d1a08cf666cc0ea982dd080f28089d17866cbfa2802240e1523302e0ca33b6a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:00.561249Z","signature_b64":"Ef+yiO43SeM7ss+00xaKIn9SqxTww4NSMjmiOJq3bFJHpBkTaXhOrHazrtHnQsbLIr9ygxy0dSZzeaF11LjIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77b435f39879b55dc80673707e604aa8431d40dbeb678e0873ab6757ed987956","last_reissued_at":"2026-05-18T03:33:00.560391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:00.560391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Planning under Time-Dependent Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kenneth Larson, Matthew Ford, Michael P. Wellman","submitted_at":"2013-02-20T15:24:00Z","abstract_excerpt":"Standard algorithms for finding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are deterministic.  We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs.  Although these dependencies violate the standard dynamic-programming decomposition, we identify a weaker stochastic consistency condition that justifies a generalized dynamic-programming approach based on stochastic dominance.  We present a revised path-planning algorithm and prove that it produces optimal paths under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4987","kind":"arxiv","version":1},"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":"1302.4987","created_at":"2026-05-18T03:33:00.560535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4987v1","created_at":"2026-05-18T03:33:00.560535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4987","created_at":"2026-05-18T03:33:00.560535+00:00"},{"alias_kind":"pith_short_12","alias_value":"O62DL44YPG2V","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O62DL44YPG2V3SAG","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O62DL44Y","created_at":"2026-05-18T12:27:54.935989+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/O62DL44YPG2V3SAGONYH4YCKVB","json":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB.json","graph_json":"https://pith.science/api/pith-number/O62DL44YPG2V3SAGONYH4YCKVB/graph.json","events_json":"https://pith.science/api/pith-number/O62DL44YPG2V3SAGONYH4YCKVB/events.json","paper":"https://pith.science/paper/O62DL44Y"},"agent_actions":{"view_html":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB","download_json":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB.json","view_paper":"https://pith.science/paper/O62DL44Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4987&json=true","fetch_graph":"https://pith.science/api/pith-number/O62DL44YPG2V3SAGONYH4YCKVB/graph.json","fetch_events":"https://pith.science/api/pith-number/O62DL44YPG2V3SAGONYH4YCKVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB/action/storage_attestation","attest_author":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB/action/author_attestation","sign_citation":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB/action/citation_signature","submit_replication":"https://pith.science/pith/O62DL44YPG2V3SAGONYH4YCKVB/action/replication_record"}},"created_at":"2026-05-18T03:33:00.560535+00:00","updated_at":"2026-05-18T03:33:00.560535+00:00"}