{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CVQ6RFZN5NQX6NMOVJXHWCTJ42","short_pith_number":"pith:CVQ6RFZN","canonical_record":{"source":{"id":"2506.11926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T16:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"718b13fa1654bd9b70197c9445d221f512fe7a1b24ea387867311b02c198b347","abstract_canon_sha256":"468a420ce691dc67367aa12aecf6f1579818c714d418ab11e8f18fea29affcd7"},"schema_version":"1.0"},"canonical_sha256":"1561e8972deb617f358eaa6e7b0a69e6962a6f2c260d338029de84f0db11e713","source":{"kind":"arxiv","id":"2506.11926","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11926","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11926v2","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11926","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"CVQ6RFZN5NQX","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_16","alias_value":"CVQ6RFZN5NQX6NMO","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_8","alias_value":"CVQ6RFZN","created_at":"2026-07-05T11:23:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CVQ6RFZN5NQX6NMOVJXHWCTJ42","target":"record","payload":{"canonical_record":{"source":{"id":"2506.11926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T16:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"718b13fa1654bd9b70197c9445d221f512fe7a1b24ea387867311b02c198b347","abstract_canon_sha256":"468a420ce691dc67367aa12aecf6f1579818c714d418ab11e8f18fea29affcd7"},"schema_version":"1.0"},"canonical_sha256":"1561e8972deb617f358eaa6e7b0a69e6962a6f2c260d338029de84f0db11e713","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:29.991243Z","signature_b64":"MpBP9oSKFfDzzJwznvdwfRgQejRzzL/FU7slzcKNhjoIMrsfrrgZ+HxEXIL/GTAh6sxQQoxYxZZyyEVGGjSOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1561e8972deb617f358eaa6e7b0a69e6962a6f2c260d338029de84f0db11e713","last_reissued_at":"2026-07-05T11:23:29.990758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:29.990758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.11926","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-07-05T11:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycfWT9XmjyMUHklCvacUKYZPaGN8ZFLxGIE5UiqgYXkqujZrL4vxii0S47mHyalR8oIk2qrAT2z9qvA3QWRDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:46:30.970865Z"},"content_sha256":"e2d0d7e6f4419f4bd5d09bd92c286e9d7846dfeb27c5bd4a73d7c2b7268e8479","schema_version":"1.0","event_id":"sha256:e2d0d7e6f4419f4bd5d09bd92c286e9d7846dfeb27c5bd4a73d7c2b7268e8479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CVQ6RFZN5NQX6NMOVJXHWCTJ42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy, Ohad Trabelsi","submitted_at":"2025-06-13T16:26:25Z","abstract_excerpt":"We consider the Global Minimum Vertex-Cut problem: given an undirected vertex-weighted graph $G$, compute a minimum-weight subset of its vertices whose removal disconnects $G$. The problem is closely related to Global Minimum Edge-Cut, where the weights are on the graph edges instead of vertices, and the goal is to compute a minimum-weight subset of edges whose removal disconnects the graph. Global Minimum Cut is one of the most basic and extensively studied problems in combinatorial optimization and graph theory. While an almost-linear time algorithm was known for the edge version of the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11926","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/2506.11926/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:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eo83z2sxp87iV6gb+x3mhbJsEAPXaAO8IpWbjsF6Xyb4O3y6NXfu/TtXEX+bFElDBbHyqd3xEBMqUMDKCbvWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:46:30.971379Z"},"content_sha256":"04325e34e9c53ddfe34d292ff403b9daef80badc2f0abc98de6acda3bc93fa05","schema_version":"1.0","event_id":"sha256:04325e34e9c53ddfe34d292ff403b9daef80badc2f0abc98de6acda3bc93fa05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42/bundle.json","state_url":"https://pith.science/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42/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-11T12:46:30Z","links":{"resolver":"https://pith.science/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42","bundle":"https://pith.science/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42/bundle.json","state":"https://pith.science/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVQ6RFZN5NQX6NMOVJXHWCTJ42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CVQ6RFZN5NQX6NMOVJXHWCTJ42","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":"468a420ce691dc67367aa12aecf6f1579818c714d418ab11e8f18fea29affcd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T16:26:25Z","title_canon_sha256":"718b13fa1654bd9b70197c9445d221f512fe7a1b24ea387867311b02c198b347"},"schema_version":"1.0","source":{"id":"2506.11926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.11926","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.11926v2","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11926","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"CVQ6RFZN5NQX","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_16","alias_value":"CVQ6RFZN5NQX6NMO","created_at":"2026-07-05T11:23:29Z"},{"alias_kind":"pith_short_8","alias_value":"CVQ6RFZN","created_at":"2026-07-05T11:23:29Z"}],"graph_snapshots":[{"event_id":"sha256:04325e34e9c53ddfe34d292ff403b9daef80badc2f0abc98de6acda3bc93fa05","target":"graph","created_at":"2026-07-05T11:23:29Z","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/2506.11926/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the Global Minimum Vertex-Cut problem: given an undirected vertex-weighted graph $G$, compute a minimum-weight subset of its vertices whose removal disconnects $G$. The problem is closely related to Global Minimum Edge-Cut, where the weights are on the graph edges instead of vertices, and the goal is to compute a minimum-weight subset of edges whose removal disconnects the graph. Global Minimum Cut is one of the most basic and extensively studied problems in combinatorial optimization and graph theory. While an almost-linear time algorithm was known for the edge version of the prob","authors_text":"Julia Chuzhoy, Ohad Trabelsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T16:26:25Z","title":"Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11926","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:e2d0d7e6f4419f4bd5d09bd92c286e9d7846dfeb27c5bd4a73d7c2b7268e8479","target":"record","created_at":"2026-07-05T11:23:29Z","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":"468a420ce691dc67367aa12aecf6f1579818c714d418ab11e8f18fea29affcd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-13T16:26:25Z","title_canon_sha256":"718b13fa1654bd9b70197c9445d221f512fe7a1b24ea387867311b02c198b347"},"schema_version":"1.0","source":{"id":"2506.11926","kind":"arxiv","version":2}},"canonical_sha256":"1561e8972deb617f358eaa6e7b0a69e6962a6f2c260d338029de84f0db11e713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1561e8972deb617f358eaa6e7b0a69e6962a6f2c260d338029de84f0db11e713","first_computed_at":"2026-07-05T11:23:29.990758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:29.990758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MpBP9oSKFfDzzJwznvdwfRgQejRzzL/FU7slzcKNhjoIMrsfrrgZ+HxEXIL/GTAh6sxQQoxYxZZyyEVGGjSOCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:29.991243Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.11926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2d0d7e6f4419f4bd5d09bd92c286e9d7846dfeb27c5bd4a73d7c2b7268e8479","sha256:04325e34e9c53ddfe34d292ff403b9daef80badc2f0abc98de6acda3bc93fa05"],"state_sha256":"e245770df6613a5480558b43c617e104f31a80b20df0763cd6cf034919005acc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QGniXWShAFAizIRO3JHaqZ4v440l8/bpGm47fFcjQJbtpsG3MKiQNNaJfIF+pzVnOooSo80CWt1c7b0YmJVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T12:46:30.975620Z","bundle_sha256":"b0eaa68a451b4b2500de39068c7502a9faced35a406e5651f4bb05b1bc283c13"}}