{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DUL5NOCZCQIQWJTRQB6TJ4AM3I","short_pith_number":"pith:DUL5NOCZ","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"},"canonical_sha256":"1d17d6b85914110b2671807d34f00cda06dddc73641cfa2d0020d3d10ef8641b","source":{"kind":"arxiv","id":"1504.00618","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00618","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00618v2","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00618","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"DUL5NOCZCQIQ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUL5NOCZCQIQWJTR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUL5NOCZ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DUL5NOCZCQIQWJTRQB6TJ4AM3I","target":"record","payload":{"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"},"canonical_sha256":"1d17d6b85914110b2671807d34f00cda06dddc73641cfa2d0020d3d10ef8641b","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"},"source_kind":"arxiv","source_id":"1504.00618","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-18T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPjDxSd1mkZsdX88QHIb3MbFvY/h1NVIcuyPDtzOX2tzP5iT1c6pX7xdEUPfqbXqeFF1yEU5jGMb9e0sqq4tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:10:14.560797Z"},"content_sha256":"57f0690ec588e9cdb49617ef74e0947533b44011714efd88377a899ca1e2562f","schema_version":"1.0","event_id":"sha256:57f0690ec588e9cdb49617ef74e0947533b44011714efd88377a899ca1e2562f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DUL5NOCZCQIQWJTRQB6TJ4AM3I","target":"graph","payload":{"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"},"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-18T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvhY3mYdI+OeoGzWFdAX6Ydc2FotbSkFLO7iqvQ1h4fW7r2TN6GQy5KzaSOwgA4xINCTGXRyzCSfwAIfxsO+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:10:14.561147Z"},"content_sha256":"982805b252e42a4f2d2dcd381976f56d6ea000ea076acc033475097b1237bd45","schema_version":"1.0","event_id":"sha256:982805b252e42a4f2d2dcd381976f56d6ea000ea076acc033475097b1237bd45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/bundle.json","state_url":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/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-27T02:10:14Z","links":{"resolver":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I","bundle":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/bundle.json","state":"https://pith.science/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUL5NOCZCQIQWJTRQB6TJ4AM3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DUL5NOCZCQIQWJTRQB6TJ4AM3I","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":"5bb2d82588c73399351816ed1c8068c53d7786dd510364282c2336d1576532c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-02T17:10:20Z","title_canon_sha256":"99c63a98e2522fc55c697aed0f0cd541fe2244fd4f5ff4f54d80bfcf3fb7350b"},"schema_version":"1.0","source":{"id":"1504.00618","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00618","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00618v2","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00618","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"DUL5NOCZCQIQ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUL5NOCZCQIQWJTR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUL5NOCZ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:982805b252e42a4f2d2dcd381976f56d6ea000ea076acc033475097b1237bd45","target":"graph","created_at":"2026-05-18T02:19:27Z","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 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","authors_text":"Emmanuel Jacob, Peter Morters","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-02T17:10:20Z","title":"Robustness of scale-free spatial networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00618","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:57f0690ec588e9cdb49617ef74e0947533b44011714efd88377a899ca1e2562f","target":"record","created_at":"2026-05-18T02:19:27Z","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":"5bb2d82588c73399351816ed1c8068c53d7786dd510364282c2336d1576532c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-02T17:10:20Z","title_canon_sha256":"99c63a98e2522fc55c697aed0f0cd541fe2244fd4f5ff4f54d80bfcf3fb7350b"},"schema_version":"1.0","source":{"id":"1504.00618","kind":"arxiv","version":2}},"canonical_sha256":"1d17d6b85914110b2671807d34f00cda06dddc73641cfa2d0020d3d10ef8641b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d17d6b85914110b2671807d34f00cda06dddc73641cfa2d0020d3d10ef8641b","first_computed_at":"2026-05-18T02:19:27.415843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:27.415843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nV3Sr2cXEo7bjvaTeHpp0QfoXLTQYmPtq5LDc1UYBM70KFJz7yJypXeveOe2vVQiaCDXnUBNvFUTB4+5/QwoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:27.416548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00618","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57f0690ec588e9cdb49617ef74e0947533b44011714efd88377a899ca1e2562f","sha256:982805b252e42a4f2d2dcd381976f56d6ea000ea076acc033475097b1237bd45"],"state_sha256":"53bdc1cef99f26fbe15d18d1fd11654efac358e83305986ae426ef3d37d7a7ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N91/0aJYN21rWvjU15g//rolAgsFXYL3Zzd9a0ATsIqUYM9YaXGdGlc/VU250gUzD21umTeEDcvt5OnLrgBbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:10:14.563104Z","bundle_sha256":"ef48d21609261bc80bf7e9327976e2f6c614167dffd6a72cb01addea50348b68"}}