{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:P5B7L6C5BVCU255GIY5UPSUM2S","short_pith_number":"pith:P5B7L6C5","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"},"canonical_sha256":"7f43f5f85d0d454d77a6463b47ca8cd495fea498f428985b436b8a8434a4172c","source":{"kind":"arxiv","id":"2412.08287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08287","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08287v1","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08287","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"pith_short_12","alias_value":"P5B7L6C5BVCU","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"pith_short_16","alias_value":"P5B7L6C5BVCU255G","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"pith_short_8","alias_value":"P5B7L6C5","created_at":"2026-07-05T09:47:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:P5B7L6C5BVCU255GIY5UPSUM2S","target":"record","payload":{"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"},"canonical_sha256":"7f43f5f85d0d454d77a6463b47ca8cd495fea498f428985b436b8a8434a4172c","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"},"source_kind":"arxiv","source_id":"2412.08287","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:47:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qtN46PmieqekTgwKrxrTd2+XT+StsiRbjmXQ4NeH5nWRPCkcyYcbdo/rcIESZzD1U/ZL5a4OWE5i0tTBkwwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:02:21.368035Z"},"content_sha256":"f8011a8af57399891abbd50fcccd27dfcd50d4f7ecccda29edd96cd2badc5646","schema_version":"1.0","event_id":"sha256:f8011a8af57399891abbd50fcccd27dfcd50d4f7ecccda29edd96cd2badc5646"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:P5B7L6C5BVCU255GIY5UPSUM2S","target":"graph","payload":{"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"},"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:47:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lUCLw16pbTeoJSOHS9wIXLU0viPPhmfBqRJ9mpbP50r2NschKDKqBikbrfOsMVSp4TnuZNy9OAuKQOIbodVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:02:21.368590Z"},"content_sha256":"35a568833b7c97a0addb8f9da7fda94da6f12522d961f93cb579c0796ae6a0fd","schema_version":"1.0","event_id":"sha256:35a568833b7c97a0addb8f9da7fda94da6f12522d961f93cb579c0796ae6a0fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/bundle.json","state_url":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5B7L6C5BVCU255GIY5UPSUM2S/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-12T14:02:21Z","links":{"resolver":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S","bundle":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/bundle.json","state":"https://pith.science/pith/P5B7L6C5BVCU255GIY5UPSUM2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5B7L6C5BVCU255GIY5UPSUM2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:P5B7L6C5BVCU255GIY5UPSUM2S","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":"4cb7f77dff3f412c48f83ddab9daa5b2b1fcfa168f1d583127815e80997d3121","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-11T11:02:48Z","title_canon_sha256":"70353b6a5956ea7dcb3ad85ef24234a3bb07486102c1eb11631db33f86ba89bf"},"schema_version":"1.0","source":{"id":"2412.08287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08287","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08287v1","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08287","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"pith_short_12","alias_value":"P5B7L6C5BVCU","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"pith_short_16","alias_value":"P5B7L6C5BVCU255G","created_at":"2026-07-05T09:47:47Z"},{"alias_kind":"pith_short_8","alias_value":"P5B7L6C5","created_at":"2026-07-05T09:47:47Z"}],"graph_snapshots":[{"event_id":"sha256:35a568833b7c97a0addb8f9da7fda94da6f12522d961f93cb579c0796ae6a0fd","target":"graph","created_at":"2026-07-05T09:47:47Z","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/2412.08287/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexandre Forel, Axel Parmentier, Cheikh Ahmed, Thibaut Vidal","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-11T11:02:48Z","title":"DistrictNet: Decision-aware learning for geographical districting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08287","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:f8011a8af57399891abbd50fcccd27dfcd50d4f7ecccda29edd96cd2badc5646","target":"record","created_at":"2026-07-05T09:47:47Z","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":"4cb7f77dff3f412c48f83ddab9daa5b2b1fcfa168f1d583127815e80997d3121","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-11T11:02:48Z","title_canon_sha256":"70353b6a5956ea7dcb3ad85ef24234a3bb07486102c1eb11631db33f86ba89bf"},"schema_version":"1.0","source":{"id":"2412.08287","kind":"arxiv","version":1}},"canonical_sha256":"7f43f5f85d0d454d77a6463b47ca8cd495fea498f428985b436b8a8434a4172c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f43f5f85d0d454d77a6463b47ca8cd495fea498f428985b436b8a8434a4172c","first_computed_at":"2026-07-05T09:47:47.746141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:47.746141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"taxmR9jgAoKTxP0OPwgXRDYGL2NdjLd7Q/KtgzuSVZ5+fJCb//aYzEeAYUqxdCztT0+0Hqm1thNEEIVENhqADA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:47.746604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.08287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8011a8af57399891abbd50fcccd27dfcd50d4f7ecccda29edd96cd2badc5646","sha256:35a568833b7c97a0addb8f9da7fda94da6f12522d961f93cb579c0796ae6a0fd"],"state_sha256":"528b5cb01dd56ccc60a4d12dacb8f4231fa5fe477d4c2107d1772b1f465f0d02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dVT7qJHoe4kTuImvCs+XAbbV2Xb1QOOPn8jjRaLyu7MidZhV6NxpHJ8PexQbVeLG4+EFPgMrNqsIwgCF0BbSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T14:02:21.377981Z","bundle_sha256":"1d0c49164700db9dbcb350b1d5d987a48dc46e657a2ebb2d41ab2d496bfd23fd"}}