{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4A4VKKRR43TUHF4FLPZ2KAHEP2","short_pith_number":"pith:4A4VKKRR","schema_version":"1.0","canonical_sha256":"e039552a31e6e74397855bf3a500e47e8a0f37c79964d374574b56e143d650cd","source":{"kind":"arxiv","id":"1206.1535","version":3},"attestation_state":"computed","paper":{"title":"Acyclic edge-coloring using entropy compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aline Parreau, Louis Esperet","submitted_at":"2012-06-07T15:52:53Z","abstract_excerpt":"An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the previous bound of 9.62 (Delta - 1). Our bound results from the analysis of a very simple randomised procedure using the so-called entropy compression method. We show that the expected running time of the procedure is O(mn Delta^2 log Delta), where n and m are the number of vertices and edges of G. Such a randomised procedure running in expected"},"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":"1206.1535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T15:52:53Z","cross_cats_sorted":[],"title_canon_sha256":"d997b3a9b3bda019138b327b89e4df2e6d6273ae6cf02b779b99be3caa78f568","abstract_canon_sha256":"84f8b528b209c0882dc1be947d59dce5623c0995d09f2d47dbd2f9f62169ca34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:28.069136Z","signature_b64":"ZylidueMF+rVM+ZXy6Nc9dQnCJ7MzC1jLlArwaOY1DC+HrPokJlcwn3amedlDbxl3S0VBRQV7cW7drQezqWQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e039552a31e6e74397855bf3a500e47e8a0f37c79964d374574b56e143d650cd","last_reissued_at":"2026-05-18T03:30:28.065784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:28.065784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acyclic edge-coloring using entropy compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aline Parreau, Louis Esperet","submitted_at":"2012-06-07T15:52:53Z","abstract_excerpt":"An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the previous bound of 9.62 (Delta - 1). Our bound results from the analysis of a very simple randomised procedure using the so-called entropy compression method. We show that the expected running time of the procedure is O(mn Delta^2 log Delta), where n and m are the number of vertices and edges of G. Such a randomised procedure running in expected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1535","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":""},"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":"1206.1535","created_at":"2026-05-18T03:30:28.068428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1535v3","created_at":"2026-05-18T03:30:28.068428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1535","created_at":"2026-05-18T03:30:28.068428+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A4VKKRR43TU","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A4VKKRR43TUHF4F","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A4VKKRR","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2","json":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2.json","graph_json":"https://pith.science/api/pith-number/4A4VKKRR43TUHF4FLPZ2KAHEP2/graph.json","events_json":"https://pith.science/api/pith-number/4A4VKKRR43TUHF4FLPZ2KAHEP2/events.json","paper":"https://pith.science/paper/4A4VKKRR"},"agent_actions":{"view_html":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2","download_json":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2.json","view_paper":"https://pith.science/paper/4A4VKKRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1535&json=true","fetch_graph":"https://pith.science/api/pith-number/4A4VKKRR43TUHF4FLPZ2KAHEP2/graph.json","fetch_events":"https://pith.science/api/pith-number/4A4VKKRR43TUHF4FLPZ2KAHEP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/action/storage_attestation","attest_author":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/action/author_attestation","sign_citation":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/action/citation_signature","submit_replication":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/action/replication_record"}},"created_at":"2026-05-18T03:30:28.068428+00:00","updated_at":"2026-05-18T03:30:28.068428+00:00"}