{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:H5UKAOWXCVCPQOQW2SEMQGOOYP","short_pith_number":"pith:H5UKAOWX","canonical_record":{"source":{"id":"2002.00496","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-02T21:32:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1fae71abededa9eb40b58fe1f5c2f389824eac9a3b493c1ab03af0a1776b2455","abstract_canon_sha256":"91d5cba60eff1eeda66e5cdaeba4e3ee1aa8ef288ebdc90871673520c86ecddd"},"schema_version":"1.0"},"canonical_sha256":"3f68a03ad71544f83a16d488c819cec3f4ed684691920ff3827d0cf5b957200b","source":{"kind":"arxiv","id":"2002.00496","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.00496","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"arxiv_version","alias_value":"2002.00496v3","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00496","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"pith_short_12","alias_value":"H5UKAOWXCVCP","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"pith_short_16","alias_value":"H5UKAOWXCVCPQOQW","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"pith_short_8","alias_value":"H5UKAOWX","created_at":"2026-07-05T05:07:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:H5UKAOWXCVCPQOQW2SEMQGOOYP","target":"record","payload":{"canonical_record":{"source":{"id":"2002.00496","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-02T21:32:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1fae71abededa9eb40b58fe1f5c2f389824eac9a3b493c1ab03af0a1776b2455","abstract_canon_sha256":"91d5cba60eff1eeda66e5cdaeba4e3ee1aa8ef288ebdc90871673520c86ecddd"},"schema_version":"1.0"},"canonical_sha256":"3f68a03ad71544f83a16d488c819cec3f4ed684691920ff3827d0cf5b957200b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:31.853780Z","signature_b64":"fHsNWccjpMOLqQl+w0FoNUyg4PJAAwQJ4joXnuqsYOjUUNSg5kJLniUQgMCOnngGj6JlVSDa+7X3oAi6WEQKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f68a03ad71544f83a16d488c819cec3f4ed684691920ff3827d0cf5b957200b","last_reissued_at":"2026-07-05T05:07:31.853369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:31.853369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.00496","source_version":3,"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-07-05T05:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Yz+iiYdF5MLqO26RkfHYYzzfzA149BTodvHSI31Z/LlaDo/WBZeBXPs6N+z7hC1t//Sr+eePRuFCSHXlkenBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:02:13.674423Z"},"content_sha256":"a3d7d311164d5d363c301899081b96fa13b64d624fe4644c59e5f76b21964796","schema_version":"1.0","event_id":"sha256:a3d7d311164d5d363c301899081b96fa13b64d624fe4644c59e5f76b21964796"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:H5UKAOWXCVCPQOQW2SEMQGOOYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excluding a ladder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Micha{\\l} T. Seweryn, Paul Wollan, Piotr Micek, Tony Huynh","submitted_at":"2020-02-02T21:32:28Z","abstract_excerpt":"A ladder is a $2 \\times k$ grid graph. When does a graph class $\\mathcal{C}$ exclude some ladder as a minor? We show that this is the case if and only if all graphs $G$ in $\\mathcal{C}$ admit a proper vertex coloring with a bounded number of colors such that for every $2$-connected subgraph $H$ of $G$, there is a color that appears exactly once in $H$. This type of vertex coloring is a relaxation of the notion of centered coloring, where for every connected subgraph $H$ of $G$, there must be a color that appears exactly once in $H$. The minimum number of colors in a centered coloring of $G$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00496","kind":"arxiv","version":3},"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/2002.00496/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-07-05T05:07:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvkf3IV0Xi7b9XX3b5sztru2Q31U/Dm36NM+bTGhp0uKwBdACzbD+6D2aWsYNbDiWw8MqVz/LovW+G9mm6P6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:02:13.674957Z"},"content_sha256":"935fce6f10be580258ca77dbb782a3d0cf5b8579df74085f532b58a07ebf967a","schema_version":"1.0","event_id":"sha256:935fce6f10be580258ca77dbb782a3d0cf5b8579df74085f532b58a07ebf967a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP/bundle.json","state_url":"https://pith.science/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP/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-08-11T19:02:13Z","links":{"resolver":"https://pith.science/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP","bundle":"https://pith.science/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP/bundle.json","state":"https://pith.science/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5UKAOWXCVCPQOQW2SEMQGOOYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:H5UKAOWXCVCPQOQW2SEMQGOOYP","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":"91d5cba60eff1eeda66e5cdaeba4e3ee1aa8ef288ebdc90871673520c86ecddd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-02T21:32:28Z","title_canon_sha256":"1fae71abededa9eb40b58fe1f5c2f389824eac9a3b493c1ab03af0a1776b2455"},"schema_version":"1.0","source":{"id":"2002.00496","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.00496","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"arxiv_version","alias_value":"2002.00496v3","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00496","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"pith_short_12","alias_value":"H5UKAOWXCVCP","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"pith_short_16","alias_value":"H5UKAOWXCVCPQOQW","created_at":"2026-07-05T05:07:31Z"},{"alias_kind":"pith_short_8","alias_value":"H5UKAOWX","created_at":"2026-07-05T05:07:31Z"}],"graph_snapshots":[{"event_id":"sha256:935fce6f10be580258ca77dbb782a3d0cf5b8579df74085f532b58a07ebf967a","target":"graph","created_at":"2026-07-05T05:07:31Z","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/2002.00496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A ladder is a $2 \\times k$ grid graph. When does a graph class $\\mathcal{C}$ exclude some ladder as a minor? We show that this is the case if and only if all graphs $G$ in $\\mathcal{C}$ admit a proper vertex coloring with a bounded number of colors such that for every $2$-connected subgraph $H$ of $G$, there is a color that appears exactly once in $H$. This type of vertex coloring is a relaxation of the notion of centered coloring, where for every connected subgraph $H$ of $G$, there must be a color that appears exactly once in $H$. The minimum number of colors in a centered coloring of $G$ is","authors_text":"Gwena\\\"el Joret, Micha{\\l} T. Seweryn, Paul Wollan, Piotr Micek, Tony Huynh","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-02T21:32:28Z","title":"Excluding a ladder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00496","kind":"arxiv","version":3},"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:a3d7d311164d5d363c301899081b96fa13b64d624fe4644c59e5f76b21964796","target":"record","created_at":"2026-07-05T05:07:31Z","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":"91d5cba60eff1eeda66e5cdaeba4e3ee1aa8ef288ebdc90871673520c86ecddd","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-02T21:32:28Z","title_canon_sha256":"1fae71abededa9eb40b58fe1f5c2f389824eac9a3b493c1ab03af0a1776b2455"},"schema_version":"1.0","source":{"id":"2002.00496","kind":"arxiv","version":3}},"canonical_sha256":"3f68a03ad71544f83a16d488c819cec3f4ed684691920ff3827d0cf5b957200b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f68a03ad71544f83a16d488c819cec3f4ed684691920ff3827d0cf5b957200b","first_computed_at":"2026-07-05T05:07:31.853369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:07:31.853369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fHsNWccjpMOLqQl+w0FoNUyg4PJAAwQJ4joXnuqsYOjUUNSg5kJLniUQgMCOnngGj6JlVSDa+7X3oAi6WEQKDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:07:31.853780Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.00496","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3d7d311164d5d363c301899081b96fa13b64d624fe4644c59e5f76b21964796","sha256:935fce6f10be580258ca77dbb782a3d0cf5b8579df74085f532b58a07ebf967a"],"state_sha256":"ec6a13e9d9397b137b39077d1b14af026355f23760cf5c675e1d10c9b9168eab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gFj08hl+V00xvQUJJefKsnKIWgFSpjor1Dkc22NKYdwmYoDr4fcRBg4+sw7QlMrd8pnhxJhz0ncA4XSTe70Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:02:13.682024Z","bundle_sha256":"a2f66a20ecdc7e26de9cd7ae0a7d7b6fe3147cd2ed9f0a8425e33f23dba8c0ab"}}