{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HSZWZRGWZLMMBJYBYYN23WEORY","short_pith_number":"pith:HSZWZRGW","canonical_record":{"source":{"id":"2402.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-06T06:05:11Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"32f9664decae98d6b9e24c9c4b4bdd08c047098e9e7c4ae14329b33297089ab6","abstract_canon_sha256":"76392db9b97355db8dd1d09be8564cca2ce4c1da0cd626a033d59c2a6505b1ac"},"schema_version":"1.0"},"canonical_sha256":"3cb36cc4d6cad8c0a701c61badd88e8e1ccf508350f5ba5f9dd2a5d32cfd4019","source":{"kind":"arxiv","id":"2402.03736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.03736","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"2402.03736v1","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03736","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"HSZWZRGWZLMM","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"pith_short_16","alias_value":"HSZWZRGWZLMMBJYB","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"pith_short_8","alias_value":"HSZWZRGW","created_at":"2026-07-05T07:41:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HSZWZRGWZLMMBJYBYYN23WEORY","target":"record","payload":{"canonical_record":{"source":{"id":"2402.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-06T06:05:11Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"32f9664decae98d6b9e24c9c4b4bdd08c047098e9e7c4ae14329b33297089ab6","abstract_canon_sha256":"76392db9b97355db8dd1d09be8564cca2ce4c1da0cd626a033d59c2a6505b1ac"},"schema_version":"1.0"},"canonical_sha256":"3cb36cc4d6cad8c0a701c61badd88e8e1ccf508350f5ba5f9dd2a5d32cfd4019","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:57.612549Z","signature_b64":"oOzckdXvbW81Rd5/9KpIMLjDnW69ufEaKlC/I7zxSXknAsTbyX9AnmpdoAkTBa7xyoji8cslknn5/o+qV78GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cb36cc4d6cad8c0a701c61badd88e8e1ccf508350f5ba5f9dd2a5d32cfd4019","last_reissued_at":"2026-07-05T07:41:57.612096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:57.612096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.03736","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-05T07:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4lz/o3pU4qav+9CYb/MjdSF9C+GP1qdfoMG/RWUigrw4B3f6YxrmupIPpaC/bnteCEYKiuvGJMfdo9dmzMUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:12:05.133207Z"},"content_sha256":"3972b103b9ad87301a88c8323375cf0f7eadbf8198ec6c89d65d465ca147ba86","schema_version":"1.0","event_id":"sha256:3972b103b9ad87301a88c8323375cf0f7eadbf8198ec6c89d65d465ca147ba86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HSZWZRGWZLMMBJYBYYN23WEORY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jinghui Xue, Jiongzhi Zheng, Kun He, Mingming Jin","submitted_at":"2024-02-06T06:05:11Z","abstract_excerpt":"The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at least |V|-s, where the vertex connectivity equals the minimum number of vertices whose deletion yields a disconnected or trivial graph. MBP is NP-hard and holds relevance in numerous realworld scenarios emphasizing the vertex connectivity. Exact algorithms for MBP mainly follow the branch-and-bound (BnB) framework, whose performance heavily depends on the quality of the upper bound on the cardinality of a maximum s-bun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03736","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/2402.03736/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-05T07:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWQbEU+H69LK2/tHztQJIygjBMjLHGbSCn1uMyEGfLDUB3LaFbH+tdS7vZh3CJK+j/0xbF5M6O4+n6/33bw+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:12:05.133814Z"},"content_sha256":"425002522efb9b7a7a33386784e04d7526fb4b848bb33fddb12a7923f51370a8","schema_version":"1.0","event_id":"sha256:425002522efb9b7a7a33386784e04d7526fb4b848bb33fddb12a7923f51370a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSZWZRGWZLMMBJYBYYN23WEORY/bundle.json","state_url":"https://pith.science/pith/HSZWZRGWZLMMBJYBYYN23WEORY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSZWZRGWZLMMBJYBYYN23WEORY/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-23T14:12:05Z","links":{"resolver":"https://pith.science/pith/HSZWZRGWZLMMBJYBYYN23WEORY","bundle":"https://pith.science/pith/HSZWZRGWZLMMBJYBYYN23WEORY/bundle.json","state":"https://pith.science/pith/HSZWZRGWZLMMBJYBYYN23WEORY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSZWZRGWZLMMBJYBYYN23WEORY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HSZWZRGWZLMMBJYBYYN23WEORY","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":"76392db9b97355db8dd1d09be8564cca2ce4c1da0cd626a033d59c2a6505b1ac","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-06T06:05:11Z","title_canon_sha256":"32f9664decae98d6b9e24c9c4b4bdd08c047098e9e7c4ae14329b33297089ab6"},"schema_version":"1.0","source":{"id":"2402.03736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.03736","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"2402.03736v1","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03736","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"HSZWZRGWZLMM","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"pith_short_16","alias_value":"HSZWZRGWZLMMBJYB","created_at":"2026-07-05T07:41:57Z"},{"alias_kind":"pith_short_8","alias_value":"HSZWZRGW","created_at":"2026-07-05T07:41:57Z"}],"graph_snapshots":[{"event_id":"sha256:425002522efb9b7a7a33386784e04d7526fb4b848bb33fddb12a7923f51370a8","target":"graph","created_at":"2026-07-05T07:41:57Z","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/2402.03736/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at least |V|-s, where the vertex connectivity equals the minimum number of vertices whose deletion yields a disconnected or trivial graph. MBP is NP-hard and holds relevance in numerous realworld scenarios emphasizing the vertex connectivity. Exact algorithms for MBP mainly follow the branch-and-bound (BnB) framework, whose performance heavily depends on the quality of the upper bound on the cardinality of a maximum s-bun","authors_text":"Jinghui Xue, Jiongzhi Zheng, Kun He, Mingming Jin","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-06T06:05:11Z","title":"An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03736","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:3972b103b9ad87301a88c8323375cf0f7eadbf8198ec6c89d65d465ca147ba86","target":"record","created_at":"2026-07-05T07:41:57Z","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":"76392db9b97355db8dd1d09be8564cca2ce4c1da0cd626a033d59c2a6505b1ac","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-06T06:05:11Z","title_canon_sha256":"32f9664decae98d6b9e24c9c4b4bdd08c047098e9e7c4ae14329b33297089ab6"},"schema_version":"1.0","source":{"id":"2402.03736","kind":"arxiv","version":1}},"canonical_sha256":"3cb36cc4d6cad8c0a701c61badd88e8e1ccf508350f5ba5f9dd2a5d32cfd4019","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cb36cc4d6cad8c0a701c61badd88e8e1ccf508350f5ba5f9dd2a5d32cfd4019","first_computed_at":"2026-07-05T07:41:57.612096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:41:57.612096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oOzckdXvbW81Rd5/9KpIMLjDnW69ufEaKlC/I7zxSXknAsTbyX9AnmpdoAkTBa7xyoji8cslknn5/o+qV78GAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:41:57.612549Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.03736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3972b103b9ad87301a88c8323375cf0f7eadbf8198ec6c89d65d465ca147ba86","sha256:425002522efb9b7a7a33386784e04d7526fb4b848bb33fddb12a7923f51370a8"],"state_sha256":"b700facc3d920d42b19f479a433b6cc3ab891bd55502966fbe6dfd4e124c48e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpSI7P0M9t/PrG4i7e/uJGxvKFXpg+abaLKT37DFv43D08zTZ3dac4G8hxUIM0cuKTLEmQjCLivsQMTyGX3dAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T14:12:05.138147Z","bundle_sha256":"3113eefcdd9c54196f115eec3f129ba684576653c3e6b895d50355af1245fbe1"}}