{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NIM65H4U2K7NSDLSOBAG6QS3IX","short_pith_number":"pith:NIM65H4U","schema_version":"1.0","canonical_sha256":"6a19ee9f94d2bed90d7270406f425b45f6775ce5b1c4f9198655acdfe5ca51d7","source":{"kind":"arxiv","id":"2506.19703","version":2},"attestation_state":"computed","paper":{"title":"Learning-aided Bigraph Matching Approach to Multi-Crew Restoration of Damaged Power Networks Coupled with Road Transportation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Harshal Kaushik, Jie Zhang, Nathan Maurer, Roshni Anna Jacob, Souma Chowdhury","submitted_at":"2025-06-24T15:12:45Z","abstract_excerpt":"The resilience of critical infrastructure networks (CINs) after disruptions, such as those caused by natural hazards, depends on both the speed of restoration and the extent to which operational functionality can be regained. Allocating resources for restoration is a combinatorial optimal planning problem that involves determining which crews will repair specific network nodes and in what order. This paper presents a novel graph-based formulation that merges two interconnected graphs, representing crew and transportation nodes and power grid nodes, into a single heterogeneous graph. To enable "},"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":"2506.19703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-24T15:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"a9463ac36084bcad40b263916dff73f1887fec7f689c23aa090216834acc248a","abstract_canon_sha256":"f7b0f525d3c7a5da2b56a595b694b8036fbcec018fd47b94b8f34ec5fb075624"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:35.742569Z","signature_b64":"/wdMGjCZrQN6Suk/owxTyJMKqSD2Tk2fQ1dnLlyqSRJ+EyUke8nEvrWFKj/GyJRGTU/V8KBSi6S8LndTyHHqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a19ee9f94d2bed90d7270406f425b45f6775ce5b1c4f9198655acdfe5ca51d7","last_reissued_at":"2026-07-05T11:35:35.742127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:35.742127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-aided Bigraph Matching Approach to Multi-Crew Restoration of Damaged Power Networks Coupled with Road Transportation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Harshal Kaushik, Jie Zhang, Nathan Maurer, Roshni Anna Jacob, Souma Chowdhury","submitted_at":"2025-06-24T15:12:45Z","abstract_excerpt":"The resilience of critical infrastructure networks (CINs) after disruptions, such as those caused by natural hazards, depends on both the speed of restoration and the extent to which operational functionality can be regained. Allocating resources for restoration is a combinatorial optimal planning problem that involves determining which crews will repair specific network nodes and in what order. This paper presents a novel graph-based formulation that merges two interconnected graphs, representing crew and transportation nodes and power grid nodes, into a single heterogeneous graph. To enable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19703","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/2506.19703/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":"2506.19703","created_at":"2026-07-05T11:35:35.742180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19703v2","created_at":"2026-07-05T11:35:35.742180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19703","created_at":"2026-07-05T11:35:35.742180+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIM65H4U2K7N","created_at":"2026-07-05T11:35:35.742180+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIM65H4U2K7NSDLS","created_at":"2026-07-05T11:35:35.742180+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIM65H4U","created_at":"2026-07-05T11:35:35.742180+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/NIM65H4U2K7NSDLSOBAG6QS3IX","json":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX.json","graph_json":"https://pith.science/api/pith-number/NIM65H4U2K7NSDLSOBAG6QS3IX/graph.json","events_json":"https://pith.science/api/pith-number/NIM65H4U2K7NSDLSOBAG6QS3IX/events.json","paper":"https://pith.science/paper/NIM65H4U"},"agent_actions":{"view_html":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX","download_json":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX.json","view_paper":"https://pith.science/paper/NIM65H4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19703&json=true","fetch_graph":"https://pith.science/api/pith-number/NIM65H4U2K7NSDLSOBAG6QS3IX/graph.json","fetch_events":"https://pith.science/api/pith-number/NIM65H4U2K7NSDLSOBAG6QS3IX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX/action/storage_attestation","attest_author":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX/action/author_attestation","sign_citation":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX/action/citation_signature","submit_replication":"https://pith.science/pith/NIM65H4U2K7NSDLSOBAG6QS3IX/action/replication_record"}},"created_at":"2026-07-05T11:35:35.742180+00:00","updated_at":"2026-07-05T11:35:35.742180+00:00"}