{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J6CTLTVEEZ5TTRRIWC7P22XLEN","short_pith_number":"pith:J6CTLTVE","canonical_record":{"source":{"id":"1204.1106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-04-05T01:45:40Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"bb07beea4032e00925e54c55e7243bccfd7c5a7f39e99ac449cf5eef83b49460","abstract_canon_sha256":"fdb54b9d5c71179f918c1a14199b7507bad99afbe3e2dc8d3e53ae6752dcef52"},"schema_version":"1.0"},"canonical_sha256":"4f8535cea4267b39c628b0befd6aeb237ad67fd76191e2af3ddae5f4a3c982d7","source":{"kind":"arxiv","id":"1204.1106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1106","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1106v1","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1106","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"J6CTLTVEEZ5T","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"J6CTLTVEEZ5TTRRI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"J6CTLTVE","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J6CTLTVEEZ5TTRRIWC7P22XLEN","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-04-05T01:45:40Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"bb07beea4032e00925e54c55e7243bccfd7c5a7f39e99ac449cf5eef83b49460","abstract_canon_sha256":"fdb54b9d5c71179f918c1a14199b7507bad99afbe3e2dc8d3e53ae6752dcef52"},"schema_version":"1.0"},"canonical_sha256":"4f8535cea4267b39c628b0befd6aeb237ad67fd76191e2af3ddae5f4a3c982d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:36.379735Z","signature_b64":"U3mqISPRCMkGD2wRlOyU85gm1iH5U0Tps7PMXaC/xe83TKNx+n14kybn2m/GyUfoQWu0K3LznD8lug6fIBeQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f8535cea4267b39c628b0befd6aeb237ad67fd76191e2af3ddae5f4a3c982d7","last_reissued_at":"2026-05-18T03:58:36.379146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:36.379146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1106","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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBDFGArTjm94Rpb/ZLQ/U63Xrp3ccOhn3EXqP5yB560LRQ+fDqUCeCF8/6O7EzWVO7vWBeowXBuspk8ZZPLqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:18:54.053279Z"},"content_sha256":"abbbfbb47e00d4797f980f55f7060faeb918bbd14dfacb7a917ac5c100eb4585","schema_version":"1.0","event_id":"sha256:abbbfbb47e00d4797f980f55f7060faeb918bbd14dfacb7a917ac5c100eb4585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J6CTLTVEEZ5TTRRIWC7P22XLEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Message Passing for Dynamic Network Energy Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Eric Chu, Javad Lavaei, Matt Kraning, Stephen Boyd","submitted_at":"2012-04-05T01:45:40Z","abstract_excerpt":"We consider a network of devices, such as generators, fixed loads, deferrable loads, and storage devices, each with its own dynamic constraints and objective, connected by lossy capacitated lines. The problem is to minimize the total network objective subject to the device and line constraints, over a given time horizon. This is a large optimization problem, with variables for consumption or generation in each time period for each device. In this paper we develop a decentralized method for solving this problem. The method is iterative: At each step, each device exchanges simple messages with i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1106","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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GImhV234NcUZQsZ7R2riRbblTJP4OlcCSItqWR/GsAjsrcVZ/16OtB3KSRimPZYk1ANKe8HJslLqnqaJBeWPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:18:54.053862Z"},"content_sha256":"44999a705deaef316edacda65ee64e39e4abfbe4f2115730188539dfcc09512e","schema_version":"1.0","event_id":"sha256:44999a705deaef316edacda65ee64e39e4abfbe4f2115730188539dfcc09512e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN/bundle.json","state_url":"https://pith.science/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN/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-05-31T07:18:54Z","links":{"resolver":"https://pith.science/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN","bundle":"https://pith.science/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN/bundle.json","state":"https://pith.science/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6CTLTVEEZ5TTRRIWC7P22XLEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J6CTLTVEEZ5TTRRIWC7P22XLEN","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":"fdb54b9d5c71179f918c1a14199b7507bad99afbe3e2dc8d3e53ae6752dcef52","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-04-05T01:45:40Z","title_canon_sha256":"bb07beea4032e00925e54c55e7243bccfd7c5a7f39e99ac449cf5eef83b49460"},"schema_version":"1.0","source":{"id":"1204.1106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1106","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1106v1","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1106","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"J6CTLTVEEZ5T","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"J6CTLTVEEZ5TTRRI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"J6CTLTVE","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:44999a705deaef316edacda65ee64e39e4abfbe4f2115730188539dfcc09512e","target":"graph","created_at":"2026-05-18T03:58:36Z","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 consider a network of devices, such as generators, fixed loads, deferrable loads, and storage devices, each with its own dynamic constraints and objective, connected by lossy capacitated lines. The problem is to minimize the total network objective subject to the device and line constraints, over a given time horizon. This is a large optimization problem, with variables for consumption or generation in each time period for each device. In this paper we develop a decentralized method for solving this problem. The method is iterative: At each step, each device exchanges simple messages with i","authors_text":"Eric Chu, Javad Lavaei, Matt Kraning, Stephen Boyd","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-04-05T01:45:40Z","title":"Message Passing for Dynamic Network Energy Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1106","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:abbbfbb47e00d4797f980f55f7060faeb918bbd14dfacb7a917ac5c100eb4585","target":"record","created_at":"2026-05-18T03:58:36Z","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":"fdb54b9d5c71179f918c1a14199b7507bad99afbe3e2dc8d3e53ae6752dcef52","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-04-05T01:45:40Z","title_canon_sha256":"bb07beea4032e00925e54c55e7243bccfd7c5a7f39e99ac449cf5eef83b49460"},"schema_version":"1.0","source":{"id":"1204.1106","kind":"arxiv","version":1}},"canonical_sha256":"4f8535cea4267b39c628b0befd6aeb237ad67fd76191e2af3ddae5f4a3c982d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f8535cea4267b39c628b0befd6aeb237ad67fd76191e2af3ddae5f4a3c982d7","first_computed_at":"2026-05-18T03:58:36.379146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:36.379146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3mqISPRCMkGD2wRlOyU85gm1iH5U0Tps7PMXaC/xe83TKNx+n14kybn2m/GyUfoQWu0K3LznD8lug6fIBeQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:36.379735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abbbfbb47e00d4797f980f55f7060faeb918bbd14dfacb7a917ac5c100eb4585","sha256:44999a705deaef316edacda65ee64e39e4abfbe4f2115730188539dfcc09512e"],"state_sha256":"f7a078f23afccefb90b9dd5eaa31fed6db6f3be2d68a3285956e409351589df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvsoeyNtC33eOvkjomVrCZ6Fhzmw2mTfrr9KkanISrQ0yNsU+vlQXDSFvv30zQfQCHf9jsL2Td0k4vpPMM6nCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:18:54.056865Z","bundle_sha256":"e217d2adb3986ce710bcf765daa722be70f04a2eb7fbcc68177bb538b3c69d06"}}