{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DQ6KXCHX3XKHDSNIYQ6RTAZMO3","short_pith_number":"pith:DQ6KXCHX","canonical_record":{"source":{"id":"2308.14104","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-27T13:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"167578189b2b138b6abbe663d3474c48400e416c03240f7d47a8941b48454569","abstract_canon_sha256":"c592279cbab45dc0acc5c53eb11be4bb10a5d4c0b4d6a23f2d62312fee3194fa"},"schema_version":"1.0"},"canonical_sha256":"1c3cab88f7ddd471c9a8c43d19832c76db3b578450ae0087495f0243333a236a","source":{"kind":"arxiv","id":"2308.14104","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.14104","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"2308.14104v3","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14104","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"DQ6KXCHX3XKH","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"pith_short_16","alias_value":"DQ6KXCHX3XKHDSNI","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"pith_short_8","alias_value":"DQ6KXCHX","created_at":"2026-07-05T08:15:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DQ6KXCHX3XKHDSNIYQ6RTAZMO3","target":"record","payload":{"canonical_record":{"source":{"id":"2308.14104","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-27T13:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"167578189b2b138b6abbe663d3474c48400e416c03240f7d47a8941b48454569","abstract_canon_sha256":"c592279cbab45dc0acc5c53eb11be4bb10a5d4c0b4d6a23f2d62312fee3194fa"},"schema_version":"1.0"},"canonical_sha256":"1c3cab88f7ddd471c9a8c43d19832c76db3b578450ae0087495f0243333a236a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:39.181509Z","signature_b64":"+D/5pSYGWl3oyORePiglPRURGvjyMj+E8OZg5jTVJ2uFzy19K7x1rBVV/JpxaMD5wRVlVqeOnKi0HGQHTQ1pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c3cab88f7ddd471c9a8c43d19832c76db3b578450ae0087495f0243333a236a","last_reissued_at":"2026-07-05T08:15:39.180920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:39.180920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.14104","source_version":3,"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-05T08:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQrp730TRpU+RlfInx9SrAn1/5YN8nu6wt5KPLCETYv2JHXDvEDt5fqxPvMakZDfwVQkBhK/27nVFA1Ce6onBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T15:01:32.101049Z"},"content_sha256":"f0c52677a99e58e49008a47995d4946c7957f8225b66b2d35a89f45190767261","schema_version":"1.0","event_id":"sha256:f0c52677a99e58e49008a47995d4946c7957f8225b66b2d35a89f45190767261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DQ6KXCHX3XKHDSNIYQ6RTAZMO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao Qian, Chengrui Gao, Dong Li, Haopu Shang, Ke Xue","submitted_at":"2023-08-27T13:22:50Z","abstract_excerpt":"Machine learning has been adapted to help solve NP-hard combinatorial optimization problems. One prevalent way is learning to construct solutions by deep neural networks, which has been receiving more and more attention due to the high efficiency and less requirement for expert knowledge. However, many neural construction methods for Vehicle Routing Problems~(VRPs) focus on synthetic problem instances with specified node distributions and limited scales, leading to poor performance on real-world problems which usually involve complex and unknown node distributions together with large scales. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14104","kind":"arxiv","version":3},"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/2308.14104/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-05T08:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWa2AWnp4kpcMgRSn0VeVJ1oSueVJQY4N6TQ/vr20K3+99ZsBhtCKSIE5AN7qrXXCB9g+TM8osZ+wcFxlp0EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T15:01:32.101563Z"},"content_sha256":"c7143c5356c77be1599b4a4a02803d7cfc7af39005fedab0336e29abf3765863","schema_version":"1.0","event_id":"sha256:c7143c5356c77be1599b4a4a02803d7cfc7af39005fedab0336e29abf3765863"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3/bundle.json","state_url":"https://pith.science/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3/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-08-22T15:01:32Z","links":{"resolver":"https://pith.science/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3","bundle":"https://pith.science/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3/bundle.json","state":"https://pith.science/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQ6KXCHX3XKHDSNIYQ6RTAZMO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DQ6KXCHX3XKHDSNIYQ6RTAZMO3","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":"c592279cbab45dc0acc5c53eb11be4bb10a5d4c0b4d6a23f2d62312fee3194fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-27T13:22:50Z","title_canon_sha256":"167578189b2b138b6abbe663d3474c48400e416c03240f7d47a8941b48454569"},"schema_version":"1.0","source":{"id":"2308.14104","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.14104","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"2308.14104v3","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14104","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"DQ6KXCHX3XKH","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"pith_short_16","alias_value":"DQ6KXCHX3XKHDSNI","created_at":"2026-07-05T08:15:39Z"},{"alias_kind":"pith_short_8","alias_value":"DQ6KXCHX","created_at":"2026-07-05T08:15:39Z"}],"graph_snapshots":[{"event_id":"sha256:c7143c5356c77be1599b4a4a02803d7cfc7af39005fedab0336e29abf3765863","target":"graph","created_at":"2026-07-05T08:15:39Z","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/2308.14104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine learning has been adapted to help solve NP-hard combinatorial optimization problems. One prevalent way is learning to construct solutions by deep neural networks, which has been receiving more and more attention due to the high efficiency and less requirement for expert knowledge. However, many neural construction methods for Vehicle Routing Problems~(VRPs) focus on synthetic problem instances with specified node distributions and limited scales, leading to poor performance on real-world problems which usually involve complex and unknown node distributions together with large scales. T","authors_text":"Chao Qian, Chengrui Gao, Dong Li, Haopu Shang, Ke Xue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-27T13:22:50Z","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14104","kind":"arxiv","version":3},"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:f0c52677a99e58e49008a47995d4946c7957f8225b66b2d35a89f45190767261","target":"record","created_at":"2026-07-05T08:15:39Z","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":"c592279cbab45dc0acc5c53eb11be4bb10a5d4c0b4d6a23f2d62312fee3194fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-27T13:22:50Z","title_canon_sha256":"167578189b2b138b6abbe663d3474c48400e416c03240f7d47a8941b48454569"},"schema_version":"1.0","source":{"id":"2308.14104","kind":"arxiv","version":3}},"canonical_sha256":"1c3cab88f7ddd471c9a8c43d19832c76db3b578450ae0087495f0243333a236a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c3cab88f7ddd471c9a8c43d19832c76db3b578450ae0087495f0243333a236a","first_computed_at":"2026-07-05T08:15:39.180920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:15:39.180920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+D/5pSYGWl3oyORePiglPRURGvjyMj+E8OZg5jTVJ2uFzy19K7x1rBVV/JpxaMD5wRVlVqeOnKi0HGQHTQ1pDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:15:39.181509Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.14104","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c52677a99e58e49008a47995d4946c7957f8225b66b2d35a89f45190767261","sha256:c7143c5356c77be1599b4a4a02803d7cfc7af39005fedab0336e29abf3765863"],"state_sha256":"1e248d02a97d99837f778f6179033ff2b398f128f2108f1900bfdab90e0d5c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5Tgeso0F30An2uMUiF4e2iEpAY+tIUywgAo5z7xv9UtRWc6PfLjUPmfzEal6LI89HBK8V4AilMmI3M81+YCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T15:01:32.104679Z","bundle_sha256":"fc58af596c84164bf0ad25050f7826f49ba5e20fe41ac2fa39a3efc313095275"}}