{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HC7Y7H7VDZXDPKDW64IPEDEGCE","short_pith_number":"pith:HC7Y7H7V","schema_version":"1.0","canonical_sha256":"38bf8f9ff51e6e37a876f710f20c86112d34d92dc387aa8a14bc428bbf0bf3c3","source":{"kind":"arxiv","id":"1504.07880","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Axel Parmentier","submitted_at":"2015-04-29T14:55:39Z","abstract_excerpt":"Resource constrained shortest path problems are usually solved thanks to a smart enumeration of all the non-dominated paths. Recent improvements of these enumeration algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard procedure to generate bounds on paths resources in a general setting which covers most resource constrained shortest path problems, among which stochastic versions.\n  In that purpose, we introduce a generalization o"},"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":"1504.07880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T14:55:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"66d920181b319f2bd042063a3e15fbf80aac4523c836daa10d433d8edcc19ffb","abstract_canon_sha256":"10e38e6c13e1e016671122e19927e84daaf32ea36c3e98ed8290513b766eee3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:43.151709Z","signature_b64":"FtGNWflQMPURN8IQMaKfNFe49B4J9WItmi68FevboUFz+y2bvNX13ByAw18QpnTRjE3YWNWXtKa8jfH2D3yCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38bf8f9ff51e6e37a876f710f20c86112d34d92dc387aa8a14bc428bbf0bf3c3","last_reissued_at":"2026-05-18T00:50:43.151004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:43.151004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Axel Parmentier","submitted_at":"2015-04-29T14:55:39Z","abstract_excerpt":"Resource constrained shortest path problems are usually solved thanks to a smart enumeration of all the non-dominated paths. Recent improvements of these enumeration algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard procedure to generate bounds on paths resources in a general setting which covers most resource constrained shortest path problems, among which stochastic versions.\n  In that purpose, we introduce a generalization o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07880","kind":"arxiv","version":2},"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":"1504.07880","created_at":"2026-05-18T00:50:43.151113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07880v2","created_at":"2026-05-18T00:50:43.151113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07880","created_at":"2026-05-18T00:50:43.151113+00:00"},{"alias_kind":"pith_short_12","alias_value":"HC7Y7H7VDZXD","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"HC7Y7H7VDZXDPKDW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"HC7Y7H7V","created_at":"2026-05-18T12:29:22.688609+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/HC7Y7H7VDZXDPKDW64IPEDEGCE","json":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE.json","graph_json":"https://pith.science/api/pith-number/HC7Y7H7VDZXDPKDW64IPEDEGCE/graph.json","events_json":"https://pith.science/api/pith-number/HC7Y7H7VDZXDPKDW64IPEDEGCE/events.json","paper":"https://pith.science/paper/HC7Y7H7V"},"agent_actions":{"view_html":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE","download_json":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE.json","view_paper":"https://pith.science/paper/HC7Y7H7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07880&json=true","fetch_graph":"https://pith.science/api/pith-number/HC7Y7H7VDZXDPKDW64IPEDEGCE/graph.json","fetch_events":"https://pith.science/api/pith-number/HC7Y7H7VDZXDPKDW64IPEDEGCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE/action/storage_attestation","attest_author":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE/action/author_attestation","sign_citation":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE/action/citation_signature","submit_replication":"https://pith.science/pith/HC7Y7H7VDZXDPKDW64IPEDEGCE/action/replication_record"}},"created_at":"2026-05-18T00:50:43.151113+00:00","updated_at":"2026-05-18T00:50:43.151113+00:00"}