{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MA73ZDOS74ATR3WJ44NEB2DG2E","short_pith_number":"pith:MA73ZDOS","schema_version":"1.0","canonical_sha256":"603fbc8dd2ff0138eec9e71a40e866d12ba1ec1a5013b078e0c6c4ea46e7f7d1","source":{"kind":"arxiv","id":"1806.01064","version":3},"attestation_state":"computed","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\\}$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.01064","created_at":"2026-07-05T06:23:24.396486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01064v3","created_at":"2026-07-05T06:23:24.396486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01064","created_at":"2026-07-05T06:23:24.396486+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA73ZDOS74AT","created_at":"2026-07-05T06:23:24.396486+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA73ZDOS74ATR3WJ","created_at":"2026-07-05T06:23:24.396486+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA73ZDOS","created_at":"2026-07-05T06:23:24.396486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01657","citing_title":"On List Equitable Total Colorings of the Generalized Theta Graph","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E","json":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E.json","graph_json":"https://pith.science/api/pith-number/MA73ZDOS74ATR3WJ44NEB2DG2E/graph.json","events_json":"https://pith.science/api/pith-number/MA73ZDOS74ATR3WJ44NEB2DG2E/events.json","paper":"https://pith.science/paper/MA73ZDOS"},"agent_actions":{"view_html":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E","download_json":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E.json","view_paper":"https://pith.science/paper/MA73ZDOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01064&json=true","fetch_graph":"https://pith.science/api/pith-number/MA73ZDOS74ATR3WJ44NEB2DG2E/graph.json","fetch_events":"https://pith.science/api/pith-number/MA73ZDOS74ATR3WJ44NEB2DG2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/action/storage_attestation","attest_author":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/action/author_attestation","sign_citation":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/action/citation_signature","submit_replication":"https://pith.science/pith/MA73ZDOS74ATR3WJ44NEB2DG2E/action/replication_record"}},"created_at":"2026-07-05T06:23:24.396486+00:00","updated_at":"2026-07-05T06:23:24.396486+00:00"}