{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XQGYBKI2PK2DOQMPMMTDY7NGT3","short_pith_number":"pith:XQGYBKI2","canonical_record":{"source":{"id":"1203.5186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T07:08:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff857dc53f3451b4bac1f2b11856c829dc08cdd8ad1771f5057400e62e096160","abstract_canon_sha256":"e7327a7104f70334d6b3532f43ca85d9e93e1d1c17804dc93212cf708d6a0e00"},"schema_version":"1.0"},"canonical_sha256":"bc0d80a91a7ab437418f63263c7da69ed6f211ec51ac4d635f5edda4172f5f05","source":{"kind":"arxiv","id":"1203.5186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5186","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5186v1","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5186","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"XQGYBKI2PK2D","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XQGYBKI2PK2DOQMP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XQGYBKI2","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XQGYBKI2PK2DOQMPMMTDY7NGT3","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T07:08:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff857dc53f3451b4bac1f2b11856c829dc08cdd8ad1771f5057400e62e096160","abstract_canon_sha256":"e7327a7104f70334d6b3532f43ca85d9e93e1d1c17804dc93212cf708d6a0e00"},"schema_version":"1.0"},"canonical_sha256":"bc0d80a91a7ab437418f63263c7da69ed6f211ec51ac4d635f5edda4172f5f05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:26.648426Z","signature_b64":"2fLxbCANonDNHSTKvH6xoffXkw3x8Dg2QC/YLOGG7ALF1GOPsqzGNhQUPJ1i7E9nu4LvuAvk4lNfDmPp0jOnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc0d80a91a7ab437418f63263c7da69ed6f211ec51ac4d635f5edda4172f5f05","last_reissued_at":"2026-05-18T03:59:26.647733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:26.647733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5186","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:59:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjroUm4ks2bVOunXElcuGCRj+MUn6m8pS0NJKhPEgWIUNT3EuTm/CNKxTwfLO1YM4F9Znk/WNHaYAb+ZuacCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:59:39.652963Z"},"content_sha256":"56f481b115ffc253a716ac643a98ef5b7dcfeef1b330e752fc7f25fb7fb2dd67","schema_version":"1.0","event_id":"sha256:56f481b115ffc253a716ac643a98ef5b7dcfeef1b330e752fc7f25fb7fb2dd67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XQGYBKI2PK2DOQMPMMTDY7NGT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved bound on acyclic chromatic index of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jianfeng Hou, Yingyuan Yang, Yue Guan","submitted_at":"2012-03-23T07:08:32Z","abstract_excerpt":"Proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\\chi'_a(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring. Basavaraju et al. [Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2) (2011), 463--478] showed that $\\chi'_a(G)\\le \\Delta(G)+12$ for planar graphs $G$ with maximum degree $\\Delta(G)$. In this paper, the bound is improved to $\\Delta(G)+10$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5186","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:59:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4mcKqId/+BRPPUT9meWXBsR5Z1h5pfAiAvP5B6z8kZ67gbYbcbn8LQbky2XWQj3n2a0zW1SaIKaOJAA+EgRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:59:39.653508Z"},"content_sha256":"0196509bc6bad816c7b01d1a78833e0793826a3e7b295e9571facd605f19fa30","schema_version":"1.0","event_id":"sha256:0196509bc6bad816c7b01d1a78833e0793826a3e7b295e9571facd605f19fa30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3/bundle.json","state_url":"https://pith.science/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3/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-06-29T01:59:39Z","links":{"resolver":"https://pith.science/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3","bundle":"https://pith.science/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3/bundle.json","state":"https://pith.science/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQGYBKI2PK2DOQMPMMTDY7NGT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XQGYBKI2PK2DOQMPMMTDY7NGT3","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":"e7327a7104f70334d6b3532f43ca85d9e93e1d1c17804dc93212cf708d6a0e00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T07:08:32Z","title_canon_sha256":"ff857dc53f3451b4bac1f2b11856c829dc08cdd8ad1771f5057400e62e096160"},"schema_version":"1.0","source":{"id":"1203.5186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5186","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5186v1","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5186","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"XQGYBKI2PK2D","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XQGYBKI2PK2DOQMP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XQGYBKI2","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:0196509bc6bad816c7b01d1a78833e0793826a3e7b295e9571facd605f19fa30","target":"graph","created_at":"2026-05-18T03:59:26Z","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":"Proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\\chi'_a(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring. Basavaraju et al. [Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2) (2011), 463--478] showed that $\\chi'_a(G)\\le \\Delta(G)+12$ for planar graphs $G$ with maximum degree $\\Delta(G)$. In this paper, the bound is improved to $\\Delta(G)+10$.","authors_text":"Jianfeng Hou, Yingyuan Yang, Yue Guan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T07:08:32Z","title":"An improved bound on acyclic chromatic index of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5186","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:56f481b115ffc253a716ac643a98ef5b7dcfeef1b330e752fc7f25fb7fb2dd67","target":"record","created_at":"2026-05-18T03:59:26Z","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":"e7327a7104f70334d6b3532f43ca85d9e93e1d1c17804dc93212cf708d6a0e00","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-23T07:08:32Z","title_canon_sha256":"ff857dc53f3451b4bac1f2b11856c829dc08cdd8ad1771f5057400e62e096160"},"schema_version":"1.0","source":{"id":"1203.5186","kind":"arxiv","version":1}},"canonical_sha256":"bc0d80a91a7ab437418f63263c7da69ed6f211ec51ac4d635f5edda4172f5f05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc0d80a91a7ab437418f63263c7da69ed6f211ec51ac4d635f5edda4172f5f05","first_computed_at":"2026-05-18T03:59:26.647733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:26.647733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2fLxbCANonDNHSTKvH6xoffXkw3x8Dg2QC/YLOGG7ALF1GOPsqzGNhQUPJ1i7E9nu4LvuAvk4lNfDmPp0jOnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:26.648426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f481b115ffc253a716ac643a98ef5b7dcfeef1b330e752fc7f25fb7fb2dd67","sha256:0196509bc6bad816c7b01d1a78833e0793826a3e7b295e9571facd605f19fa30"],"state_sha256":"1def3e5c036b4afe54fee340de9fe2ab41ec1f5c96f47f1f398c25695cdeef6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tc2VPwcpyW0TD8wTo4Gi2WUvzAU036t2XpzDMxHmUrnYQW0lbxWUWXVgr3RgbiqSVOgKGJkOigFfqVcP6/cCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T01:59:39.655894Z","bundle_sha256":"d26b5a34109dfaf856f29a9c61133a9d0b0e9035d8fd994a43e15c6a8c86011e"}}