{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QILTYGYRNJAPFJMNTISOHVMV24","short_pith_number":"pith:QILTYGYR","schema_version":"1.0","canonical_sha256":"82173c1b116a40f2a58d9a24e3d595d73d08e74385199eac1fdf402be505dcb9","source":{"kind":"arxiv","id":"1609.00744","version":2},"attestation_state":"computed","paper":{"title":"Which subsets of an infinite random graph look random?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Will Brian","submitted_at":"2016-09-02T20:41:49Z","abstract_excerpt":"Given a countable graph, we say a set $A$ of its vertices is \\emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \\emph{weakly universal} if it contains every finite graph as an induced subgraph. We show that, for almost every graph on $\\mathbb N$, $(1)$ every set of positive upper density is universal, and $(2)$ every set with divergent reciprocal sums is weakly universal. We show that the second result is sharp (i.e., a random graph on $\\mathbb N$ will almost surely contain non-universal sets with divergent reciprocal sums) and, more generally, that neithe"},"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":"1609.00744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T20:41:49Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"bb50c6ee3af5a27a8355b4813a0c3da85b34f2d2bf5cdad286c05f7905a74c8e","abstract_canon_sha256":"2139e055b47e7c20a7193bd590fa42d6b52a0ad8c200f3c8e6f3200e33b52ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:09.526999Z","signature_b64":"fuUAXFVWDpDhM6nq6P8oRyuBuZ5iYlD5AW0RlIrElCBKGPXQ/QuSj6vVh0u8eQC3NO/mYPpSFNDsGb/k3TjMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82173c1b116a40f2a58d9a24e3d595d73d08e74385199eac1fdf402be505dcb9","last_reissued_at":"2026-05-18T00:50:09.526473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:09.526473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which subsets of an infinite random graph look random?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Will Brian","submitted_at":"2016-09-02T20:41:49Z","abstract_excerpt":"Given a countable graph, we say a set $A$ of its vertices is \\emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \\emph{weakly universal} if it contains every finite graph as an induced subgraph. We show that, for almost every graph on $\\mathbb N$, $(1)$ every set of positive upper density is universal, and $(2)$ every set with divergent reciprocal sums is weakly universal. We show that the second result is sharp (i.e., a random graph on $\\mathbb N$ will almost surely contain non-universal sets with divergent reciprocal sums) and, more generally, that neithe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00744","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":"1609.00744","created_at":"2026-05-18T00:50:09.526544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00744v2","created_at":"2026-05-18T00:50:09.526544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00744","created_at":"2026-05-18T00:50:09.526544+00:00"},{"alias_kind":"pith_short_12","alias_value":"QILTYGYRNJAP","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QILTYGYRNJAPFJMN","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QILTYGYR","created_at":"2026-05-18T12:30:39.010887+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/QILTYGYRNJAPFJMNTISOHVMV24","json":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24.json","graph_json":"https://pith.science/api/pith-number/QILTYGYRNJAPFJMNTISOHVMV24/graph.json","events_json":"https://pith.science/api/pith-number/QILTYGYRNJAPFJMNTISOHVMV24/events.json","paper":"https://pith.science/paper/QILTYGYR"},"agent_actions":{"view_html":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24","download_json":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24.json","view_paper":"https://pith.science/paper/QILTYGYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00744&json=true","fetch_graph":"https://pith.science/api/pith-number/QILTYGYRNJAPFJMNTISOHVMV24/graph.json","fetch_events":"https://pith.science/api/pith-number/QILTYGYRNJAPFJMNTISOHVMV24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/action/storage_attestation","attest_author":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/action/author_attestation","sign_citation":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/action/citation_signature","submit_replication":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/action/replication_record"}},"created_at":"2026-05-18T00:50:09.526544+00:00","updated_at":"2026-05-18T00:50:09.526544+00:00"}