{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GWBEU3BAN5AIEP4CDZA3I6X6L7","short_pith_number":"pith:GWBEU3BA","canonical_record":{"source":{"id":"2210.09277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2022-10-17T17:30:09Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SP"],"title_canon_sha256":"998f9682a1e8f738fcb17c07b4cfb9de4d998c8628fc3653f98bac7ba323febb","abstract_canon_sha256":"22d0f3a405490be0295f941ae17491e527682c4d7d133c4ae85509a0fc36bdff"},"schema_version":"1.0"},"canonical_sha256":"35824a6c206f40823f821e41b47afe5fcd741ca74ed69f812c35f94e47c31a99","source":{"kind":"arxiv","id":"2210.09277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.09277","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"2210.09277v1","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09277","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"GWBEU3BAN5AI","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"pith_short_16","alias_value":"GWBEU3BAN5AIEP4C","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"pith_short_8","alias_value":"GWBEU3BA","created_at":"2026-07-05T05:07:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GWBEU3BAN5AIEP4CDZA3I6X6L7","target":"record","payload":{"canonical_record":{"source":{"id":"2210.09277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2022-10-17T17:30:09Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SP"],"title_canon_sha256":"998f9682a1e8f738fcb17c07b4cfb9de4d998c8628fc3653f98bac7ba323febb","abstract_canon_sha256":"22d0f3a405490be0295f941ae17491e527682c4d7d133c4ae85509a0fc36bdff"},"schema_version":"1.0"},"canonical_sha256":"35824a6c206f40823f821e41b47afe5fcd741ca74ed69f812c35f94e47c31a99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:20.830429Z","signature_b64":"vqJo2UYjlIXYf7j4mrLvamD1qrZMTPwyz0YhaT+C+XtE7fI+HCd/bCv+3zYeL+umk1PQsVDCbOoc75rmdG1FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35824a6c206f40823f821e41b47afe5fcd741ca74ed69f812c35f94e47c31a99","last_reissued_at":"2026-07-05T05:07:20.829983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:20.829983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.09277","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-07-05T05:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxzGCCJlBml12H8yGSvM4s8HCyn+7D5E9E/lqaZ9HYcbWL6FyEKFWrW7llhB3l7AXq+gBHmd6qMQwVZZG/86DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:21:43.990548Z"},"content_sha256":"5370426923a2b4a2b5e5cc9efb27279b69d7920f65061838aee41be284ad54d1","schema_version":"1.0","event_id":"sha256:5370426923a2b4a2b5e5cc9efb27279b69d7920f65061838aee41be284ad54d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GWBEU3BAN5AIEP4CDZA3I6X6L7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Optimal Power Flow Using Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SP"],"primary_cat":"eess.SY","authors_text":"Alejandro Ribeiro, Damian Owerko, Fernando Gama","submitted_at":"2022-10-17T17:30:09Z","abstract_excerpt":"Optimal power flow (OPF) is a critical optimization problem that allocates power to the generators in order to satisfy the demand at a minimum cost. Solving this problem exactly is computationally infeasible in the general case. In this work, we propose to leverage graph signal processing and machine learning. More specifically, we use a graph neural network to learn a nonlinear parametrization between the power demanded and the corresponding allocation. We learn the solution in an unsupervised manner, minimizing the cost directly. In order to take into account the electrical constraints of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09277","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.09277/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1e78FUlLUTSZ40NFBePEFFZSYhPVsLccnmODnqrBEB3k6aONxAdf0qcaBeFqHm4Bmak6AUGNQ4RYehgjpXvmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:21:43.991462Z"},"content_sha256":"91e799b3937553b314bcf3c1d8ff56608fd3f92f25b99c557f2aa1ea97899322","schema_version":"1.0","event_id":"sha256:91e799b3937553b314bcf3c1d8ff56608fd3f92f25b99c557f2aa1ea97899322"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7/bundle.json","state_url":"https://pith.science/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7/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-08-09T15:21:43Z","links":{"resolver":"https://pith.science/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7","bundle":"https://pith.science/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7/bundle.json","state":"https://pith.science/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWBEU3BAN5AIEP4CDZA3I6X6L7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GWBEU3BAN5AIEP4CDZA3I6X6L7","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":"22d0f3a405490be0295f941ae17491e527682c4d7d133c4ae85509a0fc36bdff","cross_cats_sorted":["cs.LG","cs.SY","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2022-10-17T17:30:09Z","title_canon_sha256":"998f9682a1e8f738fcb17c07b4cfb9de4d998c8628fc3653f98bac7ba323febb"},"schema_version":"1.0","source":{"id":"2210.09277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.09277","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"2210.09277v1","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09277","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"GWBEU3BAN5AI","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"pith_short_16","alias_value":"GWBEU3BAN5AIEP4C","created_at":"2026-07-05T05:07:20Z"},{"alias_kind":"pith_short_8","alias_value":"GWBEU3BA","created_at":"2026-07-05T05:07:20Z"}],"graph_snapshots":[{"event_id":"sha256:91e799b3937553b314bcf3c1d8ff56608fd3f92f25b99c557f2aa1ea97899322","target":"graph","created_at":"2026-07-05T05:07:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.09277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal power flow (OPF) is a critical optimization problem that allocates power to the generators in order to satisfy the demand at a minimum cost. Solving this problem exactly is computationally infeasible in the general case. In this work, we propose to leverage graph signal processing and machine learning. More specifically, we use a graph neural network to learn a nonlinear parametrization between the power demanded and the corresponding allocation. We learn the solution in an unsupervised manner, minimizing the cost directly. In order to take into account the electrical constraints of th","authors_text":"Alejandro Ribeiro, Damian Owerko, Fernando Gama","cross_cats":["cs.LG","cs.SY","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2022-10-17T17:30:09Z","title":"Unsupervised Optimal Power Flow Using Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09277","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:5370426923a2b4a2b5e5cc9efb27279b69d7920f65061838aee41be284ad54d1","target":"record","created_at":"2026-07-05T05:07:20Z","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":"22d0f3a405490be0295f941ae17491e527682c4d7d133c4ae85509a0fc36bdff","cross_cats_sorted":["cs.LG","cs.SY","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2022-10-17T17:30:09Z","title_canon_sha256":"998f9682a1e8f738fcb17c07b4cfb9de4d998c8628fc3653f98bac7ba323febb"},"schema_version":"1.0","source":{"id":"2210.09277","kind":"arxiv","version":1}},"canonical_sha256":"35824a6c206f40823f821e41b47afe5fcd741ca74ed69f812c35f94e47c31a99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35824a6c206f40823f821e41b47afe5fcd741ca74ed69f812c35f94e47c31a99","first_computed_at":"2026-07-05T05:07:20.829983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:07:20.829983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqJo2UYjlIXYf7j4mrLvamD1qrZMTPwyz0YhaT+C+XtE7fI+HCd/bCv+3zYeL+umk1PQsVDCbOoc75rmdG1FAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:07:20.830429Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.09277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5370426923a2b4a2b5e5cc9efb27279b69d7920f65061838aee41be284ad54d1","sha256:91e799b3937553b314bcf3c1d8ff56608fd3f92f25b99c557f2aa1ea97899322"],"state_sha256":"971ba62d12076db11b76e3be886f02e9b463b15c98e0b465a15b02aa6ea1602b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1iKeZSjDkdc7/ZE9o/tzfw5ivgkMXVkc45xlS3aZq2L4PzCkofEHwFm+edst0xoEEMH6efS958PXLH6hVymXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:21:43.997026Z","bundle_sha256":"0ebfbfc4b5da89e3cf0f6d7da5515b981576654335d45d96b58c3443f3e21584"}}