{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WK5WD3SNEUS2N6WYIOCAMNJOXV","short_pith_number":"pith:WK5WD3SN","schema_version":"1.0","canonical_sha256":"b2bb61ee4d2525a6fad8438406352ebd77f02f122bffaba2c306a7c25d3da903","source":{"kind":"arxiv","id":"2511.02525","version":2},"attestation_state":"computed","paper":{"title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Changhao Miao, Chen Chen, Fang Deng, Tongyu Wu, Yuntian Zhang","submitted_at":"2025-11-04T12:23:17Z","abstract_excerpt":"The capacitated location-routing problems (CLRPs) are classical problems in combinatorial optimization, which require simultaneously making location and routing decisions. In CLRPs, the complex constraints and the intricate relationships between various decisions make the problem challenging to solve. With the emergence of deep reinforcement learning (DRL), it has been extensively applied to address the vehicle routing problem and its variants, while the research related to CLRPs still needs to be explored. In this paper, we propose the DRL with heterogeneous query (DRLHQ) to solve CLRP and op"},"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":"2511.02525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-04T12:23:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a1109c6adb73422fe49c63fdb735d34d5ae900594ec76ce74fe04e5909c57498","abstract_canon_sha256":"0596a7143088ef525764f8061b2f72fcccbd94d8dd0618a9082f666809bfb303"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:39.574948Z","signature_b64":"8XUsZ5Os1godEU9m3ltjmAopLX1xKBlU3wubpX/LiXEwXvby1kZHFIl6CZwghiAzaE3zwAQqMEmRZZC5KI+xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2bb61ee4d2525a6fad8438406352ebd77f02f122bffaba2c306a7c25d3da903","last_reissued_at":"2026-05-27T01:05:39.574451Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:39.574451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Changhao Miao, Chen Chen, Fang Deng, Tongyu Wu, Yuntian Zhang","submitted_at":"2025-11-04T12:23:17Z","abstract_excerpt":"The capacitated location-routing problems (CLRPs) are classical problems in combinatorial optimization, which require simultaneously making location and routing decisions. In CLRPs, the complex constraints and the intricate relationships between various decisions make the problem challenging to solve. With the emergence of deep reinforcement learning (DRL), it has been extensively applied to address the vehicle routing problem and its variants, while the research related to CLRPs still needs to be explored. In this paper, we propose the DRL with heterogeneous query (DRLHQ) to solve CLRP and op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.02525","kind":"arxiv","version":2},"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/2511.02525/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":"2511.02525","created_at":"2026-05-27T01:05:39.574506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.02525v2","created_at":"2026-05-27T01:05:39.574506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02525","created_at":"2026-05-27T01:05:39.574506+00:00"},{"alias_kind":"pith_short_12","alias_value":"WK5WD3SNEUS2","created_at":"2026-05-27T01:05:39.574506+00:00"},{"alias_kind":"pith_short_16","alias_value":"WK5WD3SNEUS2N6WY","created_at":"2026-05-27T01:05:39.574506+00:00"},{"alias_kind":"pith_short_8","alias_value":"WK5WD3SN","created_at":"2026-05-27T01:05:39.574506+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.26776","citing_title":"Towards Generalization-Oriented Models for Vehicle Routing Problems with Mixture-of-Experts","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26763","citing_title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV","json":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV.json","graph_json":"https://pith.science/api/pith-number/WK5WD3SNEUS2N6WYIOCAMNJOXV/graph.json","events_json":"https://pith.science/api/pith-number/WK5WD3SNEUS2N6WYIOCAMNJOXV/events.json","paper":"https://pith.science/paper/WK5WD3SN"},"agent_actions":{"view_html":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV","download_json":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV.json","view_paper":"https://pith.science/paper/WK5WD3SN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.02525&json=true","fetch_graph":"https://pith.science/api/pith-number/WK5WD3SNEUS2N6WYIOCAMNJOXV/graph.json","fetch_events":"https://pith.science/api/pith-number/WK5WD3SNEUS2N6WYIOCAMNJOXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV/action/storage_attestation","attest_author":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV/action/author_attestation","sign_citation":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV/action/citation_signature","submit_replication":"https://pith.science/pith/WK5WD3SNEUS2N6WYIOCAMNJOXV/action/replication_record"}},"created_at":"2026-05-27T01:05:39.574506+00:00","updated_at":"2026-05-27T01:05:39.574506+00:00"}