{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:64WY3BJZXSEDDKA562N5P6QABB","short_pith_number":"pith:64WY3BJZ","schema_version":"1.0","canonical_sha256":"f72d8d8539bc8831a81df69bd7fa00085e4833aa122d226d69a503e6b4dbee3b","source":{"kind":"arxiv","id":"1711.08840","version":1},"attestation_state":"computed","paper":{"title":"A general and scalable matheuristic for fleet design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Bertoli, Philip Kilby, Tommaso Urli","submitted_at":"2017-11-23T23:17:29Z","abstract_excerpt":"We look at the problem of choosing a fleet of vehicles to carry out delivery tasks across a very long time horizon -- up to one year. The delivery quantities may vary markedly day to day and season to season, and the the underlying routing problem may have rich constraints -- e.g., time windows, compatibility constraints, and compartments. While many approaches to solve the fleet size and mix (FSM) problem in various contexts have been described, they usually only consider a \"representative day\" of demand. We present a method that allows any such single-day FSM solver to be used to find effici"},"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":"1711.08840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-23T23:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"f92ae5766a83225e2463c54ae94915ceb739a76e90fa080e99af2020820cc158","abstract_canon_sha256":"ab1ad054ebced2c4fceba07f52616a56976817bcb7eac76c759611ec40af1ffa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:43.938261Z","signature_b64":"7o3BKGycHz9dBoIYa7Mx1OFmWhN7ZeBl48gu8TOYmZC9XemB2Nr685rn3wD0zKKpA0j+kBFHI7/QiwmIKevUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f72d8d8539bc8831a81df69bd7fa00085e4833aa122d226d69a503e6b4dbee3b","last_reissued_at":"2026-05-18T00:29:43.937842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:43.937842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general and scalable matheuristic for fleet design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Bertoli, Philip Kilby, Tommaso Urli","submitted_at":"2017-11-23T23:17:29Z","abstract_excerpt":"We look at the problem of choosing a fleet of vehicles to carry out delivery tasks across a very long time horizon -- up to one year. The delivery quantities may vary markedly day to day and season to season, and the the underlying routing problem may have rich constraints -- e.g., time windows, compatibility constraints, and compartments. While many approaches to solve the fleet size and mix (FSM) problem in various contexts have been described, they usually only consider a \"representative day\" of demand. We present a method that allows any such single-day FSM solver to be used to find effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08840","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":"1711.08840","created_at":"2026-05-18T00:29:43.937899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08840v1","created_at":"2026-05-18T00:29:43.937899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08840","created_at":"2026-05-18T00:29:43.937899+00:00"},{"alias_kind":"pith_short_12","alias_value":"64WY3BJZXSED","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"64WY3BJZXSEDDKA5","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"64WY3BJZ","created_at":"2026-05-18T12:31:03.183658+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/64WY3BJZXSEDDKA562N5P6QABB","json":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB.json","graph_json":"https://pith.science/api/pith-number/64WY3BJZXSEDDKA562N5P6QABB/graph.json","events_json":"https://pith.science/api/pith-number/64WY3BJZXSEDDKA562N5P6QABB/events.json","paper":"https://pith.science/paper/64WY3BJZ"},"agent_actions":{"view_html":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB","download_json":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB.json","view_paper":"https://pith.science/paper/64WY3BJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08840&json=true","fetch_graph":"https://pith.science/api/pith-number/64WY3BJZXSEDDKA562N5P6QABB/graph.json","fetch_events":"https://pith.science/api/pith-number/64WY3BJZXSEDDKA562N5P6QABB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/action/storage_attestation","attest_author":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/action/author_attestation","sign_citation":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/action/citation_signature","submit_replication":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/action/replication_record"}},"created_at":"2026-05-18T00:29:43.937899+00:00","updated_at":"2026-05-18T00:29:43.937899+00:00"}