{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZICMGIV4VEWR5NJLY44S5WJG6V","short_pith_number":"pith:ZICMGIV4","canonical_record":{"source":{"id":"1606.06512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-21T11:04:10Z","cross_cats_sorted":["cs.AI","cs.CE","math.OC","physics.soc-ph"],"title_canon_sha256":"3ad0c9535a042990300f8cddefcbb4b96d8c070efd39ae9ce16353d887511b67","abstract_canon_sha256":"94841e503f28e3b41af0731b2a5fc50b4bbc796dfffa924a4d37527f0948fa29"},"schema_version":"1.0"},"canonical_sha256":"ca04c322bca92d1eb52bc7392ed926f55fd6357c09c42f79805c0d72bae620ad","source":{"kind":"arxiv","id":"1606.06512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06512","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06512v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06512","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZICMGIV4VEWR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZICMGIV4VEWR5NJL","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZICMGIV4","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZICMGIV4VEWR5NJLY44S5WJG6V","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-21T11:04:10Z","cross_cats_sorted":["cs.AI","cs.CE","math.OC","physics.soc-ph"],"title_canon_sha256":"3ad0c9535a042990300f8cddefcbb4b96d8c070efd39ae9ce16353d887511b67","abstract_canon_sha256":"94841e503f28e3b41af0731b2a5fc50b4bbc796dfffa924a4d37527f0948fa29"},"schema_version":"1.0"},"canonical_sha256":"ca04c322bca92d1eb52bc7392ed926f55fd6357c09c42f79805c0d72bae620ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.382353Z","signature_b64":"fNCIz5bDHgQnmY5Om9jM9WcirQxMxt3jczUxQbV4bxD/1JYuDsoVJG3PG3WGXVNGHn/lM7hcfBhq+IkPnGB2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca04c322bca92d1eb52bc7392ed926f55fd6357c09c42f79805c0d72bae620ad","last_reissued_at":"2026-05-18T01:12:09.381950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.381950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06512","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHNL/m4uGedm2/WDUYK8hj6NH4wCCBs199HQh1T00wzrQJF8qANhwmWR00ORPkpYrbNTUifQ+mgZe0yeEoTIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:45:24.180195Z"},"content_sha256":"656d2f6ef8d4e048d4ba5b113e982e1333dee2b4f184be8dca68e5e2ef5ec435","schema_version":"1.0","event_id":"sha256:656d2f6ef8d4e048d4ba5b113e982e1333dee2b4f184be8dca68e5e2ef5ec435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZICMGIV4VEWR5NJLY44S5WJG6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphical Models for Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CE","math.OC","physics.soc-ph"],"primary_cat":"cs.SY","authors_text":"Krishnamurthy Dvijotham, Marc Vuffray, Michael Chertkov, Pascal Van Hentenryck, Sidhant Misra","submitted_at":"2016-06-21T11:04:10Z","abstract_excerpt":"Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06512","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RK9uTKkZ4wseQI1oFxlSA4uaEXQB1qh5vxj3+/ktL10P3mMCnM8yJmp54f4PCstGeo0yolNr0bxLx5rNpAc+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:45:24.180557Z"},"content_sha256":"9744d17ac3b7d1bea66b06c78d26ae9a15c6e106d828c285504bf013e0bb6df1","schema_version":"1.0","event_id":"sha256:9744d17ac3b7d1bea66b06c78d26ae9a15c6e106d828c285504bf013e0bb6df1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZICMGIV4VEWR5NJLY44S5WJG6V/bundle.json","state_url":"https://pith.science/pith/ZICMGIV4VEWR5NJLY44S5WJG6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZICMGIV4VEWR5NJLY44S5WJG6V/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-02T22:45:24Z","links":{"resolver":"https://pith.science/pith/ZICMGIV4VEWR5NJLY44S5WJG6V","bundle":"https://pith.science/pith/ZICMGIV4VEWR5NJLY44S5WJG6V/bundle.json","state":"https://pith.science/pith/ZICMGIV4VEWR5NJLY44S5WJG6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZICMGIV4VEWR5NJLY44S5WJG6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZICMGIV4VEWR5NJLY44S5WJG6V","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":"94841e503f28e3b41af0731b2a5fc50b4bbc796dfffa924a4d37527f0948fa29","cross_cats_sorted":["cs.AI","cs.CE","math.OC","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-21T11:04:10Z","title_canon_sha256":"3ad0c9535a042990300f8cddefcbb4b96d8c070efd39ae9ce16353d887511b67"},"schema_version":"1.0","source":{"id":"1606.06512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06512","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06512v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06512","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZICMGIV4VEWR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZICMGIV4VEWR5NJL","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZICMGIV4","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9744d17ac3b7d1bea66b06c78d26ae9a15c6e106d828c285504bf013e0bb6df1","target":"graph","created_at":"2026-05-18T01:12:09Z","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":"Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretiz","authors_text":"Krishnamurthy Dvijotham, Marc Vuffray, Michael Chertkov, Pascal Van Hentenryck, Sidhant Misra","cross_cats":["cs.AI","cs.CE","math.OC","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-21T11:04:10Z","title":"Graphical Models for Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06512","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:656d2f6ef8d4e048d4ba5b113e982e1333dee2b4f184be8dca68e5e2ef5ec435","target":"record","created_at":"2026-05-18T01:12:09Z","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":"94841e503f28e3b41af0731b2a5fc50b4bbc796dfffa924a4d37527f0948fa29","cross_cats_sorted":["cs.AI","cs.CE","math.OC","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-21T11:04:10Z","title_canon_sha256":"3ad0c9535a042990300f8cddefcbb4b96d8c070efd39ae9ce16353d887511b67"},"schema_version":"1.0","source":{"id":"1606.06512","kind":"arxiv","version":1}},"canonical_sha256":"ca04c322bca92d1eb52bc7392ed926f55fd6357c09c42f79805c0d72bae620ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca04c322bca92d1eb52bc7392ed926f55fd6357c09c42f79805c0d72bae620ad","first_computed_at":"2026-05-18T01:12:09.381950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.381950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fNCIz5bDHgQnmY5Om9jM9WcirQxMxt3jczUxQbV4bxD/1JYuDsoVJG3PG3WGXVNGHn/lM7hcfBhq+IkPnGB2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.382353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:656d2f6ef8d4e048d4ba5b113e982e1333dee2b4f184be8dca68e5e2ef5ec435","sha256:9744d17ac3b7d1bea66b06c78d26ae9a15c6e106d828c285504bf013e0bb6df1"],"state_sha256":"236daab9e8da9ce43eaf676beb81df7eec34783cdddb36eb3d5d8d5bdf0c4914"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFFQ5VWIPwlufPvPsK+n6Ctruj8Q+CXNahfZ4OksbIc+Q3OF7CrgN3/jJmllef/SKjUxhpHFj1yCRphYAH+2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:45:24.182491Z","bundle_sha256":"8b41c81f81449ff5bcbef3c9936a81bfba72569035b89c83767424ccf9736e14"}}