{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RCQFCEKSICRDN53V2FUCKN5GJL","short_pith_number":"pith:RCQFCEKS","canonical_record":{"source":{"id":"1309.6689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T23:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"a703481d86bf2dccc339a782dab3f903f3d2a8f6f86bd262a803eb05765418c5","abstract_canon_sha256":"b9e41fcda0f9b48729a34ee13899e39279b82c7f90f87244dcd4bee8660b710b"},"schema_version":"1.0"},"canonical_sha256":"88a051115240a236f775d1682537a64acb2a88898622b29f78bc5d71a182a5b6","source":{"kind":"arxiv","id":"1309.6689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6689","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6689v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6689","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"RCQFCEKSICRD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCQFCEKSICRDN53V","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCQFCEKS","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RCQFCEKSICRDN53V2FUCKN5GJL","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T23:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"a703481d86bf2dccc339a782dab3f903f3d2a8f6f86bd262a803eb05765418c5","abstract_canon_sha256":"b9e41fcda0f9b48729a34ee13899e39279b82c7f90f87244dcd4bee8660b710b"},"schema_version":"1.0"},"canonical_sha256":"88a051115240a236f775d1682537a64acb2a88898622b29f78bc5d71a182a5b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.862691Z","signature_b64":"GG/PoBwF7ZdRjZUxQjIzrl/gvckmllWpTmPRKJPpwPwXDxVWjwGlqD5kCVZVDo9TjyX2DuBTJmKayaqiCelEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a051115240a236f775d1682537a64acb2a88898622b29f78bc5d71a182a5b6","last_reissued_at":"2026-05-18T03:12:10.861966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.861966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6689","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-05-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14La1M3ur/WNsn3ryVDMLN13cCa5cU6J0zEhUlhT3CDhcmeYVQBDYIgOi2YiKcF2Cep2ix2zsc7UPY9K9uh2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:35:46.170859Z"},"content_sha256":"08c63c94821ce428880c13f1582b5a6fba29838999b3291f6589d452f498f683","schema_version":"1.0","event_id":"sha256:08c63c94821ce428880c13f1582b5a6fba29838999b3291f6589d452f498f683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RCQFCEKSICRDN53V2FUCKN5GJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Connectivity Preserving Minimum Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jinhui Xu, Qi Duan","submitted_at":"2013-09-25T23:04:57Z","abstract_excerpt":"In this paper, we study a generalization of the classical minimum cut prob- lem, called Connectivity Preserving Minimum Cut (CPMC) problem, which seeks a minimum cut to separate a pair (or pairs) of source and destination nodes and meanwhile ensure the connectivity between the source and its partner node(s). The CPMC problem is a rather powerful formulation for a set of problems and finds applications in many other areas, such as network security, image processing, data mining, pattern recognition, and machine learning. For this important problem, we consider two variants, connectiv- ity prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6689","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":""},"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-05-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zM59RwzbCzHejPbTHn92l6XBZf6DHqmnUl454Bgmw7ObYCoAweO7dylPhNvjFh0ES+uPpea65McWS4smyDb7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:35:46.171206Z"},"content_sha256":"2ed7ce7a992e77acf1a936033e98261227977846a29dbb4b95c0f85709947c0d","schema_version":"1.0","event_id":"sha256:2ed7ce7a992e77acf1a936033e98261227977846a29dbb4b95c0f85709947c0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCQFCEKSICRDN53V2FUCKN5GJL/bundle.json","state_url":"https://pith.science/pith/RCQFCEKSICRDN53V2FUCKN5GJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCQFCEKSICRDN53V2FUCKN5GJL/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-03T22:35:46Z","links":{"resolver":"https://pith.science/pith/RCQFCEKSICRDN53V2FUCKN5GJL","bundle":"https://pith.science/pith/RCQFCEKSICRDN53V2FUCKN5GJL/bundle.json","state":"https://pith.science/pith/RCQFCEKSICRDN53V2FUCKN5GJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCQFCEKSICRDN53V2FUCKN5GJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RCQFCEKSICRDN53V2FUCKN5GJL","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":"b9e41fcda0f9b48729a34ee13899e39279b82c7f90f87244dcd4bee8660b710b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T23:04:57Z","title_canon_sha256":"a703481d86bf2dccc339a782dab3f903f3d2a8f6f86bd262a803eb05765418c5"},"schema_version":"1.0","source":{"id":"1309.6689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6689","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6689v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6689","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"RCQFCEKSICRD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCQFCEKSICRDN53V","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCQFCEKS","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2ed7ce7a992e77acf1a936033e98261227977846a29dbb4b95c0f85709947c0d","target":"graph","created_at":"2026-05-18T03:12:10Z","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"},"paper":{"abstract_excerpt":"In this paper, we study a generalization of the classical minimum cut prob- lem, called Connectivity Preserving Minimum Cut (CPMC) problem, which seeks a minimum cut to separate a pair (or pairs) of source and destination nodes and meanwhile ensure the connectivity between the source and its partner node(s). The CPMC problem is a rather powerful formulation for a set of problems and finds applications in many other areas, such as network security, image processing, data mining, pattern recognition, and machine learning. For this important problem, we consider two variants, connectiv- ity prese","authors_text":"Jinhui Xu, Qi Duan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T23:04:57Z","title":"On the Connectivity Preserving Minimum Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6689","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:08c63c94821ce428880c13f1582b5a6fba29838999b3291f6589d452f498f683","target":"record","created_at":"2026-05-18T03:12:10Z","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":"b9e41fcda0f9b48729a34ee13899e39279b82c7f90f87244dcd4bee8660b710b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-25T23:04:57Z","title_canon_sha256":"a703481d86bf2dccc339a782dab3f903f3d2a8f6f86bd262a803eb05765418c5"},"schema_version":"1.0","source":{"id":"1309.6689","kind":"arxiv","version":1}},"canonical_sha256":"88a051115240a236f775d1682537a64acb2a88898622b29f78bc5d71a182a5b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88a051115240a236f775d1682537a64acb2a88898622b29f78bc5d71a182a5b6","first_computed_at":"2026-05-18T03:12:10.861966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.861966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GG/PoBwF7ZdRjZUxQjIzrl/gvckmllWpTmPRKJPpwPwXDxVWjwGlqD5kCVZVDo9TjyX2DuBTJmKayaqiCelEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.862691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c63c94821ce428880c13f1582b5a6fba29838999b3291f6589d452f498f683","sha256:2ed7ce7a992e77acf1a936033e98261227977846a29dbb4b95c0f85709947c0d"],"state_sha256":"b0b033a9a2711adce6ea05d037bd40383a0e084a867b11b489806677a1ff8304"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvadSQzV6o3ySc9fp/WZSA6uW+Vkv93NZjt6iBspTFLp/y6GVaDcucpoXpBcvG98wkEv8ZfcYPmTmun9qTH0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:35:46.173100Z","bundle_sha256":"b5dac1d64176b6b0f2ec84ba8a3b3c2b09eb3da1afe5238cdc6da69c0d3a67ee"}}