{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NMR5OOY5DMYK5A2ZOIXP5VPR5B","short_pith_number":"pith:NMR5OOY5","schema_version":"1.0","canonical_sha256":"6b23d73b1d1b30ae8359722efed5f1e86966100957e18569f56e3ff9c2e8a0cd","source":{"kind":"arxiv","id":"2607.02013","version":1},"attestation_state":"computed","paper":{"title":"Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Cheng Mao, Hang Du, Jiaming Xu, Nike Sun, Yihong Wu","submitted_at":"2026-07-02T10:45:46Z","abstract_excerpt":"A random geometric graph (RGG) is generated by first sampling latent points $x_1,\\ldots,x_n$ independently and uniformly from the unit sphere in $\\mathbb{R}^d$, and then connecting each pair $(i,j)$ if $\\langle x_i,x_j\\rangle$ exceeds some threshold $\\tau$. We study the sharp detection threshold -- the largest dimension at which the RGG can be statistically distinguished from the Erd\\H{o}s--R\\'enyi graph with the same edge density $p$. This threshold is conjectured to be $d \\asymp (nh(p))^3$, where $h(p)=p \\log \\frac{1}{p} + (1-p) \\log \\frac{1}{1-p}$ is the binary entropy function. Previous wo"},"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":"2607.02013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-07-02T10:45:46Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"477cd5760a53a195d50071f29858fb65427c5147445385f038fcd1ce4199cfba","abstract_canon_sha256":"b3eac8c071efef2407a10a7c9ee2952cd632410b74d76cb1729791a73574f09c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:37.050809Z","signature_b64":"ZI/piEnStWCzNBxLzT8JZjQZjR2RRmYqQtjNeyY/IvOy5UBxnnU/3zlbYLMzjq5mTBtnkLCzyyjGbGXO00tbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b23d73b1d1b30ae8359722efed5f1e86966100957e18569f56e3ff9c2e8a0cd","last_reissued_at":"2026-07-03T01:17:37.050414Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:37.050414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Cheng Mao, Hang Du, Jiaming Xu, Nike Sun, Yihong Wu","submitted_at":"2026-07-02T10:45:46Z","abstract_excerpt":"A random geometric graph (RGG) is generated by first sampling latent points $x_1,\\ldots,x_n$ independently and uniformly from the unit sphere in $\\mathbb{R}^d$, and then connecting each pair $(i,j)$ if $\\langle x_i,x_j\\rangle$ exceeds some threshold $\\tau$. We study the sharp detection threshold -- the largest dimension at which the RGG can be statistically distinguished from the Erd\\H{o}s--R\\'enyi graph with the same edge density $p$. This threshold is conjectured to be $d \\asymp (nh(p))^3$, where $h(p)=p \\log \\frac{1}{p} + (1-p) \\log \\frac{1}{1-p}$ is the binary entropy function. Previous wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02013/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.02013","created_at":"2026-07-03T01:17:37.050478+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02013v1","created_at":"2026-07-03T01:17:37.050478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02013","created_at":"2026-07-03T01:17:37.050478+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMR5OOY5DMYK","created_at":"2026-07-03T01:17:37.050478+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMR5OOY5DMYK5A2Z","created_at":"2026-07-03T01:17:37.050478+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMR5OOY5","created_at":"2026-07-03T01:17:37.050478+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/NMR5OOY5DMYK5A2ZOIXP5VPR5B","json":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B.json","graph_json":"https://pith.science/api/pith-number/NMR5OOY5DMYK5A2ZOIXP5VPR5B/graph.json","events_json":"https://pith.science/api/pith-number/NMR5OOY5DMYK5A2ZOIXP5VPR5B/events.json","paper":"https://pith.science/paper/NMR5OOY5"},"agent_actions":{"view_html":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B","download_json":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B.json","view_paper":"https://pith.science/paper/NMR5OOY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02013&json=true","fetch_graph":"https://pith.science/api/pith-number/NMR5OOY5DMYK5A2ZOIXP5VPR5B/graph.json","fetch_events":"https://pith.science/api/pith-number/NMR5OOY5DMYK5A2ZOIXP5VPR5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B/action/storage_attestation","attest_author":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B/action/author_attestation","sign_citation":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B/action/citation_signature","submit_replication":"https://pith.science/pith/NMR5OOY5DMYK5A2ZOIXP5VPR5B/action/replication_record"}},"created_at":"2026-07-03T01:17:37.050478+00:00","updated_at":"2026-07-03T01:17:37.050478+00:00"}