{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:KHSF2OGHY5QSUNPSBBLAYPXR4T","short_pith_number":"pith:KHSF2OGH","schema_version":"1.0","canonical_sha256":"51e45d38c7c7612a35f208560c3ef1e4e995ac708efb6b6a68bf104799d0c2dc","source":{"kind":"arxiv","id":"0908.2590","version":1},"attestation_state":"computed","paper":{"title":"Infinite random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Jeannette Janssen","submitted_at":"2009-08-18T15:18:44Z","abstract_excerpt":"We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given threshold. If the vertex set is a countable dense set in R^n equipped with the metric derived from the L_{\\infty}-norm, then it is shown that with probability 1 such infinite random geometric graphs have a unique isomorphism type. The isomorphism type, which we call GR_n, is characterized by a geometric analogue of the existentially closed adjacency property, a"},"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":"0908.2590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-18T15:18:44Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"3f8160906c0cec39f72d57b1d3a5497a80fa2d2acfb06334cc72d6288627577b","abstract_canon_sha256":"ff7514fde90d6632d67f6cc2045f5d219150c56cd94a29195f0402d57741cc9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:09.094170Z","signature_b64":"R+Lyi2zhkqPMryLymc0RrkcMgTmlK92HUSVUiREXbg/NlBAeKkQ8Oka4TNdC5u5S3W9Yx90xK5x+sj6mnqk1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e45d38c7c7612a35f208560c3ef1e4e995ac708efb6b6a68bf104799d0c2dc","last_reissued_at":"2026-05-18T03:47:09.093632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:09.093632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Jeannette Janssen","submitted_at":"2009-08-18T15:18:44Z","abstract_excerpt":"We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given threshold. If the vertex set is a countable dense set in R^n equipped with the metric derived from the L_{\\infty}-norm, then it is shown that with probability 1 such infinite random geometric graphs have a unique isomorphism type. The isomorphism type, which we call GR_n, is characterized by a geometric analogue of the existentially closed adjacency property, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2590","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":"0908.2590","created_at":"2026-05-18T03:47:09.093719+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.2590v1","created_at":"2026-05-18T03:47:09.093719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2590","created_at":"2026-05-18T03:47:09.093719+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHSF2OGHY5QS","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHSF2OGHY5QSUNPS","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHSF2OGH","created_at":"2026-05-18T12:26:00.592388+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/KHSF2OGHY5QSUNPSBBLAYPXR4T","json":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T.json","graph_json":"https://pith.science/api/pith-number/KHSF2OGHY5QSUNPSBBLAYPXR4T/graph.json","events_json":"https://pith.science/api/pith-number/KHSF2OGHY5QSUNPSBBLAYPXR4T/events.json","paper":"https://pith.science/paper/KHSF2OGH"},"agent_actions":{"view_html":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T","download_json":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T.json","view_paper":"https://pith.science/paper/KHSF2OGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.2590&json=true","fetch_graph":"https://pith.science/api/pith-number/KHSF2OGHY5QSUNPSBBLAYPXR4T/graph.json","fetch_events":"https://pith.science/api/pith-number/KHSF2OGHY5QSUNPSBBLAYPXR4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T/action/storage_attestation","attest_author":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T/action/author_attestation","sign_citation":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T/action/citation_signature","submit_replication":"https://pith.science/pith/KHSF2OGHY5QSUNPSBBLAYPXR4T/action/replication_record"}},"created_at":"2026-05-18T03:47:09.093719+00:00","updated_at":"2026-05-18T03:47:09.093719+00:00"}