{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DUL5NOCZCQIQWJTRQB6TJ4AM3I","short_pith_number":"pith:DUL5NOCZ","schema_version":"1.0","canonical_sha256":"1d17d6b85914110b2671807d34f00cda06dddc73641cfa2d0020d3d10ef8641b","source":{"kind":"arxiv","id":"1504.00618","version":2},"attestation_state":"computed","paper":{"title":"Robustness of scale-free spatial networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Emmanuel Jacob, Peter Morters","submitted_at":"2015-04-02T17:10:20Z","abstract_excerpt":"A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the $d$-dimensional torus and are connected to existing vertices with a probability favouring short spatial distances and high degrees. In this model of a scale-free network with clustering we can independently tune the power law exponent $\\tau$ of the degree distribution and the rate $\\delta d$ at which the connection probability decreases with the distance of tw"},"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":"1504.00618","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-02T17:10:20Z","cross_cats_sorted":[],"title_canon_sha256":"99c63a98e2522fc55c697aed0f0cd541fe2244fd4f5ff4f54d80bfcf3fb7350b","abstract_canon_sha256":"5bb2d82588c73399351816ed1c8068c53d7786dd510364282c2336d1576532c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:27.416548Z","signature_b64":"nV3Sr2cXEo7bjvaTeHpp0QfoXLTQYmPtq5LDc1UYBM70KFJz7yJypXeveOe2vVQiaCDXnUBNvFUTB4+5/QwoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d17d6b85914110b2671807d34f00cda06dddc73641cfa2d0020d3d10ef8641b","last_reissued_at":"2026-05-18T02:19:27.415843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:27.415843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness of scale-free spatial networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Emmanuel Jacob, Peter Morters","submitted_at":"2015-04-02T17:10:20Z","abstract_excerpt":"A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the $d$-dimensional torus and are connected to existing vertices with a probability favouring short spatial distances and high degrees. In this model of a scale-free network with clustering we can independently tune the power law exponent $\\tau$ of the degree distribution and the rate $\\delta d$ at which the connection probability decreases with the distance of tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00618","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":"1504.00618","created_at":"2026-05-18T02:19:27.415953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00618v2","created_at":"2026-05-18T02:19:27.415953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00618","created_at":"2026-05-18T02:19:27.415953+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUL5NOCZCQIQ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUL5NOCZCQIQWJTR","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUL5NOCZ","created_at":"2026-05-18T12:29:17.054201+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/DUL5NOCZCQIQWJTRQB6TJ4AM3I","json":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I.json","graph_json":"https://pith.science/api/pith-number/DUL5NOCZCQIQWJTRQB6TJ4AM3I/graph.json","events_json":"https://pith.science/api/pith-number/DUL5NOCZCQIQWJTRQB6TJ4AM3I/events.json","paper":"https://pith.science/paper/DUL5NOCZ"},"agent_actions":{"view_html":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I","download_json":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I.json","view_paper":"https://pith.science/paper/DUL5NOCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00618&json=true","fetch_graph":"https://pith.science/api/pith-number/DUL5NOCZCQIQWJTRQB6TJ4AM3I/graph.json","fetch_events":"https://pith.science/api/pith-number/DUL5NOCZCQIQWJTRQB6TJ4AM3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/action/storage_attestation","attest_author":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/action/author_attestation","sign_citation":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/action/citation_signature","submit_replication":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/action/replication_record"}},"created_at":"2026-05-18T02:19:27.415953+00:00","updated_at":"2026-05-18T02:19:27.415953+00:00"}