{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZNIHHPVNJJGHYZ4MSZMTVFIVLE","short_pith_number":"pith:ZNIHHPVN","canonical_record":{"source":{"id":"1710.11043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-30T16:20:56Z","cross_cats_sorted":["cs.NI","math.PR"],"title_canon_sha256":"f00486483ff17b869d272e5005f6139623e3d1102e2f77cb1753ccd171c813c7","abstract_canon_sha256":"4203530c73e1191cc0668d5f35128a17be53df8c112bde33a1bd2419142d744e"},"schema_version":"1.0"},"canonical_sha256":"cb5073bead4a4c7c678c96593a9515592a6e136bbb0641605e187e6b04f10493","source":{"kind":"arxiv","id":"1710.11043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11043","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11043v1","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11043","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZNIHHPVNJJGH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNIHHPVNJJGHYZ4M","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNIHHPVN","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZNIHHPVNJJGHYZ4MSZMTVFIVLE","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-30T16:20:56Z","cross_cats_sorted":["cs.NI","math.PR"],"title_canon_sha256":"f00486483ff17b869d272e5005f6139623e3d1102e2f77cb1753ccd171c813c7","abstract_canon_sha256":"4203530c73e1191cc0668d5f35128a17be53df8c112bde33a1bd2419142d744e"},"schema_version":"1.0"},"canonical_sha256":"cb5073bead4a4c7c678c96593a9515592a6e136bbb0641605e187e6b04f10493","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:45.247907Z","signature_b64":"2CHg1XO6l5Mf1CE08HQruNFWEbz9GUK6y8CwcOxlnBkkRxHbrwAHwUR/zNnTZS+7NwdejN5Klv6ScP8rHSxqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5073bead4a4c7c678c96593a9515592a6e136bbb0641605e187e6b04f10493","last_reissued_at":"2026-05-18T00:04:45.247257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:45.247257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11043","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-18T00:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Trq7VI5k/B34jzCUzjAqy/kH33lPIz3INKw9syi9+lOogJCEaor9JYhWIEI4EEKrPaBSy03OxndQw0KeF0obBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:48:04.985697Z"},"content_sha256":"55d7dc08161d9e4af812d370b42b0876beb9f8781e14af5760207b01f8f22ac1","schema_version":"1.0","event_id":"sha256:55d7dc08161d9e4af812d370b42b0876beb9f8781e14af5760207b01f8f22ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZNIHHPVNJJGHYZ4MSZMTVFIVLE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Isolation and connectivity in random geometric graphs with self-similar intensity measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.PR"],"primary_cat":"cond-mat.dis-nn","authors_text":"Carl P. Dettmann (University of Bristol, UK)","submitted_at":"2017-10-30T16:20:56Z","abstract_excerpt":"Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the whole graph is connected. Here we examine these properties for several self-similar node distributions, including smooth and fractal, uniform and nonuniform, and finitely ramified or otherwise. We show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11043","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-18T00:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxM9L5uJlOsmzJKt594K/F6MDCN0z/eDHQfxKr3JPOjwFtj4mo0yRiqIBX34EtO7voWrFTIX2wdCZ1apRpFnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:48:04.986387Z"},"content_sha256":"361c2e8abc7f708c7933e0d7dbf575255b84a8ee367cda9dfaa75e784cc16fdf","schema_version":"1.0","event_id":"sha256:361c2e8abc7f708c7933e0d7dbf575255b84a8ee367cda9dfaa75e784cc16fdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE/bundle.json","state_url":"https://pith.science/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE/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-05-28T20:48:04Z","links":{"resolver":"https://pith.science/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE","bundle":"https://pith.science/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE/bundle.json","state":"https://pith.science/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNIHHPVNJJGHYZ4MSZMTVFIVLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZNIHHPVNJJGHYZ4MSZMTVFIVLE","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":"4203530c73e1191cc0668d5f35128a17be53df8c112bde33a1bd2419142d744e","cross_cats_sorted":["cs.NI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-30T16:20:56Z","title_canon_sha256":"f00486483ff17b869d272e5005f6139623e3d1102e2f77cb1753ccd171c813c7"},"schema_version":"1.0","source":{"id":"1710.11043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11043","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11043v1","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11043","created_at":"2026-05-18T00:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZNIHHPVNJJGH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNIHHPVNJJGHYZ4M","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNIHHPVN","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:361c2e8abc7f708c7933e0d7dbf575255b84a8ee367cda9dfaa75e784cc16fdf","target":"graph","created_at":"2026-05-18T00:04:45Z","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":"Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the whole graph is connected. Here we examine these properties for several self-similar node distributions, including smooth and fractal, uniform and nonuniform, and finitely ramified or otherwise. We show t","authors_text":"Carl P. Dettmann (University of Bristol, UK)","cross_cats":["cs.NI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-30T16:20:56Z","title":"Isolation and connectivity in random geometric graphs with self-similar intensity measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11043","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:55d7dc08161d9e4af812d370b42b0876beb9f8781e14af5760207b01f8f22ac1","target":"record","created_at":"2026-05-18T00:04:45Z","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":"4203530c73e1191cc0668d5f35128a17be53df8c112bde33a1bd2419142d744e","cross_cats_sorted":["cs.NI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-10-30T16:20:56Z","title_canon_sha256":"f00486483ff17b869d272e5005f6139623e3d1102e2f77cb1753ccd171c813c7"},"schema_version":"1.0","source":{"id":"1710.11043","kind":"arxiv","version":1}},"canonical_sha256":"cb5073bead4a4c7c678c96593a9515592a6e136bbb0641605e187e6b04f10493","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb5073bead4a4c7c678c96593a9515592a6e136bbb0641605e187e6b04f10493","first_computed_at":"2026-05-18T00:04:45.247257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:45.247257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2CHg1XO6l5Mf1CE08HQruNFWEbz9GUK6y8CwcOxlnBkkRxHbrwAHwUR/zNnTZS+7NwdejN5Klv6ScP8rHSxqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:45.247907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55d7dc08161d9e4af812d370b42b0876beb9f8781e14af5760207b01f8f22ac1","sha256:361c2e8abc7f708c7933e0d7dbf575255b84a8ee367cda9dfaa75e784cc16fdf"],"state_sha256":"63e31ac02b81aa85d7321458bc24566ef99548c48f83d19a9152ecc18431db93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbZkZKzmtMjFhLASHIp45UK2Dn9/UOvTpv3FrNwl8ITCUQKBCzbf8Lgh5QoRmd+pJQGPs/4Ttfy9y993wGYSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:48:04.989875Z","bundle_sha256":"94ecb144fa71465d877ff24bee5184e57a1a436601c6ac225308b0532e31bc61"}}