{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IKK3UMHJKAG5BU7JX45UY3QHLH","short_pith_number":"pith:IKK3UMHJ","schema_version":"1.0","canonical_sha256":"4295ba30e9500dd0d3e9bf3b4c6e0759d0d6b1b4f1a5d068d9addc9969324c30","source":{"kind":"arxiv","id":"1904.03587","version":1},"attestation_state":"computed","paper":{"title":"Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.DC","authors_text":"Guangyi Liu, Lingpeng Shi, Renchang Dai, Yongli Zhu","submitted_at":"2019-04-07T05:37:03Z","abstract_excerpt":"In this study, a graph-computing based grid splitting detection algorithm is proposed for contingency analysis in a graph-based EMS (Energy Management System). The graph model of a power system is established by storing its bus-branch information into the corresponding vertex objects and edge objects of the graph database. Numerical comparison to an up-to-date serial computing algorithm is also investigated. Online tests on a real power system of China State Grid with 2752 buses and 3290 branches show that a 6 times speedup can be achieved, which lays a good foundation for advanced contingency"},"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":"1904.03587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-07T05:37:03Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"8cc188a894f6560c1baedec63f463e976a6101f04e95ac75c0f4a89fc30cbbc3","abstract_canon_sha256":"b753a23769ce06f322d113c131fa368de98e8a286cb53d9e0eddebd93d787ae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:12.891076Z","signature_b64":"7MeMHL9U8nIpk4qHk903aX1L9+UJ5d8iLCIzhLNtqbTHRV6W3rl3xuRhZU+6WuQQ4ZMGgP0ETEfdTJqzxO2WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4295ba30e9500dd0d3e9bf3b4c6e0759d0d6b1b4f1a5d068d9addc9969324c30","last_reissued_at":"2026-05-17T23:49:12.890374Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:12.890374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.DC","authors_text":"Guangyi Liu, Lingpeng Shi, Renchang Dai, Yongli Zhu","submitted_at":"2019-04-07T05:37:03Z","abstract_excerpt":"In this study, a graph-computing based grid splitting detection algorithm is proposed for contingency analysis in a graph-based EMS (Energy Management System). The graph model of a power system is established by storing its bus-branch information into the corresponding vertex objects and edge objects of the graph database. Numerical comparison to an up-to-date serial computing algorithm is also investigated. Online tests on a real power system of China State Grid with 2752 buses and 3290 branches show that a 6 times speedup can be achieved, which lays a good foundation for advanced contingency"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03587","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":"1904.03587","created_at":"2026-05-17T23:49:12.890496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03587v1","created_at":"2026-05-17T23:49:12.890496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03587","created_at":"2026-05-17T23:49:12.890496+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKK3UMHJKAG5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKK3UMHJKAG5BU7J","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKK3UMHJ","created_at":"2026-05-18T12:33:18.533446+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/IKK3UMHJKAG5BU7JX45UY3QHLH","json":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH.json","graph_json":"https://pith.science/api/pith-number/IKK3UMHJKAG5BU7JX45UY3QHLH/graph.json","events_json":"https://pith.science/api/pith-number/IKK3UMHJKAG5BU7JX45UY3QHLH/events.json","paper":"https://pith.science/paper/IKK3UMHJ"},"agent_actions":{"view_html":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH","download_json":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH.json","view_paper":"https://pith.science/paper/IKK3UMHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03587&json=true","fetch_graph":"https://pith.science/api/pith-number/IKK3UMHJKAG5BU7JX45UY3QHLH/graph.json","fetch_events":"https://pith.science/api/pith-number/IKK3UMHJKAG5BU7JX45UY3QHLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH/action/storage_attestation","attest_author":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH/action/author_attestation","sign_citation":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH/action/citation_signature","submit_replication":"https://pith.science/pith/IKK3UMHJKAG5BU7JX45UY3QHLH/action/replication_record"}},"created_at":"2026-05-17T23:49:12.890496+00:00","updated_at":"2026-05-17T23:49:12.890496+00:00"}