{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XZOTWNYDFMZGLFZJDP2APMAQYG","short_pith_number":"pith:XZOTWNYD","canonical_record":{"source":{"id":"1201.0469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-01-02T14:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"4d85fe745a92e5005d43051ef1d463dbbbdfaa1900026c7ddb1eff78f83c9a3f","abstract_canon_sha256":"1c2364dd30d1f598a27c7cd5fb53de6cfb1027c8237e3c47a9703ac800bcbad1"},"schema_version":"1.0"},"canonical_sha256":"be5d3b37032b326597291bf407b010c1b2a14f13af32c12a26d70fab35a10536","source":{"kind":"arxiv","id":"1201.0469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0469","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0469v1","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0469","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"XZOTWNYDFMZG","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XZOTWNYDFMZGLFZJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XZOTWNYD","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XZOTWNYDFMZGLFZJDP2APMAQYG","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-01-02T14:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"4d85fe745a92e5005d43051ef1d463dbbbdfaa1900026c7ddb1eff78f83c9a3f","abstract_canon_sha256":"1c2364dd30d1f598a27c7cd5fb53de6cfb1027c8237e3c47a9703ac800bcbad1"},"schema_version":"1.0"},"canonical_sha256":"be5d3b37032b326597291bf407b010c1b2a14f13af32c12a26d70fab35a10536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:17.450270Z","signature_b64":"s0aFjA2SVJ8ZqyeV1a/+2ZkOUi52B8e1RAmi01Y+z1AmqGMcbXeGlsR8xQkFEWSJtqS45VafX27DqVJ0ZV84Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be5d3b37032b326597291bf407b010c1b2a14f13af32c12a26d70fab35a10536","last_reissued_at":"2026-05-18T04:05:17.449613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:17.449613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0469","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-18T04:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBr8qmZto/0+A1HIsusPOeK5QJbzuZdxciSkJM76lTOhmG/zjOnY4TM05zXxbLuGC/4fFxPqwzSD+RepRDRLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:19:47.800695Z"},"content_sha256":"cb7c35333f98cd7c4d368d10c25935ce29323bf8ad3bde231dd43210235d5b7b","schema_version":"1.0","event_id":"sha256:cb7c35333f98cd7c4d368d10c25935ce29323bf8ad3bde231dd43210235d5b7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XZOTWNYDFMZGLFZJDP2APMAQYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Critical $k$-tuples in Power Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Kin Cheong Sou","submitted_at":"2012-01-02T14:10:57Z","abstract_excerpt":"In this paper the problem of finding the sparsest (i.e., minimum cardinality) critical $k$-tuple including one arbitrarily specified measurement is considered. The solution to this problem can be used to identify weak points in the measurement set, or aid the placement of new meters. The critical $k$-tuple problem is a combinatorial generalization of the critical measurement calculation problem. Using topological network observability results, this paper proposes an efficient and accurate approximate solution procedure for the considered problem based on solving a minimum-cut (Min-Cut) problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0469","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-18T04:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/X8LfKljlRRQQejeRHMBLqOWLuRUIsjYk9mVnBJ4e+26ZuxkjPKmAL9F/50v0l4oXc7/V1LxnKRzlyUQAg4oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:19:47.801396Z"},"content_sha256":"a8bd80be9359fc63da4a731116045140c538c677be36f2595b5919c7fce12d13","schema_version":"1.0","event_id":"sha256:a8bd80be9359fc63da4a731116045140c538c677be36f2595b5919c7fce12d13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZOTWNYDFMZGLFZJDP2APMAQYG/bundle.json","state_url":"https://pith.science/pith/XZOTWNYDFMZGLFZJDP2APMAQYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZOTWNYDFMZGLFZJDP2APMAQYG/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-07T17:19:47Z","links":{"resolver":"https://pith.science/pith/XZOTWNYDFMZGLFZJDP2APMAQYG","bundle":"https://pith.science/pith/XZOTWNYDFMZGLFZJDP2APMAQYG/bundle.json","state":"https://pith.science/pith/XZOTWNYDFMZGLFZJDP2APMAQYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZOTWNYDFMZGLFZJDP2APMAQYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XZOTWNYDFMZGLFZJDP2APMAQYG","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":"1c2364dd30d1f598a27c7cd5fb53de6cfb1027c8237e3c47a9703ac800bcbad1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-01-02T14:10:57Z","title_canon_sha256":"4d85fe745a92e5005d43051ef1d463dbbbdfaa1900026c7ddb1eff78f83c9a3f"},"schema_version":"1.0","source":{"id":"1201.0469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0469","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0469v1","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0469","created_at":"2026-05-18T04:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"XZOTWNYDFMZG","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XZOTWNYDFMZGLFZJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XZOTWNYD","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:a8bd80be9359fc63da4a731116045140c538c677be36f2595b5919c7fce12d13","target":"graph","created_at":"2026-05-18T04:05:17Z","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":"In this paper the problem of finding the sparsest (i.e., minimum cardinality) critical $k$-tuple including one arbitrarily specified measurement is considered. The solution to this problem can be used to identify weak points in the measurement set, or aid the placement of new meters. The critical $k$-tuple problem is a combinatorial generalization of the critical measurement calculation problem. Using topological network observability results, this paper proposes an efficient and accurate approximate solution procedure for the considered problem based on solving a minimum-cut (Min-Cut) problem","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Kin Cheong Sou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-01-02T14:10:57Z","title":"Computing Critical $k$-tuples in Power Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0469","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:cb7c35333f98cd7c4d368d10c25935ce29323bf8ad3bde231dd43210235d5b7b","target":"record","created_at":"2026-05-18T04:05:17Z","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":"1c2364dd30d1f598a27c7cd5fb53de6cfb1027c8237e3c47a9703ac800bcbad1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2012-01-02T14:10:57Z","title_canon_sha256":"4d85fe745a92e5005d43051ef1d463dbbbdfaa1900026c7ddb1eff78f83c9a3f"},"schema_version":"1.0","source":{"id":"1201.0469","kind":"arxiv","version":1}},"canonical_sha256":"be5d3b37032b326597291bf407b010c1b2a14f13af32c12a26d70fab35a10536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be5d3b37032b326597291bf407b010c1b2a14f13af32c12a26d70fab35a10536","first_computed_at":"2026-05-18T04:05:17.449613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:17.449613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s0aFjA2SVJ8ZqyeV1a/+2ZkOUi52B8e1RAmi01Y+z1AmqGMcbXeGlsR8xQkFEWSJtqS45VafX27DqVJ0ZV84Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:17.450270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb7c35333f98cd7c4d368d10c25935ce29323bf8ad3bde231dd43210235d5b7b","sha256:a8bd80be9359fc63da4a731116045140c538c677be36f2595b5919c7fce12d13"],"state_sha256":"186733c5ae95b2077023786c9d7648ff1f06b50eed61a624a9c028a7afeed871"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVJtFDHAQnRAdzXf8+r4DD3ZOOExKwHLhEiowmZEjDlDJ+vhB3RywRfHVhRE72B0D94JBOfaTCP6NZ4gdLEQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:19:47.805154Z","bundle_sha256":"51fa2a12588259be619caa926dc3b0a8559ae8b423295d67b9048b2ef6c7d0fe"}}