{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BPRDMFXNB4OIOYCBW4EGJVGDHU","short_pith_number":"pith:BPRDMFXN","schema_version":"1.0","canonical_sha256":"0be23616ed0f1c876041b70864d4c33d1d35208222c1bb81dd11b6c7139e9c62","source":{"kind":"arxiv","id":"1407.5374","version":9},"attestation_state":"computed","paper":{"title":"Acyclic Edge Coloring through the Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Ioannis Giotis, Kostas I. Psaromiligkos, Lefteris Kirousis","submitted_at":"2014-07-21T05:01:25Z","abstract_excerpt":"We give a probabilistic analysis of a Moser-type algorithm for the Lov\\'{a}sz Local Lemma (LLL), adjusted to search for acyclic edge colorings of a graph. We thus improve the best known upper bound to acyclic chromatic index, also obtained by analyzing a similar algorithm, but through the entropic method (basically counting argument). Specifically we show that a graph with maximum degree $\\Delta$ has an acyclic proper edge coloring with at most $\\lceil 3.74(\\Delta-1)\\rceil+1 $ colors, whereas, previously, the best bound was $4(\\Delta-1)$. The main contribution of this work is that it comprises"},"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":"1407.5374","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T05:01:25Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"9cae3b7e0bad1b494038743728c96a0981e7cb2a6ef26d695f9862da0e78fd38","abstract_canon_sha256":"9e78307155db2dc8b418655dc406ac9fa073a430d4a7732b738008f246a5ed0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:40.353295Z","signature_b64":"2LKBuTh+N95+NUnUtxYs46+eF6FxY1waQIH8Pq3SZcpnkianZWNPG8S/DJWDh5knAtinLyvwX2eACRG29Q7fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be23616ed0f1c876041b70864d4c33d1d35208222c1bb81dd11b6c7139e9c62","last_reissued_at":"2026-05-18T00:26:40.352769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:40.352769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acyclic Edge Coloring through the Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Ioannis Giotis, Kostas I. Psaromiligkos, Lefteris Kirousis","submitted_at":"2014-07-21T05:01:25Z","abstract_excerpt":"We give a probabilistic analysis of a Moser-type algorithm for the Lov\\'{a}sz Local Lemma (LLL), adjusted to search for acyclic edge colorings of a graph. We thus improve the best known upper bound to acyclic chromatic index, also obtained by analyzing a similar algorithm, but through the entropic method (basically counting argument). Specifically we show that a graph with maximum degree $\\Delta$ has an acyclic proper edge coloring with at most $\\lceil 3.74(\\Delta-1)\\rceil+1 $ colors, whereas, previously, the best bound was $4(\\Delta-1)$. The main contribution of this work is that it comprises"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5374","kind":"arxiv","version":9},"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":"1407.5374","created_at":"2026-05-18T00:26:40.352861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5374v9","created_at":"2026-05-18T00:26:40.352861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5374","created_at":"2026-05-18T00:26:40.352861+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPRDMFXNB4OI","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPRDMFXNB4OIOYCB","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPRDMFXN","created_at":"2026-05-18T12:28:22.404517+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/BPRDMFXNB4OIOYCBW4EGJVGDHU","json":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU.json","graph_json":"https://pith.science/api/pith-number/BPRDMFXNB4OIOYCBW4EGJVGDHU/graph.json","events_json":"https://pith.science/api/pith-number/BPRDMFXNB4OIOYCBW4EGJVGDHU/events.json","paper":"https://pith.science/paper/BPRDMFXN"},"agent_actions":{"view_html":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU","download_json":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU.json","view_paper":"https://pith.science/paper/BPRDMFXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5374&json=true","fetch_graph":"https://pith.science/api/pith-number/BPRDMFXNB4OIOYCBW4EGJVGDHU/graph.json","fetch_events":"https://pith.science/api/pith-number/BPRDMFXNB4OIOYCBW4EGJVGDHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/action/storage_attestation","attest_author":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/action/author_attestation","sign_citation":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/action/citation_signature","submit_replication":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/action/replication_record"}},"created_at":"2026-05-18T00:26:40.352861+00:00","updated_at":"2026-05-18T00:26:40.352861+00:00"}