{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TLQDKYPNNYRRFMO5IINNPXDQ7K","short_pith_number":"pith:TLQDKYPN","canonical_record":{"source":{"id":"1605.03694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-05-12T06:34:25Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5586e69b72a9e0c7b6773a849f793f3656b60bb6cb6b395487e0ef95465f53a9","abstract_canon_sha256":"728439ac60305c3dfffbcd8afe9aeb67545c2751b926f7e6ae8156e8ed746f22"},"schema_version":"1.0"},"canonical_sha256":"9ae03561ed6e2312b1dd421ad7dc70fa9034aef5bac30adbcdd4e7aebc1e17f2","source":{"kind":"arxiv","id":"1605.03694","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03694","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03694v2","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03694","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"TLQDKYPNNYRR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TLQDKYPNNYRRFMO5","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TLQDKYPN","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TLQDKYPNNYRRFMO5IINNPXDQ7K","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-05-12T06:34:25Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5586e69b72a9e0c7b6773a849f793f3656b60bb6cb6b395487e0ef95465f53a9","abstract_canon_sha256":"728439ac60305c3dfffbcd8afe9aeb67545c2751b926f7e6ae8156e8ed746f22"},"schema_version":"1.0"},"canonical_sha256":"9ae03561ed6e2312b1dd421ad7dc70fa9034aef5bac30adbcdd4e7aebc1e17f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:46.129133Z","signature_b64":"UWOduqqKzKM0rIDX/AOSoepQAop33RJBLtvuajaRXZJULahcOyegM6KUhrZghNS4cqbPXYwL3hvBT8CwlnG3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ae03561ed6e2312b1dd421ad7dc70fa9034aef5bac30adbcdd4e7aebc1e17f2","last_reissued_at":"2026-05-18T00:56:46.128468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:46.128468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03694","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-18T00:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnjxZZ0+tfNRZSEvw8698z5QYgbhEAmpBjWqxa9pUDPrzW+2PuGrOBsqtG2BCK+8dx7Mb5H7E1AeXsIGl8AOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:37:24.854736Z"},"content_sha256":"ad854825408dc59b5431d29d8caec2185803422941f5a88dd4b316502e64c845","schema_version":"1.0","event_id":"sha256:ad854825408dc59b5431d29d8caec2185803422941f5a88dd4b316502e64c845"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TLQDKYPNNYRRFMO5IINNPXDQ7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fragmenting networks by targeting collective influencers at a mesoscopic level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Naoki Masuda, Teruyoshi Kobayashi","submitted_at":"2016-05-12T06:34:25Z","abstract_excerpt":"A practical approach to protecting networks against epidemic processes such as spreading of infectious diseases, malware, and harmful viral information is to remove some influential nodes beforehand to fragment the network into small components. Because determining the optimal order to remove nodes is a computationally hard problem, various approximate algorithms have been proposed to efficiently fragment networks by sequential node removal. Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms. In fact, ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03694","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-18T00:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"erHMhS9XmU5vtb4QtxgU68YIVxM413V7AxdlhWstX6THpo3rNoSuT7jaNn0sqZBHHJbUNvQ9WPT6u1bMNYN2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:37:24.855461Z"},"content_sha256":"84a7f9b8004c3a93efd733346352b6d785d58e9d7cd0604daad754396f9d6168","schema_version":"1.0","event_id":"sha256:84a7f9b8004c3a93efd733346352b6d785d58e9d7cd0604daad754396f9d6168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K/bundle.json","state_url":"https://pith.science/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K/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-05-30T14:37:24Z","links":{"resolver":"https://pith.science/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K","bundle":"https://pith.science/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K/bundle.json","state":"https://pith.science/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLQDKYPNNYRRFMO5IINNPXDQ7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TLQDKYPNNYRRFMO5IINNPXDQ7K","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":"728439ac60305c3dfffbcd8afe9aeb67545c2751b926f7e6ae8156e8ed746f22","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-05-12T06:34:25Z","title_canon_sha256":"5586e69b72a9e0c7b6773a849f793f3656b60bb6cb6b395487e0ef95465f53a9"},"schema_version":"1.0","source":{"id":"1605.03694","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03694","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03694v2","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03694","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"TLQDKYPNNYRR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TLQDKYPNNYRRFMO5","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TLQDKYPN","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:84a7f9b8004c3a93efd733346352b6d785d58e9d7cd0604daad754396f9d6168","target":"graph","created_at":"2026-05-18T00:56:46Z","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":"A practical approach to protecting networks against epidemic processes such as spreading of infectious diseases, malware, and harmful viral information is to remove some influential nodes beforehand to fragment the network into small components. Because determining the optimal order to remove nodes is a computationally hard problem, various approximate algorithms have been proposed to efficiently fragment networks by sequential node removal. Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms. In fact, ma","authors_text":"Naoki Masuda, Teruyoshi Kobayashi","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-05-12T06:34:25Z","title":"Fragmenting networks by targeting collective influencers at a mesoscopic level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03694","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:ad854825408dc59b5431d29d8caec2185803422941f5a88dd4b316502e64c845","target":"record","created_at":"2026-05-18T00:56:46Z","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":"728439ac60305c3dfffbcd8afe9aeb67545c2751b926f7e6ae8156e8ed746f22","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-05-12T06:34:25Z","title_canon_sha256":"5586e69b72a9e0c7b6773a849f793f3656b60bb6cb6b395487e0ef95465f53a9"},"schema_version":"1.0","source":{"id":"1605.03694","kind":"arxiv","version":2}},"canonical_sha256":"9ae03561ed6e2312b1dd421ad7dc70fa9034aef5bac30adbcdd4e7aebc1e17f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ae03561ed6e2312b1dd421ad7dc70fa9034aef5bac30adbcdd4e7aebc1e17f2","first_computed_at":"2026-05-18T00:56:46.128468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:46.128468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UWOduqqKzKM0rIDX/AOSoepQAop33RJBLtvuajaRXZJULahcOyegM6KUhrZghNS4cqbPXYwL3hvBT8CwlnG3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:46.129133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03694","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad854825408dc59b5431d29d8caec2185803422941f5a88dd4b316502e64c845","sha256:84a7f9b8004c3a93efd733346352b6d785d58e9d7cd0604daad754396f9d6168"],"state_sha256":"259640501c807408b528f945d1e8a461442c09f02f76d70be1cfc3743208e2d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbP8z46Kl/9JIY8wcD4t+HxxZtG29Yl5TwjwJxqBSEd4yLHSUwe/CiODt84XCmiYYiPumwld5d3gTUnwmt07BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:37:24.859390Z","bundle_sha256":"911481359a5c27c262343e977d4a33e85271bb1c957a9c859f1eb46c69c902bf"}}