{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VSGURCLB6VJV445UG67PFQU3WT","short_pith_number":"pith:VSGURCLB","canonical_record":{"source":{"id":"1605.04415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-14T13:20:38Z","cross_cats_sorted":[],"title_canon_sha256":"45dde5c8d4911aaf7a0a32cf2151eb46550bd19f1dd02ca489a18fb35a086981","abstract_canon_sha256":"404eaa381b1e0c86738eb4a892d2a8f6a97f66ee8ac6b6cfe50a15b54b45d51b"},"schema_version":"1.0"},"canonical_sha256":"ac8d488961f5535e73b437bef2c29bb4c6d3055d6a8e753a951b3ee8a255ae8a","source":{"kind":"arxiv","id":"1605.04415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04415","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04415v1","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04415","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"VSGURCLB6VJV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VSGURCLB6VJV445U","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VSGURCLB","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VSGURCLB6VJV445UG67PFQU3WT","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-14T13:20:38Z","cross_cats_sorted":[],"title_canon_sha256":"45dde5c8d4911aaf7a0a32cf2151eb46550bd19f1dd02ca489a18fb35a086981","abstract_canon_sha256":"404eaa381b1e0c86738eb4a892d2a8f6a97f66ee8ac6b6cfe50a15b54b45d51b"},"schema_version":"1.0"},"canonical_sha256":"ac8d488961f5535e73b437bef2c29bb4c6d3055d6a8e753a951b3ee8a255ae8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:51.744333Z","signature_b64":"XoN2sS9BTaHRCGECgaVFcQiEYCk9hl9xoMKJeHbVA6/zcTeUZKxQmgxme/4X3LqxdUjE8t7OzorVInWWotBlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8d488961f5535e73b437bef2c29bb4c6d3055d6a8e753a951b3ee8a255ae8a","last_reissued_at":"2026-05-18T01:14:51.743725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:51.743725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04415","source_version":1,"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-18T01:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArmkNd4mZz9pM86DQ5T3+VqgdYUUJWFo41/XZUrvLcN5XNRs//m4TL4i7FVBgVR6EA7bg6O6BvQLcXUcNQdjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:51:39.555199Z"},"content_sha256":"34c2649bac32ae2f7c174b817528e58f0f5c507b7500a56b706a7451db25bbd4","schema_version":"1.0","event_id":"sha256:34c2649bac32ae2f7c174b817528e58f0f5c507b7500a56b706a7451db25bbd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VSGURCLB6VJV445UG67PFQU3WT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Every planar graph is $1$-defective $(9,2)$-paintable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ming Han, Xuding Zhu","submitted_at":"2016-05-14T13:20:38Z","abstract_excerpt":"Assume $L$ is a $k$-list assignment of a graph $G$. A $d$-defective $m$-fold $L$-colouring $\\phi$ of $G$ assigns to each vertex $v$ a set $\\phi(v)$ of $m$ colours, so that $\\phi(v) \\subseteq L(v)$ for each vertex $v$, and for each colour $i$, the set $\\{v: i \\in \\phi(v)\\}$ induces a subgraph of maximum degree at most $d$. In this paper, we consider on-line list $d$-defective $m$-fold colouring of graphs, where the list assignment $L$ is given on-line, and the colouring is constructed on-line. To be precise, the $d$-defective $(k,m)$-painting game on a graph $G$ is played by two players: Lister"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04415","kind":"arxiv","version":1},"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-18T01:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RL6V0UJTOYiqbAlTAQsJ1xQh7s894Jur7rEhA5mPc8I4rF1eE8Hr06wGmFyyCK9A+nWrd7F/6lcnyWwRmNWUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:51:39.555966Z"},"content_sha256":"0a2cdddacdf3e9cff524733417754824fbe96c49f7a50707c7ddeb60e8483818","schema_version":"1.0","event_id":"sha256:0a2cdddacdf3e9cff524733417754824fbe96c49f7a50707c7ddeb60e8483818"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSGURCLB6VJV445UG67PFQU3WT/bundle.json","state_url":"https://pith.science/pith/VSGURCLB6VJV445UG67PFQU3WT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSGURCLB6VJV445UG67PFQU3WT/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-05-31T15:51:39Z","links":{"resolver":"https://pith.science/pith/VSGURCLB6VJV445UG67PFQU3WT","bundle":"https://pith.science/pith/VSGURCLB6VJV445UG67PFQU3WT/bundle.json","state":"https://pith.science/pith/VSGURCLB6VJV445UG67PFQU3WT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSGURCLB6VJV445UG67PFQU3WT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VSGURCLB6VJV445UG67PFQU3WT","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":"404eaa381b1e0c86738eb4a892d2a8f6a97f66ee8ac6b6cfe50a15b54b45d51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-14T13:20:38Z","title_canon_sha256":"45dde5c8d4911aaf7a0a32cf2151eb46550bd19f1dd02ca489a18fb35a086981"},"schema_version":"1.0","source":{"id":"1605.04415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04415","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04415v1","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04415","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"VSGURCLB6VJV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VSGURCLB6VJV445U","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VSGURCLB","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:0a2cdddacdf3e9cff524733417754824fbe96c49f7a50707c7ddeb60e8483818","target":"graph","created_at":"2026-05-18T01:14:51Z","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":"Assume $L$ is a $k$-list assignment of a graph $G$. A $d$-defective $m$-fold $L$-colouring $\\phi$ of $G$ assigns to each vertex $v$ a set $\\phi(v)$ of $m$ colours, so that $\\phi(v) \\subseteq L(v)$ for each vertex $v$, and for each colour $i$, the set $\\{v: i \\in \\phi(v)\\}$ induces a subgraph of maximum degree at most $d$. In this paper, we consider on-line list $d$-defective $m$-fold colouring of graphs, where the list assignment $L$ is given on-line, and the colouring is constructed on-line. To be precise, the $d$-defective $(k,m)$-painting game on a graph $G$ is played by two players: Lister","authors_text":"Ming Han, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-14T13:20:38Z","title":"Every planar graph is $1$-defective $(9,2)$-paintable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04415","kind":"arxiv","version":1},"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:34c2649bac32ae2f7c174b817528e58f0f5c507b7500a56b706a7451db25bbd4","target":"record","created_at":"2026-05-18T01:14:51Z","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":"404eaa381b1e0c86738eb4a892d2a8f6a97f66ee8ac6b6cfe50a15b54b45d51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-14T13:20:38Z","title_canon_sha256":"45dde5c8d4911aaf7a0a32cf2151eb46550bd19f1dd02ca489a18fb35a086981"},"schema_version":"1.0","source":{"id":"1605.04415","kind":"arxiv","version":1}},"canonical_sha256":"ac8d488961f5535e73b437bef2c29bb4c6d3055d6a8e753a951b3ee8a255ae8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac8d488961f5535e73b437bef2c29bb4c6d3055d6a8e753a951b3ee8a255ae8a","first_computed_at":"2026-05-18T01:14:51.743725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:51.743725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XoN2sS9BTaHRCGECgaVFcQiEYCk9hl9xoMKJeHbVA6/zcTeUZKxQmgxme/4X3LqxdUjE8t7OzorVInWWotBlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:51.744333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34c2649bac32ae2f7c174b817528e58f0f5c507b7500a56b706a7451db25bbd4","sha256:0a2cdddacdf3e9cff524733417754824fbe96c49f7a50707c7ddeb60e8483818"],"state_sha256":"bdbdd7eec70c1bc613eb0b6a3bb890122201c38b8667009770c7cbbd5b059e8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CRbxFFM3es27/7ADI2Rhip1t0vRVK+C1NzJQbaUJgGDuMq22/tyWoU0fE5125qC7immz3JLlWoeqDf7WV/tCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:51:39.560452Z","bundle_sha256":"6fe82466cc4bfbbae8c17065becbf12f52d30282b2bf295b106d8efab65230af"}}