{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HLX5GEIUU7FVVKQCBZKQLSZEEZ","short_pith_number":"pith:HLX5GEIU","schema_version":"1.0","canonical_sha256":"3aefd31114a7cb5aaa020e5505cb242642a35fe6b60f261ddb16093bea3c84ee","source":{"kind":"arxiv","id":"2404.03197","version":3},"attestation_state":"computed","paper":{"title":"Formulating the Restoration of Distribution Networks as a Multiple Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Arindam K. Das, Daniel S. Kirschen, Payman Arabshahi, Ran Wei","submitted_at":"2024-04-04T04:57:55Z","abstract_excerpt":"Severe weather events can cause extensive damage to electrical distribution networks, requiring a multi-day restoration effort. Optimizing the dispatch of repair crews minimizes the severe socio-economic consequences of such events. Considering both repair times and travel times, we use graphical manipulations to transform this multiple crew scheduling problem into a type of traveling salesman problem(TSP). Specifically, we demonstrate that the restoration problem bears major resemblance to an instance of a cost constrained reward maximizing mTSP (multiple TSP) on node and edge weighted (doubl"},"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":"2404.03197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-04-04T04:57:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1302282013832e0f8aa6b19fef02900541272b85579f4f55940ecea6bfef4187","abstract_canon_sha256":"b9f5df183d7dd6b88764ed697e793a04313332d9fc2604af2715c8e5c06f214d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:57.809852Z","signature_b64":"n2y5f34AjDWDJGE4GbYQzt4CyKEZgV/i2ObslvRqnU0LcPbdEgH3Gpp8J9P6LXAdZDCm0bJCgPgU13dF34L1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aefd31114a7cb5aaa020e5505cb242642a35fe6b60f261ddb16093bea3c84ee","last_reissued_at":"2026-07-05T10:59:57.809380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:57.809380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formulating the Restoration of Distribution Networks as a Multiple Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Arindam K. Das, Daniel S. Kirschen, Payman Arabshahi, Ran Wei","submitted_at":"2024-04-04T04:57:55Z","abstract_excerpt":"Severe weather events can cause extensive damage to electrical distribution networks, requiring a multi-day restoration effort. Optimizing the dispatch of repair crews minimizes the severe socio-economic consequences of such events. Considering both repair times and travel times, we use graphical manipulations to transform this multiple crew scheduling problem into a type of traveling salesman problem(TSP). Specifically, we demonstrate that the restoration problem bears major resemblance to an instance of a cost constrained reward maximizing mTSP (multiple TSP) on node and edge weighted (doubl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03197","kind":"arxiv","version":3},"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/2404.03197/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":"2404.03197","created_at":"2026-07-05T10:59:57.809438+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03197v3","created_at":"2026-07-05T10:59:57.809438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03197","created_at":"2026-07-05T10:59:57.809438+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLX5GEIUU7FV","created_at":"2026-07-05T10:59:57.809438+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLX5GEIUU7FVVKQC","created_at":"2026-07-05T10:59:57.809438+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLX5GEIU","created_at":"2026-07-05T10:59:57.809438+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/HLX5GEIUU7FVVKQCBZKQLSZEEZ","json":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ.json","graph_json":"https://pith.science/api/pith-number/HLX5GEIUU7FVVKQCBZKQLSZEEZ/graph.json","events_json":"https://pith.science/api/pith-number/HLX5GEIUU7FVVKQCBZKQLSZEEZ/events.json","paper":"https://pith.science/paper/HLX5GEIU"},"agent_actions":{"view_html":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ","download_json":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ.json","view_paper":"https://pith.science/paper/HLX5GEIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03197&json=true","fetch_graph":"https://pith.science/api/pith-number/HLX5GEIUU7FVVKQCBZKQLSZEEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HLX5GEIUU7FVVKQCBZKQLSZEEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ/action/storage_attestation","attest_author":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ/action/author_attestation","sign_citation":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ/action/citation_signature","submit_replication":"https://pith.science/pith/HLX5GEIUU7FVVKQCBZKQLSZEEZ/action/replication_record"}},"created_at":"2026-07-05T10:59:57.809438+00:00","updated_at":"2026-07-05T10:59:57.809438+00:00"}