{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JKNHCEOCZLH6QNJO5GBDRP7HVS","short_pith_number":"pith:JKNHCEOC","schema_version":"1.0","canonical_sha256":"4a9a7111c2cacfe8352ee98238bfe7ac8a2129e345ff422260161c5c5c4f0e53","source":{"kind":"arxiv","id":"1207.2799","version":1},"attestation_state":"computed","paper":{"title":"Optimal recovery of damaged infrastructure network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Alexander Gutfraind, Milan Bradonji\\'c, Tim Novikoff","submitted_at":"2012-07-11T21:53:19Z","abstract_excerpt":"Natural disasters or attacks may disrupt infrastructure networks on a vast scale. Parts of the damaged network are interdependent, making it difficult to plan and optimally execute the recovery operations. To study how interdependencies affect the recovery schedule, we introduce a new discrete optimization problem where the goal is to minimize the total cost of installing (or recovering) a given network. This cost is determined by the structure of the network and the sequence in which the nodes are installed. Namely, the cost of installing a node is a function of the number of its neighbors th"},"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":"1207.2799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-11T21:53:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"74df567e2036459c750cdea4bd7f80bab37011e6ed4d48330320b4190853e21a","abstract_canon_sha256":"aaf56265cdc44ae29fb6d43e81a2b7ff0bb9b07fbee5db55bb8acf6870b23158"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:13.706074Z","signature_b64":"RIsbR6WV332DaJa0D+6ytjOMpm7CRLQBlAp2q5gzxfd1tWewfD2DQ2e1Wr0SCXyfuI2UUK26QRliT5Sj2ueVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a9a7111c2cacfe8352ee98238bfe7ac8a2129e345ff422260161c5c5c4f0e53","last_reissued_at":"2026-05-18T03:51:13.705625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:13.705625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal recovery of damaged infrastructure network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Alexander Gutfraind, Milan Bradonji\\'c, Tim Novikoff","submitted_at":"2012-07-11T21:53:19Z","abstract_excerpt":"Natural disasters or attacks may disrupt infrastructure networks on a vast scale. Parts of the damaged network are interdependent, making it difficult to plan and optimally execute the recovery operations. To study how interdependencies affect the recovery schedule, we introduce a new discrete optimization problem where the goal is to minimize the total cost of installing (or recovering) a given network. This cost is determined by the structure of the network and the sequence in which the nodes are installed. Namely, the cost of installing a node is a function of the number of its neighbors th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2799","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":""},"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":"1207.2799","created_at":"2026-05-18T03:51:13.705691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2799v1","created_at":"2026-05-18T03:51:13.705691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2799","created_at":"2026-05-18T03:51:13.705691+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKNHCEOCZLH6","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKNHCEOCZLH6QNJO","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKNHCEOC","created_at":"2026-05-18T12:27:11.947152+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/JKNHCEOCZLH6QNJO5GBDRP7HVS","json":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS.json","graph_json":"https://pith.science/api/pith-number/JKNHCEOCZLH6QNJO5GBDRP7HVS/graph.json","events_json":"https://pith.science/api/pith-number/JKNHCEOCZLH6QNJO5GBDRP7HVS/events.json","paper":"https://pith.science/paper/JKNHCEOC"},"agent_actions":{"view_html":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS","download_json":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS.json","view_paper":"https://pith.science/paper/JKNHCEOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2799&json=true","fetch_graph":"https://pith.science/api/pith-number/JKNHCEOCZLH6QNJO5GBDRP7HVS/graph.json","fetch_events":"https://pith.science/api/pith-number/JKNHCEOCZLH6QNJO5GBDRP7HVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS/action/storage_attestation","attest_author":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS/action/author_attestation","sign_citation":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS/action/citation_signature","submit_replication":"https://pith.science/pith/JKNHCEOCZLH6QNJO5GBDRP7HVS/action/replication_record"}},"created_at":"2026-05-18T03:51:13.705691+00:00","updated_at":"2026-05-18T03:51:13.705691+00:00"}