{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WNI2TDAPZ472NIFUFMMB55CSUE","short_pith_number":"pith:WNI2TDAP","schema_version":"1.0","canonical_sha256":"b351a98c0fcf3fa6a0b42b181ef452a108a1dccc3d67c2641517d43bc17346dc","source":{"kind":"arxiv","id":"2601.13072","version":2},"attestation_state":"computed","paper":{"title":"Faster 3-colouring algorithm for graphs of diameter 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carla Groenland, Hidde Koerts, Sophie Spirkl","submitted_at":"2026-01-19T14:05:52Z","abstract_excerpt":"We show that given an $n$-vertex graph $G$ of diameter 3 we can decide if $G$ is $3$-colourable in time $2^{O(n^{2/3-\\varepsilon})}$ for any $\\varepsilon < 1/33$. This improves on the previous best algorithm of $2^{O((n\\log n)^{2/3})}$ from D\\k{e}bski, Piecyk and Rz\\k{a}\\.zewski [Faster 3-coloring of small-diameter graphs, ESA 2021]."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2601.13072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-01-19T14:05:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1f351ec52625f456f2b39d2c95d135a5074adf42d3ab37959b574948c8fdf4ce","abstract_canon_sha256":"5f969a68b338fcf15529fd7ea3cfc3069fafca1f409c019a308904844ab42673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:05.622553Z","signature_b64":"3GCKPmBV1s1+nLKowOCoI1zvu4GTSeUT295t+Ti8S5Vl9XX+fqfWrHQX0lzw7YpCgsQdkf+K+Xyr4AOpT3EWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b351a98c0fcf3fa6a0b42b181ef452a108a1dccc3d67c2641517d43bc17346dc","last_reissued_at":"2026-05-26T02:05:05.621613Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:05.621613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster 3-colouring algorithm for graphs of diameter 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carla Groenland, Hidde Koerts, Sophie Spirkl","submitted_at":"2026-01-19T14:05:52Z","abstract_excerpt":"We show that given an $n$-vertex graph $G$ of diameter 3 we can decide if $G$ is $3$-colourable in time $2^{O(n^{2/3-\\varepsilon})}$ for any $\\varepsilon < 1/33$. This improves on the previous best algorithm of $2^{O((n\\log n)^{2/3})}$ from D\\k{e}bski, Piecyk and Rz\\k{a}\\.zewski [Faster 3-coloring of small-diameter graphs, ESA 2021]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.13072","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.13072/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.13072","created_at":"2026-05-26T02:05:05.621705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.13072v2","created_at":"2026-05-26T02:05:05.621705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.13072","created_at":"2026-05-26T02:05:05.621705+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNI2TDAPZ472","created_at":"2026-05-26T02:05:05.621705+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNI2TDAPZ472NIFU","created_at":"2026-05-26T02:05:05.621705+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNI2TDAP","created_at":"2026-05-26T02:05:05.621705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE","json":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE.json","graph_json":"https://pith.science/api/pith-number/WNI2TDAPZ472NIFUFMMB55CSUE/graph.json","events_json":"https://pith.science/api/pith-number/WNI2TDAPZ472NIFUFMMB55CSUE/events.json","paper":"https://pith.science/paper/WNI2TDAP"},"agent_actions":{"view_html":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE","download_json":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE.json","view_paper":"https://pith.science/paper/WNI2TDAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.13072&json=true","fetch_graph":"https://pith.science/api/pith-number/WNI2TDAPZ472NIFUFMMB55CSUE/graph.json","fetch_events":"https://pith.science/api/pith-number/WNI2TDAPZ472NIFUFMMB55CSUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE/action/storage_attestation","attest_author":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE/action/author_attestation","sign_citation":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE/action/citation_signature","submit_replication":"https://pith.science/pith/WNI2TDAPZ472NIFUFMMB55CSUE/action/replication_record"}},"created_at":"2026-05-26T02:05:05.621705+00:00","updated_at":"2026-05-26T02:05:05.621705+00:00"}