{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P5B7L6C5BVCU255GIY5UPSUM2S","short_pith_number":"pith:P5B7L6C5","schema_version":"1.0","canonical_sha256":"7f43f5f85d0d454d77a6463b47ca8cd495fea498f428985b436b8a8434a4172c","source":{"kind":"arxiv","id":"2412.08287","version":1},"attestation_state":"computed","paper":{"title":"DistrictNet: Decision-aware learning for geographical districting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexandre Forel, Axel Parmentier, Cheikh Ahmed, Thibaut Vidal","submitted_at":"2024-12-11T11:02:48Z","abstract_excerpt":"Districting is a complex combinatorial problem that consists in partitioning a geographical area into small districts. In logistics, it is a major strategic decision determining operating costs for several years. Solving districting problems using traditional methods is intractable even for small geographical areas and existing heuristics often provide sub-optimal results. We present a structured learning approach to find high-quality solutions to real-world districting problems in a few minutes. It is based on integrating a combinatorial optimization layer, the capacitated minimum spanning tr"},"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":"2412.08287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-11T11:02:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"70353b6a5956ea7dcb3ad85ef24234a3bb07486102c1eb11631db33f86ba89bf","abstract_canon_sha256":"4cb7f77dff3f412c48f83ddab9daa5b2b1fcfa168f1d583127815e80997d3121"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:47.746604Z","signature_b64":"taxmR9jgAoKTxP0OPwgXRDYGL2NdjLd7Q/KtgzuSVZ5+fJCb//aYzEeAYUqxdCztT0+0Hqm1thNEEIVENhqADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f43f5f85d0d454d77a6463b47ca8cd495fea498f428985b436b8a8434a4172c","last_reissued_at":"2026-07-05T09:47:47.746141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:47.746141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DistrictNet: Decision-aware learning for geographical districting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexandre Forel, Axel Parmentier, Cheikh Ahmed, Thibaut Vidal","submitted_at":"2024-12-11T11:02:48Z","abstract_excerpt":"Districting is a complex combinatorial problem that consists in partitioning a geographical area into small districts. In logistics, it is a major strategic decision determining operating costs for several years. Solving districting problems using traditional methods is intractable even for small geographical areas and existing heuristics often provide sub-optimal results. We present a structured learning approach to find high-quality solutions to real-world districting problems in a few minutes. It is based on integrating a combinatorial optimization layer, the capacitated minimum spanning tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08287","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/2412.08287/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":"2412.08287","created_at":"2026-07-05T09:47:47.746197+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08287v1","created_at":"2026-07-05T09:47:47.746197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08287","created_at":"2026-07-05T09:47:47.746197+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5B7L6C5BVCU","created_at":"2026-07-05T09:47:47.746197+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5B7L6C5BVCU255G","created_at":"2026-07-05T09:47:47.746197+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5B7L6C5","created_at":"2026-07-05T09:47:47.746197+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S","json":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S.json","graph_json":"https://pith.science/api/pith-number/P5B7L6C5BVCU255GIY5UPSUM2S/graph.json","events_json":"https://pith.science/api/pith-number/P5B7L6C5BVCU255GIY5UPSUM2S/events.json","paper":"https://pith.science/paper/P5B7L6C5"},"agent_actions":{"view_html":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S","download_json":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S.json","view_paper":"https://pith.science/paper/P5B7L6C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08287&json=true","fetch_graph":"https://pith.science/api/pith-number/P5B7L6C5BVCU255GIY5UPSUM2S/graph.json","fetch_events":"https://pith.science/api/pith-number/P5B7L6C5BVCU255GIY5UPSUM2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/action/storage_attestation","attest_author":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/action/author_attestation","sign_citation":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/action/citation_signature","submit_replication":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/action/replication_record"}},"created_at":"2026-07-05T09:47:47.746197+00:00","updated_at":"2026-07-05T09:47:47.746197+00:00"}