{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:64WY3BJZXSEDDKA562N5P6QABB","short_pith_number":"pith:64WY3BJZ","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"},"canonical_sha256":"f72d8d8539bc8831a81df69bd7fa00085e4833aa122d226d69a503e6b4dbee3b","source":{"kind":"arxiv","id":"1711.08840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08840","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08840v1","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08840","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"pith_short_12","alias_value":"64WY3BJZXSED","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"64WY3BJZXSEDDKA5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"64WY3BJZ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:64WY3BJZXSEDDKA562N5P6QABB","target":"record","payload":{"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"},"canonical_sha256":"f72d8d8539bc8831a81df69bd7fa00085e4833aa122d226d69a503e6b4dbee3b","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"},"source_kind":"arxiv","source_id":"1711.08840","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52hrMiCdZODzJDdeblt5yxcB78Tx90PX6LFRfvw++dulISGLmorWjLmVDiRnHGomla5YprJWUrLQjTRovMv4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:28:08.232701Z"},"content_sha256":"6f9e59500c613fb344360c43dd9387108d1a2d53933ff1bcdbe314d9665629b4","schema_version":"1.0","event_id":"sha256:6f9e59500c613fb344360c43dd9387108d1a2d53933ff1bcdbe314d9665629b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:64WY3BJZXSEDDKA562N5P6QABB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYpEERhcktMHrCyD975ZSSNh+qs8KMxoxjGwbn7+EbDrm9YZlRpqIONM2Y9mb+1VpdZsW1CjMtKv8J9OoOAUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T05:28:08.233046Z"},"content_sha256":"b1a02888411ed004636395e7d8398e93909f34bbe647ec4952b9dc85d92fe449","schema_version":"1.0","event_id":"sha256:b1a02888411ed004636395e7d8398e93909f34bbe647ec4952b9dc85d92fe449"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/bundle.json","state_url":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64WY3BJZXSEDDKA562N5P6QABB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T05:28:08Z","links":{"resolver":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB","bundle":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/bundle.json","state":"https://pith.science/pith/64WY3BJZXSEDDKA562N5P6QABB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64WY3BJZXSEDDKA562N5P6QABB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:64WY3BJZXSEDDKA562N5P6QABB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ab1ad054ebced2c4fceba07f52616a56976817bcb7eac76c759611ec40af1ffa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-23T23:17:29Z","title_canon_sha256":"f92ae5766a83225e2463c54ae94915ceb739a76e90fa080e99af2020820cc158"},"schema_version":"1.0","source":{"id":"1711.08840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08840","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08840v1","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08840","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"pith_short_12","alias_value":"64WY3BJZXSED","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"64WY3BJZXSEDDKA5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"64WY3BJZ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:b1a02888411ed004636395e7d8398e93909f34bbe647ec4952b9dc85d92fe449","target":"graph","created_at":"2026-05-18T00:29:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Francesco Bertoli, Philip Kilby, Tommaso Urli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-23T23:17:29Z","title":"A general and scalable matheuristic for fleet design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08840","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6f9e59500c613fb344360c43dd9387108d1a2d53933ff1bcdbe314d9665629b4","target":"record","created_at":"2026-05-18T00:29:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ab1ad054ebced2c4fceba07f52616a56976817bcb7eac76c759611ec40af1ffa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-23T23:17:29Z","title_canon_sha256":"f92ae5766a83225e2463c54ae94915ceb739a76e90fa080e99af2020820cc158"},"schema_version":"1.0","source":{"id":"1711.08840","kind":"arxiv","version":1}},"canonical_sha256":"f72d8d8539bc8831a81df69bd7fa00085e4833aa122d226d69a503e6b4dbee3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f72d8d8539bc8831a81df69bd7fa00085e4833aa122d226d69a503e6b4dbee3b","first_computed_at":"2026-05-18T00:29:43.937842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:43.937842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7o3BKGycHz9dBoIYa7Mx1OFmWhN7ZeBl48gu8TOYmZC9XemB2Nr685rn3wD0zKKpA0j+kBFHI7/QiwmIKevUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:43.938261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f9e59500c613fb344360c43dd9387108d1a2d53933ff1bcdbe314d9665629b4","sha256:b1a02888411ed004636395e7d8398e93909f34bbe647ec4952b9dc85d92fe449"],"state_sha256":"3be2cd7d027d0ae11ec2a086baa195274d2d19583a4dffd513f967c192560844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mt+0gUt85gYtERK7BpLUVkQl0octSiQi/YPx/lBELgaqOAFXgUkWsqZh/ntlABBwdxppi6qMEnYGrFdo1NbbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T05:28:08.234923Z","bundle_sha256":"83e10323cea1f235e2c2dfc5387ced80dfdd1432a0fa75cb0f0dbd4ace36e91f"}}