{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QQBTLCJWUQM2VCATK6YSU7P6I3","short_pith_number":"pith:QQBTLCJW","schema_version":"1.0","canonical_sha256":"8403358936a419aa881357b12a7dfe46d6ca9581829fb8f79a69a13d75a5bb45","source":{"kind":"arxiv","id":"1610.02381","version":2},"attestation_state":"computed","paper":{"title":"Geometric random graphs and Rado sets in sequence spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Anthony Quas, Jeannette Janssen","submitted_at":"2016-10-07T19:18:14Z","abstract_excerpt":"We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\\delta $. A countable dense set in a metric space is {\\sl Rado} if this random model gives, with probability 1, a graph that is unique up to isomorphism. In earlier work, the first two authors proved that in finite dimensional spaces $\\mathbb{R}^n$ equipped with the $\\ell_{\\infty}$ norm, all countable dense set satisfying a mild non-integrality condition are Rado. In this paper, we extend this res"},"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":"1610.02381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-07T19:18:14Z","cross_cats_sorted":[],"title_canon_sha256":"e5a723aac4b38a5cc2a9c5bcbc713217069fe550f2fb134558758a0b06cbbe0d","abstract_canon_sha256":"73d3a84496acd621ebf7151ca9b31caebe27c8c0662624f8c41fd552231d65f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:52.974630Z","signature_b64":"oEm3MttR3dw4jeFyi4TKbqs2A4us9cnbfjy91EG7ESOcT06NGF0K+fQcnGZEfmYQDbL+aBZlPSo4GreiZdFyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8403358936a419aa881357b12a7dfe46d6ca9581829fb8f79a69a13d75a5bb45","last_reissued_at":"2026-05-18T00:22:52.974163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:52.974163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric random graphs and Rado sets in sequence spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Anthony Quas, Jeannette Janssen","submitted_at":"2016-10-07T19:18:14Z","abstract_excerpt":"We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\\delta $. A countable dense set in a metric space is {\\sl Rado} if this random model gives, with probability 1, a graph that is unique up to isomorphism. In earlier work, the first two authors proved that in finite dimensional spaces $\\mathbb{R}^n$ equipped with the $\\ell_{\\infty}$ norm, all countable dense set satisfying a mild non-integrality condition are Rado. In this paper, we extend this res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02381","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":"1610.02381","created_at":"2026-05-18T00:22:52.974249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02381v2","created_at":"2026-05-18T00:22:52.974249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02381","created_at":"2026-05-18T00:22:52.974249+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQBTLCJWUQM2","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQBTLCJWUQM2VCAT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQBTLCJW","created_at":"2026-05-18T12:30:41.710351+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/QQBTLCJWUQM2VCATK6YSU7P6I3","json":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3.json","graph_json":"https://pith.science/api/pith-number/QQBTLCJWUQM2VCATK6YSU7P6I3/graph.json","events_json":"https://pith.science/api/pith-number/QQBTLCJWUQM2VCATK6YSU7P6I3/events.json","paper":"https://pith.science/paper/QQBTLCJW"},"agent_actions":{"view_html":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3","download_json":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3.json","view_paper":"https://pith.science/paper/QQBTLCJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02381&json=true","fetch_graph":"https://pith.science/api/pith-number/QQBTLCJWUQM2VCATK6YSU7P6I3/graph.json","fetch_events":"https://pith.science/api/pith-number/QQBTLCJWUQM2VCATK6YSU7P6I3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3/action/storage_attestation","attest_author":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3/action/author_attestation","sign_citation":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3/action/citation_signature","submit_replication":"https://pith.science/pith/QQBTLCJWUQM2VCATK6YSU7P6I3/action/replication_record"}},"created_at":"2026-05-18T00:22:52.974249+00:00","updated_at":"2026-05-18T00:22:52.974249+00:00"}