{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MK4QAORNHFMTANMUTNMKJZIZAO","short_pith_number":"pith:MK4QAORN","schema_version":"1.0","canonical_sha256":"62b9003a2d39593035949b58a4e51903877b4e5ffff788832debb6ed159ae76c","source":{"kind":"arxiv","id":"1210.5380","version":1},"attestation_state":"computed","paper":{"title":"Nonuniform random geometric graphs with location-dependent radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Debleena Thacker, Srikanth K. Iyer","submitted_at":"2012-10-19T11:26:26Z","abstract_excerpt":"We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\\cdot)$, where $n\\in \\mathbb{N}$, and $f$ is a probability density function on $\\mathbb{R}^d$. A vertex located at $x$ connects via directed edges to other vertices that are within a cut-off distance $r_n(x)$. We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large $n$ and (ii) the maximum and minimum vertex degrees"},"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":"1210.5380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-19T11:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"35d90ea5552ee024a632f67c8b98e27b5fc79b63e11ef3d4d5f83e6e690dcdc5","abstract_canon_sha256":"c35fc6df225a1f1119fb1be0ed1dff866979e04c6541510e8d9e1f4942cb3832"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:45.403848Z","signature_b64":"8fTITZNU3qhRrR2XSQRXP4x0y7q44zbxQ0k90rN7NmvwAuKJwvJvF6FPte8Crld1REr+sm2o5wvYj988AEoFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b9003a2d39593035949b58a4e51903877b4e5ffff788832debb6ed159ae76c","last_reissued_at":"2026-05-18T03:42:45.403389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:45.403389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonuniform random geometric graphs with location-dependent radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Debleena Thacker, Srikanth K. Iyer","submitted_at":"2012-10-19T11:26:26Z","abstract_excerpt":"We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\\cdot)$, where $n\\in \\mathbb{N}$, and $f$ is a probability density function on $\\mathbb{R}^d$. A vertex located at $x$ connects via directed edges to other vertices that are within a cut-off distance $r_n(x)$. We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large $n$ and (ii) the maximum and minimum vertex degrees"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5380","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.5380","created_at":"2026-05-18T03:42:45.403462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5380v1","created_at":"2026-05-18T03:42:45.403462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5380","created_at":"2026-05-18T03:42:45.403462+00:00"},{"alias_kind":"pith_short_12","alias_value":"MK4QAORNHFMT","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MK4QAORNHFMTANMU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MK4QAORN","created_at":"2026-05-18T12:27:14.488303+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/MK4QAORNHFMTANMUTNMKJZIZAO","json":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO.json","graph_json":"https://pith.science/api/pith-number/MK4QAORNHFMTANMUTNMKJZIZAO/graph.json","events_json":"https://pith.science/api/pith-number/MK4QAORNHFMTANMUTNMKJZIZAO/events.json","paper":"https://pith.science/paper/MK4QAORN"},"agent_actions":{"view_html":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO","download_json":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO.json","view_paper":"https://pith.science/paper/MK4QAORN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5380&json=true","fetch_graph":"https://pith.science/api/pith-number/MK4QAORNHFMTANMUTNMKJZIZAO/graph.json","fetch_events":"https://pith.science/api/pith-number/MK4QAORNHFMTANMUTNMKJZIZAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO/action/storage_attestation","attest_author":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO/action/author_attestation","sign_citation":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO/action/citation_signature","submit_replication":"https://pith.science/pith/MK4QAORNHFMTANMUTNMKJZIZAO/action/replication_record"}},"created_at":"2026-05-18T03:42:45.403462+00:00","updated_at":"2026-05-18T03:42:45.403462+00:00"}