{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WG2VRDQVAPBZULCXZZ4M5VC375","short_pith_number":"pith:WG2VRDQV","canonical_record":{"source":{"id":"2607.00604","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:30:20Z","cross_cats_sorted":[],"title_canon_sha256":"b17013fadb69df86462f30a5b26393d18ef800ff0f03c1a1a2fad398238c88ba","abstract_canon_sha256":"07f8b8bf0f1bd6fd2b98d011f5d4a8902705895c12a74bbe35ded1364cd5d48a"},"schema_version":"1.0"},"canonical_sha256":"b1b5588e1503c39a2c57ce78ced45bff60fa82f2ea3733c44a3dac8e105e7573","source":{"kind":"arxiv","id":"2607.00604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00604","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00604v1","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00604","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"WG2VRDQVAPBZ","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_16","alias_value":"WG2VRDQVAPBZULCX","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_8","alias_value":"WG2VRDQV","created_at":"2026-07-02T01:17:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WG2VRDQVAPBZULCXZZ4M5VC375","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00604","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:30:20Z","cross_cats_sorted":[],"title_canon_sha256":"b17013fadb69df86462f30a5b26393d18ef800ff0f03c1a1a2fad398238c88ba","abstract_canon_sha256":"07f8b8bf0f1bd6fd2b98d011f5d4a8902705895c12a74bbe35ded1364cd5d48a"},"schema_version":"1.0"},"canonical_sha256":"b1b5588e1503c39a2c57ce78ced45bff60fa82f2ea3733c44a3dac8e105e7573","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:48.906002Z","signature_b64":"v+2bP8V7Onwv9srkhR8mBJHd6DNPg+h2QLPuTrx+iXnHKzIBWpcTZZh39u2DPQdaaJdtT8n9rUc61OxYDa6NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1b5588e1503c39a2c57ce78ced45bff60fa82f2ea3733c44a3dac8e105e7573","last_reissued_at":"2026-07-02T01:17:48.905566Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:48.905566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00604","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-02T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKjeebF87Jv3ggHzBh4W9hWqFehmwfOwDD8O/AQSqMcFUwRIFtuVBAbOVyzp/r/i1tsfbwqfmQ7ezWT6BkHkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T15:05:42.471721Z"},"content_sha256":"48dcf7dfa2d5d7549fae8a2a0f88f04eca981411c764724430d32e08a7e67eea","schema_version":"1.0","event_id":"sha256:48dcf7dfa2d5d7549fae8a2a0f88f04eca981411c764724430d32e08a7e67eea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WG2VRDQVAPBZULCXZZ4M5VC375","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chong Shen, Wanquan Liu, Xianchao Xiu, Yanjiao Zhu","submitted_at":"2026-07-01T08:30:20Z","abstract_excerpt":"The vehicle routing problem (VRP) is a central optimization problem in artificial intelligence, logistics automation, transportation scheduling, and industrial decision-making. VRP and its variants are NP-hard, and practical routing tasks often combine time windows, vehicle capacities, pickup-and-delivery relations, dynamic requests, and other operational constraints, making both modeling and solving difficult. Large language models (LLMs) provide a flexible interface for routing optimization by processing natural-language requirements, generating code, reasoning over constraints, and interact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00604","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/2607.00604/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-02T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cX7t+EJrqTcZDRChNkPfpvDPYl3EmSZeZrE8R6OiZ16q2wnSDn4XTlXaEiL/6NQtS9HLmhvgHC7Eoc0+1YljBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T15:05:42.472095Z"},"content_sha256":"54418b9b702a48847b8dc09524ad950aa49474a75c557f0b28a9573f3bca28f4","schema_version":"1.0","event_id":"sha256:54418b9b702a48847b8dc09524ad950aa49474a75c557f0b28a9573f3bca28f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WG2VRDQVAPBZULCXZZ4M5VC375/bundle.json","state_url":"https://pith.science/pith/WG2VRDQVAPBZULCXZZ4M5VC375/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WG2VRDQVAPBZULCXZZ4M5VC375/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-02T15:05:42Z","links":{"resolver":"https://pith.science/pith/WG2VRDQVAPBZULCXZZ4M5VC375","bundle":"https://pith.science/pith/WG2VRDQVAPBZULCXZZ4M5VC375/bundle.json","state":"https://pith.science/pith/WG2VRDQVAPBZULCXZZ4M5VC375/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WG2VRDQVAPBZULCXZZ4M5VC375/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WG2VRDQVAPBZULCXZZ4M5VC375","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":"07f8b8bf0f1bd6fd2b98d011f5d4a8902705895c12a74bbe35ded1364cd5d48a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:30:20Z","title_canon_sha256":"b17013fadb69df86462f30a5b26393d18ef800ff0f03c1a1a2fad398238c88ba"},"schema_version":"1.0","source":{"id":"2607.00604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00604","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00604v1","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00604","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"WG2VRDQVAPBZ","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_16","alias_value":"WG2VRDQVAPBZULCX","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_8","alias_value":"WG2VRDQV","created_at":"2026-07-02T01:17:48Z"}],"graph_snapshots":[{"event_id":"sha256:54418b9b702a48847b8dc09524ad950aa49474a75c557f0b28a9573f3bca28f4","target":"graph","created_at":"2026-07-02T01:17:48Z","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/2607.00604/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The vehicle routing problem (VRP) is a central optimization problem in artificial intelligence, logistics automation, transportation scheduling, and industrial decision-making. VRP and its variants are NP-hard, and practical routing tasks often combine time windows, vehicle capacities, pickup-and-delivery relations, dynamic requests, and other operational constraints, making both modeling and solving difficult. Large language models (LLMs) provide a flexible interface for routing optimization by processing natural-language requirements, generating code, reasoning over constraints, and interact","authors_text":"Chong Shen, Wanquan Liu, Xianchao Xiu, Yanjiao Zhu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:30:20Z","title":"Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00604","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:48dcf7dfa2d5d7549fae8a2a0f88f04eca981411c764724430d32e08a7e67eea","target":"record","created_at":"2026-07-02T01:17:48Z","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":"07f8b8bf0f1bd6fd2b98d011f5d4a8902705895c12a74bbe35ded1364cd5d48a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T08:30:20Z","title_canon_sha256":"b17013fadb69df86462f30a5b26393d18ef800ff0f03c1a1a2fad398238c88ba"},"schema_version":"1.0","source":{"id":"2607.00604","kind":"arxiv","version":1}},"canonical_sha256":"b1b5588e1503c39a2c57ce78ced45bff60fa82f2ea3733c44a3dac8e105e7573","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1b5588e1503c39a2c57ce78ced45bff60fa82f2ea3733c44a3dac8e105e7573","first_computed_at":"2026-07-02T01:17:48.905566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:48.905566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+2bP8V7Onwv9srkhR8mBJHd6DNPg+h2QLPuTrx+iXnHKzIBWpcTZZh39u2DPQdaaJdtT8n9rUc61OxYDa6NDA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:48.906002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48dcf7dfa2d5d7549fae8a2a0f88f04eca981411c764724430d32e08a7e67eea","sha256:54418b9b702a48847b8dc09524ad950aa49474a75c557f0b28a9573f3bca28f4"],"state_sha256":"d608e3d264b4bbd204edd8f8e887fb657e78b575fe141752b4ac684c5b9867fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BXgVSGEE/+DUwBCsfiyuh5HxoKZVi3/IIHrReMiQcwSORNxtekSvGQ9IPT0zl0fygGja2ICH23ReqmBdPhKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T15:05:42.474441Z","bundle_sha256":"7bde7babc760844aaf20ed20b84c77eb2ad0ec17a3b145a6b778231cb572f5cc"}}