{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XPVGAPGP46H2ME6AEU6NGQ6NBN","short_pith_number":"pith:XPVGAPGP","schema_version":"1.0","canonical_sha256":"bbea603ccfe78fa613c0253cd343cd0b5f3f8f2b16f503998f568acf8ef96f1e","source":{"kind":"arxiv","id":"1502.05440","version":4},"attestation_state":"computed","paper":{"title":"Connectivity of Soft Random Geometric Graphs Over Annuli","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.CO","authors_text":"Alexander P. Kartun-Giles, Carl P. Dettmann, Orestis Georgiou","submitted_at":"2015-02-18T23:10:41Z","abstract_excerpt":"Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains."},"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":"1502.05440","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-18T23:10:41Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"a385f6ca5f3d2f378f9c52a2d58c1304fd1cdc1ef0edaa783e14c475dd46290e","abstract_canon_sha256":"882e5bdcf3a67bb428937b39375e83dbd5655425f89217f8a9e3c4e9c542c112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:24.188961Z","signature_b64":"kTMON2s0L4Z207n8KzWiALyu2m4BssBy7NI7O6oGt4QFDp9SzmJszhs6KEPZA1fGa2ykIcKqSjSblp7V7J1iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbea603ccfe78fa613c0253cd343cd0b5f3f8f2b16f503998f568acf8ef96f1e","last_reissued_at":"2026-05-18T00:42:24.188427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:24.188427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity of Soft Random Geometric Graphs Over Annuli","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.CO","authors_text":"Alexander P. Kartun-Giles, Carl P. Dettmann, Orestis Georgiou","submitted_at":"2015-02-18T23:10:41Z","abstract_excerpt":"Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05440","kind":"arxiv","version":4},"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":"1502.05440","created_at":"2026-05-18T00:42:24.188507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05440v4","created_at":"2026-05-18T00:42:24.188507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05440","created_at":"2026-05-18T00:42:24.188507+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPVGAPGP46H2","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPVGAPGP46H2ME6A","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPVGAPGP","created_at":"2026-05-18T12:29:50.041715+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/XPVGAPGP46H2ME6AEU6NGQ6NBN","json":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN.json","graph_json":"https://pith.science/api/pith-number/XPVGAPGP46H2ME6AEU6NGQ6NBN/graph.json","events_json":"https://pith.science/api/pith-number/XPVGAPGP46H2ME6AEU6NGQ6NBN/events.json","paper":"https://pith.science/paper/XPVGAPGP"},"agent_actions":{"view_html":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN","download_json":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN.json","view_paper":"https://pith.science/paper/XPVGAPGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05440&json=true","fetch_graph":"https://pith.science/api/pith-number/XPVGAPGP46H2ME6AEU6NGQ6NBN/graph.json","fetch_events":"https://pith.science/api/pith-number/XPVGAPGP46H2ME6AEU6NGQ6NBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN/action/storage_attestation","attest_author":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN/action/author_attestation","sign_citation":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN/action/citation_signature","submit_replication":"https://pith.science/pith/XPVGAPGP46H2ME6AEU6NGQ6NBN/action/replication_record"}},"created_at":"2026-05-18T00:42:24.188507+00:00","updated_at":"2026-05-18T00:42:24.188507+00:00"}