{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DMSQ4UISUHT2CRPS2WU2XUFLR4","short_pith_number":"pith:DMSQ4UIS","schema_version":"1.0","canonical_sha256":"1b250e5112a1e7a145f2d5a9abd0ab8f2345f6a32d383a040163e8c9819df445","source":{"kind":"arxiv","id":"1410.8521","version":7},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.8521","created_at":"2026-05-18T00:58:11.310874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8521v7","created_at":"2026-05-18T00:58:11.310874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8521","created_at":"2026-05-18T00:58:11.310874+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMSQ4UISUHT2","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMSQ4UISUHT2CRPS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMSQ4UIS","created_at":"2026-05-18T12:28:25.294606+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/DMSQ4UISUHT2CRPS2WU2XUFLR4","json":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4.json","graph_json":"https://pith.science/api/pith-number/DMSQ4UISUHT2CRPS2WU2XUFLR4/graph.json","events_json":"https://pith.science/api/pith-number/DMSQ4UISUHT2CRPS2WU2XUFLR4/events.json","paper":"https://pith.science/paper/DMSQ4UIS"},"agent_actions":{"view_html":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4","download_json":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4.json","view_paper":"https://pith.science/paper/DMSQ4UIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8521&json=true","fetch_graph":"https://pith.science/api/pith-number/DMSQ4UISUHT2CRPS2WU2XUFLR4/graph.json","fetch_events":"https://pith.science/api/pith-number/DMSQ4UISUHT2CRPS2WU2XUFLR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/action/storage_attestation","attest_author":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/action/author_attestation","sign_citation":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/action/citation_signature","submit_replication":"https://pith.science/pith/DMSQ4UISUHT2CRPS2WU2XUFLR4/action/replication_record"}},"created_at":"2026-05-18T00:58:11.310874+00:00","updated_at":"2026-05-18T00:58:11.310874+00:00"}