{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GRHC3WCDZBQ42337J7PIUMQIYA","short_pith_number":"pith:GRHC3WCD","canonical_record":{"source":{"id":"1010.4702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-22T13:09:30Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"7a03bc466e0a9a7c2f23993f111c346f93602e57d179f3781919ecbdd889a894","abstract_canon_sha256":"db33e29447ab5be3ef1296e14e50296711889bd2e1d99d68f0be196027c25f09"},"schema_version":"1.0"},"canonical_sha256":"344e2dd843c861cd6f7f4fde8a3208c013f6c2d16b1f880f2bd8ba3b4e6985d6","source":{"kind":"arxiv","id":"1010.4702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.4702","created_at":"2026-05-18T04:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1010.4702v1","created_at":"2026-05-18T04:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4702","created_at":"2026-05-18T04:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"GRHC3WCDZBQ4","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GRHC3WCDZBQ42337","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GRHC3WCD","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GRHC3WCDZBQ42337J7PIUMQIYA","target":"record","payload":{"canonical_record":{"source":{"id":"1010.4702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-22T13:09:30Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"7a03bc466e0a9a7c2f23993f111c346f93602e57d179f3781919ecbdd889a894","abstract_canon_sha256":"db33e29447ab5be3ef1296e14e50296711889bd2e1d99d68f0be196027c25f09"},"schema_version":"1.0"},"canonical_sha256":"344e2dd843c861cd6f7f4fde8a3208c013f6c2d16b1f880f2bd8ba3b4e6985d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:57.547326Z","signature_b64":"XKMd6gMnH2LfjzMAYKxPm1kTi8bD52bY4py4s0uxRu3ZI+7vEj3f1M4lyqoJdL7bfnk8TFouF95Wws86oBkaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"344e2dd843c861cd6f7f4fde8a3208c013f6c2d16b1f880f2bd8ba3b4e6985d6","last_reissued_at":"2026-05-18T04:38:57.546814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:57.546814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.4702","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-18T04:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5B/2dZSahkNxpWFhjAzXE7VnLJVmuItTDO+7iRbCJZ/htLmylEoqJXQ/kjJNQamN4kBVO+l4NwmGVaL7Ua1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:46:48.918431Z"},"content_sha256":"1041d9535380fdc5c9c17de96550e496e51580c04dc51e1f23d2d8b151fd45c1","schema_version":"1.0","event_id":"sha256:1041d9535380fdc5c9c17de96550e496e51580c04dc51e1f23d2d8b151fd45c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GRHC3WCDZBQ42337J7PIUMQIYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Perturbation and Reconstructability of Complex Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"D. Liu, H. Wang, P. Van Mieghem","submitted_at":"2010-10-22T13:09:30Z","abstract_excerpt":"In recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a new global measure for a network, the reconstructability coefficient {\\theta}, defined as the maximum number of eigenvalues that can be removed, subject to the condition that the adjacency matrix can be reconstructed exactly. Our main finding is that a linear scaling law, E[{\\theta}]=aN, seems universal, in that it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4702","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-18T04:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kEVsAnKJcJtQDv6wl3EOZX0mJkdZtA3Ofru8fmr6gI4PsgEeyMppSJpPI530j+XDDVeZP5vX9yQY+WomHZ6gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:46:48.918771Z"},"content_sha256":"bc1153473257dde426dce9e086d8c58b9a282d038ecc2c40b76477ebff8071a2","schema_version":"1.0","event_id":"sha256:bc1153473257dde426dce9e086d8c58b9a282d038ecc2c40b76477ebff8071a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRHC3WCDZBQ42337J7PIUMQIYA/bundle.json","state_url":"https://pith.science/pith/GRHC3WCDZBQ42337J7PIUMQIYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRHC3WCDZBQ42337J7PIUMQIYA/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-07-03T20:46:48Z","links":{"resolver":"https://pith.science/pith/GRHC3WCDZBQ42337J7PIUMQIYA","bundle":"https://pith.science/pith/GRHC3WCDZBQ42337J7PIUMQIYA/bundle.json","state":"https://pith.science/pith/GRHC3WCDZBQ42337J7PIUMQIYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRHC3WCDZBQ42337J7PIUMQIYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GRHC3WCDZBQ42337J7PIUMQIYA","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":"db33e29447ab5be3ef1296e14e50296711889bd2e1d99d68f0be196027c25f09","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-22T13:09:30Z","title_canon_sha256":"7a03bc466e0a9a7c2f23993f111c346f93602e57d179f3781919ecbdd889a894"},"schema_version":"1.0","source":{"id":"1010.4702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.4702","created_at":"2026-05-18T04:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1010.4702v1","created_at":"2026-05-18T04:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4702","created_at":"2026-05-18T04:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"GRHC3WCDZBQ4","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GRHC3WCDZBQ42337","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GRHC3WCD","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:bc1153473257dde426dce9e086d8c58b9a282d038ecc2c40b76477ebff8071a2","target":"graph","created_at":"2026-05-18T04:38:57Z","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 recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a new global measure for a network, the reconstructability coefficient {\\theta}, defined as the maximum number of eigenvalues that can be removed, subject to the condition that the adjacency matrix can be reconstructed exactly. Our main finding is that a linear scaling law, E[{\\theta}]=aN, seems universal, in that it","authors_text":"D. Liu, H. Wang, P. Van Mieghem","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-22T13:09:30Z","title":"Spectral Perturbation and Reconstructability of Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4702","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:1041d9535380fdc5c9c17de96550e496e51580c04dc51e1f23d2d8b151fd45c1","target":"record","created_at":"2026-05-18T04:38:57Z","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":"db33e29447ab5be3ef1296e14e50296711889bd2e1d99d68f0be196027c25f09","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-10-22T13:09:30Z","title_canon_sha256":"7a03bc466e0a9a7c2f23993f111c346f93602e57d179f3781919ecbdd889a894"},"schema_version":"1.0","source":{"id":"1010.4702","kind":"arxiv","version":1}},"canonical_sha256":"344e2dd843c861cd6f7f4fde8a3208c013f6c2d16b1f880f2bd8ba3b4e6985d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"344e2dd843c861cd6f7f4fde8a3208c013f6c2d16b1f880f2bd8ba3b4e6985d6","first_computed_at":"2026-05-18T04:38:57.546814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:57.546814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XKMd6gMnH2LfjzMAYKxPm1kTi8bD52bY4py4s0uxRu3ZI+7vEj3f1M4lyqoJdL7bfnk8TFouF95Wws86oBkaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:57.547326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.4702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1041d9535380fdc5c9c17de96550e496e51580c04dc51e1f23d2d8b151fd45c1","sha256:bc1153473257dde426dce9e086d8c58b9a282d038ecc2c40b76477ebff8071a2"],"state_sha256":"ad09f9814fcc62ec947473f0aa5faee25832231c4751cd268ea06d9b7ca5930f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FiUwIDITpPxwBW89pxt1kT1ZBVcIY8Y3ssCQz0A9c7VPK131xseqfIh+azNoe3Nx/v+bxsKcnXUewfT9hsSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:46:48.920616Z","bundle_sha256":"ab1c23a210b8a7982d083f646f766838447934b21ed81b32aeaa26eafe4db65c"}}