{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XXWYEMT6V5ORIIDRYMR6SZYM54","short_pith_number":"pith:XXWYEMT6","schema_version":"1.0","canonical_sha256":"bded82327eaf5d142071c323e9670cef0e544b86c0cf5f0929efd1acc5adfdc3","source":{"kind":"arxiv","id":"2109.00327","version":2},"attestation_state":"computed","paper":{"title":"Universality in minor-closed graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Carsten Thomassen, David R. Wood, Robert \\v{S}\\'amal, Tony Huynh","submitted_at":"2021-09-01T12:19:28Z","abstract_excerpt":"Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). J\\'anos Pach (1981) answered this question in the negative. We strengthen this result by showing that every countable graph that contains all countable planar graphs must contain (i) an infinite complete graph as a minor, and (ii) a subdivision of the complete graph $K_t$ with multiplicity $t$, for every finite $t$.\n  On the other hand, we construct a countable graph that contains all countable planar graphs and has several k"},"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":"2109.00327","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-01T12:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"c3d908d8614632f9795ad92f7e93fd586f5266afa3c804978426046df30b6060","abstract_canon_sha256":"a0403154b173e120f5ed65341d8da05bd4f3d647d7934237225740657815a67a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:12.384649Z","signature_b64":"Na3291bLakZAA5clGwIM5NPxkBgTL8xdJB353OsNN98/SLYrye3JKBSVLT1YkfyBwMv9pqkRnpFaoGXsMKyEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bded82327eaf5d142071c323e9670cef0e544b86c0cf5f0929efd1acc5adfdc3","last_reissued_at":"2026-06-26T01:15:12.384098Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:12.384098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality in minor-closed graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Carsten Thomassen, David R. Wood, Robert \\v{S}\\'amal, Tony Huynh","submitted_at":"2021-09-01T12:19:28Z","abstract_excerpt":"Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). J\\'anos Pach (1981) answered this question in the negative. We strengthen this result by showing that every countable graph that contains all countable planar graphs must contain (i) an infinite complete graph as a minor, and (ii) a subdivision of the complete graph $K_t$ with multiplicity $t$, for every finite $t$.\n  On the other hand, we construct a countable graph that contains all countable planar graphs and has several k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00327","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.00327/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.00327","created_at":"2026-06-26T01:15:12.384166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.00327v2","created_at":"2026-06-26T01:15:12.384166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00327","created_at":"2026-06-26T01:15:12.384166+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXWYEMT6V5OR","created_at":"2026-06-26T01:15:12.384166+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXWYEMT6V5ORIIDR","created_at":"2026-06-26T01:15:12.384166+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXWYEMT6","created_at":"2026-06-26T01:15:12.384166+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/XXWYEMT6V5ORIIDRYMR6SZYM54","json":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54.json","graph_json":"https://pith.science/api/pith-number/XXWYEMT6V5ORIIDRYMR6SZYM54/graph.json","events_json":"https://pith.science/api/pith-number/XXWYEMT6V5ORIIDRYMR6SZYM54/events.json","paper":"https://pith.science/paper/XXWYEMT6"},"agent_actions":{"view_html":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54","download_json":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54.json","view_paper":"https://pith.science/paper/XXWYEMT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.00327&json=true","fetch_graph":"https://pith.science/api/pith-number/XXWYEMT6V5ORIIDRYMR6SZYM54/graph.json","fetch_events":"https://pith.science/api/pith-number/XXWYEMT6V5ORIIDRYMR6SZYM54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/action/storage_attestation","attest_author":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/action/author_attestation","sign_citation":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/action/citation_signature","submit_replication":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/action/replication_record"}},"created_at":"2026-06-26T01:15:12.384166+00:00","updated_at":"2026-06-26T01:15:12.384166+00:00"}