{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DMSQ4UISUHT2CRPS2WU2XUFLR4","short_pith_number":"pith:DMSQ4UIS","canonical_record":{"source":{"id":"1410.8521","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-23T16:12:00Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CG","cs.NI","math.PR","physics.soc-ph"],"title_canon_sha256":"9de57ad7fcb09036158c2c9844d17d4910677b8326b367ae310e0233bb2b6b42","abstract_canon_sha256":"5daabcee0e2578201783717c5e59020d84c5777aa93f30a248fed45f4650877b"},"schema_version":"1.0"},"canonical_sha256":"1b250e5112a1e7a145f2d5a9abd0ab8f2345f6a32d383a040163e8c9819df445","source":{"kind":"arxiv","id":"1410.8521","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8521","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8521v7","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8521","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"DMSQ4UISUHT2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMSQ4UISUHT2CRPS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMSQ4UIS","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DMSQ4UISUHT2CRPS2WU2XUFLR4","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8521","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-23T16:12:00Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CG","cs.NI","math.PR","physics.soc-ph"],"title_canon_sha256":"9de57ad7fcb09036158c2c9844d17d4910677b8326b367ae310e0233bb2b6b42","abstract_canon_sha256":"5daabcee0e2578201783717c5e59020d84c5777aa93f30a248fed45f4650877b"},"schema_version":"1.0"},"canonical_sha256":"1b250e5112a1e7a145f2d5a9abd0ab8f2345f6a32d383a040163e8c9819df445","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.311453Z","signature_b64":"a1EhdveMvM28juEXUgyrvCJZgSd+auxWqkHg+Dm+YOGs0KxLMrzazySkJUkEuuAhL2THSShf0HQDxzlogGHoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b250e5112a1e7a145f2d5a9abd0ab8f2345f6a32d383a040163e8c9819df445","last_reissued_at":"2026-05-18T00:58:11.310776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.310776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8521","source_version":7,"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:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qm0u+cildFXFfSWgjbrohfrt+IZeym3C8UjhjgbuspWffdRAhse7CjnZp2ntrrmgr2vLSxOndWB5i6Lh09J3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:08:53.953061Z"},"content_sha256":"f99ff395dfbaa92cb61f84d33c49684cf163f336dd4127d0fe1e8ca8a5c7aebc","schema_version":"1.0","event_id":"sha256:f99ff395dfbaa92cb61f84d33c49684cf163f336dd4127d0fe1e8ca8a5c7aebc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DMSQ4UISUHT2CRPS2WU2XUFLR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Betweenness Centrality in Dense Random Geometric Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CG","cs.NI","math.PR","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alexander P. Kartun-Giles, Carl P. Dettmann, Orestis Georgiou","submitted_at":"2014-10-23T16:12:00Z","abstract_excerpt":"Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\\mathcal{V} \\subseteq \\mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how often all paths in the network characterisable as topologically `shortest' contain a given node (betweenness centrality), deriving an expression in terms of a known integral whenever 1) the network boundary is the perimeter of a disk and 2) the network is extremely dense. Our method shows how similar formulas can be obtained for any convex geometry. Numerica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8521","kind":"arxiv","version":7},"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:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDxEw92UtSi+lPtkgX2p0u+9An5ONPETF06cG7vedz3lK7fw7uOuzMorUsYV4KnSW48p9yrs5/sFWUFX485uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:08:53.953771Z"},"content_sha256":"2e83ce2833bd3ab91df7c1a92e681c5bbc5b430c177668da40eb3694012db078","schema_version":"1.0","event_id":"sha256:2e83ce2833bd3ab91df7c1a92e681c5bbc5b430c177668da40eb3694012db078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/bundle.json","state_url":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/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-29T15:08:53Z","links":{"resolver":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4","bundle":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/bundle.json","state":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DMSQ4UISUHT2CRPS2WU2XUFLR4","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":"5daabcee0e2578201783717c5e59020d84c5777aa93f30a248fed45f4650877b","cross_cats_sorted":["cond-mat.stat-mech","cs.CG","cs.NI","math.PR","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-23T16:12:00Z","title_canon_sha256":"9de57ad7fcb09036158c2c9844d17d4910677b8326b367ae310e0233bb2b6b42"},"schema_version":"1.0","source":{"id":"1410.8521","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8521","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8521v7","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8521","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"DMSQ4UISUHT2","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMSQ4UISUHT2CRPS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMSQ4UIS","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2e83ce2833bd3ab91df7c1a92e681c5bbc5b430c177668da40eb3694012db078","target":"graph","created_at":"2026-05-18T00:58:11Z","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 networks consist of 1) a set of nodes embedded randomly in a bounded domain $\\mathcal{V} \\subseteq \\mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how often all paths in the network characterisable as topologically `shortest' contain a given node (betweenness centrality), deriving an expression in terms of a known integral whenever 1) the network boundary is the perimeter of a disk and 2) the network is extremely dense. Our method shows how similar formulas can be obtained for any convex geometry. Numerica","authors_text":"Alexander P. Kartun-Giles, Carl P. Dettmann, Orestis Georgiou","cross_cats":["cond-mat.stat-mech","cs.CG","cs.NI","math.PR","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-23T16:12:00Z","title":"Betweenness Centrality in Dense Random Geometric Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8521","kind":"arxiv","version":7},"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:f99ff395dfbaa92cb61f84d33c49684cf163f336dd4127d0fe1e8ca8a5c7aebc","target":"record","created_at":"2026-05-18T00:58:11Z","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":"5daabcee0e2578201783717c5e59020d84c5777aa93f30a248fed45f4650877b","cross_cats_sorted":["cond-mat.stat-mech","cs.CG","cs.NI","math.PR","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-10-23T16:12:00Z","title_canon_sha256":"9de57ad7fcb09036158c2c9844d17d4910677b8326b367ae310e0233bb2b6b42"},"schema_version":"1.0","source":{"id":"1410.8521","kind":"arxiv","version":7}},"canonical_sha256":"1b250e5112a1e7a145f2d5a9abd0ab8f2345f6a32d383a040163e8c9819df445","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b250e5112a1e7a145f2d5a9abd0ab8f2345f6a32d383a040163e8c9819df445","first_computed_at":"2026-05-18T00:58:11.310776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.310776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1EhdveMvM28juEXUgyrvCJZgSd+auxWqkHg+Dm+YOGs0KxLMrzazySkJUkEuuAhL2THSShf0HQDxzlogGHoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.311453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8521","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f99ff395dfbaa92cb61f84d33c49684cf163f336dd4127d0fe1e8ca8a5c7aebc","sha256:2e83ce2833bd3ab91df7c1a92e681c5bbc5b430c177668da40eb3694012db078"],"state_sha256":"a70155c6d4574e23f49321b5e41d4b3005072924596ce6cac178b59dcc30dd0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgsSozUzJYPLWRmmJzgr0Mxv8G+94G5sXoFBDrmCfwHb0WJikgLnNJdmFOMbwxLvyOa8MgeKrHkmuc39NwdLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:08:53.957609Z","bundle_sha256":"d5640354f1482095ba08f2a291990018fbb6c84debbf21be5457f2d7580bfe48"}}