{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QILTYGYRNJAPFJMNTISOHVMV24","short_pith_number":"pith:QILTYGYR","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"},"canonical_sha256":"82173c1b116a40f2a58d9a24e3d595d73d08e74385199eac1fdf402be505dcb9","source":{"kind":"arxiv","id":"1609.00744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00744","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00744v2","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00744","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"QILTYGYRNJAP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QILTYGYRNJAPFJMN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QILTYGYR","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QILTYGYRNJAPFJMNTISOHVMV24","target":"record","payload":{"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"},"canonical_sha256":"82173c1b116a40f2a58d9a24e3d595d73d08e74385199eac1fdf402be505dcb9","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"},"source_kind":"arxiv","source_id":"1609.00744","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+Gbrjm+lAXu4cOiKA32mnwCy3wPEhmZBMqlmsydk63ADKiXcoSKHCF2YiVVn7zfh5NHvx0q/CnhnLgUoOhKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:57:39.489470Z"},"content_sha256":"2862cdd5245888f63d630d98e885abfaab4b872918a2db8fa4484d6c3064667c","schema_version":"1.0","event_id":"sha256:2862cdd5245888f63d630d98e885abfaab4b872918a2db8fa4484d6c3064667c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QILTYGYRNJAPFJMNTISOHVMV24","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdhQb9PG1OvxdfE18kfizdqYXrBb7E78uxol8Pkj5xHVM7StYC1URDiXm70db6CN0RrprPR/DahRI2oYzCcZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:57:39.489825Z"},"content_sha256":"4d8f96353d73f6f6a12933b65383f716ca37f33e19e5c70a4b70deac4ca5091c","schema_version":"1.0","event_id":"sha256:4d8f96353d73f6f6a12933b65383f716ca37f33e19e5c70a4b70deac4ca5091c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/bundle.json","state_url":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QILTYGYRNJAPFJMNTISOHVMV24/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T15:57:39Z","links":{"resolver":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24","bundle":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/bundle.json","state":"https://pith.science/pith/QILTYGYRNJAPFJMNTISOHVMV24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QILTYGYRNJAPFJMNTISOHVMV24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QILTYGYRNJAPFJMNTISOHVMV24","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2139e055b47e7c20a7193bd590fa42d6b52a0ad8c200f3c8e6f3200e33b52ab6","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T20:41:49Z","title_canon_sha256":"bb50c6ee3af5a27a8355b4813a0c3da85b34f2d2bf5cdad286c05f7905a74c8e"},"schema_version":"1.0","source":{"id":"1609.00744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00744","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00744v2","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00744","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"QILTYGYRNJAP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QILTYGYRNJAPFJMN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QILTYGYR","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:4d8f96353d73f6f6a12933b65383f716ca37f33e19e5c70a4b70deac4ca5091c","target":"graph","created_at":"2026-05-18T00:50:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Will Brian","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T20:41:49Z","title":"Which subsets of an infinite random graph look random?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00744","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2862cdd5245888f63d630d98e885abfaab4b872918a2db8fa4484d6c3064667c","target":"record","created_at":"2026-05-18T00:50:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2139e055b47e7c20a7193bd590fa42d6b52a0ad8c200f3c8e6f3200e33b52ab6","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T20:41:49Z","title_canon_sha256":"bb50c6ee3af5a27a8355b4813a0c3da85b34f2d2bf5cdad286c05f7905a74c8e"},"schema_version":"1.0","source":{"id":"1609.00744","kind":"arxiv","version":2}},"canonical_sha256":"82173c1b116a40f2a58d9a24e3d595d73d08e74385199eac1fdf402be505dcb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82173c1b116a40f2a58d9a24e3d595d73d08e74385199eac1fdf402be505dcb9","first_computed_at":"2026-05-18T00:50:09.526473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:09.526473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fuUAXFVWDpDhM6nq6P8oRyuBuZ5iYlD5AW0RlIrElCBKGPXQ/QuSj6vVh0u8eQC3NO/mYPpSFNDsGb/k3TjMDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:09.526999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2862cdd5245888f63d630d98e885abfaab4b872918a2db8fa4484d6c3064667c","sha256:4d8f96353d73f6f6a12933b65383f716ca37f33e19e5c70a4b70deac4ca5091c"],"state_sha256":"f267e3fb4b0e1e05fb78ebf17899e7e8a5f6e167efcb8019c87ddcc1952e3aed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isTzoiIgocC1+0AmQjPcnKw+9OA/cPxu6ZL9U7YRiIgEOVjv5lncoWWxs50cDlkncZYGYNAz60Rg3bP8P/QvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:57:39.491761Z","bundle_sha256":"ea1d4adb298f23e7428c90fdd7839395852318f4715a4f9a7cdafce4303b082d"}}