{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:323VEMULBQ6UVQW5UIHJOCBIAN","short_pith_number":"pith:323VEMUL","canonical_record":{"source":{"id":"1409.4451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-15T21:14:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8189198bd1f9f33b5f510185689a1d02e99b2ba9ce63847661cfa140bacba316","abstract_canon_sha256":"f8f0dc88f5c197391bb2f002a0a3f262afbdc24c2de6c0de4e24ff6302afd4f4"},"schema_version":"1.0"},"canonical_sha256":"deb752328b0c3d4ac2dda20e9708280348df04d7100d10df474561fcb3768a8a","source":{"kind":"arxiv","id":"1409.4451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4451","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4451v1","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4451","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"323VEMULBQ6U","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"323VEMULBQ6UVQW5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"323VEMUL","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:323VEMULBQ6UVQW5UIHJOCBIAN","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-15T21:14:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8189198bd1f9f33b5f510185689a1d02e99b2ba9ce63847661cfa140bacba316","abstract_canon_sha256":"f8f0dc88f5c197391bb2f002a0a3f262afbdc24c2de6c0de4e24ff6302afd4f4"},"schema_version":"1.0"},"canonical_sha256":"deb752328b0c3d4ac2dda20e9708280348df04d7100d10df474561fcb3768a8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:45.526912Z","signature_b64":"0Fuaj4pc6bdyhl9H8KPMKj27V/8WGI9ceSJBP6PYkTSu4hCYOnfypVAsI8zcVmpd7gNW8ZAfBem+9E1DyM4+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb752328b0c3d4ac2dda20e9708280348df04d7100d10df474561fcb3768a8a","last_reissued_at":"2026-05-18T02:42:45.526475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:45.526475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4451","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-18T02:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMsHSjSy7yJywp5hl8R67uPl+1QG6eBYOY3O8wo8EADZ1VvYP0iXc8gVBM1Bo7hUa6jVL/2/p9v5MXOJ5ZBMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:49:13.822176Z"},"content_sha256":"c29a23f3a3eecb79c52a72ed98dab58d27d410812e454efb6caabed37d93460c","schema_version":"1.0","event_id":"sha256:c29a23f3a3eecb79c52a72ed98dab58d27d410812e454efb6caabed37d93460c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:323VEMULBQ6UVQW5UIHJOCBIAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Synchronization Stability Metrics for Fault Clearing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Daniel Bienstock, Dvijotham Krishnamurthy, Michael Chertkov, Russell Bent, Scott Backhaus","submitted_at":"2014-09-15T21:14:14Z","abstract_excerpt":"Direct methods can provide rapid screening of the dynamical security of large numbers fault and contingency scenarios by avoiding extensive time simulation. We introduce a computationally-efficient direct method based on optimization that leverages efficient cutting plane techniques. The method considers both unstable equilibrium points and the effects of additional relay tripping on dynamical security\\cite{01SH}. Similar to other direct methods, our approach yields conservative results for dynamical security, however, the optimization formulation potentially lends itself to the inclusion of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4451","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-18T02:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDaBPsDsM3ozFoqfqAzYhT6uI0uN49SLVbqUiSZZEsP1FrjOqvS0mARtscTCCEQ9oWBEZACJR69Z9b69B/tMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:49:13.822749Z"},"content_sha256":"6e1fe1ba459a548895a50923f873c29ca406482222e924f6052718aad4841ec9","schema_version":"1.0","event_id":"sha256:6e1fe1ba459a548895a50923f873c29ca406482222e924f6052718aad4841ec9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/323VEMULBQ6UVQW5UIHJOCBIAN/bundle.json","state_url":"https://pith.science/pith/323VEMULBQ6UVQW5UIHJOCBIAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/323VEMULBQ6UVQW5UIHJOCBIAN/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-05T05:49:13Z","links":{"resolver":"https://pith.science/pith/323VEMULBQ6UVQW5UIHJOCBIAN","bundle":"https://pith.science/pith/323VEMULBQ6UVQW5UIHJOCBIAN/bundle.json","state":"https://pith.science/pith/323VEMULBQ6UVQW5UIHJOCBIAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/323VEMULBQ6UVQW5UIHJOCBIAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:323VEMULBQ6UVQW5UIHJOCBIAN","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":"f8f0dc88f5c197391bb2f002a0a3f262afbdc24c2de6c0de4e24ff6302afd4f4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-15T21:14:14Z","title_canon_sha256":"8189198bd1f9f33b5f510185689a1d02e99b2ba9ce63847661cfa140bacba316"},"schema_version":"1.0","source":{"id":"1409.4451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4451","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4451v1","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4451","created_at":"2026-05-18T02:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"323VEMULBQ6U","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"323VEMULBQ6UVQW5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"323VEMUL","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:6e1fe1ba459a548895a50923f873c29ca406482222e924f6052718aad4841ec9","target":"graph","created_at":"2026-05-18T02:42:45Z","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":"Direct methods can provide rapid screening of the dynamical security of large numbers fault and contingency scenarios by avoiding extensive time simulation. We introduce a computationally-efficient direct method based on optimization that leverages efficient cutting plane techniques. The method considers both unstable equilibrium points and the effects of additional relay tripping on dynamical security\\cite{01SH}. Similar to other direct methods, our approach yields conservative results for dynamical security, however, the optimization formulation potentially lends itself to the inclusion of a","authors_text":"Daniel Bienstock, Dvijotham Krishnamurthy, Michael Chertkov, Russell Bent, Scott Backhaus","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-15T21:14:14Z","title":"Efficient Synchronization Stability Metrics for Fault Clearing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4451","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:c29a23f3a3eecb79c52a72ed98dab58d27d410812e454efb6caabed37d93460c","target":"record","created_at":"2026-05-18T02:42:45Z","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":"f8f0dc88f5c197391bb2f002a0a3f262afbdc24c2de6c0de4e24ff6302afd4f4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-15T21:14:14Z","title_canon_sha256":"8189198bd1f9f33b5f510185689a1d02e99b2ba9ce63847661cfa140bacba316"},"schema_version":"1.0","source":{"id":"1409.4451","kind":"arxiv","version":1}},"canonical_sha256":"deb752328b0c3d4ac2dda20e9708280348df04d7100d10df474561fcb3768a8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deb752328b0c3d4ac2dda20e9708280348df04d7100d10df474561fcb3768a8a","first_computed_at":"2026-05-18T02:42:45.526475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:45.526475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Fuaj4pc6bdyhl9H8KPMKj27V/8WGI9ceSJBP6PYkTSu4hCYOnfypVAsI8zcVmpd7gNW8ZAfBem+9E1DyM4+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:45.526912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c29a23f3a3eecb79c52a72ed98dab58d27d410812e454efb6caabed37d93460c","sha256:6e1fe1ba459a548895a50923f873c29ca406482222e924f6052718aad4841ec9"],"state_sha256":"cd3d3457307942803db13cf98ff85f3af34abf6bd7137bf8c66942d4020d3948"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OA4Vrq13YzEgTzSzGo4bv2slWaQCRZeRx75tIro4spPzli6wg6opd76tkAZo99CV2dBFvS9/ILnBkqp8QanDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:49:13.826311Z","bundle_sha256":"41d1b93f7c130f684aaf16b63f0d46dff3009cb1cf3923a482e43399ec8431f3"}}