{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XXWYEMT6V5ORIIDRYMR6SZYM54","short_pith_number":"pith:XXWYEMT6","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"},"canonical_sha256":"bded82327eaf5d142071c323e9670cef0e544b86c0cf5f0929efd1acc5adfdc3","source":{"kind":"arxiv","id":"2109.00327","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.00327","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"arxiv_version","alias_value":"2109.00327v2","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00327","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"pith_short_12","alias_value":"XXWYEMT6V5OR","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"pith_short_16","alias_value":"XXWYEMT6V5ORIIDR","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"pith_short_8","alias_value":"XXWYEMT6","created_at":"2026-06-26T01:15:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XXWYEMT6V5ORIIDRYMR6SZYM54","target":"record","payload":{"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"},"canonical_sha256":"bded82327eaf5d142071c323e9670cef0e544b86c0cf5f0929efd1acc5adfdc3","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"},"source_kind":"arxiv","source_id":"2109.00327","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-06-26T01:15:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WFgzqtYkEkmUNyG0JSp3uTModHfUmnUyJXA8TUb4aeWRm81rjkpcHPqbthBEypol7eb4MJ8TWmZHFM2txhlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:30:04.996153Z"},"content_sha256":"40a48b8bd2554852ceebea5f5b379e26ee66ba74e36cfaeb84fd1c785f550f03","schema_version":"1.0","event_id":"sha256:40a48b8bd2554852ceebea5f5b379e26ee66ba74e36cfaeb84fd1c785f550f03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XXWYEMT6V5ORIIDRYMR6SZYM54","target":"graph","payload":{"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"},"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-06-26T01:15:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A47gfsE8rG8DtfgarSji17qrqvdtJIVFeCqQgoHc45LBwHnHD3TFl+RqpgBcyMbbUDAiJSk3OrOmDAtuqYF9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:30:04.996531Z"},"content_sha256":"a5f8be2088135c477bce2ea768752f06908966f28f693e0ce9729d164e7f03c0","schema_version":"1.0","event_id":"sha256:a5f8be2088135c477bce2ea768752f06908966f28f693e0ce9729d164e7f03c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/bundle.json","state_url":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/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-07-04T10:30:04Z","links":{"resolver":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54","bundle":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/bundle.json","state":"https://pith.science/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXWYEMT6V5ORIIDRYMR6SZYM54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XXWYEMT6V5ORIIDRYMR6SZYM54","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":"a0403154b173e120f5ed65341d8da05bd4f3d647d7934237225740657815a67a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-01T12:19:28Z","title_canon_sha256":"c3d908d8614632f9795ad92f7e93fd586f5266afa3c804978426046df30b6060"},"schema_version":"1.0","source":{"id":"2109.00327","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.00327","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"arxiv_version","alias_value":"2109.00327v2","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00327","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"pith_short_12","alias_value":"XXWYEMT6V5OR","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"pith_short_16","alias_value":"XXWYEMT6V5ORIIDR","created_at":"2026-06-26T01:15:12Z"},{"alias_kind":"pith_short_8","alias_value":"XXWYEMT6","created_at":"2026-06-26T01:15:12Z"}],"graph_snapshots":[{"event_id":"sha256:a5f8be2088135c477bce2ea768752f06908966f28f693e0ce9729d164e7f03c0","target":"graph","created_at":"2026-06-26T01:15:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.00327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bojan Mohar, Carsten Thomassen, David R. Wood, Robert \\v{S}\\'amal, Tony Huynh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-01T12:19:28Z","title":"Universality in minor-closed graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00327","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:40a48b8bd2554852ceebea5f5b379e26ee66ba74e36cfaeb84fd1c785f550f03","target":"record","created_at":"2026-06-26T01:15:12Z","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":"a0403154b173e120f5ed65341d8da05bd4f3d647d7934237225740657815a67a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-01T12:19:28Z","title_canon_sha256":"c3d908d8614632f9795ad92f7e93fd586f5266afa3c804978426046df30b6060"},"schema_version":"1.0","source":{"id":"2109.00327","kind":"arxiv","version":2}},"canonical_sha256":"bded82327eaf5d142071c323e9670cef0e544b86c0cf5f0929efd1acc5adfdc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bded82327eaf5d142071c323e9670cef0e544b86c0cf5f0929efd1acc5adfdc3","first_computed_at":"2026-06-26T01:15:12.384098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:12.384098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Na3291bLakZAA5clGwIM5NPxkBgTL8xdJB353OsNN98/SLYrye3JKBSVLT1YkfyBwMv9pqkRnpFaoGXsMKyEDQ==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:12.384649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.00327","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40a48b8bd2554852ceebea5f5b379e26ee66ba74e36cfaeb84fd1c785f550f03","sha256:a5f8be2088135c477bce2ea768752f06908966f28f693e0ce9729d164e7f03c0"],"state_sha256":"242ea3647903eecb86452a5dcc3b14ff5abf174df1b5f072ea4cf27c43e3ed02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnxEDgAp5VP5TvVlh1lahxK6V0eU40o4yTWoTLzrOUlt1kV7kXUU+y2avvTQwV9QqjyHDNA/S/9bmxj6Bb2OBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:30:04.998570Z","bundle_sha256":"e9890bd61b28e4fc167e7d30857afbd358ed8f50d44670d7a625ad7cac698d88"}}