{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:L7YWKWM7DUQX22NKW7RBOYCU7R","short_pith_number":"pith:L7YWKWM7","schema_version":"1.0","canonical_sha256":"5ff165599f1d217d69aab7e2176054fc78300f0f90801574bef7ef4e5ad473d4","source":{"kind":"arxiv","id":"1112.5297","version":2},"attestation_state":"computed","paper":{"title":"Robustness of onion-like correlated networks against targeted attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"H. Eugene Stanley, Shlomo Havlin, Toshihiro Tanizawa","submitted_at":"2011-12-22T13:02:08Z","abstract_excerpt":"Recently, it was found by Schneider et al. [Proc. Natl. Acad. Sci. USA, 108, 3838 (2011)], using simulations, that scale-free networks with \"onion structure\" are very robust against targeted high degree attacks. The onion structure is a network where nodes with almost the same degree are connected. Motivated by this work, we propose and analyze, based on analytical considerations, an onion-like candidate for a nearly optimal structure against simultaneous random and targeted high degree node attacks. The nearly optimal structure can be viewed as a hierarchically interconnected random regular g"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1112.5297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-12-22T13:02:08Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"7fb70bb3fc80472c96382fedafe0434ecec931a5072be44443a6e6d70c653719","abstract_canon_sha256":"8c70eafccb736e0eab2652d0bc28fcbdb0548e0579b545f91e8fe4c07678cc2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:00.084083Z","signature_b64":"HTG+pllMhhh3xR9c8n4Uo8Q18t5KfJiw05oRKBRVnMG7jGZb8YuyWE5wVA41KTxiB4JpNR3Ofy//dffuvTsVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff165599f1d217d69aab7e2176054fc78300f0f90801574bef7ef4e5ad473d4","last_reissued_at":"2026-05-18T03:57:00.083144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:00.083144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of onion-like correlated networks against targeted attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"H. Eugene Stanley, Shlomo Havlin, Toshihiro Tanizawa","submitted_at":"2011-12-22T13:02:08Z","abstract_excerpt":"Recently, it was found by Schneider et al. [Proc. Natl. Acad. Sci. USA, 108, 3838 (2011)], using simulations, that scale-free networks with \"onion structure\" are very robust against targeted high degree attacks. The onion structure is a network where nodes with almost the same degree are connected. Motivated by this work, we propose and analyze, based on analytical considerations, an onion-like candidate for a nearly optimal structure against simultaneous random and targeted high degree node attacks. The nearly optimal structure can be viewed as a hierarchically interconnected random regular g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5297","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.5297","created_at":"2026-05-18T03:57:00.083310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5297v2","created_at":"2026-05-18T03:57:00.083310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5297","created_at":"2026-05-18T03:57:00.083310+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7YWKWM7DUQX","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7YWKWM7DUQX22NK","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7YWKWM7","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R","json":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R.json","graph_json":"https://pith.science/api/pith-number/L7YWKWM7DUQX22NKW7RBOYCU7R/graph.json","events_json":"https://pith.science/api/pith-number/L7YWKWM7DUQX22NKW7RBOYCU7R/events.json","paper":"https://pith.science/paper/L7YWKWM7"},"agent_actions":{"view_html":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R","download_json":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R.json","view_paper":"https://pith.science/paper/L7YWKWM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5297&json=true","fetch_graph":"https://pith.science/api/pith-number/L7YWKWM7DUQX22NKW7RBOYCU7R/graph.json","fetch_events":"https://pith.science/api/pith-number/L7YWKWM7DUQX22NKW7RBOYCU7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R/action/storage_attestation","attest_author":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R/action/author_attestation","sign_citation":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R/action/citation_signature","submit_replication":"https://pith.science/pith/L7YWKWM7DUQX22NKW7RBOYCU7R/action/replication_record"}},"created_at":"2026-05-18T03:57:00.083310+00:00","updated_at":"2026-05-18T03:57:00.083310+00:00"}