{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UMPFJ3TSO6DZPHAM2UNGUF5VDZ","short_pith_number":"pith:UMPFJ3TS","schema_version":"1.0","canonical_sha256":"a31e54ee727787979c0cd51a6a17b51e6a9816ead60dc24adcdf72042e932d04","source":{"kind":"arxiv","id":"2404.04987","version":2},"attestation_state":"computed","paper":{"title":"Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Kevin Pratt, Petteri Kaski, Radu Curticapean, Thore Husfeldt","submitted_at":"2024-04-07T15:10:25Z","abstract_excerpt":"In this paper we further explore the recently discovered connection by Bj\\\"{o}rklund and Kaski [STOC 2024] and Pratt [STOC 2024] between the asymptotic rank conjecture of Strassen [Progr. Math. 1994] and the three-way partitioning problem. We show that under the asymptotic rank conjecture, the chromatic number of an $n$-vertex graph can be computed deterministically in $O(1.99982^n)$ time, thus giving a conditional answer to a question of Zamir [ICALP 2021], and questioning the optimality of the $2^n\\operatorname{poly}(n)$ time algorithm for chromatic number by Bj\\\"{o}rklund, Husfeldt, and Koi"},"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":"2404.04987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-07T15:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"95e61993654aae1c9744d16cdeb19b85e76d3000e4fe7abd6bce98881387fb01","abstract_canon_sha256":"e6c68af28f2c273e8b8f6ef4aeda60ce133d3d3a6ab95b54dacec07766883488"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:09.393222Z","signature_b64":"kweIP8nAbOnjy7dBqcmtaxW6Cqp5Ol2tG8SRV0lgVlGrbPXbCMbRT4178wG1CoYDl1+qxaDzb2kqYmlzM1+LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31e54ee727787979c0cd51a6a17b51e6a9816ead60dc24adcdf72042e932d04","last_reissued_at":"2026-07-05T09:45:09.392740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:09.392740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Kevin Pratt, Petteri Kaski, Radu Curticapean, Thore Husfeldt","submitted_at":"2024-04-07T15:10:25Z","abstract_excerpt":"In this paper we further explore the recently discovered connection by Bj\\\"{o}rklund and Kaski [STOC 2024] and Pratt [STOC 2024] between the asymptotic rank conjecture of Strassen [Progr. Math. 1994] and the three-way partitioning problem. We show that under the asymptotic rank conjecture, the chromatic number of an $n$-vertex graph can be computed deterministically in $O(1.99982^n)$ time, thus giving a conditional answer to a question of Zamir [ICALP 2021], and questioning the optimality of the $2^n\\operatorname{poly}(n)$ time algorithm for chromatic number by Bj\\\"{o}rklund, Husfeldt, and Koi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04987","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/2404.04987/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":"2404.04987","created_at":"2026-07-05T09:45:09.392795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.04987v2","created_at":"2026-07-05T09:45:09.392795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04987","created_at":"2026-07-05T09:45:09.392795+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMPFJ3TSO6DZ","created_at":"2026-07-05T09:45:09.392795+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMPFJ3TSO6DZPHAM","created_at":"2026-07-05T09:45:09.392795+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMPFJ3TS","created_at":"2026-07-05T09:45:09.392795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.05570","citing_title":"Faster Edge Coloring by Partition Sieving","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ","json":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ.json","graph_json":"https://pith.science/api/pith-number/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/graph.json","events_json":"https://pith.science/api/pith-number/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/events.json","paper":"https://pith.science/paper/UMPFJ3TS"},"agent_actions":{"view_html":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ","download_json":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ.json","view_paper":"https://pith.science/paper/UMPFJ3TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.04987&json=true","fetch_graph":"https://pith.science/api/pith-number/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/action/storage_attestation","attest_author":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/action/author_attestation","sign_citation":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/action/citation_signature","submit_replication":"https://pith.science/pith/UMPFJ3TSO6DZPHAM2UNGUF5VDZ/action/replication_record"}},"created_at":"2026-07-05T09:45:09.392795+00:00","updated_at":"2026-07-05T09:45:09.392795+00:00"}