{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VZFVBXHCPY4YUKVIEEHEFGXOJ2","short_pith_number":"pith:VZFVBXHC","canonical_record":{"source":{"id":"2505.18435","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T00:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"bc1a5f7b8813ce0e1966263994499a7d215634d6f0cf7ad77dd1f53e33bf67df","abstract_canon_sha256":"8f571692a5f4acef2a2293406560e8b68d8991874cc4ce52f761ace51ede0988"},"schema_version":"1.0"},"canonical_sha256":"ae4b50dce27e398a2aa8210e429aee4ea7544792d915e61f078fb23a6b6400bd","source":{"kind":"arxiv","id":"2505.18435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18435","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18435v1","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18435","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"VZFVBXHCPY4Y","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"VZFVBXHCPY4YUKVI","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"VZFVBXHC","created_at":"2026-07-05T11:08:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VZFVBXHCPY4YUKVIEEHEFGXOJ2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.18435","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T00:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"bc1a5f7b8813ce0e1966263994499a7d215634d6f0cf7ad77dd1f53e33bf67df","abstract_canon_sha256":"8f571692a5f4acef2a2293406560e8b68d8991874cc4ce52f761ace51ede0988"},"schema_version":"1.0"},"canonical_sha256":"ae4b50dce27e398a2aa8210e429aee4ea7544792d915e61f078fb23a6b6400bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:46.394720Z","signature_b64":"g18/eiAbx6WNyG1nEKqhHpRP3PAWUsWNcw08R523UoTAAp+nXjnqeX4jCFafr2vuv7QVFUfpY0lb7ea8ATNjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae4b50dce27e398a2aa8210e429aee4ea7544792d915e61f078fb23a6b6400bd","last_reissued_at":"2026-07-05T11:08:46.394264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:46.394264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.18435","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-05T11:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkmBIlmsu3ykuSyf3EAOBu6RHWE29MAqC7ogDiTOIUdHJ48DJnba+K17SvM38Z+LM+Zc/f5hhz8p5Tpjy5LVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:15:47.381339Z"},"content_sha256":"6ba7773ea82db075e5c5b6c406f5803bee95a98433f915cf35ed708a84f481d7","schema_version":"1.0","event_id":"sha256:6ba7773ea82db075e5c5b6c406f5803bee95a98433f915cf35ed708a84f481d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VZFVBXHCPY4YUKVIEEHEFGXOJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Global Optimization for AC-OPF via Quadratic Convex Relaxation and Branch-and-Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mohammad Rasoul Narimani, Mohammadreza Iranpour","submitted_at":"2025-05-24T00:05:52Z","abstract_excerpt":"The Optimal Power Flow (OPF) problem is central to the reliable and efficient operation of power systems, yet its non-convex nature poses significant challenges for finding globally optimal solutions. While convex relaxation techniques such as Quadratic Convex (QC) relaxation have shown promise in providing tight lower bounds, they typically do not guarantee global optimality. Conversely, global optimization methods like the Branch and Bound (B\\&B) algorithm can ensure optimality but often suffer from high computational costs due to the large search space involved. This paper proposes a novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18435","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/2505.18435/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-05T11:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utd8OkOw5KcB6YNlP43gUzqN/Xg6TUhf5omwITGadX6PpeDhzHXKaf89yPrhhsLeUMhlcqwkFPZQ2nErqythAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:15:47.381847Z"},"content_sha256":"f6c20bd663afd5a69305784e5a06d7e42e9308a70ad9dc27cca465401004313c","schema_version":"1.0","event_id":"sha256:f6c20bd663afd5a69305784e5a06d7e42e9308a70ad9dc27cca465401004313c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2/bundle.json","state_url":"https://pith.science/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2/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-03T16:15:47Z","links":{"resolver":"https://pith.science/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2","bundle":"https://pith.science/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2/bundle.json","state":"https://pith.science/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZFVBXHCPY4YUKVIEEHEFGXOJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VZFVBXHCPY4YUKVIEEHEFGXOJ2","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":"8f571692a5f4acef2a2293406560e8b68d8991874cc4ce52f761ace51ede0988","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T00:05:52Z","title_canon_sha256":"bc1a5f7b8813ce0e1966263994499a7d215634d6f0cf7ad77dd1f53e33bf67df"},"schema_version":"1.0","source":{"id":"2505.18435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18435","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18435v1","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18435","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"VZFVBXHCPY4Y","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"VZFVBXHCPY4YUKVI","created_at":"2026-07-05T11:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"VZFVBXHC","created_at":"2026-07-05T11:08:46Z"}],"graph_snapshots":[{"event_id":"sha256:f6c20bd663afd5a69305784e5a06d7e42e9308a70ad9dc27cca465401004313c","target":"graph","created_at":"2026-07-05T11:08:46Z","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/2505.18435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Optimal Power Flow (OPF) problem is central to the reliable and efficient operation of power systems, yet its non-convex nature poses significant challenges for finding globally optimal solutions. While convex relaxation techniques such as Quadratic Convex (QC) relaxation have shown promise in providing tight lower bounds, they typically do not guarantee global optimality. Conversely, global optimization methods like the Branch and Bound (B\\&B) algorithm can ensure optimality but often suffer from high computational costs due to the large search space involved. This paper proposes a novel ","authors_text":"Mohammad Rasoul Narimani, Mohammadreza Iranpour","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T00:05:52Z","title":"Scalable Global Optimization for AC-OPF via Quadratic Convex Relaxation and Branch-and-Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18435","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:6ba7773ea82db075e5c5b6c406f5803bee95a98433f915cf35ed708a84f481d7","target":"record","created_at":"2026-07-05T11:08:46Z","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":"8f571692a5f4acef2a2293406560e8b68d8991874cc4ce52f761ace51ede0988","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T00:05:52Z","title_canon_sha256":"bc1a5f7b8813ce0e1966263994499a7d215634d6f0cf7ad77dd1f53e33bf67df"},"schema_version":"1.0","source":{"id":"2505.18435","kind":"arxiv","version":1}},"canonical_sha256":"ae4b50dce27e398a2aa8210e429aee4ea7544792d915e61f078fb23a6b6400bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae4b50dce27e398a2aa8210e429aee4ea7544792d915e61f078fb23a6b6400bd","first_computed_at":"2026-07-05T11:08:46.394264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:46.394264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g18/eiAbx6WNyG1nEKqhHpRP3PAWUsWNcw08R523UoTAAp+nXjnqeX4jCFafr2vuv7QVFUfpY0lb7ea8ATNjCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:46.394720Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ba7773ea82db075e5c5b6c406f5803bee95a98433f915cf35ed708a84f481d7","sha256:f6c20bd663afd5a69305784e5a06d7e42e9308a70ad9dc27cca465401004313c"],"state_sha256":"b685f402ffd6cb9cf2aa876e63701f05883fc3f1b0ba1633dedcd0b5ec24eb73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9H/KRP73Y36Ul0z4qSVyH2T12m4ow/K0EMC866B4L4fokaVB56iLt990Ywy/Muwxl1AagoGGTrZeM5LzzERCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:15:47.386674Z","bundle_sha256":"d1422535162a2fb9c79ed1e3af0f0fdec44f19a5117ca13656499f04c0ceb23d"}}