{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4HQXW4JPYUGYPWAJER3UJXBVMY","short_pith_number":"pith:4HQXW4JP","schema_version":"1.0","canonical_sha256":"e1e17b712fc50d87d809247744dc35661aa74a11c624e3dde7339c4f1fd11266","source":{"kind":"arxiv","id":"1403.1274","version":2},"attestation_state":"computed","paper":{"title":"Almost optimal sparsification of random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.CO"],"primary_cat":"math.PR","authors_text":"Gabor Lugosi, Luc Devroye, Nicolas Broutin","submitted_at":"2014-03-05T21:15:27Z","abstract_excerpt":"A random geometric irrigation graph $\\Gamma_n(r_n,\\xi)$ has $n$ vertices identified by $n$ independent uniformly distributed points $X_1,\\ldots,X_n$ in the unit square $[0,1]^2$. Each point $X_i$ selects $\\xi_i$ neighbors at random, without replacement, among those points $X_j$ ($j\\neq i$) for which $\\|X_i-X_j\\| < r_n$, and the selected vertices are connected to $X_i$ by an edge. The number $\\xi_i$ of the neighbors is an integer-valued random variable, chosen independently with identical distribution for each $X_i$ such that $\\xi_i$ satisfies $1\\le \\xi_i \\le \\kappa$ for a constant $\\kappa>1$. "},"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":"1403.1274","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-05T21:15:27Z","cross_cats_sorted":["cs.DM","cs.NI","math.CO"],"title_canon_sha256":"a9f05e5b960cc3aaad059ac0b310e5e239e29bd4cddc2f4eceb205992e1f0998","abstract_canon_sha256":"51bc04b8de5cbb530993e94a6249f8c0e306deb45a219d7aba330d82f17ad6a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.380336Z","signature_b64":"w5i2T3qDY/ohHFGCsrW8LYzkGGAPSId17IWGWiQROWwI2zuBvgA31JCFWNzIBjZeJ8HeM+/3rpBskH16WpgcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1e17b712fc50d87d809247744dc35661aa74a11c624e3dde7339c4f1fd11266","last_reissued_at":"2026-05-18T02:56:51.379800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.379800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost optimal sparsification of random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.CO"],"primary_cat":"math.PR","authors_text":"Gabor Lugosi, Luc Devroye, Nicolas Broutin","submitted_at":"2014-03-05T21:15:27Z","abstract_excerpt":"A random geometric irrigation graph $\\Gamma_n(r_n,\\xi)$ has $n$ vertices identified by $n$ independent uniformly distributed points $X_1,\\ldots,X_n$ in the unit square $[0,1]^2$. Each point $X_i$ selects $\\xi_i$ neighbors at random, without replacement, among those points $X_j$ ($j\\neq i$) for which $\\|X_i-X_j\\| < r_n$, and the selected vertices are connected to $X_i$ by an edge. The number $\\xi_i$ of the neighbors is an integer-valued random variable, chosen independently with identical distribution for each $X_i$ such that $\\xi_i$ satisfies $1\\le \\xi_i \\le \\kappa$ for a constant $\\kappa>1$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1274","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":""},"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":"1403.1274","created_at":"2026-05-18T02:56:51.379871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1274v2","created_at":"2026-05-18T02:56:51.379871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1274","created_at":"2026-05-18T02:56:51.379871+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HQXW4JPYUGY","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HQXW4JPYUGYPWAJ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HQXW4JP","created_at":"2026-05-18T12:28:14.216126+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/4HQXW4JPYUGYPWAJER3UJXBVMY","json":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY.json","graph_json":"https://pith.science/api/pith-number/4HQXW4JPYUGYPWAJER3UJXBVMY/graph.json","events_json":"https://pith.science/api/pith-number/4HQXW4JPYUGYPWAJER3UJXBVMY/events.json","paper":"https://pith.science/paper/4HQXW4JP"},"agent_actions":{"view_html":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY","download_json":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY.json","view_paper":"https://pith.science/paper/4HQXW4JP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1274&json=true","fetch_graph":"https://pith.science/api/pith-number/4HQXW4JPYUGYPWAJER3UJXBVMY/graph.json","fetch_events":"https://pith.science/api/pith-number/4HQXW4JPYUGYPWAJER3UJXBVMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY/action/storage_attestation","attest_author":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY/action/author_attestation","sign_citation":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY/action/citation_signature","submit_replication":"https://pith.science/pith/4HQXW4JPYUGYPWAJER3UJXBVMY/action/replication_record"}},"created_at":"2026-05-18T02:56:51.379871+00:00","updated_at":"2026-05-18T02:56:51.379871+00:00"}