{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BPRDMFXNB4OIOYCBW4EGJVGDHU","short_pith_number":"pith:BPRDMFXN","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"},"canonical_sha256":"0be23616ed0f1c876041b70864d4c33d1d35208222c1bb81dd11b6c7139e9c62","source":{"kind":"arxiv","id":"1407.5374","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5374","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5374v9","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5374","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"BPRDMFXNB4OI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BPRDMFXNB4OIOYCB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BPRDMFXN","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BPRDMFXNB4OIOYCBW4EGJVGDHU","target":"record","payload":{"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"},"canonical_sha256":"0be23616ed0f1c876041b70864d4c33d1d35208222c1bb81dd11b6c7139e9c62","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"},"source_kind":"arxiv","source_id":"1407.5374","source_version":9,"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-18T00:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdwDZcTD7XM7hFQ/MUmFYIlDlV+p4xEqPGx0zHqbqt9TCO+PG9mS75SM/fh1cpF0wHfTnf1bCRzs6gSK+PUFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:36.662619Z"},"content_sha256":"73ce844e0f7b56f6e3100615f39297bed0aaeecfc215f8870dc287191f25e63d","schema_version":"1.0","event_id":"sha256:73ce844e0f7b56f6e3100615f39297bed0aaeecfc215f8870dc287191f25e63d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BPRDMFXNB4OIOYCBW4EGJVGDHU","target":"graph","payload":{"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"},"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-18T00:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qi5aIYftVfcppF99Lrj94YNyz/zuPEPRsYiTIgngmquPgW+7xjFmrwgHVf9x4khf+0D869UxXqCZ9joLffUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:36.663376Z"},"content_sha256":"6570de8366ef34d36aee262c44f8dc35b3c1284d06db95f772175a4524c588c8","schema_version":"1.0","event_id":"sha256:6570de8366ef34d36aee262c44f8dc35b3c1284d06db95f772175a4524c588c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/bundle.json","state_url":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/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-25T18:51:36Z","links":{"resolver":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU","bundle":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/bundle.json","state":"https://pith.science/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPRDMFXNB4OIOYCBW4EGJVGDHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BPRDMFXNB4OIOYCBW4EGJVGDHU","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":"9e78307155db2dc8b418655dc406ac9fa073a430d4a7732b738008f246a5ed0e","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T05:01:25Z","title_canon_sha256":"9cae3b7e0bad1b494038743728c96a0981e7cb2a6ef26d695f9862da0e78fd38"},"schema_version":"1.0","source":{"id":"1407.5374","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5374","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5374v9","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5374","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"BPRDMFXNB4OI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BPRDMFXNB4OIOYCB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BPRDMFXN","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:6570de8366ef34d36aee262c44f8dc35b3c1284d06db95f772175a4524c588c8","target":"graph","created_at":"2026-05-18T00:26:40Z","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":"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","authors_text":"Dimitrios M. Thilikos, Ioannis Giotis, Kostas I. Psaromiligkos, Lefteris Kirousis","cross_cats":["cs.DS","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T05:01:25Z","title":"Acyclic Edge Coloring through the Lov\\'asz Local Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5374","kind":"arxiv","version":9},"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:73ce844e0f7b56f6e3100615f39297bed0aaeecfc215f8870dc287191f25e63d","target":"record","created_at":"2026-05-18T00:26:40Z","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":"9e78307155db2dc8b418655dc406ac9fa073a430d4a7732b738008f246a5ed0e","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-21T05:01:25Z","title_canon_sha256":"9cae3b7e0bad1b494038743728c96a0981e7cb2a6ef26d695f9862da0e78fd38"},"schema_version":"1.0","source":{"id":"1407.5374","kind":"arxiv","version":9}},"canonical_sha256":"0be23616ed0f1c876041b70864d4c33d1d35208222c1bb81dd11b6c7139e9c62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0be23616ed0f1c876041b70864d4c33d1d35208222c1bb81dd11b6c7139e9c62","first_computed_at":"2026-05-18T00:26:40.352769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:40.352769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2LKBuTh+N95+NUnUtxYs46+eF6FxY1waQIH8Pq3SZcpnkianZWNPG8S/DJWDh5knAtinLyvwX2eACRG29Q7fBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:40.353295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5374","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73ce844e0f7b56f6e3100615f39297bed0aaeecfc215f8870dc287191f25e63d","sha256:6570de8366ef34d36aee262c44f8dc35b3c1284d06db95f772175a4524c588c8"],"state_sha256":"928d7a1ff8c07d00cba0e1b1e38ab4d3acac4d4fe6f8248df7f2779fc268976e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUXVuQ+3mYTuWjGfboOX2sAcyrC/azaIh5ODKKuBYIYVaXOutjZ9D8lYDsLB9DLPdidTSajKeFBb+7TejzzjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:51:36.667275Z","bundle_sha256":"5faaa94bef37f161eeb9f99fb581195504db6c551cb52d5b5954b043b7906aaa"}}