{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:J3XEXLZNDJLPADWW6RHTAP6YZJ","short_pith_number":"pith:J3XEXLZN","canonical_record":{"source":{"id":"2004.07151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T15:30:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"212821346d86977ced718931b324dc2b3addf624e9b0bfb2a6c81b7b3db07e53","abstract_canon_sha256":"033ef3e5917a1e93861d9be18ab4f4b4038f22dab55f859e218a0dae72af33d8"},"schema_version":"1.0"},"canonical_sha256":"4eee4baf2d1a56f00ed6f44f303fd8ca6b343ed63cc37a892b3b8f07ffba427a","source":{"kind":"arxiv","id":"2004.07151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07151","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07151v1","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07151","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"J3XEXLZNDJLP","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"pith_short_16","alias_value":"J3XEXLZNDJLPADWW","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"pith_short_8","alias_value":"J3XEXLZN","created_at":"2026-07-05T00:55:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:J3XEXLZNDJLPADWW6RHTAP6YZJ","target":"record","payload":{"canonical_record":{"source":{"id":"2004.07151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T15:30:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"212821346d86977ced718931b324dc2b3addf624e9b0bfb2a6c81b7b3db07e53","abstract_canon_sha256":"033ef3e5917a1e93861d9be18ab4f4b4038f22dab55f859e218a0dae72af33d8"},"schema_version":"1.0"},"canonical_sha256":"4eee4baf2d1a56f00ed6f44f303fd8ca6b343ed63cc37a892b3b8f07ffba427a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:25.107969Z","signature_b64":"m9jf/V8aa8Ssyeqlzv0RpK/P4Sv7/ImMMHsYKrbSnvnpTQmTJvDk2ArF7rdquIEerAB85+jMSCg5wpqvCXYHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eee4baf2d1a56f00ed6f44f303fd8ca6b343ed63cc37a892b3b8f07ffba427a","last_reissued_at":"2026-07-05T00:55:25.107562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:25.107562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.07151","source_version":1,"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-07-05T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eN4p3RNA101Fv9AMZ3lQjFBHXhlJAPm49JSGwRw0eJdxPgFaCfuTSzDMKhzLSzPUV6+hN34mqCZVEvRT18F0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:31:25.378894Z"},"content_sha256":"995515cbfa8bdadb145df083915f848d24b62518449f002406510e8cb026afb9","schema_version":"1.0","event_id":"sha256:995515cbfa8bdadb145df083915f848d24b62518449f002406510e8cb026afb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:J3XEXLZNDJLPADWW6RHTAP6YZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithmic framework for colouring locally sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Ewan Davies, Fran\\c{c}ois Pirot, Jean-S\\'ebastien Sereni, Ross J. Kang","submitted_at":"2020-04-15T15:30:38Z","abstract_excerpt":"We develop an algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets.\n  With this we give, for any fixed $k\\ge 3$ and $\\varepsilon>0$, a randomised polynomial-time algorithm for colouring graphs of maximum degree $\\Delta$ in which each vertex is contained in at most $t$ copies of a cycle of length $k$, where $1/2\\le t\\le \\Delta^\\frac{2\\varepsilon}{1+2\\varepsilon}/(\\log\\Delta)^2$, with $\\lfloor(1+\\varepsilon)\\Delta/\\log(\\Delta/\\sqrt t)\\rfloor$ colours.\n  This generalises and improves upon several notable results inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07151","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.07151/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NwshpxA4Vf/vsR8gRAikE8bs5gFs1JOPZMIUl0cjtLGkkbn7smJfsioQG5gDOYveuE3jL6Xj1ePgLGGhhQeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:31:25.379386Z"},"content_sha256":"6f4aad385d44feaab1cd0ad0ba1b742403364802755b62a13cdf01c6bb1bdf16","schema_version":"1.0","event_id":"sha256:6f4aad385d44feaab1cd0ad0ba1b742403364802755b62a13cdf01c6bb1bdf16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ/bundle.json","state_url":"https://pith.science/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ/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-08-13T06:31:25Z","links":{"resolver":"https://pith.science/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ","bundle":"https://pith.science/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ/bundle.json","state":"https://pith.science/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3XEXLZNDJLPADWW6RHTAP6YZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:J3XEXLZNDJLPADWW6RHTAP6YZJ","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":"033ef3e5917a1e93861d9be18ab4f4b4038f22dab55f859e218a0dae72af33d8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T15:30:38Z","title_canon_sha256":"212821346d86977ced718931b324dc2b3addf624e9b0bfb2a6c81b7b3db07e53"},"schema_version":"1.0","source":{"id":"2004.07151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.07151","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"2004.07151v1","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07151","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"J3XEXLZNDJLP","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"pith_short_16","alias_value":"J3XEXLZNDJLPADWW","created_at":"2026-07-05T00:55:25Z"},{"alias_kind":"pith_short_8","alias_value":"J3XEXLZN","created_at":"2026-07-05T00:55:25Z"}],"graph_snapshots":[{"event_id":"sha256:6f4aad385d44feaab1cd0ad0ba1b742403364802755b62a13cdf01c6bb1bdf16","target":"graph","created_at":"2026-07-05T00:55:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.07151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets.\n  With this we give, for any fixed $k\\ge 3$ and $\\varepsilon>0$, a randomised polynomial-time algorithm for colouring graphs of maximum degree $\\Delta$ in which each vertex is contained in at most $t$ copies of a cycle of length $k$, where $1/2\\le t\\le \\Delta^\\frac{2\\varepsilon}{1+2\\varepsilon}/(\\log\\Delta)^2$, with $\\lfloor(1+\\varepsilon)\\Delta/\\log(\\Delta/\\sqrt t)\\rfloor$ colours.\n  This generalises and improves upon several notable results inc","authors_text":"Ewan Davies, Fran\\c{c}ois Pirot, Jean-S\\'ebastien Sereni, Ross J. Kang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T15:30:38Z","title":"An algorithmic framework for colouring locally sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07151","kind":"arxiv","version":1},"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:995515cbfa8bdadb145df083915f848d24b62518449f002406510e8cb026afb9","target":"record","created_at":"2026-07-05T00:55:25Z","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":"033ef3e5917a1e93861d9be18ab4f4b4038f22dab55f859e218a0dae72af33d8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-15T15:30:38Z","title_canon_sha256":"212821346d86977ced718931b324dc2b3addf624e9b0bfb2a6c81b7b3db07e53"},"schema_version":"1.0","source":{"id":"2004.07151","kind":"arxiv","version":1}},"canonical_sha256":"4eee4baf2d1a56f00ed6f44f303fd8ca6b343ed63cc37a892b3b8f07ffba427a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eee4baf2d1a56f00ed6f44f303fd8ca6b343ed63cc37a892b3b8f07ffba427a","first_computed_at":"2026-07-05T00:55:25.107562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:25.107562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m9jf/V8aa8Ssyeqlzv0RpK/P4Sv7/ImMMHsYKrbSnvnpTQmTJvDk2ArF7rdquIEerAB85+jMSCg5wpqvCXYHCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:25.107969Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.07151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:995515cbfa8bdadb145df083915f848d24b62518449f002406510e8cb026afb9","sha256:6f4aad385d44feaab1cd0ad0ba1b742403364802755b62a13cdf01c6bb1bdf16"],"state_sha256":"34532eb0f124a0301ba23952d9c4ab25baeba9cc37a189accd4abcddb91fd42b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNuOys+qjZAV3CXt1oTqnkpyC3BGRsq0RFF2C1RdO+GjJrJyIOOUkMT7XbonQUiYQg/b1xolMBiIZy+C90YvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:31:25.382637Z","bundle_sha256":"de32bb324637f42e8d792e7c8248c0e890c10f319ebad645c8c6de0565a1de49"}}