{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LNQQ2ZCHMZKNCUTP6D4ZLYIFRY","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":"a3dfbb71b04799865189f48a2c88b247e463cf7205871a7e23705740c6938212","cross_cats_sorted":["cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-03-28T23:57:38Z","title_canon_sha256":"984c225e14e3dd634290024b322e5434d1e2eef6c9504066a1b0a4a570714e79"},"schema_version":"1.0","source":{"id":"2103.15249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15249","created_at":"2026-07-05T02:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15249v1","created_at":"2026-07-05T02:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15249","created_at":"2026-07-05T02:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"LNQQ2ZCHMZKN","created_at":"2026-07-05T02:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"LNQQ2ZCHMZKNCUTP","created_at":"2026-07-05T02:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"LNQQ2ZCH","created_at":"2026-07-05T02:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:2321e98913aeaf848fd01e746e690fd28e08e116abee25bccb387519b23d5cae","target":"graph","created_at":"2026-07-05T02:27:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.15249/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of detecting latent geometric structure in random graphs. To this end, we consider the soft high-dimensional random geometric graph $\\mathcal{G}(n,p,d,q)$, where each of the $n$ vertices corresponds to an independent random point distributed uniformly on the sphere $\\mathbb{S}^{d-1}$, and the probability that two vertices are connected by an edge is a decreasing function of the Euclidean distance between the points. The probability of connection is parametrized by $q \\in [0,1]$, with smaller $q$ corresponding to weaker dependence on the geometry; this can also be interpret","authors_text":"Miklos Z. Racz, Suqi Liu","cross_cats":["cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-03-28T23:57:38Z","title":"Phase transition in noisy high-dimensional random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15249","kind":"arxiv","version":1},"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:14333a2183528851646ba62063827b1976467857995f7c0ec72a8128e2dbcf80","target":"record","created_at":"2026-07-05T02:27:04Z","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":"a3dfbb71b04799865189f48a2c88b247e463cf7205871a7e23705740c6938212","cross_cats_sorted":["cs.IT","cs.SI","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-03-28T23:57:38Z","title_canon_sha256":"984c225e14e3dd634290024b322e5434d1e2eef6c9504066a1b0a4a570714e79"},"schema_version":"1.0","source":{"id":"2103.15249","kind":"arxiv","version":1}},"canonical_sha256":"5b610d64476654d1526ff0f995e1058e0a9eeb051bbb0ecd7887bfba7becc23a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b610d64476654d1526ff0f995e1058e0a9eeb051bbb0ecd7887bfba7becc23a","first_computed_at":"2026-07-05T02:27:04.126155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:27:04.126155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JciX6uSyeKouaKJWyvT9hpwRNlSByJeiGgdkB0LSkGSwKPrxiz7xJvkXWlZvGhTX23V4hTRQx7+DzUEIuR8MDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:27:04.126545Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.15249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14333a2183528851646ba62063827b1976467857995f7c0ec72a8128e2dbcf80","sha256:2321e98913aeaf848fd01e746e690fd28e08e116abee25bccb387519b23d5cae"],"state_sha256":"2badf855e14f9829b5fb775d86b3bf1b1801a3663c8559943933107c6621f198"}