{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JWBNT7QB2CMK2BGKJ6V5SBNVMF","short_pith_number":"pith:JWBNT7QB","schema_version":"1.0","canonical_sha256":"4d82d9fe01d098ad04ca4fabd905b56169e49035a094cbfb2f830d49cebeaaf3","source":{"kind":"arxiv","id":"1205.6869","version":1},"attestation_state":"computed","paper":{"title":"A new upper bound on the acyclic chromatic indices of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qiaojun Shu, Weifan Wang, Yiqiao Wang","submitted_at":"2012-05-31T02:05:04Z","abstract_excerpt":"An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a'(G)$ of $G$ is the smallest integer $k$ such that $G$ has an acyclic edge coloring using $k$ colors. It was conjectured that $a'(G)\\le \\Delta+2$ for any simple graph $G$ with maximum degree $\\Delta$. In this paper, we prove that if $G$ is a planar graph, then $a'(G)\\leq\\Delta +7$. This improves a result by Basavaraju et al. [{\\em Acyclic edge-coloring of planar graphs}, SIAM J. Discrete Math., 25 (2011), pp. 463-478], which says that every planar graph "},"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":"1205.6869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-31T02:05:04Z","cross_cats_sorted":[],"title_canon_sha256":"7c513f1464c8898a1d11956ed900066fc727e2101ba8369aba1996e6dddbe1d6","abstract_canon_sha256":"9391fa4f6e0d4dec3fb04e5ae41ee6591441ed0b9f6763ca07b6bb020deb54e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:36.694307Z","signature_b64":"wucRAxmYa1iD6DYSqTYNL5v8Ta5vvsNaUe55MrWLkK0f0xdJIRqe1Gv/pyB8Zx4G+l3vGUmSXxLNpZVJd8gcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d82d9fe01d098ad04ca4fabd905b56169e49035a094cbfb2f830d49cebeaaf3","last_reissued_at":"2026-05-18T03:54:36.693594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:36.693594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new upper bound on the acyclic chromatic indices of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qiaojun Shu, Weifan Wang, Yiqiao Wang","submitted_at":"2012-05-31T02:05:04Z","abstract_excerpt":"An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a'(G)$ of $G$ is the smallest integer $k$ such that $G$ has an acyclic edge coloring using $k$ colors. It was conjectured that $a'(G)\\le \\Delta+2$ for any simple graph $G$ with maximum degree $\\Delta$. In this paper, we prove that if $G$ is a planar graph, then $a'(G)\\leq\\Delta +7$. This improves a result by Basavaraju et al. [{\\em Acyclic edge-coloring of planar graphs}, SIAM J. Discrete Math., 25 (2011), pp. 463-478], which says that every planar graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6869","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.6869","created_at":"2026-05-18T03:54:36.693703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6869v1","created_at":"2026-05-18T03:54:36.693703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6869","created_at":"2026-05-18T03:54:36.693703+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWBNT7QB2CMK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWBNT7QB2CMK2BGK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWBNT7QB","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF","json":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF.json","graph_json":"https://pith.science/api/pith-number/JWBNT7QB2CMK2BGKJ6V5SBNVMF/graph.json","events_json":"https://pith.science/api/pith-number/JWBNT7QB2CMK2BGKJ6V5SBNVMF/events.json","paper":"https://pith.science/paper/JWBNT7QB"},"agent_actions":{"view_html":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF","download_json":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF.json","view_paper":"https://pith.science/paper/JWBNT7QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6869&json=true","fetch_graph":"https://pith.science/api/pith-number/JWBNT7QB2CMK2BGKJ6V5SBNVMF/graph.json","fetch_events":"https://pith.science/api/pith-number/JWBNT7QB2CMK2BGKJ6V5SBNVMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/action/storage_attestation","attest_author":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/action/author_attestation","sign_citation":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/action/citation_signature","submit_replication":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/action/replication_record"}},"created_at":"2026-05-18T03:54:36.693703+00:00","updated_at":"2026-05-18T03:54:36.693703+00:00"}