{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RMMCLK3LCUNIWNNUSPV2I2BOQT","short_pith_number":"pith:RMMCLK3L","canonical_record":{"source":{"id":"2410.21066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-28T14:26:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9c19b95f9b4ad7fe5389a05762a3739f0d517b9886b514a3b7c753d12ca00840","abstract_canon_sha256":"2de85690fa10fbd0d76ec9f7961252e380c9148997c92ca1d2371f5ded8c7cb1"},"schema_version":"1.0"},"canonical_sha256":"8b1825ab6b151a8b35b493eba4682e84e9a2342a2913d88fc90714eaf505f311","source":{"kind":"arxiv","id":"2410.21066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.21066","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.21066v1","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21066","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"RMMCLK3LCUNI","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"pith_short_16","alias_value":"RMMCLK3LCUNIWNNU","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"pith_short_8","alias_value":"RMMCLK3L","created_at":"2026-07-05T09:27:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RMMCLK3LCUNIWNNUSPV2I2BOQT","target":"record","payload":{"canonical_record":{"source":{"id":"2410.21066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-28T14:26:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9c19b95f9b4ad7fe5389a05762a3739f0d517b9886b514a3b7c753d12ca00840","abstract_canon_sha256":"2de85690fa10fbd0d76ec9f7961252e380c9148997c92ca1d2371f5ded8c7cb1"},"schema_version":"1.0"},"canonical_sha256":"8b1825ab6b151a8b35b493eba4682e84e9a2342a2913d88fc90714eaf505f311","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:15.078109Z","signature_b64":"eXwtUkauug4GtcYCKinIYmefWdNyC1bmpOMLDPGZBq2Bnx/HHc2mkYlSq8X21DMFWFo71Xn7n8a1lK8IXxuRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b1825ab6b151a8b35b493eba4682e84e9a2342a2913d88fc90714eaf505f311","last_reissued_at":"2026-07-05T09:27:15.077651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:15.077651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.21066","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-05T09:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHOUlPjPQueLznGmHvKNwhUl7EhGjKPCLXCXaaixACFru6CuY1HS/6G+R9dUTsGR0JP+5b0osjsRmqu0orLsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:50:56.931571Z"},"content_sha256":"fad8bea0f9d25194779f357c21cb6777e82669d70302e3d958610b88374162db","schema_version":"1.0","event_id":"sha256:fad8bea0f9d25194779f357c21cb6777e82669d70302e3d958610b88374162db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RMMCLK3LCUNIWNNUSPV2I2BOQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Handle Complex Constraints for Vehicle Routing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jianan Zhou, Jieyi Bi, Jie Zhang, Wen Song, Yaoxin Wu, Yining Ma, Zhiguang Cao","submitted_at":"2024-10-28T14:26:54Z","abstract_excerpt":"Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints. While recent neural methods excel in constructing solutions based on feasibility masking, they struggle with handling complex constraints, especially when obtaining the masking itself is NP-hard. In this paper, we propose a novel Proactive Infeasibility Prevention (PIP) framework to advance the capabilities of neural methods towards more complex VRPs. Our PIP integrates the Lagrangian multiplier as a basis to enhance constraint awareness and introduces preventative infeasibility masking t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21066","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/2410.21066/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-05T09:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fl0c+2VjA0emKmNNgF+G440ctm4g4lYjI63pa/sstY6okdxxBD2nq9oVVFKk1APqvnfqJOjXfRQB9GGTVHggAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:50:56.932094Z"},"content_sha256":"1f2e82a0b822a97b1810e0f2aed7f75f4b2fc8d2ce033f7d72ecb432b171c729","schema_version":"1.0","event_id":"sha256:1f2e82a0b822a97b1810e0f2aed7f75f4b2fc8d2ce033f7d72ecb432b171c729"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/bundle.json","state_url":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/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-13T11:50:56Z","links":{"resolver":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT","bundle":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/bundle.json","state":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RMMCLK3LCUNIWNNUSPV2I2BOQT","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":"2de85690fa10fbd0d76ec9f7961252e380c9148997c92ca1d2371f5ded8c7cb1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-28T14:26:54Z","title_canon_sha256":"9c19b95f9b4ad7fe5389a05762a3739f0d517b9886b514a3b7c753d12ca00840"},"schema_version":"1.0","source":{"id":"2410.21066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.21066","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.21066v1","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21066","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"RMMCLK3LCUNI","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"pith_short_16","alias_value":"RMMCLK3LCUNIWNNU","created_at":"2026-07-05T09:27:15Z"},{"alias_kind":"pith_short_8","alias_value":"RMMCLK3L","created_at":"2026-07-05T09:27:15Z"}],"graph_snapshots":[{"event_id":"sha256:1f2e82a0b822a97b1810e0f2aed7f75f4b2fc8d2ce033f7d72ecb432b171c729","target":"graph","created_at":"2026-07-05T09:27:15Z","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/2410.21066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vehicle Routing Problems (VRPs) can model many real-world scenarios and often involve complex constraints. While recent neural methods excel in constructing solutions based on feasibility masking, they struggle with handling complex constraints, especially when obtaining the masking itself is NP-hard. In this paper, we propose a novel Proactive Infeasibility Prevention (PIP) framework to advance the capabilities of neural methods towards more complex VRPs. Our PIP integrates the Lagrangian multiplier as a basis to enhance constraint awareness and introduces preventative infeasibility masking t","authors_text":"Jianan Zhou, Jieyi Bi, Jie Zhang, Wen Song, Yaoxin Wu, Yining Ma, Zhiguang Cao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-28T14:26:54Z","title":"Learning to Handle Complex Constraints for Vehicle Routing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21066","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:fad8bea0f9d25194779f357c21cb6777e82669d70302e3d958610b88374162db","target":"record","created_at":"2026-07-05T09:27:15Z","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":"2de85690fa10fbd0d76ec9f7961252e380c9148997c92ca1d2371f5ded8c7cb1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-10-28T14:26:54Z","title_canon_sha256":"9c19b95f9b4ad7fe5389a05762a3739f0d517b9886b514a3b7c753d12ca00840"},"schema_version":"1.0","source":{"id":"2410.21066","kind":"arxiv","version":1}},"canonical_sha256":"8b1825ab6b151a8b35b493eba4682e84e9a2342a2913d88fc90714eaf505f311","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b1825ab6b151a8b35b493eba4682e84e9a2342a2913d88fc90714eaf505f311","first_computed_at":"2026-07-05T09:27:15.077651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:27:15.077651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eXwtUkauug4GtcYCKinIYmefWdNyC1bmpOMLDPGZBq2Bnx/HHc2mkYlSq8X21DMFWFo71Xn7n8a1lK8IXxuRAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:27:15.078109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.21066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad8bea0f9d25194779f357c21cb6777e82669d70302e3d958610b88374162db","sha256:1f2e82a0b822a97b1810e0f2aed7f75f4b2fc8d2ce033f7d72ecb432b171c729"],"state_sha256":"216d86ccc7dc1b93f2e75920343cb923029a147974d6ce94682d2e7835c74f7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVLIJZ430BnNi441l/looVxk/3gYx28ExyBFC+hMYuksfir+6coe513ZkOvcjXB35GKdd9PYKejXy0D2AogsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:50:56.941262Z","bundle_sha256":"8f82d2440373ba5278c2f26d9427e7345fd3992da64bc23201a43029507b7e29"}}