{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:M7LA5S5JSXSTFMDHVFYGCZOLYP","short_pith_number":"pith:M7LA5S5J","canonical_record":{"source":{"id":"2602.04984","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-02-04T19:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"315bc6abd58d86d73841baf15262054343e63cf32d242858667ea6bb5d2389fd","abstract_canon_sha256":"83a97c1cfdcfafab1f83a72ea6e2f41cdb6f23b4c0d1ebbaa23ff8b3b94578e5"},"schema_version":"1.0"},"canonical_sha256":"67d60ecba995e532b067a9706165cbc3d80e39214ac0b15551f0b37e84d86053","source":{"kind":"arxiv","id":"2602.04984","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:M7LA5S5JSXSTFMDHVFYGCZOLYP","target":"record","payload":{"canonical_record":{"source":{"id":"2602.04984","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-02-04T19:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"315bc6abd58d86d73841baf15262054343e63cf32d242858667ea6bb5d2389fd","abstract_canon_sha256":"83a97c1cfdcfafab1f83a72ea6e2f41cdb6f23b4c0d1ebbaa23ff8b3b94578e5"},"schema_version":"1.0"},"canonical_sha256":"67d60ecba995e532b067a9706165cbc3d80e39214ac0b15551f0b37e84d86053","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:06.970566Z","signature_b64":"yLNLsj95Z0AvXSt7KW+7EmcppUgooB0HEG9uRP/xQ/f4wZbVXN1+RfOEm6SDkGfzBv3I8UBueZLf7VkhCnEQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67d60ecba995e532b067a9706165cbc3d80e39214ac0b15551f0b37e84d86053","last_reissued_at":"2026-06-08T01:05:06.969580Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:06.969580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.04984","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrR2+xB/z7P8QPgvLo+oXhwSGR3k716EtFuP5hnbn8WmWDe74iyEDzN9FIiXbecsFnXyIorRfShyoc6cFl+rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:57:31.813235Z"},"content_sha256":"db6d09e7ce38ad7aed4ef16b1e929c2fc2bef22fb13f6fc583a4767395697a9a","schema_version":"1.0","event_id":"sha256:db6d09e7ce38ad7aed4ef16b1e929c2fc2bef22fb13f6fc583a4767395697a9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:M7LA5S5JSXSTFMDHVFYGCZOLYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branch-and-price strikes back for the k-vertex cut problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher Hojny, Fabio Ciccarelli, Fabio Furini, Marco L\\\"ubbecke","submitted_at":"2026-02-04T19:16:08Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04984","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/2602.04984/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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eV7SWUqqBFNvYRGXcIB37k6Ot2v4u7kULTkq9ldreHJPv6mj2P+m/iEdiOYyvTnDnB3tDw5FDzjYXCLf3Y2dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:57:31.813640Z"},"content_sha256":"3b0cb63276d4c9854532c4e74c1a41f94c23111bd49830ef1adc95b2cb5ba612","schema_version":"1.0","event_id":"sha256:3b0cb63276d4c9854532c4e74c1a41f94c23111bd49830ef1adc95b2cb5ba612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP/bundle.json","state_url":"https://pith.science/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP/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-25T23:57:31Z","links":{"resolver":"https://pith.science/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP","bundle":"https://pith.science/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP/bundle.json","state":"https://pith.science/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7LA5S5JSXSTFMDHVFYGCZOLYP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EhPcwqzqtk25XUiV75GT7aiDvbhwbNJFE/zNet6mH8nBY1tyhEkQ+WZRfL0qAb2XPWNBFUcL+oqXlF53zQMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:57:31.815847Z","bundle_sha256":"e917d7f468b098fc3cdcd7dd134961d740158cf82c3b3a36bed11bedcce59412"}}