{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BQSEVIAQDYBPSQPJKIEVD7DZSW","short_pith_number":"pith:BQSEVIAQ","canonical_record":{"source":{"id":"2508.15006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-20T18:54:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ae2a959a962ec674a0a0c476b7b880d6172ce4870898d3ec97f1f3c197530f1c","abstract_canon_sha256":"69a9354821a7696997a0eb5ce49dff7ec171fbf2653ceed216b1c51d219ed785"},"schema_version":"1.0"},"canonical_sha256":"0c244aa0101e02f941e9520951fc79959887d686a80b36b5974f2f00cb288410","source":{"kind":"arxiv","id":"2508.15006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.15006","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2508.15006v2","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15006","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"BQSEVIAQDYBP","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"BQSEVIAQDYBPSQPJ","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"BQSEVIAQ","created_at":"2026-06-08T01:05:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BQSEVIAQDYBPSQPJKIEVD7DZSW","target":"record","payload":{"canonical_record":{"source":{"id":"2508.15006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-20T18:54:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ae2a959a962ec674a0a0c476b7b880d6172ce4870898d3ec97f1f3c197530f1c","abstract_canon_sha256":"69a9354821a7696997a0eb5ce49dff7ec171fbf2653ceed216b1c51d219ed785"},"schema_version":"1.0"},"canonical_sha256":"0c244aa0101e02f941e9520951fc79959887d686a80b36b5974f2f00cb288410","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:02.412459Z","signature_b64":"BYyPlUL7YM5FtmCSafE+8uY9/jS8w7Im1ZUiQmJ7dY0RF8zdB8M+Di+34IjzRkuUPvEjTnznToSVVFlgRyvTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c244aa0101e02f941e9520951fc79959887d686a80b36b5974f2f00cb288410","last_reissued_at":"2026-06-08T01:05:02.411358Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:02.411358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.15006","source_version":2,"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-06-08T01:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dINq0JzemEm+NpZnxIEybb6lFYK2v2dMeRK2IdoDZYgvKAz7gJtIck8KzOZw1W7p5SYSWK/rStiAUyzzizG1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:45:36.382358Z"},"content_sha256":"1c4aabeb2b5f2be355cf91bde93a21b3fe9f1928f43c2022af88f4ba850a47ad","schema_version":"1.0","event_id":"sha256:1c4aabeb2b5f2be355cf91bde93a21b3fe9f1928f43c2022af88f4ba850a47ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BQSEVIAQDYBPSQPJKIEVD7DZSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure-preserving Optimal Kron-based Reduction of Radial Distribution Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mads Almassalkhi, Omid Mokhtari, Samuel Chevalier","submitted_at":"2025-08-20T18:54:48Z","abstract_excerpt":"Network reduction simplifies complex electrical networks to address computational challenges of large-scale transmission and distribution grids. Traditional network reduction methods are often based on a predefined set of nodes or lines to remain in the reduced network. This paper builds upon previous work on optimal Kron-based reduction of networks, which was formulated as a mixed-integer linear program, to enhance the framework in three aspects. First, the scalability is improved via a cutting plane restriction, tightened Big M bounds, and a zero-injection node reduction stage. Next, we intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15006","kind":"arxiv","version":2},"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/2508.15006/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-06-08T01:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDa98ab6MVTRMpGKOo2RPz5AI+xDEwa46PUlNTEKTbEKKL1W/AEEd9e/HLFiDsciyf9BEgsw/kTloEbzjI9iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:45:36.383075Z"},"content_sha256":"f6ee61abf454c3297c87c741f65491608917123135e6180009d46c9e49b0e155","schema_version":"1.0","event_id":"sha256:f6ee61abf454c3297c87c741f65491608917123135e6180009d46c9e49b0e155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW/bundle.json","state_url":"https://pith.science/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW/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-10T11:45:36Z","links":{"resolver":"https://pith.science/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW","bundle":"https://pith.science/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW/bundle.json","state":"https://pith.science/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQSEVIAQDYBPSQPJKIEVD7DZSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BQSEVIAQDYBPSQPJKIEVD7DZSW","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":"69a9354821a7696997a0eb5ce49dff7ec171fbf2653ceed216b1c51d219ed785","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-20T18:54:48Z","title_canon_sha256":"ae2a959a962ec674a0a0c476b7b880d6172ce4870898d3ec97f1f3c197530f1c"},"schema_version":"1.0","source":{"id":"2508.15006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.15006","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2508.15006v2","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15006","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"BQSEVIAQDYBP","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"BQSEVIAQDYBPSQPJ","created_at":"2026-06-08T01:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"BQSEVIAQ","created_at":"2026-06-08T01:05:02Z"}],"graph_snapshots":[{"event_id":"sha256:f6ee61abf454c3297c87c741f65491608917123135e6180009d46c9e49b0e155","target":"graph","created_at":"2026-06-08T01:05:02Z","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/2508.15006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network reduction simplifies complex electrical networks to address computational challenges of large-scale transmission and distribution grids. Traditional network reduction methods are often based on a predefined set of nodes or lines to remain in the reduced network. This paper builds upon previous work on optimal Kron-based reduction of networks, which was formulated as a mixed-integer linear program, to enhance the framework in three aspects. First, the scalability is improved via a cutting plane restriction, tightened Big M bounds, and a zero-injection node reduction stage. Next, we intr","authors_text":"Mads Almassalkhi, Omid Mokhtari, Samuel Chevalier","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-20T18:54:48Z","title":"Structure-preserving Optimal Kron-based Reduction of Radial Distribution Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15006","kind":"arxiv","version":2},"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:1c4aabeb2b5f2be355cf91bde93a21b3fe9f1928f43c2022af88f4ba850a47ad","target":"record","created_at":"2026-06-08T01:05:02Z","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":"69a9354821a7696997a0eb5ce49dff7ec171fbf2653ceed216b1c51d219ed785","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-08-20T18:54:48Z","title_canon_sha256":"ae2a959a962ec674a0a0c476b7b880d6172ce4870898d3ec97f1f3c197530f1c"},"schema_version":"1.0","source":{"id":"2508.15006","kind":"arxiv","version":2}},"canonical_sha256":"0c244aa0101e02f941e9520951fc79959887d686a80b36b5974f2f00cb288410","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c244aa0101e02f941e9520951fc79959887d686a80b36b5974f2f00cb288410","first_computed_at":"2026-06-08T01:05:02.411358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:05:02.411358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BYyPlUL7YM5FtmCSafE+8uY9/jS8w7Im1ZUiQmJ7dY0RF8zdB8M+Di+34IjzRkuUPvEjTnznToSVVFlgRyvTDQ==","signature_status":"signed_v1","signed_at":"2026-06-08T01:05:02.412459Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.15006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c4aabeb2b5f2be355cf91bde93a21b3fe9f1928f43c2022af88f4ba850a47ad","sha256:f6ee61abf454c3297c87c741f65491608917123135e6180009d46c9e49b0e155"],"state_sha256":"f93a13bd3d91bd8e600e4ac111fc18983d141eb0633824f82f4e0a29625f2e09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt+0ypkZhI/aazpsMpWMS89lseAjAjVYU3VeQeieJezCRA2ZrTIaiGQqg8V9DeyHLTYCBPGNIZ/op3ufeQD2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:45:36.387361Z","bundle_sha256":"830bd0c8b34a076b3a23c62e78e6bfbd5a3d8d28c05f4c992b2662d4d781176d"}}