{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XFQSNQBG5PIT5SETVK5PU72MHO","short_pith_number":"pith:XFQSNQBG","schema_version":"1.0","canonical_sha256":"b96126c026ebd13ec893aabafa7f4c3b9d666ada6e6f27a018d7db937eb75c62","source":{"kind":"arxiv","id":"2203.15351","version":2},"attestation_state":"computed","paper":{"title":"Random Geometric Graph: Some recent developments and perspectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.SI","authors_text":"Quentin Duchemin (LAMA), Yohann de Castro (ICJ)","submitted_at":"2022-03-29T08:48:55Z","abstract_excerpt":"The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such as the small-world phenomenon and clustering. Originally introduced to model wireless communication networks, RGGs are now very popular with applications ranging from network user profiling to protein-protein interactions in biology. RGGs are also of purely theoretical interest since the underlying geometry gives rise to challenging mathematical questions. Th"},"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":"2203.15351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-03-29T08:48:55Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"47c224daa9bcd80faf0e8feba6a23cb5118cd9ef0686fde730ce5aab665e9332","abstract_canon_sha256":"cb5996e695a71c09287ec1a9dcd56fd4314ece90680cc156d5c23884d12a1297"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:07.495779Z","signature_b64":"HPE1x1I9qu6qBa47BhYm7XmYziQ7ZOb50/nREe6yQZerzztZ3PNYP4O4FloWHseAWA/9zWL8US9FcvglB1N6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96126c026ebd13ec893aabafa7f4c3b9d666ada6e6f27a018d7db937eb75c62","last_reissued_at":"2026-07-05T04:51:07.495289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:07.495289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Geometric Graph: Some recent developments and perspectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.SI","authors_text":"Quentin Duchemin (LAMA), Yohann de Castro (ICJ)","submitted_at":"2022-03-29T08:48:55Z","abstract_excerpt":"The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such as the small-world phenomenon and clustering. Originally introduced to model wireless communication networks, RGGs are now very popular with applications ranging from network user profiling to protein-protein interactions in biology. RGGs are also of purely theoretical interest since the underlying geometry gives rise to challenging mathematical questions. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15351","kind":"arxiv","version":2},"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/2203.15351/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":"2203.15351","created_at":"2026-07-05T04:51:07.495365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15351v2","created_at":"2026-07-05T04:51:07.495365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15351","created_at":"2026-07-05T04:51:07.495365+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFQSNQBG5PIT","created_at":"2026-07-05T04:51:07.495365+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFQSNQBG5PIT5SET","created_at":"2026-07-05T04:51:07.495365+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFQSNQBG","created_at":"2026-07-05T04:51:07.495365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18301","citing_title":"Denoising Distances in Metric Measure Spaces","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18301","citing_title":"Denoising Distances in Metric Measure Spaces","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO","json":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO.json","graph_json":"https://pith.science/api/pith-number/XFQSNQBG5PIT5SETVK5PU72MHO/graph.json","events_json":"https://pith.science/api/pith-number/XFQSNQBG5PIT5SETVK5PU72MHO/events.json","paper":"https://pith.science/paper/XFQSNQBG"},"agent_actions":{"view_html":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO","download_json":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO.json","view_paper":"https://pith.science/paper/XFQSNQBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15351&json=true","fetch_graph":"https://pith.science/api/pith-number/XFQSNQBG5PIT5SETVK5PU72MHO/graph.json","fetch_events":"https://pith.science/api/pith-number/XFQSNQBG5PIT5SETVK5PU72MHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO/action/storage_attestation","attest_author":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO/action/author_attestation","sign_citation":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO/action/citation_signature","submit_replication":"https://pith.science/pith/XFQSNQBG5PIT5SETVK5PU72MHO/action/replication_record"}},"created_at":"2026-07-05T04:51:07.495365+00:00","updated_at":"2026-07-05T04:51:07.495365+00:00"}