{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JWBNT7QB2CMK2BGKJ6V5SBNVMF","short_pith_number":"pith:JWBNT7QB","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"},"canonical_sha256":"4d82d9fe01d098ad04ca4fabd905b56169e49035a094cbfb2f830d49cebeaaf3","source":{"kind":"arxiv","id":"1205.6869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6869","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6869v1","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6869","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"JWBNT7QB2CMK","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JWBNT7QB2CMK2BGK","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JWBNT7QB","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JWBNT7QB2CMK2BGKJ6V5SBNVMF","target":"record","payload":{"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"},"canonical_sha256":"4d82d9fe01d098ad04ca4fabd905b56169e49035a094cbfb2f830d49cebeaaf3","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"},"source_kind":"arxiv","source_id":"1205.6869","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-18T03:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoAfzOj6u5j+KqOdQgUbViXdoxlVS9WN9IVNMQvKgGG8o3HisIoY8k/Vsebp2XI7nhk9TfOTrL/Xnze9l99cBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:59:00.581106Z"},"content_sha256":"8c5989ea3e3b5821a501d6b81d0ebc9c4362d2661416f50b886239d3d52a8175","schema_version":"1.0","event_id":"sha256:8c5989ea3e3b5821a501d6b81d0ebc9c4362d2661416f50b886239d3d52a8175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JWBNT7QB2CMK2BGKJ6V5SBNVMF","target":"graph","payload":{"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"},"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-18T03:54:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQUfLDO+d023V1yiTCim6+jgC9U4FA3GSDvp3NxRzaxsq0P8eE8yERQRiBFwt2Zbv8fYlwoIJjhhs8TanjH0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:59:00.581796Z"},"content_sha256":"8ca058e79da07a81dc2858fd88267c83d5035495261ade4f05c47f7a160ca4c6","schema_version":"1.0","event_id":"sha256:8ca058e79da07a81dc2858fd88267c83d5035495261ade4f05c47f7a160ca4c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/bundle.json","state_url":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/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-31T10:59:00Z","links":{"resolver":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF","bundle":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/bundle.json","state":"https://pith.science/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWBNT7QB2CMK2BGKJ6V5SBNVMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JWBNT7QB2CMK2BGKJ6V5SBNVMF","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":"9391fa4f6e0d4dec3fb04e5ae41ee6591441ed0b9f6763ca07b6bb020deb54e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-31T02:05:04Z","title_canon_sha256":"7c513f1464c8898a1d11956ed900066fc727e2101ba8369aba1996e6dddbe1d6"},"schema_version":"1.0","source":{"id":"1205.6869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6869","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6869v1","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6869","created_at":"2026-05-18T03:54:36Z"},{"alias_kind":"pith_short_12","alias_value":"JWBNT7QB2CMK","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JWBNT7QB2CMK2BGK","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JWBNT7QB","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:8ca058e79da07a81dc2858fd88267c83d5035495261ade4f05c47f7a160ca4c6","target":"graph","created_at":"2026-05-18T03:54:36Z","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":"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 ","authors_text":"Qiaojun Shu, Weifan Wang, Yiqiao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-31T02:05:04Z","title":"A new upper bound on the acyclic chromatic indices of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6869","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:8c5989ea3e3b5821a501d6b81d0ebc9c4362d2661416f50b886239d3d52a8175","target":"record","created_at":"2026-05-18T03:54:36Z","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":"9391fa4f6e0d4dec3fb04e5ae41ee6591441ed0b9f6763ca07b6bb020deb54e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-31T02:05:04Z","title_canon_sha256":"7c513f1464c8898a1d11956ed900066fc727e2101ba8369aba1996e6dddbe1d6"},"schema_version":"1.0","source":{"id":"1205.6869","kind":"arxiv","version":1}},"canonical_sha256":"4d82d9fe01d098ad04ca4fabd905b56169e49035a094cbfb2f830d49cebeaaf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d82d9fe01d098ad04ca4fabd905b56169e49035a094cbfb2f830d49cebeaaf3","first_computed_at":"2026-05-18T03:54:36.693594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:36.693594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wucRAxmYa1iD6DYSqTYNL5v8Ta5vvsNaUe55MrWLkK0f0xdJIRqe1Gv/pyB8Zx4G+l3vGUmSXxLNpZVJd8gcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:36.694307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c5989ea3e3b5821a501d6b81d0ebc9c4362d2661416f50b886239d3d52a8175","sha256:8ca058e79da07a81dc2858fd88267c83d5035495261ade4f05c47f7a160ca4c6"],"state_sha256":"c1811cc882304f08e5fb51bcc0fb060ca74554ce1dc3453d2438d4c6aa39e309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++8B2OfkUSVZ81Aa+n6jUFEQlT4aJoiEvkoN1fLxxFOXa4W4nHPDSOThREQGAPUbsiREySRlcK6yEKmsel7DDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:59:00.585814Z","bundle_sha256":"655997041f984f420bbb76b29b220d4f78320801256d47151eb84e3f342b4ada"}}