{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XNUK6DTZNJKGTFB7LAHB7BAVVG","short_pith_number":"pith:XNUK6DTZ","canonical_record":{"source":{"id":"1608.03988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-08-13T14:37:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"96fcc2b77b1062679af4a1f10893a577a1848df343e8a157429ceeac59846b51","abstract_canon_sha256":"9c9bdd45ec54a6673d5d0bf863bcb7a6bd40b352eee8179d7c8cf5e6140422b3"},"schema_version":"1.0"},"canonical_sha256":"bb68af0e796a5469943f580e1f8415a9abf8d09c2ac25fb4c4270a0f648c130c","source":{"kind":"arxiv","id":"1608.03988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03988","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03988v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03988","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"XNUK6DTZNJKG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XNUK6DTZNJKGTFB7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XNUK6DTZ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XNUK6DTZNJKGTFB7LAHB7BAVVG","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-08-13T14:37:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"96fcc2b77b1062679af4a1f10893a577a1848df343e8a157429ceeac59846b51","abstract_canon_sha256":"9c9bdd45ec54a6673d5d0bf863bcb7a6bd40b352eee8179d7c8cf5e6140422b3"},"schema_version":"1.0"},"canonical_sha256":"bb68af0e796a5469943f580e1f8415a9abf8d09c2ac25fb4c4270a0f648c130c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:04.497924Z","signature_b64":"5XZCW1J6nlbnY2LqoPjClz48XjiBGXfo7J2nsuebr4vHJjqmfPvRoPXruo95Q7l97q+hzlhKtvBCqb5xtydpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb68af0e796a5469943f580e1f8415a9abf8d09c2ac25fb4c4270a0f648c130c","last_reissued_at":"2026-05-18T01:09:04.497412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:04.497412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03988","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-18T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPL01ZyUB6IscWGjeYC5YDage8qQl6AwHybvE39NRhgp6Fl/tgExla/iWRMubQ7OdjL1cZJQnl/6fMVzQpHbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:21:29.062029Z"},"content_sha256":"ee05593374fd387a63d3bda45aa94054fb8b5583ccc11c8e30afb7b9ac162cad","schema_version":"1.0","event_id":"sha256:ee05593374fd387a63d3bda45aa94054fb8b5583ccc11c8e30afb7b9ac162cad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XNUK6DTZNJKGTFB7LAHB7BAVVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Accurate Robustness Estimation for Large Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Sebastian Wandelt, Xiaoqian Sun","submitted_at":"2016-08-13T14:37:03Z","abstract_excerpt":"Robustness estimation is critical for the design and maintenance of resilient networks, one of the global challenges of the 21st century. Existing studies exploit network metrics to generate attack strategies, which simulate intentional attacks in a network, and compute a metric-induced robustness estimation. While some metrics are easy to compute, e.g. degree centrality, other, more accurate, metrics require considerable computation efforts, e.g. betweennes centrality. We propose a new algorithm for estimating the robustness of a network in sub-quadratic time, i.e., significantly faster than "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03988","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-18T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyziyQC2CsuAjIlZbr/+EIk3WDp14dvls6v7tcgCabTNXnH7XI3IBCXX/+ph3Vwo3efc0LrFr+frFrX4cU3UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T04:21:29.062405Z"},"content_sha256":"a0e67a533d15e721a0bd28495b6b446e2f0e377d688cd494ae8f4564b7dd9813","schema_version":"1.0","event_id":"sha256:a0e67a533d15e721a0bd28495b6b446e2f0e377d688cd494ae8f4564b7dd9813"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG/bundle.json","state_url":"https://pith.science/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG/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-21T04:21:29Z","links":{"resolver":"https://pith.science/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG","bundle":"https://pith.science/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG/bundle.json","state":"https://pith.science/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNUK6DTZNJKGTFB7LAHB7BAVVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XNUK6DTZNJKGTFB7LAHB7BAVVG","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":"9c9bdd45ec54a6673d5d0bf863bcb7a6bd40b352eee8179d7c8cf5e6140422b3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-08-13T14:37:03Z","title_canon_sha256":"96fcc2b77b1062679af4a1f10893a577a1848df343e8a157429ceeac59846b51"},"schema_version":"1.0","source":{"id":"1608.03988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03988","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03988v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03988","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"XNUK6DTZNJKG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XNUK6DTZNJKGTFB7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XNUK6DTZ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:a0e67a533d15e721a0bd28495b6b446e2f0e377d688cd494ae8f4564b7dd9813","target":"graph","created_at":"2026-05-18T01:09:04Z","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":"Robustness estimation is critical for the design and maintenance of resilient networks, one of the global challenges of the 21st century. Existing studies exploit network metrics to generate attack strategies, which simulate intentional attacks in a network, and compute a metric-induced robustness estimation. While some metrics are easy to compute, e.g. degree centrality, other, more accurate, metrics require considerable computation efforts, e.g. betweennes centrality. We propose a new algorithm for estimating the robustness of a network in sub-quadratic time, i.e., significantly faster than ","authors_text":"Sebastian Wandelt, Xiaoqian Sun","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-08-13T14:37:03Z","title":"Efficient and Accurate Robustness Estimation for Large Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03988","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:ee05593374fd387a63d3bda45aa94054fb8b5583ccc11c8e30afb7b9ac162cad","target":"record","created_at":"2026-05-18T01:09:04Z","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":"9c9bdd45ec54a6673d5d0bf863bcb7a6bd40b352eee8179d7c8cf5e6140422b3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-08-13T14:37:03Z","title_canon_sha256":"96fcc2b77b1062679af4a1f10893a577a1848df343e8a157429ceeac59846b51"},"schema_version":"1.0","source":{"id":"1608.03988","kind":"arxiv","version":1}},"canonical_sha256":"bb68af0e796a5469943f580e1f8415a9abf8d09c2ac25fb4c4270a0f648c130c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb68af0e796a5469943f580e1f8415a9abf8d09c2ac25fb4c4270a0f648c130c","first_computed_at":"2026-05-18T01:09:04.497412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:04.497412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5XZCW1J6nlbnY2LqoPjClz48XjiBGXfo7J2nsuebr4vHJjqmfPvRoPXruo95Q7l97q+hzlhKtvBCqb5xtydpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:04.497924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee05593374fd387a63d3bda45aa94054fb8b5583ccc11c8e30afb7b9ac162cad","sha256:a0e67a533d15e721a0bd28495b6b446e2f0e377d688cd494ae8f4564b7dd9813"],"state_sha256":"429c2928700a39990a3a6cb1230e9ef380338240e6e043f1708c3e9f5a0df18c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9h/w32igs/n8TVQzp7hNUfQRgkbLXeCLsJ721cOJ64apaMKX+4/Q+G+QoQ5KHGGb/a+IwF9WrWQy+6UzS0S1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T04:21:29.064333Z","bundle_sha256":"f6a910c42c756d2c4b866a9bd377d26830eea6cf9858f965261d0c7f5dd44a0a"}}