{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:APHUW2SGPPHHWAW3JULKHQSW5S","short_pith_number":"pith:APHUW2SG","canonical_record":{"source":{"id":"2007.07874","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-07-15T17:49:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fcb8f784fb5fc0b0bc000042ec7ccab519c91d591e277aa4969dccfb3b93f144","abstract_canon_sha256":"8eff6f484da638d62bed546cd0dd077d95aee1b7d2c01f4573dab6c56018b87d"},"schema_version":"1.0"},"canonical_sha256":"03cf4b6a467bce7b02db4d16a3c256ec86169ed570c72953990a2c95507a1005","source":{"kind":"arxiv","id":"2007.07874","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07874","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07874v3","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07874","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"APHUW2SGPPHH","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"APHUW2SGPPHHWAW3","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"APHUW2SG","created_at":"2026-07-05T04:56:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:APHUW2SGPPHHWAW3JULKHQSW5S","target":"record","payload":{"canonical_record":{"source":{"id":"2007.07874","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-07-15T17:49:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fcb8f784fb5fc0b0bc000042ec7ccab519c91d591e277aa4969dccfb3b93f144","abstract_canon_sha256":"8eff6f484da638d62bed546cd0dd077d95aee1b7d2c01f4573dab6c56018b87d"},"schema_version":"1.0"},"canonical_sha256":"03cf4b6a467bce7b02db4d16a3c256ec86169ed570c72953990a2c95507a1005","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:09.517480Z","signature_b64":"I8spX4DGAjaN/hzQgj7z0m7BI3DgQCo4qEWCb1owjXlOJWFtweC9IKCoKT5qtnPz3kSL5mTagxF6o+rKOhj9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03cf4b6a467bce7b02db4d16a3c256ec86169ed570c72953990a2c95507a1005","last_reissued_at":"2026-07-05T04:56:09.516987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:09.516987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.07874","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-07-05T04:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6RbmQWdDjw4GsjfCtXVzoFZtqoEC8FIcY6jMxDqh8NGK5J345U2amBQu6QO50qih26C8IYh0GOo8dM2ar3pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:53:31.157651Z"},"content_sha256":"64647bf606bbd39b63b86c654ed6104e3c094e5efe8d314ea1446966e96ddfea","schema_version":"1.0","event_id":"sha256:64647bf606bbd39b63b86c654ed6104e3c094e5efe8d314ea1446966e96ddfea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:APHUW2SGPPHHWAW3JULKHQSW5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved procedure for colouring graphs of bounded local density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eoin Hurley, R\\'emi de Joannis de Verclos, Ross J. Kang","submitted_at":"2020-07-15T17:49:16Z","abstract_excerpt":"We develop an improved bound for the chromatic number of graphs of maximum degree $\\Delta$ under the assumption that the number of edges spanning any neighbourhood is at most $(1-\\sigma)\\binom{\\Delta}{2}$ for some fixed $0<\\sigma<1$. The leading term in the reduction of colours achieved through this bound is best possible as $\\sigma\\to0$. As two consequences, we advance the state of the art in two longstanding and well-studied graph colouring conjectures, the Erd\\H{o}s-Ne\\v{s}et\\v{r}il conjecture and Reed's conjecture. We prove that the strong chromatic index is at most $1.772\\Delta^2$ for any"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07874","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.07874/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-05T04:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaGYrYXW7xCULbWM03DiZ1jTTQ6JJaVp3Nj8vZtOexo+QKTGlkACsu+7/jkvktTe5Noj1VhipLW27OhCMjmGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:53:31.158269Z"},"content_sha256":"c3fcf61f65aeada251caf652a6d9e01a52398ede516effe6b8a44be3b655d94b","schema_version":"1.0","event_id":"sha256:c3fcf61f65aeada251caf652a6d9e01a52398ede516effe6b8a44be3b655d94b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APHUW2SGPPHHWAW3JULKHQSW5S/bundle.json","state_url":"https://pith.science/pith/APHUW2SGPPHHWAW3JULKHQSW5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APHUW2SGPPHHWAW3JULKHQSW5S/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-11T17:53:31Z","links":{"resolver":"https://pith.science/pith/APHUW2SGPPHHWAW3JULKHQSW5S","bundle":"https://pith.science/pith/APHUW2SGPPHHWAW3JULKHQSW5S/bundle.json","state":"https://pith.science/pith/APHUW2SGPPHHWAW3JULKHQSW5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APHUW2SGPPHHWAW3JULKHQSW5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:APHUW2SGPPHHWAW3JULKHQSW5S","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":"8eff6f484da638d62bed546cd0dd077d95aee1b7d2c01f4573dab6c56018b87d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-07-15T17:49:16Z","title_canon_sha256":"fcb8f784fb5fc0b0bc000042ec7ccab519c91d591e277aa4969dccfb3b93f144"},"schema_version":"1.0","source":{"id":"2007.07874","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07874","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07874v3","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07874","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"APHUW2SGPPHH","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"APHUW2SGPPHHWAW3","created_at":"2026-07-05T04:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"APHUW2SG","created_at":"2026-07-05T04:56:09Z"}],"graph_snapshots":[{"event_id":"sha256:c3fcf61f65aeada251caf652a6d9e01a52398ede516effe6b8a44be3b655d94b","target":"graph","created_at":"2026-07-05T04:56:09Z","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/2007.07874/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an improved bound for the chromatic number of graphs of maximum degree $\\Delta$ under the assumption that the number of edges spanning any neighbourhood is at most $(1-\\sigma)\\binom{\\Delta}{2}$ for some fixed $0<\\sigma<1$. The leading term in the reduction of colours achieved through this bound is best possible as $\\sigma\\to0$. As two consequences, we advance the state of the art in two longstanding and well-studied graph colouring conjectures, the Erd\\H{o}s-Ne\\v{s}et\\v{r}il conjecture and Reed's conjecture. We prove that the strong chromatic index is at most $1.772\\Delta^2$ for any","authors_text":"Eoin Hurley, R\\'emi de Joannis de Verclos, Ross J. Kang","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-07-15T17:49:16Z","title":"An improved procedure for colouring graphs of bounded local density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07874","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:64647bf606bbd39b63b86c654ed6104e3c094e5efe8d314ea1446966e96ddfea","target":"record","created_at":"2026-07-05T04:56:09Z","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":"8eff6f484da638d62bed546cd0dd077d95aee1b7d2c01f4573dab6c56018b87d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-07-15T17:49:16Z","title_canon_sha256":"fcb8f784fb5fc0b0bc000042ec7ccab519c91d591e277aa4969dccfb3b93f144"},"schema_version":"1.0","source":{"id":"2007.07874","kind":"arxiv","version":3}},"canonical_sha256":"03cf4b6a467bce7b02db4d16a3c256ec86169ed570c72953990a2c95507a1005","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03cf4b6a467bce7b02db4d16a3c256ec86169ed570c72953990a2c95507a1005","first_computed_at":"2026-07-05T04:56:09.516987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:56:09.516987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I8spX4DGAjaN/hzQgj7z0m7BI3DgQCo4qEWCb1owjXlOJWFtweC9IKCoKT5qtnPz3kSL5mTagxF6o+rKOhj9CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:56:09.517480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.07874","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64647bf606bbd39b63b86c654ed6104e3c094e5efe8d314ea1446966e96ddfea","sha256:c3fcf61f65aeada251caf652a6d9e01a52398ede516effe6b8a44be3b655d94b"],"state_sha256":"88ed03a0bd8fcf33e19ee5ab4d3189cdc1bcd7122336d6c9006b773b78e939c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+P09xrheMM+52Z+4syGnZp8F47hFbMbZNQc+W5CicY2zybjZUo9JGXYm+jPlR+IXJskJyy5kkeEFC08WBvQnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:53:31.163683Z","bundle_sha256":"2df5687f57dbc256405fdf15a9269fca567b76fc85a28d02c00518ddf7c187ea"}}