{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NGVS4H63OAGARMVTYCHLZKRVCZ","short_pith_number":"pith:NGVS4H63","canonical_record":{"source":{"id":"1812.06456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-16T12:40:50Z","cross_cats_sorted":[],"title_canon_sha256":"6e0d25e53f1f7a9beaa21b529320ad59a9da6a847ae52a3b9821a74e2cec5504","abstract_canon_sha256":"768c65c3bcbcebc2ad6569e9ec9bb0759f66d03791da2bc20d8ee3f1e94f9342"},"schema_version":"1.0"},"canonical_sha256":"69ab2e1fdb700c08b2b3c08ebcaa35164081ed4c463a37ed966765f441a839df","source":{"kind":"arxiv","id":"1812.06456","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06456","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06456v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06456","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"NGVS4H63OAGA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGVS4H63OAGARMVT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGVS4H63","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NGVS4H63OAGARMVTYCHLZKRVCZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-16T12:40:50Z","cross_cats_sorted":[],"title_canon_sha256":"6e0d25e53f1f7a9beaa21b529320ad59a9da6a847ae52a3b9821a74e2cec5504","abstract_canon_sha256":"768c65c3bcbcebc2ad6569e9ec9bb0759f66d03791da2bc20d8ee3f1e94f9342"},"schema_version":"1.0"},"canonical_sha256":"69ab2e1fdb700c08b2b3c08ebcaa35164081ed4c463a37ed966765f441a839df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.785167Z","signature_b64":"3wRxdTGJs1S07FCNjnsqFpRLeae5Z3wjs9FwlEtzpTd7atHP7uKKcLtd9Krt0D/f5CE/5fQQEEWZv2CnfMrWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ab2e1fdb700c08b2b3c08ebcaa35164081ed4c463a37ed966765f441a839df","last_reissued_at":"2026-05-17T23:44:47.784534Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.784534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06456","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-05-17T23:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxzaYOp9FV7PMrJ2pAwkZYWGhBRp/m7wVBmhuZZnLb5nefPhTzn9ALLMcmJsZw6l13MaV7j5oF7hWe2Ly2YWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:57:23.494868Z"},"content_sha256":"da2cd8983000d7d64e1fb68f69024bb2843b89cd366e15fcddbb4d4ad720f0af","schema_version":"1.0","event_id":"sha256:da2cd8983000d7d64e1fb68f69024bb2843b89cd366e15fcddbb4d4ad720f0af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NGVS4H63OAGARMVTYCHLZKRVCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Stochastic Critical Node Problem over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pierre Hosteins, Rosario Scatamacchia","submitted_at":"2018-12-16T12:40:50Z","abstract_excerpt":"We tackle a stochastic version of the Critical Node Problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the attacks on nodes can fail with a certain probability. In our work we focus on trees and demonstrate that over trees the stochastic CNP actually generalizes to the stochastic Critical Element Detection Problem where attacks on edges can also fail with a certain probability. We also prove the NP-completeness of the decision version of the problem when connection costs are one, while its d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06456","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":""},"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-17T23:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94j20u4Yj0SdWs8BBJdqsxh/NwAYaCbRcCb4+jfu779XNj8ELcjg0l24ujFuK1dkWRbl2swRy0bRec6bJIwEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:57:23.495771Z"},"content_sha256":"5a099e41de770471e76cc36e0c4dc1e86fa7eac199ee8f59aeb8bd2339c66923","schema_version":"1.0","event_id":"sha256:5a099e41de770471e76cc36e0c4dc1e86fa7eac199ee8f59aeb8bd2339c66923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGVS4H63OAGARMVTYCHLZKRVCZ/bundle.json","state_url":"https://pith.science/pith/NGVS4H63OAGARMVTYCHLZKRVCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGVS4H63OAGARMVTYCHLZKRVCZ/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-05T19:57:23Z","links":{"resolver":"https://pith.science/pith/NGVS4H63OAGARMVTYCHLZKRVCZ","bundle":"https://pith.science/pith/NGVS4H63OAGARMVTYCHLZKRVCZ/bundle.json","state":"https://pith.science/pith/NGVS4H63OAGARMVTYCHLZKRVCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGVS4H63OAGARMVTYCHLZKRVCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NGVS4H63OAGARMVTYCHLZKRVCZ","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":"768c65c3bcbcebc2ad6569e9ec9bb0759f66d03791da2bc20d8ee3f1e94f9342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-16T12:40:50Z","title_canon_sha256":"6e0d25e53f1f7a9beaa21b529320ad59a9da6a847ae52a3b9821a74e2cec5504"},"schema_version":"1.0","source":{"id":"1812.06456","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06456","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06456v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06456","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"NGVS4H63OAGA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGVS4H63OAGARMVT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGVS4H63","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:5a099e41de770471e76cc36e0c4dc1e86fa7eac199ee8f59aeb8bd2339c66923","target":"graph","created_at":"2026-05-17T23:44:47Z","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":"We tackle a stochastic version of the Critical Node Problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the attacks on nodes can fail with a certain probability. In our work we focus on trees and demonstrate that over trees the stochastic CNP actually generalizes to the stochastic Critical Element Detection Problem where attacks on edges can also fail with a certain probability. We also prove the NP-completeness of the decision version of the problem when connection costs are one, while its d","authors_text":"Pierre Hosteins, Rosario Scatamacchia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-16T12:40:50Z","title":"The Stochastic Critical Node Problem over Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06456","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:da2cd8983000d7d64e1fb68f69024bb2843b89cd366e15fcddbb4d4ad720f0af","target":"record","created_at":"2026-05-17T23:44:47Z","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":"768c65c3bcbcebc2ad6569e9ec9bb0759f66d03791da2bc20d8ee3f1e94f9342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-16T12:40:50Z","title_canon_sha256":"6e0d25e53f1f7a9beaa21b529320ad59a9da6a847ae52a3b9821a74e2cec5504"},"schema_version":"1.0","source":{"id":"1812.06456","kind":"arxiv","version":2}},"canonical_sha256":"69ab2e1fdb700c08b2b3c08ebcaa35164081ed4c463a37ed966765f441a839df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ab2e1fdb700c08b2b3c08ebcaa35164081ed4c463a37ed966765f441a839df","first_computed_at":"2026-05-17T23:44:47.784534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:47.784534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3wRxdTGJs1S07FCNjnsqFpRLeae5Z3wjs9FwlEtzpTd7atHP7uKKcLtd9Krt0D/f5CE/5fQQEEWZv2CnfMrWBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:47.785167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06456","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da2cd8983000d7d64e1fb68f69024bb2843b89cd366e15fcddbb4d4ad720f0af","sha256:5a099e41de770471e76cc36e0c4dc1e86fa7eac199ee8f59aeb8bd2339c66923"],"state_sha256":"a665b5db85cd797aa0192d1281db63967294ddb4f4e7ce4cf8de17244fbe29ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWuzXR5+pYS2nXd/Pao3uJM6FsRQLO1aQl7pbPLpor7yHEED9HeWqKPl3LpZGLpEO8+JT+jsvMkMLLsCo8EyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:57:23.500637Z","bundle_sha256":"bb4abd7f9912b2bd8e8973bb37d1e1a77bccda94616edc391cf1c2bd186a26f0"}}