{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GLNKIEIXWXKHTK3CRFWNMZW33D","short_pith_number":"pith:GLNKIEIX","canonical_record":{"source":{"id":"2503.05004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-06T22:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"3f14c700a8e6843b4616c4834b4d24682f51ec41f224a0729c15ba5e38c3cef3","abstract_canon_sha256":"f370d43223fccfe2a1b8dde471ddaab15972b5e83a50d104b0d04e027ea59ca4"},"schema_version":"1.0"},"canonical_sha256":"32daa41117b5d479ab62896cd666dbd8e6d4f588c7b8fd6b3cd7c6dd9aaad3b3","source":{"kind":"arxiv","id":"2503.05004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05004","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05004v1","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05004","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"GLNKIEIXWXKH","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLNKIEIXWXKHTK3C","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLNKIEIX","created_at":"2026-07-05T10:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GLNKIEIXWXKHTK3CRFWNMZW33D","target":"record","payload":{"canonical_record":{"source":{"id":"2503.05004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-06T22:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"3f14c700a8e6843b4616c4834b4d24682f51ec41f224a0729c15ba5e38c3cef3","abstract_canon_sha256":"f370d43223fccfe2a1b8dde471ddaab15972b5e83a50d104b0d04e027ea59ca4"},"schema_version":"1.0"},"canonical_sha256":"32daa41117b5d479ab62896cd666dbd8e6d4f588c7b8fd6b3cd7c6dd9aaad3b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:18.087376Z","signature_b64":"GWv1p2abJKRW+qaOnVCXAfc4+WTh2lTh5CA4VJ42YjVQf1q9N57WRkiyYdZ5MibDcmmqLB1UMFWPJghorAE8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32daa41117b5d479ab62896cd666dbd8e6d4f588c7b8fd6b3cd7c6dd9aaad3b3","last_reissued_at":"2026-07-05T10:26:18.086756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:18.086756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.05004","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-05T10:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqvqhjOPq41+OL0p4P0KghTjVubY8v53mH2FCQMr3tJznWNRduV+83leSMavmDLDuleBxeZl5jJmeG1wx6SBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:39:13.786936Z"},"content_sha256":"e94623cf852611767d49a88e9bcfabddcc454d0b819c91ee5948cd226aac2ba6","schema_version":"1.0","event_id":"sha256:e94623cf852611767d49a88e9bcfabddcc454d0b819c91ee5948cd226aac2ba6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GLNKIEIXWXKHTK3CRFWNMZW33D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Global Minimum Cut with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Moseley, Helia Niaparast, Karan Singh","submitted_at":"2025-03-06T22:09:21Z","abstract_excerpt":"Global minimum cut is a fundamental combinatorial optimization problem with wide-ranging applications. Often in practice, these problems are solved repeatedly on families of similar or related instances. However, the de facto algorithmic approach is to solve each instance of the problem from scratch discarding information from prior instances.\n  In this paper, we consider how predictions informed by prior instances can be used to warm-start practical minimum cut algorithms. The paper considers the widely used Karger's algorithm and its counterpart, the Karger-Stein algorithm. Given good predic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05004","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/2503.05004/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-05T10:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtyoJurbFzLiLa7QYIti0HgqUELrVYzZridGotRHw7XdkpWrop7iIM2Fnn3WBlcdVoAJhhqohhoEouE0KmEiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:39:13.787505Z"},"content_sha256":"d91af147b4fc24b67c3eb16cad5195893eeef5c9a57f256c3890b210fa758c16","schema_version":"1.0","event_id":"sha256:d91af147b4fc24b67c3eb16cad5195893eeef5c9a57f256c3890b210fa758c16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLNKIEIXWXKHTK3CRFWNMZW33D/bundle.json","state_url":"https://pith.science/pith/GLNKIEIXWXKHTK3CRFWNMZW33D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLNKIEIXWXKHTK3CRFWNMZW33D/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-03T19:39:13Z","links":{"resolver":"https://pith.science/pith/GLNKIEIXWXKHTK3CRFWNMZW33D","bundle":"https://pith.science/pith/GLNKIEIXWXKHTK3CRFWNMZW33D/bundle.json","state":"https://pith.science/pith/GLNKIEIXWXKHTK3CRFWNMZW33D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLNKIEIXWXKHTK3CRFWNMZW33D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GLNKIEIXWXKHTK3CRFWNMZW33D","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":"f370d43223fccfe2a1b8dde471ddaab15972b5e83a50d104b0d04e027ea59ca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-06T22:09:21Z","title_canon_sha256":"3f14c700a8e6843b4616c4834b4d24682f51ec41f224a0729c15ba5e38c3cef3"},"schema_version":"1.0","source":{"id":"2503.05004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05004","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05004v1","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05004","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"GLNKIEIXWXKH","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLNKIEIXWXKHTK3C","created_at":"2026-07-05T10:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLNKIEIX","created_at":"2026-07-05T10:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:d91af147b4fc24b67c3eb16cad5195893eeef5c9a57f256c3890b210fa758c16","target":"graph","created_at":"2026-07-05T10:26:18Z","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/2503.05004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Global minimum cut is a fundamental combinatorial optimization problem with wide-ranging applications. Often in practice, these problems are solved repeatedly on families of similar or related instances. However, the de facto algorithmic approach is to solve each instance of the problem from scratch discarding information from prior instances.\n  In this paper, we consider how predictions informed by prior instances can be used to warm-start practical minimum cut algorithms. The paper considers the widely used Karger's algorithm and its counterpart, the Karger-Stein algorithm. Given good predic","authors_text":"Benjamin Moseley, Helia Niaparast, Karan Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-06T22:09:21Z","title":"Faster Global Minimum Cut with Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05004","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:e94623cf852611767d49a88e9bcfabddcc454d0b819c91ee5948cd226aac2ba6","target":"record","created_at":"2026-07-05T10:26:18Z","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":"f370d43223fccfe2a1b8dde471ddaab15972b5e83a50d104b0d04e027ea59ca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-06T22:09:21Z","title_canon_sha256":"3f14c700a8e6843b4616c4834b4d24682f51ec41f224a0729c15ba5e38c3cef3"},"schema_version":"1.0","source":{"id":"2503.05004","kind":"arxiv","version":1}},"canonical_sha256":"32daa41117b5d479ab62896cd666dbd8e6d4f588c7b8fd6b3cd7c6dd9aaad3b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32daa41117b5d479ab62896cd666dbd8e6d4f588c7b8fd6b3cd7c6dd9aaad3b3","first_computed_at":"2026-07-05T10:26:18.086756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:26:18.086756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GWv1p2abJKRW+qaOnVCXAfc4+WTh2lTh5CA4VJ42YjVQf1q9N57WRkiyYdZ5MibDcmmqLB1UMFWPJghorAE8Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:26:18.087376Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.05004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e94623cf852611767d49a88e9bcfabddcc454d0b819c91ee5948cd226aac2ba6","sha256:d91af147b4fc24b67c3eb16cad5195893eeef5c9a57f256c3890b210fa758c16"],"state_sha256":"fa75acf29604328cec5fa858b2304d4c84b60353ef1deeffd7f541b77f043db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7llrr8BDf/xdki6eCPGfNhY7ECMjC30xGvPEJfYHb8harUBMWRdrBTIz3tGjSSzWP/M0Swd1fp7yMyK9pw3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:39:13.790788Z","bundle_sha256":"ef7a35836dd3896e62e45ea544583a93896015eb3e1da78ff7e8965a3fcc1b55"}}