{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MA73ZDOS74ATR3WJ44NEB2DG2E","short_pith_number":"pith:MA73ZDOS","canonical_record":{"source":{"id":"1806.01064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-04T11:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"6ef70e0d8d77ce6142cd4404e0097f7ae5aa71df413f0666fde9be554377806c","abstract_canon_sha256":"9595a2fb1b7afa0ecc466a7c257c14db8e286cbf2412df073207196bf7af49fd"},"schema_version":"1.0"},"canonical_sha256":"603fbc8dd2ff0138eec9e71a40e866d12ba1ec1a5013b078e0c6c4ea46e7f7d1","source":{"kind":"arxiv","id":"1806.01064","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01064","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01064v3","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01064","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"MA73ZDOS74AT","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"pith_short_16","alias_value":"MA73ZDOS74ATR3WJ","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"pith_short_8","alias_value":"MA73ZDOS","created_at":"2026-07-05T06:23:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MA73ZDOS74ATR3WJ44NEB2DG2E","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-04T11:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"6ef70e0d8d77ce6142cd4404e0097f7ae5aa71df413f0666fde9be554377806c","abstract_canon_sha256":"9595a2fb1b7afa0ecc466a7c257c14db8e286cbf2412df073207196bf7af49fd"},"schema_version":"1.0"},"canonical_sha256":"603fbc8dd2ff0138eec9e71a40e866d12ba1ec1a5013b078e0c6c4ea46e7f7d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:24.396829Z","signature_b64":"ArnRvBQdujbI1AItdXtS9pyQUqVqYJrhshL56OUZvKBdwaHGeEAiPcKUsVdwF1/8KDF0EaP+Nd2IT9f7JgcdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"603fbc8dd2ff0138eec9e71a40e866d12ba1ec1a5013b078e0c6c4ea46e7f7d1","last_reissued_at":"2026-07-05T06:23:24.396411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:24.396411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01064","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-05T06:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSSHNswF6zVueeZ+OZFpfnY976EIOOxNTrWxsqX+FoDpMI0RnvNLzxObCm2I46y5bI/jtbflOeH+nb/4+dgiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:49:29.446371Z"},"content_sha256":"92e241c01b57de9de6532466358e462885428cc505366812e021bda1bcbe8e19","schema_version":"1.0","event_id":"sha256:92e241c01b57de9de6532466358e462885428cc505366812e021bda1bcbe8e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MA73ZDOS74ATR3WJ44NEB2DG2E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aijun Dong, Jianliang Wu","submitted_at":"2018-06-04T11:55:25Z","abstract_excerpt":"A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\\lceil\\frac{|V(G)|}{k}\\rceil$ vertices. A graph is equitably $k$-colorable if the vertex set $V(G)$ can be partitioned into $k$ independent subsets $V_1$, $V_2$, $\\cdots$, $V_k$ such that $||V_i|-|V_j||\\leq 1$ for $1\\leq i, j\\leq k$. In this paper, we prove that if $G$ is a planar graph without chordal $4$- and $6$-cycles, then $G$ is equitably $k$-colorable and equitably $k$-choosable where $k\\geq\\max\\{\\Delta(G), 7\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01064","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/1806.01064/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-05T06:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klpkZjKUUh6X97+Vat5UJhNOLxCQpfLiGX9sBakZiwX7xQht4UjICjN7CchB1jBQw2U5niWGNPnr+iqS6ROYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:49:29.449857Z"},"content_sha256":"c09515c2e8d45eb44812fd811e021256cc34a9d27242ece1922691e15ee0267b","schema_version":"1.0","event_id":"sha256:c09515c2e8d45eb44812fd811e021256cc34a9d27242ece1922691e15ee0267b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/bundle.json","state_url":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/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-16T06:49:29Z","links":{"resolver":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E","bundle":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/bundle.json","state":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MA73ZDOS74ATR3WJ44NEB2DG2E","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":"9595a2fb1b7afa0ecc466a7c257c14db8e286cbf2412df073207196bf7af49fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-04T11:55:25Z","title_canon_sha256":"6ef70e0d8d77ce6142cd4404e0097f7ae5aa71df413f0666fde9be554377806c"},"schema_version":"1.0","source":{"id":"1806.01064","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01064","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01064v3","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01064","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"MA73ZDOS74AT","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"pith_short_16","alias_value":"MA73ZDOS74ATR3WJ","created_at":"2026-07-05T06:23:24Z"},{"alias_kind":"pith_short_8","alias_value":"MA73ZDOS","created_at":"2026-07-05T06:23:24Z"}],"graph_snapshots":[{"event_id":"sha256:c09515c2e8d45eb44812fd811e021256cc34a9d27242ece1922691e15ee0267b","target":"graph","created_at":"2026-07-05T06:23:24Z","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/1806.01064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\\lceil\\frac{|V(G)|}{k}\\rceil$ vertices. A graph is equitably $k$-colorable if the vertex set $V(G)$ can be partitioned into $k$ independent subsets $V_1$, $V_2$, $\\cdots$, $V_k$ such that $||V_i|-|V_j||\\leq 1$ for $1\\leq i, j\\leq k$. In this paper, we prove that if $G$ is a planar graph without chordal $4$- and $6$-cycles, then $G$ is equitably $k$-colorable and equitably $k$-choosable where $k\\geq\\max\\{\\Delta(G), 7\\}$.","authors_text":"Aijun Dong, Jianliang Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-04T11:55:25Z","title":"Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01064","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:92e241c01b57de9de6532466358e462885428cc505366812e021bda1bcbe8e19","target":"record","created_at":"2026-07-05T06:23:24Z","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":"9595a2fb1b7afa0ecc466a7c257c14db8e286cbf2412df073207196bf7af49fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-04T11:55:25Z","title_canon_sha256":"6ef70e0d8d77ce6142cd4404e0097f7ae5aa71df413f0666fde9be554377806c"},"schema_version":"1.0","source":{"id":"1806.01064","kind":"arxiv","version":3}},"canonical_sha256":"603fbc8dd2ff0138eec9e71a40e866d12ba1ec1a5013b078e0c6c4ea46e7f7d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"603fbc8dd2ff0138eec9e71a40e866d12ba1ec1a5013b078e0c6c4ea46e7f7d1","first_computed_at":"2026-07-05T06:23:24.396411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:24.396411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ArnRvBQdujbI1AItdXtS9pyQUqVqYJrhshL56OUZvKBdwaHGeEAiPcKUsVdwF1/8KDF0EaP+Nd2IT9f7JgcdCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:24.396829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01064","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92e241c01b57de9de6532466358e462885428cc505366812e021bda1bcbe8e19","sha256:c09515c2e8d45eb44812fd811e021256cc34a9d27242ece1922691e15ee0267b"],"state_sha256":"232788950490e8c0c41a8db3965f0705c43558f4cdb1cc4beee5ee0fb2602557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdJ1VdbhYkMowCtmtBHAi+nrbuQebQ0SMu7htvUpVLSgVtZ9PSbvqx/hgBnOO+B4YVlffglWrEpcWu0ynuVrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:49:29.465442Z","bundle_sha256":"05b83bb720969b631b343696a28b5e17b8eb2181355112051e628ef593d07c9a"}}