{"as_of":"2026-08-12T13:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7cd48b4316ec035cd85d377e690feeca94ce7057d9bffcd0ef944e924fe7baf3","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T01:06:19.463003Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T10:42:28.587548Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.25973","snapshot_observed_at":"2026-07-30T10:42:28.587548Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27159","last_updated":"2026-07-29T17:36:11Z","snapshot_observed_at":"2026-08-07T08:07:21.994512Z","submitted_at":"2026-07-29T17:36:11Z","title":"Breaking the $2^n$ barrier for graph $k$-coloring","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.587548Z"},"links":{"cited_paper":"/paper/2607.25973","citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:d0b8991501f8cbe9f2908f50f25ae1137951d6d71da1d375482df0b318443631","observation_id":"227f72be-9f2a-47f2-95f1-74c0b3bfd3ff","resolution":{"observed_at":"2026-07-30T10:42:28.587548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.25973/citation-record","integrity":"/paper/2607.25973/integrity","json":"/paper/2607.25973/citation-record.json","paper":"/paper/2607.25973"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:13.539361Z","title":"and Tarjan, Robert Endre , title =","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:13.539361Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:d2eb1574bc2500036e91745d0bbef5cd123bf0b997912e0b0a4fd604b0c5eedb","observation_id":"80325775-8957-43fe-8158-afe3f51973d7","resolution":{"observed_at":"2026-08-01T01:06:13.539361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:13.641061Z","title":"Journal of Algorithms , volume =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:13.641061Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:f5fac43bd64c58493b64bac2d98eaadd3af68c3f6696828db7cebc2ba0beeba5","observation_id":"21ea7420-a548-4755-9fb8-dd6e430b8831","resolution":{"observed_at":"2026-08-01T01:06:13.641061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:13.709080Z","title":"Fourier Meets","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:13.709080Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:5c648acbbae18156e1842f5734afdbad5f522e231ed1ba23052f53be860cc3d4","observation_id":"4fdcf278-ccee-46a3-bfd0-8b88934b93aa","resolution":{"observed_at":"2026-08-01T01:06:13.709080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:13.780492Z","title":"Set Partitioning via Inclusion--Exclusion , journal =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:13.780492Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:e89672f76485183fcb8511f3bebacdc02c7d98e706ef0e749c7b6d3dc8dbb7fd","observation_id":"730a0a4f-995e-4bd0-8d19-e6ece7a05b5e","resolution":{"observed_at":"2026-08-01T01:06:13.780492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:13.838093Z","title":"Parameterized and Exact Computation: Third International Workshop,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:13.838093Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:31f0cc6ea07633820c24539c64cb05084220c85e07f4af0e2e72db71d286e7ac","observation_id":"81aa6b2c-1124-4bb4-b219-85d47efb16e2","resolution":{"observed_at":"2026-08-01T01:06:13.838093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:13.943358Z","title":"30th Annual European Symposium on Algorithms (","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:13.943358Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:5d90787cdb78e341e4bb4515f0f556918deea358e0fcd9fe99211280b4a77d41","observation_id":"abdeeb87-15d8-4a2a-97bd-fb9287474777","resolution":{"observed_at":"2026-08-01T01:06:13.943358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.042268Z","title":"48th International Colloquium on Automata, Languages, and Programming (","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.042268Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:41ed8ed01f8b9739c8150e073a9a7fbd31721d54396da732f83dd6d71dd0c686","observation_id":"274c19d2-c4a9-480e-b6d1-e566939b1b9e","resolution":{"observed_at":"2026-08-01T01:06:14.042268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.132343Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.132343Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:fe167c58268d104e35668edf07b89d0fd778459579018e5fcb83139ce8541464","observation_id":"d8f5b783-b200-4ffc-8660-02b92e25c125","resolution":{"observed_at":"2026-08-01T01:06:14.132343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.255283Z","title":"AI magazine , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.255283Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:c48e87613e020264aa269bd774a4961dfc80d8e7e880ffed999ebf823ab2452d","observation_id":"ee3cb33f-3ce3-4268-bc01-e0f421d8d576","resolution":{"observed_at":"2026-08-01T01:06:14.255283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.324114Z","title":"A probabilistic algorithm for","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.324114Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:935cf85aba7896b02e51aad29a58aaefba2ff5a4366799fb7762b305063cebdc","observation_id":"398dd319-fb17-4ffe-8149-407be8c9bc87","resolution":{"observed_at":"2026-08-01T01:06:14.324114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.412295Z","title":"Proc.\\ of 41st ICALP","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.412295Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:62ca8ee4b98581d7cd01f8f674bf8c75697193e602b935113e6c7ec1c0c0d68f","observation_id":"6114a911-7d4f-4a78-a722-a63c369c26a0","resolution":{"observed_at":"2026-08-01T01:06:14.412295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.513725Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.513725Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:0c0b7fdcbb837ed5766795e2c8f24879e9f15d1f3e5ea3c6a1c8e9d386a49e50","observation_id":"1027b245-7403-4fe5-9fe7-db5e734309a6","resolution":{"observed_at":"2026-08-01T01:06:14.513725Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.608151Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.608151Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:88f29cb9b4eb0ddbcbf030cc41f77eb5686f2040021a5c4675e37ab14f7310e7","observation_id":"a4217fd3-658e-45f8-b24d-d45ee2f2e022","resolution":{"observed_at":"2026-08-01T01:06:14.608151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0166-218x(85)90050-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete Applied Mathematics , volume =","venue":"Discrete Applied Mathematics","work_id":"0ec61cba-9b39-4f8b-b6ab-efe85a2face3","year":1985},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.695482Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:83c0475b3b69c57801f06d15493c8417d7e5171f34d4a9f1f0ffb82a8200026a","observation_id":"7a892462-858c-43ae-8834-539912aecc1f","resolution":{"observed_at":"2026-08-01T01:11:06.349164Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.851346Z","title":"Satisfiability Coding Lemma , journal =","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.851346Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:e51844033f9be95554a4ee8b4ff82fdbed9a35f08bee29bc458912cb9c8c2791","observation_id":"cec82ea8-33d2-49f2-b846-f3513dbd2619","resolution":{"observed_at":"2026-08-01T01:06:14.851346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:14.947765Z","title":"An Improved Exponential-Time Algorithm for k -","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:14.947765Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:85e3f9cdd5aa21d7c9c98dcfa7650a01f9b7aa73c5d3e39d27d6708c14436799","observation_id":"3ee1888b-8f86-426d-9716-c67687c3ba43","resolution":{"observed_at":"2026-08-01T01:06:14.947765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:15.058735Z","title":"An improved exponential-time algorithm for k -","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.058735Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:eca4f4716684ba1d98b48dd5cad1e9f624babf2bd4a261e154774ed6ec9d5bfc","observation_id":"bc5d50d7-7ff7-45be-bf34-145ab21f8e49","resolution":{"observed_at":"2026-08-01T01:06:15.058735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2017.85","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proc.\\ of 44th ICALP , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"28feff1e-a5dc-4878-8b78-8ac11844cae3","year":2017},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.172625Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:2aaeeda2cbcdc46f5eb4d4365a5e7fd630cf09355c177e954dc0bceaaf20a937","observation_id":"92ff1316-9bbe-4402-8130-42d7cd88bc4d","resolution":{"observed_at":"2026-08-01T01:11:06.290584Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:15.291031Z","title":"An Improvement of the Algorithm of","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.291031Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:e835b3530b7ddf19ae8575a1ffe51d18faed2f796a1cc9b0945adb0487de6db7","observation_id":"be87f220-fec3-47c5-a105-944213de196b","resolution":{"observed_at":"2026-08-01T01:06:15.291031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-61732-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A New Approach on Solving 3-Satisfiability , booktitle =","venue":null,"work_id":"c68016c4-0047-47fd-a2e8-471fe6da45fc","year":1996},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.396503Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:6059dc84a466f4f617b15cabb2103d43f9e3f126bb7b76b85b08fa5923f52d67","observation_id":"f04d56ed-04a9-47e3-bf2d-abc8461f277a","resolution":{"observed_at":"2026-08-01T01:11:06.220727Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2017.9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Steinberger , title =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"2493835e-9ddb-4b3c-86cd-9955d05f63ab","year":2017},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.516435Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:4faadbf90f4cff439e3431b8cb699020752e8fcd4e98e19cf54efc622aec4392","observation_id":"41174625-0086-49b1-bcae-95a0fca61392","resolution":{"observed_at":"2026-08-01T01:11:06.162136Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:15.616152Z","title":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.616152Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:5030be60bd980b64252be2374021c084bcc94150a133a47417343a38a45086e6","observation_id":"3c3e4ad3-5ced-4ce0-bcad-7718226205c4","resolution":{"observed_at":"2026-08-01T01:06:15.616152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:15.739846Z","title":"3-coloring in time","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.739846Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:57cdae3050ec2cd941afead9abce265d3bca63a6d621a48229d1e5675bbb8db7","observation_id":"f3ff9599-cd3c-4c62-bc35-e5a0afba4101","resolution":{"observed_at":"2026-08-01T01:06:15.739846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:15.859043Z","title":"ACM Transactions on Algorithms (TALG) , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.859043Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:fed1ac1a0d1b3938d1f0b56c3c6197b1fcd6cf7cdf7c3bf098e1d6f349cefd4d","observation_id":"297c9257-d9f6-4d4c-86e0-8f686e0b42f0","resolution":{"observed_at":"2026-08-01T01:06:15.859043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:15.945251Z","title":"International Computing and Combinatorics Conference , pages=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:15.945251Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:6d43e483e798517fb1b7561f5df03dafb71d540df74613e0fb958c4c7eb854e5","observation_id":"41cd1fd0-8785-46a5-b649-15a8468287fe","resolution":{"observed_at":"2026-08-01T01:06:15.945251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.019974Z","title":"Information and Computation , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.019974Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:67f887641979d4ece92288330b1d575862211613a12c5de052ee4e73b348fb97","observation_id":"908611b9-d7d2-4dae-9bae-8900991127a6","resolution":{"observed_at":"2026-08-01T01:06:16.019974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.119563Z","title":"Graph colouring algorithms , DOI=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.119563Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:0d6426f3c00de8a5f5011316199b05232aa86b0a539dbfbd6948621b5af42ea7","observation_id":"cd13d222-f512-4a0b-ba76-a7359383fd76","resolution":{"observed_at":"2026-08-01T01:06:16.119563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.254275Z","title":"On the foundations of combinatorial theory I","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.254275Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:e531973de57abbe9d8ecf39901a52ab22a188375d51c82bf9632d5251c018ce2","observation_id":"68bb3a1f-d697-46f6-858d-bcb71ee24e85","resolution":{"observed_at":"2026-08-01T01:06:16.254275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.336415Z","title":"1937 , publisher=","venue":null,"work_id":null,"year":1937},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.336415Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:50211a8df457a5f722c3466a2bd441e1840b85e899147f68ac8555b2bc9b00d3","observation_id":"94aefabb-e258-480d-b6f1-d3bd2685dc75","resolution":{"observed_at":"2026-08-01T01:06:16.336415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.522346Z","title":"The art of computer programming , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.522346Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:4bd1db5b898ade8a8ee4d5c98e906caa1f5e21b41bdb2dc9d1689fbfb9eba135","observation_id":"c2926c6f-0979-4ec7-9ce1-24f4b53f12b5","resolution":{"observed_at":"2026-08-01T01:06:16.522346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.690160Z","title":"IEEE Transactions on Systems, Man, and Cybernetics , volume=","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.690160Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:119744538f76a4c494c819616dc9b2582afe0ffba3eb51a90bdce1d1309b5966","observation_id":"d3cf176c-2efa-4eb9-a1ea-b2ac0c73cb40","resolution":{"observed_at":"2026-08-01T01:06:16.690160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.816939Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.816939Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:42dfcc75ae016709edaecd7bfdf172b96ddf1547e7071f2b77e342fa9ced2249","observation_id":"7fb7ee02-e9c6-4d3b-855e-ca11b1e93348","resolution":{"observed_at":"2026-08-01T01:06:16.816939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:16.978806Z","title":"Complexity of computer computations , pages=","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:16.978806Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:67dbafff13084f39989ed11af8f5a602a5d5d5a1f93320e510b09dd7e7599bb3","observation_id":"e233555e-03f2-445e-b109-eb58b400890a","resolution":{"observed_at":"2026-08-01T01:06:16.978806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.107843Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.107843Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:a28743cd2b68905815add15a114adfa8897562d7c72eb96e73a924bd7bff4644","observation_id":"d6fe0ff7-038e-4ee6-be3b-edf603ea36da","resolution":{"observed_at":"2026-08-01T01:06:17.107843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.259324Z","title":"ACM Sigact News , volume=","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.259324Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:9fd33e9282f9e2f845bd6297c1561f1c7221672632ccd04cbba10d57371db133","observation_id":"01b7eaed-af54-4544-b558-65ecd7140898","resolution":{"observed_at":"2026-08-01T01:06:17.259324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.326457Z","title":"On the complexity of","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.326457Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:a345fcf95415cd6d74607f8bfe1111d4257abc809cb09e00291650d7cf573e2e","observation_id":"2ef18703-ee43-4b8a-8fae-564d315a4d1f","resolution":{"observed_at":"2026-08-01T01:06:17.326457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.432025Z","title":"Exact algorithms for","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.432025Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:9f32e1edd462c9e909f8d5d897a3d02f4383d00f42cae39d9220fe95ea0987e2","observation_id":"f4abf2b7-eba7-43b5-960a-8cd6923ccc92","resolution":{"observed_at":"2026-08-01T01:06:17.432025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.523483Z","title":"Operations Research Letters , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.523483Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:c31d8c02c40281a34672c748e80e2f20df00367c11693a82a6fc3d79aa407469","observation_id":"ddd35c3a-c65f-4a97-939c-a33b203bc117","resolution":{"observed_at":"2026-08-01T01:06:17.523483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.609258Z","title":"Israel journal of Mathematics , volume=","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.609258Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:a41cdec69f6736e47c1333f6c769aa44dd87e5c5f3e232957d45ab90a2da99e4","observation_id":"c11ef22e-483a-4acc-bee2-ddf201f46e10","resolution":{"observed_at":"2026-08-01T01:06:17.609258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.698632Z","title":"IRE Transactions on Electronic Computers , number=","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.698632Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:65bcc10fe21eaa3b3c0dbeede921ec963efaf6c1b9e0b91815c50ce98e002b51","observation_id":"6c9ebce5-2c7d-429c-a435-2b8fb3889fe3","resolution":{"observed_at":"2026-08-01T01:06:17.698632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.834158Z","title":"Workshop on Algorithms and Data Structures , pages=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.834158Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:33efe8195cb03aa55e3334c0e6b76f43d7bc02f782866553345b7ac66e5943b4","observation_id":"ab28eccb-ec82-46e6-ab8b-d372f096304a","resolution":{"observed_at":"2026-08-01T01:06:17.834158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.890413Z","title":"Deciding 3-colourability in less than","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.890413Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:799f16c8595772af9a931f291cd3c06c2da0172e8aa29b73716f86859b8a888b","observation_id":"5885e03e-90df-43f1-ad81-11e9edc3e28b","resolution":{"observed_at":"2026-08-01T01:06:17.890413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:17.971811Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:17.971811Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:0cb668929d5f9e19ee07ce4016ab1a7d78fb3779f72ba930a749fb759a2a757b","observation_id":"99ef4d34-e00a-492d-871a-c9163aba1ae5","resolution":{"observed_at":"2026-08-01T01:06:17.971811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.056015Z","title":"2010 , publisher=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.056015Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:18b1d66098a7f8547a4efadfe4e2d141eeab8bced6ecb84dfed7727747e4680d","observation_id":"b06aeadf-c120-4e03-a8ae-7e5ec3cc212d","resolution":{"observed_at":"2026-08-01T01:06:18.056015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.156348Z","title":"Journal of Computer and System Sciences , volume =","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.156348Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:35540d1f803188f86e0749b9d15a2c19be3c4b3e0f18328f87532243385aace3","observation_id":"c5b7ac9b-1497-4862-b0f3-42fb98a7501a","resolution":{"observed_at":"2026-08-01T01:06:18.156348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.279689Z","title":"On Problems as Hard as","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.279689Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:a8ad81ee35c1e0cd598cf70695ef519bb39e5b6eee501ce07eee3c683d4550c9","observation_id":"9b6157c5-772e-4bf5-aeb8-d09cbd41a24a","resolution":{"observed_at":"2026-08-01T01:06:18.279689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.336224Z","title":"Ryan Williams , title =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.336224Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:47aa893edbbd6d18382b569c058cb7d341bc5fa8614c86ce590f8289b7f1b458","observation_id":"94b5afb7-ca86-448a-8c00-e1df064e01c2","resolution":{"observed_at":"2026-08-01T01:06:18.336224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.456723Z","title":"Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science , pages =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.456723Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:365e5759f389d54124e2c9399ef1cbfc3af23f2234615ff50ac4bd3450987bcb","observation_id":"7ffedad3-67ba-45b8-a3b8-07a50bfa1bc0","resolution":{"observed_at":"2026-08-01T01:06:18.456723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.511602Z","title":"Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.511602Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:6908f2b89d23381b4fe597ea8cf903c28b571f9c4f17d75ffe4ffe621ad59051","observation_id":"21bc0e98-c885-40dd-b2c7-07da5d0cb436","resolution":{"observed_at":"2026-08-01T01:06:18.511602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.650301Z","title":"Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science , pages =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.650301Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:b21d4faf7ac4c38914bf159c0deb5073532e0dc50057ea5ee9ddd923e2b760b1","observation_id":"7194cf35-a682-4f4a-b071-65438293fe88","resolution":{"observed_at":"2026-08-01T01:06:18.650301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.771360Z","title":"Proceedings of the International Congress of Mathematicians 2018 , pages =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.771360Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:1ff5a467ac3a09d69c01a51790e0c63bbab601ac59496629cd65d976a3627871","observation_id":"965f3d31-ca65-4168-88c8-b37ad06c2930","resolution":{"observed_at":"2026-08-01T01:06:18.771360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.849357Z","title":"Ryan Williams , title =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.849357Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:974d8d8eb6df62a0dc5d946396b07cebc6c3ecd472298756be92e7a34a94d724","observation_id":"ce39dafa-7c60-48e1-9f93-b73dfaa79d5b","resolution":{"observed_at":"2026-08-01T01:06:18.849357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.912791Z","title":"Theory of Computing Systems , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.912791Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:9503027f41f15c52ca3a15f43e7964dd3b6fba43b791b740cb53f9178662671b","observation_id":"9498d340-cc91-4c90-a6f7-27c4779738a2","resolution":{"observed_at":"2026-08-01T01:06:18.912791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:18.968236Z","title":"Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture , booktitle =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:18.968236Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:b55962fdcb62a4c5050a756d555da43d2615717cf2a30949602f5b49a1d65bf9","observation_id":"a32be275-0d76-4e07-b42a-5ca198bc2152","resolution":{"observed_at":"2026-08-01T01:06:18.968236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:19.068678Z","title":"The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True , booktitle =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:19.068678Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:9ce28ee2130baea5814b09aecd9f3925200d94420c59264d338f2f8967104287","observation_id":"9414a8e2-662e-4c43-a2ca-4a9aa4fddcf5","resolution":{"observed_at":"2026-08-01T01:06:19.068678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:19.132757Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , pages =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:19.132757Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:9a9ba83282f8dfee5ddf28d0d1485ee2447367005413f7f89ab5712a4f0a3f5c","observation_id":"f8f4d1fe-7582-4ad0-afa6-ff161ae35ca3","resolution":{"observed_at":"2026-08-01T01:06:19.132757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:19.244287Z","title":"32nd Annual European Symposium on Algorithms (ESA 2024) , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:19.244287Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:795b474309b1db7da8842d43ec638b379434ad9bae43e132ee6e7edda72a3819","observation_id":"3749272c-82e4-4c8d-9675-0291c8c17e88","resolution":{"observed_at":"2026-08-01T01:06:19.244287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:19.342323Z","title":"3-Coloring in Time O (1.3217\\^","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:19.342323Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:f83b3151f413b52671579c31f44525f41343bf1c039dc180a32f1d45c35df933","observation_id":"50648432-82b1-470e-87df-efa4b600f77a","resolution":{"observed_at":"2026-08-01T01:06:19.342323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:19.383719Z","title":"Lee , title =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:19.383719Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:69f597962d95306c4d5f69dc171673e045768d998b490c8700a434d116164880","observation_id":"86fb0f0d-cc48-4d8d-ae64-fdecd2231069","resolution":{"observed_at":"2026-08-01T01:06:19.383719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:06:19.463003Z","title":"Theoretical Computer Science , volume =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T01:06:19.463003Z"},"links":{"citing_paper":"/paper/2607.25973"},"observation_digest":"sha256:d92e63fb7861785c39aae2117238fb5c660ff71f41b4bd9656a8e05aae1b15e9","observation_id":"664b753c-206f-4e43-9179-bcc79a3b169b","resolution":{"observed_at":"2026-08-01T01:06:19.463003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25973","last_updated":"2026-07-28T16:53:58Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T15:49:20.412653Z","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":55,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":60},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2607.25973."}