{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VLMFFLF6S5WCVWTNS7K7BEQTE2","short_pith_number":"pith:VLMFFLF6","canonical_record":{"source":{"id":"2606.31820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-30T15:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"79cd3169af2f10337d3d3acc0e4f618c3b88247826722d92ff8c0abbabc85a81","abstract_canon_sha256":"4cf9b6bb3fc0071e3734b3bc9e1795fa83d7e59daa959c9592f1d933b80e4d74"},"schema_version":"1.0"},"canonical_sha256":"aad852acbe976c2ada6d97d5f09213269563567c5857534c41b9bdb83fc45b17","source":{"kind":"arxiv","id":"2606.31820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31820","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31820v1","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31820","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"VLMFFLF6S5WC","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"VLMFFLF6S5WCVWTN","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"VLMFFLF6","created_at":"2026-07-01T01:18:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VLMFFLF6S5WCVWTNS7K7BEQTE2","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-30T15:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"79cd3169af2f10337d3d3acc0e4f618c3b88247826722d92ff8c0abbabc85a81","abstract_canon_sha256":"4cf9b6bb3fc0071e3734b3bc9e1795fa83d7e59daa959c9592f1d933b80e4d74"},"schema_version":"1.0"},"canonical_sha256":"aad852acbe976c2ada6d97d5f09213269563567c5857534c41b9bdb83fc45b17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:16.644912Z","signature_b64":"6NAy1pJMb8wEuHPtZcPv2IZlFUcuCqNhlNOK85WvHBm4XMBg1miZARhi4EUliYBthLh2G5zhzIC0cLr8JKIbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aad852acbe976c2ada6d97d5f09213269563567c5857534c41b9bdb83fc45b17","last_reissued_at":"2026-07-01T01:18:16.644521Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:16.644521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31820","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-07-01T01:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ae3uNJcHrzFlPTls29hzsK7/+m+KQrUmMV26nywLvbvGHklpktj8E7wKaSFuADJA+wXy3fnvlm/xe1Alee07BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:53:43.886611Z"},"content_sha256":"00b20fb14a44ec9115590a322a62a3667f8e9173f8c0d24e7360279814478156","schema_version":"1.0","event_id":"sha256:00b20fb14a44ec9115590a322a62a3667f8e9173f8c0d24e7360279814478156"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VLMFFLF6S5WCVWTNS7K7BEQTE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Cluster-First Route-Second Decomposition for Industrial-Scale Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hyong Kim (1) ((1) Carnegie Mellon University), Oguzhan Karaahmetoglu (1)","submitted_at":"2026-06-30T15:31:40Z","abstract_excerpt":"Large-scale capacitated vehicle routing problems (CVRPs) are commonly addressed using cluster-first route-second (CFRS) approaches that split a routing instance into smaller, computationally tractable subproblems. Existing splitting methods typically rely on fixed partitioning rules, predefined optimization objectives, or learned policies, which may perform inconsistently across instances exhibiting different spatial, demand, and operational characteristics. In this work, we propose an adaptive CFRS system that formulates a decomposition procedure as an iterative decision-making process. Motiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31820","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/2606.31820/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"},"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-07-01T01:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtWlleVUy5pun1WOrbfyRMfl1KlnOnWGBJEWIf4DdOv9fJPhAgLAfRbafMcci1rSzuImhEkIc4PXeFaBgFxpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:53:43.886984Z"},"content_sha256":"c387c0a55b36fbda042da557019c914c109e7ab048e515a5b22ab01f745c46be","schema_version":"1.0","event_id":"sha256:c387c0a55b36fbda042da557019c914c109e7ab048e515a5b22ab01f745c46be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2/bundle.json","state_url":"https://pith.science/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2/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-07-02T18:53:43Z","links":{"resolver":"https://pith.science/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2","bundle":"https://pith.science/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2/bundle.json","state":"https://pith.science/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLMFFLF6S5WCVWTNS7K7BEQTE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VLMFFLF6S5WCVWTNS7K7BEQTE2","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":"4cf9b6bb3fc0071e3734b3bc9e1795fa83d7e59daa959c9592f1d933b80e4d74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-30T15:31:40Z","title_canon_sha256":"79cd3169af2f10337d3d3acc0e4f618c3b88247826722d92ff8c0abbabc85a81"},"schema_version":"1.0","source":{"id":"2606.31820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31820","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31820v1","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31820","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"VLMFFLF6S5WC","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"VLMFFLF6S5WCVWTN","created_at":"2026-07-01T01:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"VLMFFLF6","created_at":"2026-07-01T01:18:16Z"}],"graph_snapshots":[{"event_id":"sha256:c387c0a55b36fbda042da557019c914c109e7ab048e515a5b22ab01f745c46be","target":"graph","created_at":"2026-07-01T01:18:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.31820/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large-scale capacitated vehicle routing problems (CVRPs) are commonly addressed using cluster-first route-second (CFRS) approaches that split a routing instance into smaller, computationally tractable subproblems. Existing splitting methods typically rely on fixed partitioning rules, predefined optimization objectives, or learned policies, which may perform inconsistently across instances exhibiting different spatial, demand, and operational characteristics. In this work, we propose an adaptive CFRS system that formulates a decomposition procedure as an iterative decision-making process. Motiv","authors_text":"Hyong Kim (1) ((1) Carnegie Mellon University), Oguzhan Karaahmetoglu (1)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-30T15:31:40Z","title":"Adaptive Cluster-First Route-Second Decomposition for Industrial-Scale Vehicle Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31820","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:00b20fb14a44ec9115590a322a62a3667f8e9173f8c0d24e7360279814478156","target":"record","created_at":"2026-07-01T01:18:16Z","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":"4cf9b6bb3fc0071e3734b3bc9e1795fa83d7e59daa959c9592f1d933b80e4d74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-30T15:31:40Z","title_canon_sha256":"79cd3169af2f10337d3d3acc0e4f618c3b88247826722d92ff8c0abbabc85a81"},"schema_version":"1.0","source":{"id":"2606.31820","kind":"arxiv","version":1}},"canonical_sha256":"aad852acbe976c2ada6d97d5f09213269563567c5857534c41b9bdb83fc45b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aad852acbe976c2ada6d97d5f09213269563567c5857534c41b9bdb83fc45b17","first_computed_at":"2026-07-01T01:18:16.644521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:16.644521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6NAy1pJMb8wEuHPtZcPv2IZlFUcuCqNhlNOK85WvHBm4XMBg1miZARhi4EUliYBthLh2G5zhzIC0cLr8JKIbCw==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:16.644912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00b20fb14a44ec9115590a322a62a3667f8e9173f8c0d24e7360279814478156","sha256:c387c0a55b36fbda042da557019c914c109e7ab048e515a5b22ab01f745c46be"],"state_sha256":"0048feb81c738efa3c194b3bce06613700d173ea6adc5b92026e720884a04143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ciN9QPkqJq7PV3VCUFSwlYpg1AtHNiNflbotzVm7ouDWYoQ3WBUzWQPKIOPDE7yAP1PdfYLxSWvdNyS3tmO0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T18:53:43.888938Z","bundle_sha256":"79423e9745978269d3ada14c1bfff7d405b6216cfe7725c650d6520fc26e0774"}}