{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:M7LA5S5JSXSTFMDHVFYGCZOLYP","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":"83a97c1cfdcfafab1f83a72ea6e2f41cdb6f23b4c0d1ebbaa23ff8b3b94578e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-02-04T19:16:08Z","title_canon_sha256":"315bc6abd58d86d73841baf15262054343e63cf32d242858667ea6bb5d2389fd"},"schema_version":"1.0","source":{"id":"2602.04984","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.04984","created_at":"2026-06-08T01:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2602.04984v2","created_at":"2026-06-08T01:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.04984","created_at":"2026-06-08T01:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"M7LA5S5JSXST","created_at":"2026-06-08T01:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"M7LA5S5JSXSTFMDH","created_at":"2026-06-08T01:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"M7LA5S5J","created_at":"2026-06-08T01:05:06Z"}],"graph_snapshots":[{"event_id":"sha256:3b0cb63276d4c9854532c4e74c1a41f94c23111bd49830ef1adc95b2cb5ba612","target":"graph","created_at":"2026-06-08T01:05:06Z","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/2602.04984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an undirected graph, the k-vertex cut problem (k-VCP) asks for a minimum-cost set of vertices whose removal yields at least k connected components in the resulting graph. The k-VCP is an important problem in network optimization, with applications in infrastructure protection and epidemic containment. We present a new extended integer linear programming (ILP) formulation that unifies and strengthens existing models and serves as the foundation for a new branch-and-price algorithm for the k-VCP. An in-depth theoretical study enables us to devise algorithmic components such as tailored bra","authors_text":"Christopher Hojny, Fabio Ciccarelli, Fabio Furini, Marco L\\\"ubbecke","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-02-04T19:16:08Z","title":"Branch-and-price strikes back for the k-vertex cut problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04984","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:db6d09e7ce38ad7aed4ef16b1e929c2fc2bef22fb13f6fc583a4767395697a9a","target":"record","created_at":"2026-06-08T01:05:06Z","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":"83a97c1cfdcfafab1f83a72ea6e2f41cdb6f23b4c0d1ebbaa23ff8b3b94578e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-02-04T19:16:08Z","title_canon_sha256":"315bc6abd58d86d73841baf15262054343e63cf32d242858667ea6bb5d2389fd"},"schema_version":"1.0","source":{"id":"2602.04984","kind":"arxiv","version":2}},"canonical_sha256":"67d60ecba995e532b067a9706165cbc3d80e39214ac0b15551f0b37e84d86053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67d60ecba995e532b067a9706165cbc3d80e39214ac0b15551f0b37e84d86053","first_computed_at":"2026-06-08T01:05:06.969580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:05:06.969580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yLNLsj95Z0AvXSt7KW+7EmcppUgooB0HEG9uRP/xQ/f4wZbVXN1+RfOEm6SDkGfzBv3I8UBueZLf7VkhCnEQAA==","signature_status":"signed_v1","signed_at":"2026-06-08T01:05:06.970566Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.04984","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db6d09e7ce38ad7aed4ef16b1e929c2fc2bef22fb13f6fc583a4767395697a9a","sha256:3b0cb63276d4c9854532c4e74c1a41f94c23111bd49830ef1adc95b2cb5ba612"],"state_sha256":"58bc5eaab83eb8cc834277d17cfc787fb56be555084113e9d8d36f189bca6f39"}