{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OI5BEDG5NJF6HXEJLEOKEDX3EC","short_pith_number":"pith:OI5BEDG5","canonical_record":{"source":{"id":"1202.6129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T05:54:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c8a1a9a4eaa448891349a9bc01a60e91266ba2eb0222b461de673e372fb48988","abstract_canon_sha256":"7fc839493c9a5e75b881de2118c82e064b518974c838d69adaf28aa7f23666d0"},"schema_version":"1.0"},"canonical_sha256":"723a120cdd6a4be3dc89591ca20efb209a43c50eca7049368cea777dcc2008c9","source":{"kind":"arxiv","id":"1202.6129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6129","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6129v1","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6129","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"OI5BEDG5NJF6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OI5BEDG5NJF6HXEJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OI5BEDG5","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OI5BEDG5NJF6HXEJLEOKEDX3EC","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T05:54:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c8a1a9a4eaa448891349a9bc01a60e91266ba2eb0222b461de673e372fb48988","abstract_canon_sha256":"7fc839493c9a5e75b881de2118c82e064b518974c838d69adaf28aa7f23666d0"},"schema_version":"1.0"},"canonical_sha256":"723a120cdd6a4be3dc89591ca20efb209a43c50eca7049368cea777dcc2008c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:11.126055Z","signature_b64":"lub69QZwKSzPgeuuc4CKoa3KH/vjDqAC/RjBv+viaKadDZGBoHdrsA3bTm3Ep6mqWOz0/2smca7iCfCThljdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723a120cdd6a4be3dc89591ca20efb209a43c50eca7049368cea777dcc2008c9","last_reissued_at":"2026-05-18T02:25:11.125394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:11.125394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6129","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-18T02:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4O7uDI2ygoEoha8FbML9uBrO/Wqyz6t3PGWQtAinBe/eevIkZs8nGmhjUKUH0Tmo6zbu5MER7UpEEpacxlN2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:27:27.001191Z"},"content_sha256":"8288e0752a4c9f92ff5cf51e58e702d708ec7fa004e22acda40ace0e7a8c9994","schema_version":"1.0","event_id":"sha256:8288e0752a4c9f92ff5cf51e58e702d708ec7fa004e22acda40ace0e7a8c9994"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OI5BEDG5NJF6HXEJLEOKEDX3EC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Acyclic edge coloring of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jianfeng Hou","submitted_at":"2012-02-28T05:54:52Z","abstract_excerpt":"A 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. The maximum average degree of a graph $G$, denoted by $\\mad(G)$, is the maximum of the average degree of all subgraphs of $G$. In this paper, it is proved that if $\\mad(G)<4$, then $\\chi'_a(G)\\leq{\\Delta(G)+2}$; if $\\mad(G)<3$, then $\\chi'_a(G)\\leq{\\Delta(G)+1}$. This implies that every triangle-free planar graph $G$ is acyclically edge $(\\Delta(G)+2)$-color"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6129","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-18T02:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6khuQADOY70JxjPMhO+ZNHDZHffXVlo4XTf/BwI2h+7TFwdlu6+tLspejb8tKPcyfgGTR1+3D8wY9fefHXyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:27:27.001537Z"},"content_sha256":"58574214028f6b53f7f80c73fd2c96ee5add5fc30de5cccf2ea18dca078d67b5","schema_version":"1.0","event_id":"sha256:58574214028f6b53f7f80c73fd2c96ee5add5fc30de5cccf2ea18dca078d67b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC/bundle.json","state_url":"https://pith.science/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC/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-29T09:27:27Z","links":{"resolver":"https://pith.science/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC","bundle":"https://pith.science/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC/bundle.json","state":"https://pith.science/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OI5BEDG5NJF6HXEJLEOKEDX3EC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OI5BEDG5NJF6HXEJLEOKEDX3EC","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":"7fc839493c9a5e75b881de2118c82e064b518974c838d69adaf28aa7f23666d0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T05:54:52Z","title_canon_sha256":"c8a1a9a4eaa448891349a9bc01a60e91266ba2eb0222b461de673e372fb48988"},"schema_version":"1.0","source":{"id":"1202.6129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6129","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6129v1","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6129","created_at":"2026-05-18T02:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"OI5BEDG5NJF6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OI5BEDG5NJF6HXEJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OI5BEDG5","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:58574214028f6b53f7f80c73fd2c96ee5add5fc30de5cccf2ea18dca078d67b5","target":"graph","created_at":"2026-05-18T02:25:11Z","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":"A 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. The maximum average degree of a graph $G$, denoted by $\\mad(G)$, is the maximum of the average degree of all subgraphs of $G$. In this paper, it is proved that if $\\mad(G)<4$, then $\\chi'_a(G)\\leq{\\Delta(G)+2}$; if $\\mad(G)<3$, then $\\chi'_a(G)\\leq{\\Delta(G)+1}$. This implies that every triangle-free planar graph $G$ is acyclically edge $(\\Delta(G)+2)$-color","authors_text":"Jianfeng Hou","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T05:54:52Z","title":"Acyclic edge coloring of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6129","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:8288e0752a4c9f92ff5cf51e58e702d708ec7fa004e22acda40ace0e7a8c9994","target":"record","created_at":"2026-05-18T02:25:11Z","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":"7fc839493c9a5e75b881de2118c82e064b518974c838d69adaf28aa7f23666d0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-28T05:54:52Z","title_canon_sha256":"c8a1a9a4eaa448891349a9bc01a60e91266ba2eb0222b461de673e372fb48988"},"schema_version":"1.0","source":{"id":"1202.6129","kind":"arxiv","version":1}},"canonical_sha256":"723a120cdd6a4be3dc89591ca20efb209a43c50eca7049368cea777dcc2008c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"723a120cdd6a4be3dc89591ca20efb209a43c50eca7049368cea777dcc2008c9","first_computed_at":"2026-05-18T02:25:11.125394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:11.125394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lub69QZwKSzPgeuuc4CKoa3KH/vjDqAC/RjBv+viaKadDZGBoHdrsA3bTm3Ep6mqWOz0/2smca7iCfCThljdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:11.126055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8288e0752a4c9f92ff5cf51e58e702d708ec7fa004e22acda40ace0e7a8c9994","sha256:58574214028f6b53f7f80c73fd2c96ee5add5fc30de5cccf2ea18dca078d67b5"],"state_sha256":"6a87a2916711c78117af3d9d5bc7c792bde255e722bbf12c97ec97c72771e9fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2KZn5AR42Tn0CGjUchp8JORrxgnlTc8n9mBVew5Qa4cPJ33bYPog4du+X1lUjYMU9jLlrpKZY6LMleEEplQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:27:27.003382Z","bundle_sha256":"9cb9080fdb331762d539f14c825c0a97863a878ee9ad4d990dbeaa9a794a1b99"}}