{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SPDZ7EJODYCBAPRHGWCC4QRDAO","short_pith_number":"pith:SPDZ7EJO","schema_version":"1.0","canonical_sha256":"93c79f912e1e04103e2735842e422303a3184d10914da27161ab572281b6afac","source":{"kind":"arxiv","id":"2306.08622","version":1},"attestation_state":"computed","paper":{"title":"PathWise: a flexible, open-source library for the Resource Constrained Shortest Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Matteo Salani, Saverio Basso","submitted_at":"2023-06-14T16:29:21Z","abstract_excerpt":"In this paper, we consider a fundamental and hard combinatorial problem: the Resource Constrained Shortest Path Problem (RCSPP). We describe the implementation of a flexible, open-source library for the solution of the RCSPP, called PathWise, capable of tackling several variants of the problem. We designed PathWise with the final user in mind, developing easy-to-use interfaces without compromising performance. We provide computational experiments on three classes of instances of the RCSPP, namely RCSPP on cyclic networks, RCSPP on large acyclic networks, and RCSPP on ad-hoc cyclic networks. We"},"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":"2306.08622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-14T16:29:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5048afbd6b4ac728ad157bbd88965620de4deee6aa9a493396fa1ff4d23620d1","abstract_canon_sha256":"3002948f4a23f3491e04f303bdfa82e434841a56dbb3ec0e8dc2448fd58e1b48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:54.458447Z","signature_b64":"v1fzc6qN3v43sy7opSmsXtBxqOAkwYw4bBe4te2c/gMG7Ay9fgtgYXsDuBxKTNWe9ob/OREw9PoVPZFt3CfZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c79f912e1e04103e2735842e422303a3184d10914da27161ab572281b6afac","last_reissued_at":"2026-07-05T06:20:54.458033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:54.458033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PathWise: a flexible, open-source library for the Resource Constrained Shortest Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Matteo Salani, Saverio Basso","submitted_at":"2023-06-14T16:29:21Z","abstract_excerpt":"In this paper, we consider a fundamental and hard combinatorial problem: the Resource Constrained Shortest Path Problem (RCSPP). We describe the implementation of a flexible, open-source library for the solution of the RCSPP, called PathWise, capable of tackling several variants of the problem. We designed PathWise with the final user in mind, developing easy-to-use interfaces without compromising performance. We provide computational experiments on three classes of instances of the RCSPP, namely RCSPP on cyclic networks, RCSPP on large acyclic networks, and RCSPP on ad-hoc cyclic networks. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08622","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.08622/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.08622","created_at":"2026-07-05T06:20:54.458094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08622v1","created_at":"2026-07-05T06:20:54.458094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08622","created_at":"2026-07-05T06:20:54.458094+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPDZ7EJODYCB","created_at":"2026-07-05T06:20:54.458094+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPDZ7EJODYCBAPRH","created_at":"2026-07-05T06:20:54.458094+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPDZ7EJO","created_at":"2026-07-05T06:20:54.458094+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30847","citing_title":"$\\texttt{bucket-graph-spprc}$: an extensible C++ library for the shortest path problem with resource constraints","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO","json":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO.json","graph_json":"https://pith.science/api/pith-number/SPDZ7EJODYCBAPRHGWCC4QRDAO/graph.json","events_json":"https://pith.science/api/pith-number/SPDZ7EJODYCBAPRHGWCC4QRDAO/events.json","paper":"https://pith.science/paper/SPDZ7EJO"},"agent_actions":{"view_html":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO","download_json":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO.json","view_paper":"https://pith.science/paper/SPDZ7EJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08622&json=true","fetch_graph":"https://pith.science/api/pith-number/SPDZ7EJODYCBAPRHGWCC4QRDAO/graph.json","fetch_events":"https://pith.science/api/pith-number/SPDZ7EJODYCBAPRHGWCC4QRDAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO/action/storage_attestation","attest_author":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO/action/author_attestation","sign_citation":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO/action/citation_signature","submit_replication":"https://pith.science/pith/SPDZ7EJODYCBAPRHGWCC4QRDAO/action/replication_record"}},"created_at":"2026-07-05T06:20:54.458094+00:00","updated_at":"2026-07-05T06:20:54.458094+00:00"}