{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZEJ42KBCIWLQX5YXF3EPDOUZDN","short_pith_number":"pith:ZEJ42KBC","schema_version":"1.0","canonical_sha256":"c913cd282245970bf7172ec8f1ba991b543f5895efcc8b4a7184f6d4945c5f08","source":{"kind":"arxiv","id":"2009.07588","version":1},"attestation_state":"computed","paper":{"title":"On path ranking in time-dependent graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Emanuela Guerriero, Gianpaolo Ghiani, Tommaso Adamo","submitted_at":"2020-09-16T10:23:23Z","abstract_excerpt":"In this paper we study a property of time-dependent graphs, dubbed path ranking invariance. Broadly speaking, a time-dependent graph is path ranking invariant if the ordering of its paths (w.r.t. travel time) is independent of the start time. In this paper we show that, if a graph is path ranking invariant, the solution of a large class of time-dependent vehicle routing problems can be obtained by solving suitably defined (and simpler) time-independent routing problems. We also show how this property can be checked by solving a linear program. If the check fails, the solution of the linear pro"},"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":"2009.07588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-09-16T10:23:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"43bd84512d80bd8606f560bb3228921c7815c4766b628bbda050637ab85ea75f","abstract_canon_sha256":"effa3854504765982f04e9d4c04e9b639764cde1c95770d96656804c4e837a18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:24.406091Z","signature_b64":"3e9+n9A5Wtby8fo9UkMova3aSWA4Z0sNFry9tmr1P39nEt5UYl6LhO2Jy4sCq6NKgVhQ9IrGEafhw4+40y5WAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c913cd282245970bf7172ec8f1ba991b543f5895efcc8b4a7184f6d4945c5f08","last_reissued_at":"2026-07-05T05:30:24.405714Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:24.405714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On path ranking in time-dependent graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Emanuela Guerriero, Gianpaolo Ghiani, Tommaso Adamo","submitted_at":"2020-09-16T10:23:23Z","abstract_excerpt":"In this paper we study a property of time-dependent graphs, dubbed path ranking invariance. Broadly speaking, a time-dependent graph is path ranking invariant if the ordering of its paths (w.r.t. travel time) is independent of the start time. In this paper we show that, if a graph is path ranking invariant, the solution of a large class of time-dependent vehicle routing problems can be obtained by solving suitably defined (and simpler) time-independent routing problems. We also show how this property can be checked by solving a linear program. If the check fails, the solution of the linear pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07588","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/2009.07588/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":"2009.07588","created_at":"2026-07-05T05:30:24.405773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.07588v1","created_at":"2026-07-05T05:30:24.405773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07588","created_at":"2026-07-05T05:30:24.405773+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEJ42KBCIWLQ","created_at":"2026-07-05T05:30:24.405773+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEJ42KBCIWLQX5YX","created_at":"2026-07-05T05:30:24.405773+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEJ42KBC","created_at":"2026-07-05T05:30:24.405773+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/ZEJ42KBCIWLQX5YXF3EPDOUZDN","json":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN.json","graph_json":"https://pith.science/api/pith-number/ZEJ42KBCIWLQX5YXF3EPDOUZDN/graph.json","events_json":"https://pith.science/api/pith-number/ZEJ42KBCIWLQX5YXF3EPDOUZDN/events.json","paper":"https://pith.science/paper/ZEJ42KBC"},"agent_actions":{"view_html":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN","download_json":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN.json","view_paper":"https://pith.science/paper/ZEJ42KBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.07588&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEJ42KBCIWLQX5YXF3EPDOUZDN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEJ42KBCIWLQX5YXF3EPDOUZDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN/action/storage_attestation","attest_author":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN/action/author_attestation","sign_citation":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN/action/citation_signature","submit_replication":"https://pith.science/pith/ZEJ42KBCIWLQX5YXF3EPDOUZDN/action/replication_record"}},"created_at":"2026-07-05T05:30:24.405773+00:00","updated_at":"2026-07-05T05:30:24.405773+00:00"}