{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XWNDQGA7QHPT3XRTYTNMYM6HF3","short_pith_number":"pith:XWNDQGA7","canonical_record":{"source":{"id":"1406.4380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-17T14:29:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f769171a935ac017d20af1842314c25606c1d0eafa46e14dfd47ab055fc556b8","abstract_canon_sha256":"2d302fb07725ce6b4e0b22c8d4880fe15c27ff0d9884335b91ba5bc56233facd"},"schema_version":"1.0"},"canonical_sha256":"bd9a38181f81df3dde33c4dacc33c72ecb942daeb531440206ba0e8947340c95","source":{"kind":"arxiv","id":"1406.4380","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4380","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4380v2","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4380","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"XWNDQGA7QHPT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XWNDQGA7QHPT3XRT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XWNDQGA7","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XWNDQGA7QHPT3XRTYTNMYM6HF3","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-17T14:29:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f769171a935ac017d20af1842314c25606c1d0eafa46e14dfd47ab055fc556b8","abstract_canon_sha256":"2d302fb07725ce6b4e0b22c8d4880fe15c27ff0d9884335b91ba5bc56233facd"},"schema_version":"1.0"},"canonical_sha256":"bd9a38181f81df3dde33c4dacc33c72ecb942daeb531440206ba0e8947340c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:55.102851Z","signature_b64":"LgJYRkDVxQ4EMEvmUlW1Umv7ZTCuhXpg1D+0RjMRkduL6poQw4lqw7obau5UEq2IQVTAIDbpeWvJ6Y35MBdNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd9a38181f81df3dde33c4dacc33c72ecb942daeb531440206ba0e8947340c95","last_reissued_at":"2026-05-18T02:28:55.102493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:55.102493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4380","source_version":2,"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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvFTYvvPabKXX8Iiz4wMV2Mq8oJPwHp86PHxJmJoL2jCMFKZloShPM1FxsZZPM/sqnmD9lZ1D6k5dMPU8XInBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:42:00.661352Z"},"content_sha256":"678efc4d96d6345da861b7578cb83d538abbf1b04acccfc6f2e4bfb0208b8596","schema_version":"1.0","event_id":"sha256:678efc4d96d6345da861b7578cb83d538abbf1b04acccfc6f2e4bfb0208b8596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XWNDQGA7QHPT3XRTYTNMYM6HF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy compression method applied to graph colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Daniel Gon\\c{c}alves, Micka\\\"el Montassier","submitted_at":"2014-06-17T14:29:46Z","abstract_excerpt":"Based on the algorithmic proof of Lov\\'asz local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmovi\\'c et al. on colorings, Esperet and Parreau developed a framework to prove upper bounds for several chromatic numbers (in particular acyclic chromatic index, star chromatic number and Thue chromatic number) using the so-called \\emph{entropy compression method}.\n  Inspired by this work, we propose a more general framework and a better analysis. This leads to improved upper bounds on chromatic numbers and indices. In particular, every graph with maximum degree $\\Delt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4380","kind":"arxiv","version":2},"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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vM0gKiSSx84edRvCv6KUiJYasPvNy8Tgmf6Y5ch+jDgZnXteX2wId0B52+FmrpI3n/89J5tqEgoZE1Gnb5C2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:42:00.661710Z"},"content_sha256":"df9319e496d787103a1d8c19a02604a590dd146389d0fe7845ac2c9f1ec55f39","schema_version":"1.0","event_id":"sha256:df9319e496d787103a1d8c19a02604a590dd146389d0fe7845ac2c9f1ec55f39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3/bundle.json","state_url":"https://pith.science/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3/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-02T00:42:00Z","links":{"resolver":"https://pith.science/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3","bundle":"https://pith.science/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3/bundle.json","state":"https://pith.science/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWNDQGA7QHPT3XRTYTNMYM6HF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XWNDQGA7QHPT3XRTYTNMYM6HF3","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":"2d302fb07725ce6b4e0b22c8d4880fe15c27ff0d9884335b91ba5bc56233facd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-17T14:29:46Z","title_canon_sha256":"f769171a935ac017d20af1842314c25606c1d0eafa46e14dfd47ab055fc556b8"},"schema_version":"1.0","source":{"id":"1406.4380","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4380","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4380v2","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4380","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"XWNDQGA7QHPT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XWNDQGA7QHPT3XRT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XWNDQGA7","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:df9319e496d787103a1d8c19a02604a590dd146389d0fe7845ac2c9f1ec55f39","target":"graph","created_at":"2026-05-18T02:28:55Z","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":"Based on the algorithmic proof of Lov\\'asz local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmovi\\'c et al. on colorings, Esperet and Parreau developed a framework to prove upper bounds for several chromatic numbers (in particular acyclic chromatic index, star chromatic number and Thue chromatic number) using the so-called \\emph{entropy compression method}.\n  Inspired by this work, we propose a more general framework and a better analysis. This leads to improved upper bounds on chromatic numbers and indices. In particular, every graph with maximum degree $\\Delt","authors_text":"Alexandre Pinlou, Daniel Gon\\c{c}alves, Micka\\\"el Montassier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-17T14:29:46Z","title":"Entropy compression method applied to graph colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4380","kind":"arxiv","version":2},"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:678efc4d96d6345da861b7578cb83d538abbf1b04acccfc6f2e4bfb0208b8596","target":"record","created_at":"2026-05-18T02:28:55Z","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":"2d302fb07725ce6b4e0b22c8d4880fe15c27ff0d9884335b91ba5bc56233facd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-17T14:29:46Z","title_canon_sha256":"f769171a935ac017d20af1842314c25606c1d0eafa46e14dfd47ab055fc556b8"},"schema_version":"1.0","source":{"id":"1406.4380","kind":"arxiv","version":2}},"canonical_sha256":"bd9a38181f81df3dde33c4dacc33c72ecb942daeb531440206ba0e8947340c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd9a38181f81df3dde33c4dacc33c72ecb942daeb531440206ba0e8947340c95","first_computed_at":"2026-05-18T02:28:55.102493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:55.102493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LgJYRkDVxQ4EMEvmUlW1Umv7ZTCuhXpg1D+0RjMRkduL6poQw4lqw7obau5UEq2IQVTAIDbpeWvJ6Y35MBdNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:55.102851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4380","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:678efc4d96d6345da861b7578cb83d538abbf1b04acccfc6f2e4bfb0208b8596","sha256:df9319e496d787103a1d8c19a02604a590dd146389d0fe7845ac2c9f1ec55f39"],"state_sha256":"a87b9a74f4fe69c3726f311840b672dcf156a85af6446251b9c7d9b3a1e4ace8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNb69PYgp2enL+2oT6z7URL4zaBNsX6JEY6BfCwKbevbktLdNNLZxSCSgWv1J3/xOkoOKIlSlEXbXxGXX14zAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:42:00.663727Z","bundle_sha256":"de6aad3eac50084b33f0ce3603ea64a470136860810e5dbe6f5f4b9d7dd9baa9"}}