{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CLHVA6LZZIZNDGVTZY6BXCWUEX","short_pith_number":"pith:CLHVA6LZ","canonical_record":{"source":{"id":"1704.04555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T23:25:33Z","cross_cats_sorted":[],"title_canon_sha256":"450319fe85d61d24cb123af698886cb21359c45fb0633cb49daf9fafdf83e648","abstract_canon_sha256":"4f46b98a73eeffb04358f554698dd16c5cd9025695041ce14f315308be8e78f2"},"schema_version":"1.0"},"canonical_sha256":"12cf507979ca32d19ab3ce3c1b8ad425eddbd561561b703698e642067f7c9ded","source":{"kind":"arxiv","id":"1704.04555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04555","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04555v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04555","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"CLHVA6LZZIZN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CLHVA6LZZIZNDGVT","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CLHVA6LZ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CLHVA6LZZIZNDGVTZY6BXCWUEX","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T23:25:33Z","cross_cats_sorted":[],"title_canon_sha256":"450319fe85d61d24cb123af698886cb21359c45fb0633cb49daf9fafdf83e648","abstract_canon_sha256":"4f46b98a73eeffb04358f554698dd16c5cd9025695041ce14f315308be8e78f2"},"schema_version":"1.0"},"canonical_sha256":"12cf507979ca32d19ab3ce3c1b8ad425eddbd561561b703698e642067f7c9ded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.200939Z","signature_b64":"b91UjFIeshrEAw+Y6Lx1pbdGetEka2SsKOGPdvMwIA/VCVwaKARLIJNpaMoH1AVB1VBVJZrDXWSgmvNosHMiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12cf507979ca32d19ab3ce3c1b8ad425eddbd561561b703698e642067f7c9ded","last_reissued_at":"2026-05-18T00:46:18.200609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.200609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04555","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-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIbC7zllomwcQxkmt086h8qbxA/2clGrzl3xRXYIf0pa0YB8ocBeCElMuQvSeHKRh6dFgPyK464nkncTKKDJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:04:35.429914Z"},"content_sha256":"77a9eacada60046f80067667579a13762bad6896ff9da1f64fb63313ba3dab99","schema_version":"1.0","event_id":"sha256:77a9eacada60046f80067667579a13762bad6896ff9da1f64fb63313ba3dab99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CLHVA6LZZIZNDGVTZY6BXCWUEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo-Separation for Assessment of Structural Vulnerability of a Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Kuhnle, Md Abdul Alim, My T. Thai, Tianyi Pan, Victoria G. Crawford","submitted_at":"2017-04-14T23:25:33Z","abstract_excerpt":"Based upon the idea that network functionality is impaired if two nodes in a network are sufficiently separated in terms of a given metric, we introduce two combinatorial \\emph{pseudocut} problems generalizing the classical min-cut and multi-cut problems. We expect the pseudocut problems will find broad relevance to the study of network reliability. We comprehensively analyze the computational complexity of the pseudocut problems and provide three approximation algorithms for these problems.\n  Motivated by applications in communication networks with strict Quality-of-Service (QoS) requirements"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04555","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-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YadTWEjkEONpwHQPg25/1t0B9LFoH/ZONfo/SPYny7+yfWlfBJK+S7cPDVSFaRhpPb+/D8iYBsLCciqPMYrIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:04:35.430250Z"},"content_sha256":"19fcef07296825c518df8503aa5a684156217d1a47b652e2c8c2491889cc5fab","schema_version":"1.0","event_id":"sha256:19fcef07296825c518df8503aa5a684156217d1a47b652e2c8c2491889cc5fab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX/bundle.json","state_url":"https://pith.science/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX/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-04T11:04:35Z","links":{"resolver":"https://pith.science/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX","bundle":"https://pith.science/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX/bundle.json","state":"https://pith.science/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLHVA6LZZIZNDGVTZY6BXCWUEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CLHVA6LZZIZNDGVTZY6BXCWUEX","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":"4f46b98a73eeffb04358f554698dd16c5cd9025695041ce14f315308be8e78f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T23:25:33Z","title_canon_sha256":"450319fe85d61d24cb123af698886cb21359c45fb0633cb49daf9fafdf83e648"},"schema_version":"1.0","source":{"id":"1704.04555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04555","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04555v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04555","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"CLHVA6LZZIZN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CLHVA6LZZIZNDGVT","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CLHVA6LZ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:19fcef07296825c518df8503aa5a684156217d1a47b652e2c8c2491889cc5fab","target":"graph","created_at":"2026-05-18T00:46:18Z","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":"Based upon the idea that network functionality is impaired if two nodes in a network are sufficiently separated in terms of a given metric, we introduce two combinatorial \\emph{pseudocut} problems generalizing the classical min-cut and multi-cut problems. We expect the pseudocut problems will find broad relevance to the study of network reliability. We comprehensively analyze the computational complexity of the pseudocut problems and provide three approximation algorithms for these problems.\n  Motivated by applications in communication networks with strict Quality-of-Service (QoS) requirements","authors_text":"Alan Kuhnle, Md Abdul Alim, My T. Thai, Tianyi Pan, Victoria G. Crawford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T23:25:33Z","title":"Pseudo-Separation for Assessment of Structural Vulnerability of a Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04555","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:77a9eacada60046f80067667579a13762bad6896ff9da1f64fb63313ba3dab99","target":"record","created_at":"2026-05-18T00:46:18Z","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":"4f46b98a73eeffb04358f554698dd16c5cd9025695041ce14f315308be8e78f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T23:25:33Z","title_canon_sha256":"450319fe85d61d24cb123af698886cb21359c45fb0633cb49daf9fafdf83e648"},"schema_version":"1.0","source":{"id":"1704.04555","kind":"arxiv","version":1}},"canonical_sha256":"12cf507979ca32d19ab3ce3c1b8ad425eddbd561561b703698e642067f7c9ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12cf507979ca32d19ab3ce3c1b8ad425eddbd561561b703698e642067f7c9ded","first_computed_at":"2026-05-18T00:46:18.200609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.200609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b91UjFIeshrEAw+Y6Lx1pbdGetEka2SsKOGPdvMwIA/VCVwaKARLIJNpaMoH1AVB1VBVJZrDXWSgmvNosHMiDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.200939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77a9eacada60046f80067667579a13762bad6896ff9da1f64fb63313ba3dab99","sha256:19fcef07296825c518df8503aa5a684156217d1a47b652e2c8c2491889cc5fab"],"state_sha256":"687b72061b7e72a8fb9c13579dd04ab63b3e8dd554885de249b2047d07dc2062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfTGBpBwCRZrz+HZdLOVTmupjVuaVpw8KTq9wX6Ll1QX7qR6lTBDkW2I5du/SjEb8EWvGvCIvTz/sn2Cu5KnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:04:35.432088Z","bundle_sha256":"edbca9ff91ba4dd52fe003f563b188c3bf8723aea9b36ece279ffc3eb35104bd"}}