{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NBE3TTIBNNWRWS3QCP2FXJMN5G","short_pith_number":"pith:NBE3TTIB","schema_version":"1.0","canonical_sha256":"6849b9cd016b6d1b4b7013f45ba58de9a67ad719fc997b15b7addd7889c2bf17","source":{"kind":"arxiv","id":"1901.02771","version":1},"attestation_state":"computed","paper":{"title":"Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Window","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Christian Truden, Christoph Hertrich, Philipp Hungerl\\\"ander","submitted_at":"2019-01-09T15:00:46Z","abstract_excerpt":"The capacitated Vehicle Routing Problem with structured Time Windows (cVRPsTW) is concerned with finding optimal tours for vehicles with given capacity constraints to deliver goods to customers within assigned time windows. In our problem variant these time windows have a special structure, namely they are non-overlapping and each time window holds several customers. This is a reasonable assumption for Attended Home Delivery services. Sweep algorithms are known as simple, yet effective heuristics for the classical capacitated Vehicle Routing Problem. We propose variants of the sweep algorithm "},"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":"1901.02771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-09T15:00:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"688fe4480c851540007537e63e1d79d9829f2b8850b2b4ae6801c3e03c913a09","abstract_canon_sha256":"3dd30dda023b32f4c488f6a14b34ba7f52a6e20b053b5adadf38a07d1df9d54a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:50.161957Z","signature_b64":"p4qsSlggWkLhksE3vy+Awcfjo5N5b08nQtl/ZLqFlpY8iTfrivu+oN7a1c2vYp9+zCnvxjrnNKAieX0/bx6ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6849b9cd016b6d1b4b7013f45ba58de9a67ad719fc997b15b7addd7889c2bf17","last_reissued_at":"2026-07-05T00:10:50.161408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:50.161408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Window","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Christian Truden, Christoph Hertrich, Philipp Hungerl\\\"ander","submitted_at":"2019-01-09T15:00:46Z","abstract_excerpt":"The capacitated Vehicle Routing Problem with structured Time Windows (cVRPsTW) is concerned with finding optimal tours for vehicles with given capacity constraints to deliver goods to customers within assigned time windows. In our problem variant these time windows have a special structure, namely they are non-overlapping and each time window holds several customers. This is a reasonable assumption for Attended Home Delivery services. Sweep algorithms are known as simple, yet effective heuristics for the classical capacitated Vehicle Routing Problem. We propose variants of the sweep algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02771","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/1901.02771/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":"1901.02771","created_at":"2026-07-05T00:10:50.161466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02771v1","created_at":"2026-07-05T00:10:50.161466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02771","created_at":"2026-07-05T00:10:50.161466+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBE3TTIBNNWR","created_at":"2026-07-05T00:10:50.161466+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBE3TTIBNNWRWS3Q","created_at":"2026-07-05T00:10:50.161466+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBE3TTIB","created_at":"2026-07-05T00:10:50.161466+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/NBE3TTIBNNWRWS3QCP2FXJMN5G","json":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G.json","graph_json":"https://pith.science/api/pith-number/NBE3TTIBNNWRWS3QCP2FXJMN5G/graph.json","events_json":"https://pith.science/api/pith-number/NBE3TTIBNNWRWS3QCP2FXJMN5G/events.json","paper":"https://pith.science/paper/NBE3TTIB"},"agent_actions":{"view_html":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G","download_json":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G.json","view_paper":"https://pith.science/paper/NBE3TTIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02771&json=true","fetch_graph":"https://pith.science/api/pith-number/NBE3TTIBNNWRWS3QCP2FXJMN5G/graph.json","fetch_events":"https://pith.science/api/pith-number/NBE3TTIBNNWRWS3QCP2FXJMN5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G/action/storage_attestation","attest_author":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G/action/author_attestation","sign_citation":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G/action/citation_signature","submit_replication":"https://pith.science/pith/NBE3TTIBNNWRWS3QCP2FXJMN5G/action/replication_record"}},"created_at":"2026-07-05T00:10:50.161466+00:00","updated_at":"2026-07-05T00:10:50.161466+00:00"}