{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4A4VKKRR43TUHF4FLPZ2KAHEP2","short_pith_number":"pith:4A4VKKRR","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"},"canonical_sha256":"e039552a31e6e74397855bf3a500e47e8a0f37c79964d374574b56e143d650cd","source":{"kind":"arxiv","id":"1206.1535","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1535","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1535v3","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1535","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"4A4VKKRR43TU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4A4VKKRR43TUHF4F","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4A4VKKRR","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4A4VKKRR43TUHF4FLPZ2KAHEP2","target":"record","payload":{"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"},"canonical_sha256":"e039552a31e6e74397855bf3a500e47e8a0f37c79964d374574b56e143d650cd","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"},"source_kind":"arxiv","source_id":"1206.1535","source_version":3,"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:30:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cH+8BlVceee9RTqgDpMjFXZ8J4LMf3irGZichB6Kcd/hlcFO2Tgh/6LZ8wZRJNwR2k6T1L0vYZnyW3lMOqhmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:08.608151Z"},"content_sha256":"420cdfec634d31539d650d71fb287a1df1703b3534fc5eeae09446a1ade25e28","schema_version":"1.0","event_id":"sha256:420cdfec634d31539d650d71fb287a1df1703b3534fc5eeae09446a1ade25e28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4A4VKKRR43TUHF4FLPZ2KAHEP2","target":"graph","payload":{"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"},"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:30:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjDxQrw6j3yvYDf9Qs4YB/EP+W+mXY+ykkj69kBoEQzo+VUdkKdYkvURDEnQf6HfPWCwD5FKIxksRFOJ9DDuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:08.608521Z"},"content_sha256":"05bf74a1c9806ef66b210ac1755bf7bfc4d418cdfd90712e1bd4cbcc6aacb052","schema_version":"1.0","event_id":"sha256:05bf74a1c9806ef66b210ac1755bf7bfc4d418cdfd90712e1bd4cbcc6aacb052"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/bundle.json","state_url":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/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-26T06:52:08Z","links":{"resolver":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2","bundle":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/bundle.json","state":"https://pith.science/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4A4VKKRR43TUHF4FLPZ2KAHEP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4A4VKKRR43TUHF4FLPZ2KAHEP2","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":"84f8b528b209c0882dc1be947d59dce5623c0995d09f2d47dbd2f9f62169ca34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T15:52:53Z","title_canon_sha256":"d997b3a9b3bda019138b327b89e4df2e6d6273ae6cf02b779b99be3caa78f568"},"schema_version":"1.0","source":{"id":"1206.1535","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1535","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1535v3","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1535","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"4A4VKKRR43TU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4A4VKKRR43TUHF4F","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4A4VKKRR","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:05bf74a1c9806ef66b210ac1755bf7bfc4d418cdfd90712e1bd4cbcc6aacb052","target":"graph","created_at":"2026-05-18T03:30:28Z","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":"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","authors_text":"Aline Parreau, Louis Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T15:52:53Z","title":"Acyclic edge-coloring using entropy compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1535","kind":"arxiv","version":3},"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:420cdfec634d31539d650d71fb287a1df1703b3534fc5eeae09446a1ade25e28","target":"record","created_at":"2026-05-18T03:30:28Z","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":"84f8b528b209c0882dc1be947d59dce5623c0995d09f2d47dbd2f9f62169ca34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-07T15:52:53Z","title_canon_sha256":"d997b3a9b3bda019138b327b89e4df2e6d6273ae6cf02b779b99be3caa78f568"},"schema_version":"1.0","source":{"id":"1206.1535","kind":"arxiv","version":3}},"canonical_sha256":"e039552a31e6e74397855bf3a500e47e8a0f37c79964d374574b56e143d650cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e039552a31e6e74397855bf3a500e47e8a0f37c79964d374574b56e143d650cd","first_computed_at":"2026-05-18T03:30:28.065784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:28.065784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZylidueMF+rVM+ZXy6Nc9dQnCJ7MzC1jLlArwaOY1DC+HrPokJlcwn3amedlDbxl3S0VBRQV7cW7drQezqWQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:28.069136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1535","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:420cdfec634d31539d650d71fb287a1df1703b3534fc5eeae09446a1ade25e28","sha256:05bf74a1c9806ef66b210ac1755bf7bfc4d418cdfd90712e1bd4cbcc6aacb052"],"state_sha256":"b675ebb35ac6fcbc7b82790b4071e55929c7230f83773b6e693768b967e229e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lE9XffybEj6hNoPYsRPzuLfWn+/X1I2yUQgtAurCAx9l39cVVHZthopiI6BODX0b/tCks3umcrq9/O22ptaJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:52:08.611029Z","bundle_sha256":"8f678106bda47a7857c761455c2d59e6fac878879ba18369b278730d5d1585ae"}}