{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KATXBMTRHGA7QRAQNEEO6WFCPS","short_pith_number":"pith:KATXBMTR","canonical_record":{"source":{"id":"1211.0728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-04T22:37:37Z","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"title_canon_sha256":"91d872550df897aeb998d38466ee08ae7996114e2aac1923097519031375d2ab","abstract_canon_sha256":"6935f2eb6a44af882f238aa08f761f09a4a86bd37d7e5375cebccc852d5c82a4"},"schema_version":"1.0"},"canonical_sha256":"502770b2713981f844106908ef58a27ca6cd4bef3a81eafebf67fde9a883ffb6","source":{"kind":"arxiv","id":"1211.0728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0728","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0728v1","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0728","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"KATXBMTRHGA7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KATXBMTRHGA7QRAQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KATXBMTR","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KATXBMTRHGA7QRAQNEEO6WFCPS","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0728","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-04T22:37:37Z","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"title_canon_sha256":"91d872550df897aeb998d38466ee08ae7996114e2aac1923097519031375d2ab","abstract_canon_sha256":"6935f2eb6a44af882f238aa08f761f09a4a86bd37d7e5375cebccc852d5c82a4"},"schema_version":"1.0"},"canonical_sha256":"502770b2713981f844106908ef58a27ca6cd4bef3a81eafebf67fde9a883ffb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:31.714164Z","signature_b64":"cjoYYbhoNMOVu1pcR70WugJi/hsv+RkFAuKy+z6M23FauCo+n9g3bI8mvi3VdRW+xvjbt2edATm6z4Tmbr4CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502770b2713981f844106908ef58a27ca6cd4bef3a81eafebf67fde9a883ffb6","last_reissued_at":"2026-05-18T03:41:31.713725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:31.713725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0728","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyVKlyHNfPTVXivmBSDPQJ4NceJXggjULcgWq0zcv9tgUlOMuSmGQBLe8sWcDDjHcGiUNu5rDkIWgKJ7yzxZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:30:19.021685Z"},"content_sha256":"fa2768aa3c91bf69d3b74c82c60690eede44514756c6fdc5114637de647a00b0","schema_version":"1.0","event_id":"sha256:fa2768aa3c91bf69d3b74c82c60690eede44514756c6fdc5114637de647a00b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KATXBMTRHGA7QRAQNEEO6WFCPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Algorithm for N-2 Contingency Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math-ph","math.MP"],"primary_cat":"physics.soc-ph","authors_text":"K. S. Turitsyn, P. A. Kaplunovich","submitted_at":"2012-11-04T22:37:37Z","abstract_excerpt":"We present a novel selection algorithm for N-2 contingency analysis problem. The algorithm is based on the iterative bounding of line outage distribution factors and successive pruning of the set of contingency pair candidates. The selection procedure is non-heuristic, and is certified to identify all events that lead to thermal constraints violations in DC approximation. The complexity of the algorithm is O(N^2) comparable to the complexity of N-1 contingency problem. We validate and test the algorithm on the Polish grid network with around 3000 lines. For this test case two iterations of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0728","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfgBW7Ezvdm6dYJcjQ9UCa+e16MCDwVGtQ50ejs25bmy8pRTs84ppYQj+ay86bhvneH4irMjDQjLErN1hgudCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:30:19.022154Z"},"content_sha256":"05a25ada57c6ab1e42cc72f980f5b15e5a26a6383f5c8fbffa5dff7a5184779d","schema_version":"1.0","event_id":"sha256:05a25ada57c6ab1e42cc72f980f5b15e5a26a6383f5c8fbffa5dff7a5184779d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KATXBMTRHGA7QRAQNEEO6WFCPS/bundle.json","state_url":"https://pith.science/pith/KATXBMTRHGA7QRAQNEEO6WFCPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KATXBMTRHGA7QRAQNEEO6WFCPS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T18:30:19Z","links":{"resolver":"https://pith.science/pith/KATXBMTRHGA7QRAQNEEO6WFCPS","bundle":"https://pith.science/pith/KATXBMTRHGA7QRAQNEEO6WFCPS/bundle.json","state":"https://pith.science/pith/KATXBMTRHGA7QRAQNEEO6WFCPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KATXBMTRHGA7QRAQNEEO6WFCPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KATXBMTRHGA7QRAQNEEO6WFCPS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6935f2eb6a44af882f238aa08f761f09a4a86bd37d7e5375cebccc852d5c82a4","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-04T22:37:37Z","title_canon_sha256":"91d872550df897aeb998d38466ee08ae7996114e2aac1923097519031375d2ab"},"schema_version":"1.0","source":{"id":"1211.0728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0728","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0728v1","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0728","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"KATXBMTRHGA7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KATXBMTRHGA7QRAQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KATXBMTR","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:05a25ada57c6ab1e42cc72f980f5b15e5a26a6383f5c8fbffa5dff7a5184779d","target":"graph","created_at":"2026-05-18T03:41:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present a novel selection algorithm for N-2 contingency analysis problem. The algorithm is based on the iterative bounding of line outage distribution factors and successive pruning of the set of contingency pair candidates. The selection procedure is non-heuristic, and is certified to identify all events that lead to thermal constraints violations in DC approximation. The complexity of the algorithm is O(N^2) comparable to the complexity of N-1 contingency problem. We validate and test the algorithm on the Polish grid network with around 3000 lines. For this test case two iterations of the","authors_text":"K. S. Turitsyn, P. A. Kaplunovich","cross_cats":["cs.SI","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-04T22:37:37Z","title":"Fast Algorithm for N-2 Contingency Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0728","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa2768aa3c91bf69d3b74c82c60690eede44514756c6fdc5114637de647a00b0","target":"record","created_at":"2026-05-18T03:41:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6935f2eb6a44af882f238aa08f761f09a4a86bd37d7e5375cebccc852d5c82a4","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2012-11-04T22:37:37Z","title_canon_sha256":"91d872550df897aeb998d38466ee08ae7996114e2aac1923097519031375d2ab"},"schema_version":"1.0","source":{"id":"1211.0728","kind":"arxiv","version":1}},"canonical_sha256":"502770b2713981f844106908ef58a27ca6cd4bef3a81eafebf67fde9a883ffb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"502770b2713981f844106908ef58a27ca6cd4bef3a81eafebf67fde9a883ffb6","first_computed_at":"2026-05-18T03:41:31.713725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:31.713725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjoYYbhoNMOVu1pcR70WugJi/hsv+RkFAuKy+z6M23FauCo+n9g3bI8mvi3VdRW+xvjbt2edATm6z4Tmbr4CCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:31.714164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa2768aa3c91bf69d3b74c82c60690eede44514756c6fdc5114637de647a00b0","sha256:05a25ada57c6ab1e42cc72f980f5b15e5a26a6383f5c8fbffa5dff7a5184779d"],"state_sha256":"2e83b0957d3524862b5c4974a090dc52745b4c0071fb4c80cc107f6b9b4c9a04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGy8/l2xUmA0GLOm6/N8gdMXtZ6djm2ZHMTRqSBJuJ9LPqp2VpDBiMVKJRPwbEArvvIYkFAWgCAbmwAWY7g6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:30:19.024763Z","bundle_sha256":"fb990749718b9e10741aef20fe31027dfc679d981370f1eeeee62ef237ca9e0f"}}