{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RMMCLK3LCUNIWNNUSPV2I2BOQT","short_pith_number":"pith:RMMCLK3L","schema_version":"1.0","canonical_sha256":"8b1825ab6b151a8b35b493eba4682e84e9a2342a2913d88fc90714eaf505f311","source":{"kind":"arxiv","id":"2410.21066","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.21066","created_at":"2026-07-05T09:27:15.077711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21066v1","created_at":"2026-07-05T09:27:15.077711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21066","created_at":"2026-07-05T09:27:15.077711+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMMCLK3LCUNI","created_at":"2026-07-05T09:27:15.077711+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMMCLK3LCUNIWNNU","created_at":"2026-07-05T09:27:15.077711+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMMCLK3L","created_at":"2026-07-05T09:27:15.077711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02977","citing_title":"CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT","json":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT.json","graph_json":"https://pith.science/api/pith-number/RMMCLK3LCUNIWNNUSPV2I2BOQT/graph.json","events_json":"https://pith.science/api/pith-number/RMMCLK3LCUNIWNNUSPV2I2BOQT/events.json","paper":"https://pith.science/paper/RMMCLK3L"},"agent_actions":{"view_html":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT","download_json":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT.json","view_paper":"https://pith.science/paper/RMMCLK3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21066&json=true","fetch_graph":"https://pith.science/api/pith-number/RMMCLK3LCUNIWNNUSPV2I2BOQT/graph.json","fetch_events":"https://pith.science/api/pith-number/RMMCLK3LCUNIWNNUSPV2I2BOQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/action/storage_attestation","attest_author":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/action/author_attestation","sign_citation":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/action/citation_signature","submit_replication":"https://pith.science/pith/RMMCLK3LCUNIWNNUSPV2I2BOQT/action/replication_record"}},"created_at":"2026-07-05T09:27:15.077711+00:00","updated_at":"2026-07-05T09:27:15.077711+00:00"}