{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WUPJ447NFDGSQ57WXMZF5I5OSD","short_pith_number":"pith:WUPJ447N","schema_version":"1.0","canonical_sha256":"b51e9e73ed28cd2877f6bb325ea3ae90e15b81663a70630dcd0097e701fd0acd","source":{"kind":"arxiv","id":"1804.01351","version":1},"attestation_state":"computed","paper":{"title":"Attack vulnerability of power systems under an equal load redistribution model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"physics.soc-ph","authors_text":"Osman Yagan, Talha Cihad Gulcu, Vaggos Chatziafratis, Yingrui Zhang","submitted_at":"2018-04-04T11:44:01Z","abstract_excerpt":"This paper studies the vulnerability of flow networks against adversarial attacks. In particular, consider a power system (or, any system carrying a physical flow) consisting of $N$ transmission lines with initial loads $L_1, \\ldots , L_N$ and capacities $C_1, \\ldots, C_N$, respectively; the capacity $C_i$ defines the maximum flow allowed on line $i$. Under an equal load redistribution model, where load of failed lines is redistributed equally among all remaining lines, we study the {\\em optimization} problem of finding the best $k$ lines to attack so as to minimize the number of {\\em alive} l"},"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":"1804.01351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-04-04T11:44:01Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"148f48cabfde16408a5f928ac0eb2c38bbf6185da9bb1cc796569e33a8c7f1bb","abstract_canon_sha256":"a44a499ccc21dbdefe5fc041091eed04fd2e6347b48cee23b6125cdd01a7ff26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:15.318148Z","signature_b64":"P0ExxH4Qd+5J2DKuAh5uccboAijtkKwHEc9WG+FAC1/Oje4QwQ7RAVKR2f6NqfuAum0yHXrUNv5LHNLfUAbsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b51e9e73ed28cd2877f6bb325ea3ae90e15b81663a70630dcd0097e701fd0acd","last_reissued_at":"2026-05-18T00:19:15.317401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:15.317401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attack vulnerability of power systems under an equal load redistribution model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"physics.soc-ph","authors_text":"Osman Yagan, Talha Cihad Gulcu, Vaggos Chatziafratis, Yingrui Zhang","submitted_at":"2018-04-04T11:44:01Z","abstract_excerpt":"This paper studies the vulnerability of flow networks against adversarial attacks. In particular, consider a power system (or, any system carrying a physical flow) consisting of $N$ transmission lines with initial loads $L_1, \\ldots , L_N$ and capacities $C_1, \\ldots, C_N$, respectively; the capacity $C_i$ defines the maximum flow allowed on line $i$. Under an equal load redistribution model, where load of failed lines is redistributed equally among all remaining lines, we study the {\\em optimization} problem of finding the best $k$ lines to attack so as to minimize the number of {\\em alive} l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01351","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":"1804.01351","created_at":"2026-05-18T00:19:15.317510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01351v1","created_at":"2026-05-18T00:19:15.317510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01351","created_at":"2026-05-18T00:19:15.317510+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUPJ447NFDGS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUPJ447NFDGSQ57W","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUPJ447N","created_at":"2026-05-18T12:33:01.666342+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/WUPJ447NFDGSQ57WXMZF5I5OSD","json":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD.json","graph_json":"https://pith.science/api/pith-number/WUPJ447NFDGSQ57WXMZF5I5OSD/graph.json","events_json":"https://pith.science/api/pith-number/WUPJ447NFDGSQ57WXMZF5I5OSD/events.json","paper":"https://pith.science/paper/WUPJ447N"},"agent_actions":{"view_html":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD","download_json":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD.json","view_paper":"https://pith.science/paper/WUPJ447N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01351&json=true","fetch_graph":"https://pith.science/api/pith-number/WUPJ447NFDGSQ57WXMZF5I5OSD/graph.json","fetch_events":"https://pith.science/api/pith-number/WUPJ447NFDGSQ57WXMZF5I5OSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD/action/storage_attestation","attest_author":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD/action/author_attestation","sign_citation":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD/action/citation_signature","submit_replication":"https://pith.science/pith/WUPJ447NFDGSQ57WXMZF5I5OSD/action/replication_record"}},"created_at":"2026-05-18T00:19:15.317510+00:00","updated_at":"2026-05-18T00:19:15.317510+00:00"}