{"as_of":"2026-08-11T06:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:289e3debdc59c8bbd1066229bee1b95d39d91dfc58629b06e150628ec449cb73","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:00:58.848641Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.26592/citation-record","integrity":"/paper/2607.26592/integrity","json":"/paper/2607.26592/citation-record.json","paper":"/paper/2607.26592"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T13:00:53.877482Z","title":"Journal of Algorithms , volume=","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:53.877482Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:bd83bcfcd04c26728f571037f92111adb135ff05361ce52e7d1fe4121b91ca95","observation_id":"8e9aa171-be7d-473d-aa81-2efdec2e80a7","resolution":{"observed_at":"2026-08-01T13:00:53.877482Z","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-01T13:00:53.944439Z","title":"Discrete Mathematics , volume =","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:53.944439Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:fb8116213fbea335e34d4cf2884f76e8e074f5a306057ee8f55b4e535e8d006a","observation_id":"3c1fa451-6f45-4954-875e-e1d50e93d791","resolution":{"observed_at":"2026-08-01T13:00:53.944439Z","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-01T13:00:54.022198Z","title":"Discrete Applied Mathematics , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.022198Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:3005bc88a29a79e0f68618f059dd14113fb4c7c4cf9caad04f2f419a049caf04","observation_id":"dadf0a5c-d222-48e6-8133-ea27efa4f6ae","resolution":{"observed_at":"2026-08-01T13:00:54.022198Z","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-01T13:00:54.138606Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.138606Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:416850599921fc1b5bdba0a69416fa42702854ebcd6090361b813509bff762c9","observation_id":"96664393-4f99-49b5-a1df-d7e3be8f2964","resolution":{"observed_at":"2026-08-01T13:00:54.138606Z","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-01T13:00:54.242608Z","title":"Journal of Algorithms , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.242608Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:7a8d02be938362ed14f82a61d80df11fb222c0a3b8a85b0ce5cdf75ecb26de5f","observation_id":"7d4ed48c-732d-4709-a0c6-95543e2bb6c3","resolution":{"observed_at":"2026-08-01T13:00:54.242608Z","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-01T13:00:54.342705Z","title":"Discrete mathematics , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.342705Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:c32e236107d6bc4fd9e9ccb5bdfa44f13523d9fb642f1a105f4182e82db92f25","observation_id":"99e6c024-55f2-4778-b2c2-835dfff7a77a","resolution":{"observed_at":"2026-08-01T13:00:54.342705Z","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-01T13:00:54.414464Z","title":"International Workshop on Graph-Theoretic Concepts in Computer Science , pages=","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.414464Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:48db28eb51b5589e42bc60f73a1eaaf5f482132febd36b50ead88c359f42a0d4","observation_id":"df4a5791-7763-498d-b1d7-900176d17860","resolution":{"observed_at":"2026-08-01T13:00:54.414464Z","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-01T13:00:54.513489Z","title":"Journal of algorithms , volume=","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.513489Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:b9b803aab4dcd02ab77b921b8cfdeb4b72789ce4e9d286e716709eb061280325","observation_id":"765d6052-ad96-42fc-ba87-147e5761d7a2","resolution":{"observed_at":"2026-08-01T13:00:54.513489Z","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-01T13:00:54.697383Z","title":"Theory of Computing Systems , volume=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.697383Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:f8c8b6352d44e79bae92f06881a7edb713db1e84f7e6bcdd4215b002a22ca4c9","observation_id":"3faac245-1adc-464d-a216-a5b1e88d95d0","resolution":{"observed_at":"2026-08-01T13:00:54.697383Z","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-01T13:00:54.750144Z","title":"Journal of Algorithms , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.750144Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:3213493cae31c12206f14152cf755b1dae5b192afc162ba42fec2457323be712","observation_id":"77e568f7-cc0f-4c2a-a894-fafb10e9cb22","resolution":{"observed_at":"2026-08-01T13:00:54.750144Z","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-01T13:00:54.825390Z","title":"50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art , pages=","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.825390Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:bb01b29bbc8fb4d98fca41153bc70d76cfbdfd983ec707432601590f82ccf9f1","observation_id":"55bb873e-9caa-44e8-9f12-0e842faca35e","resolution":{"observed_at":"2026-08-01T13:00:54.825390Z","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-01T13:00:54.897381Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:54.897381Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:4c754b7a34c974dd8f4ee65c87f19ec228226433f380f8f6fd08e7333465566a","observation_id":"bc2c57d3-a601-4614-bdec-9498976d120f","resolution":{"observed_at":"2026-08-01T13:00:54.897381Z","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-01T13:00:55.050386Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.050386Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:97130a0a0a360ecbe5d86f269e8eb84441902b2f3463049ff727e217dfe1fb83","observation_id":"574b45b6-b82d-468d-9668-cda4e257b52f","resolution":{"observed_at":"2026-08-01T13:00:55.050386Z","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-01T13:00:55.201731Z","title":"Karp , editor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.201731Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:6019163c396572119da10ce549ef650fc9e6b7adbfd1c296f4ead40df81c8b56","observation_id":"e4e15f15-6d61-4bf3-9c09-4d0642d16cab","resolution":{"observed_at":"2026-08-01T13:00:55.201731Z","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-01T13:00:55.326350Z","title":"A Fast Coloring Oracle for Average Case Hypergraphs , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.326350Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:f3047dfb30d4815ec675c56c0e66331d521bf4657126a280aa551d069f40cd35","observation_id":"8fe5a8c7-2776-427a-b4b4-521894bbd3be","resolution":{"observed_at":"2026-08-01T13:00:55.326350Z","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-01T13:00:55.413852Z","title":"Set Partitioning via Inclusion-Exclusion , journal =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.413852Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:39be258472e16159986d3cd6d7fd5a4d5fb7578e699daed572c0e23776704e50","observation_id":"c96b992f-6831-418f-af3d-b249c887e2d7","resolution":{"observed_at":"2026-08-01T13:00:55.413852Z","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-01T13:00:55.575638Z","title":"Fundamentals of Computation Theory: Proceedings of the 1977 International FCT-Conference, Pozna","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.575638Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:30e425a118eb8507edb6045ad5cd158a0006f903ea18146f8e03c0b3d93a619a","observation_id":"6e2a2b1e-d741-44f2-a3ce-46cc22ec6871","resolution":{"observed_at":"2026-08-01T13:00:55.575638Z","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-01T13:00:55.671087Z","title":"International Colloquium on Automata, Languages, and Programming , pages=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.671087Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:09c05296cb4b80c7109f0c454c6a4f43a3458493efc94973a41fc2a14a032d23","observation_id":"0e46278a-dd0a-4a5e-999c-8bee114f2969","resolution":{"observed_at":"2026-08-01T13:00:55.671087Z","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-01T13:00:55.779372Z","title":"Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.779372Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:3e55be8ff5e9452e1c9938cf69af28caf59219035070cbffa04f49a324fce351","observation_id":"9e88928e-3c19-4b18-88de-60ee4a8743f3","resolution":{"observed_at":"2026-08-01T13:00:55.779372Z","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-01T13:00:55.842364Z","title":"Journal of Computer and System Sciences , volume=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.842364Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:926d35907a906b2c676d76f84c698e0959c3feb36ed1a3b6cd38cb4f151ce152","observation_id":"f5ddc2de-fdc5-4141-b7b2-4c500405d23f","resolution":{"observed_at":"2026-08-01T13:00:55.842364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.00129","last_updated":"2025-06-26T06:52:38Z","snapshot_observed_at":"2026-08-07T22:46:07.464301Z","submitted_at":"2024-02-29T21:14:01Z","title":"Beyond Worst Case Local Computation Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.00129","snapshot_observed_at":"2026-08-01T13:00:55.993007Z","title":"arXiv preprint arXiv:2403.00129 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:55.993007Z"},"links":{"cited_paper":"/paper/2403.00129","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:4fcbe6f21e8b559976a7310a4a759b9a3889adf86500be286cb32bfbc613ad3c","observation_id":"a7f08ad4-436b-402a-956b-a2d06405033e","resolution":{"observed_at":"2026-08-01T13:00:55.993007Z","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-01T13:00:56.101720Z","title":"International Symposium on Mathematical Foundations of Computer Science , pages=","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.101720Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:ed38de016cc1743aee34e33e47ebf23aa28df4053caa1d8d9705e35e5d099e00","observation_id":"57eb1d30-3b1f-4832-af6e-1de1f278d852","resolution":{"observed_at":"2026-08-01T13:00:56.101720Z","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-01T13:00:56.196446Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.196446Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:7986fea48ed98c2a615e239b4953f91d318a6c86c340c40da25e09aabf238418","observation_id":"a4faa098-a60a-4e54-afbb-483c09906997","resolution":{"observed_at":"2026-08-01T13:00:56.196446Z","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-01T13:00:56.333044Z","title":"Surveys in combinatorics , volume=","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.333044Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:66743da4475bd217ecb91801c084dcb65afc27f63e49a7d3a7d7bbb43ab23381","observation_id":"0a1d809e-92c2-4a59-9551-0f22d9afedb5","resolution":{"observed_at":"2026-08-01T13:00:56.333044Z","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-01T13:00:56.418894Z","title":"Physical Review E—Statistical, Nonlinear, and Soft Matter Physics , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.418894Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:b6968b7fa5fa8b4f2ac396b884ff8940c16a3095d754bc5714f6edf8d082c35a","observation_id":"56e9003d-05f6-47e6-ae60-2f86f35bca9e","resolution":{"observed_at":"2026-08-01T13:00:56.418894Z","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-01T13:00:56.500077Z","title":"Proceedings of the Seventeenth Annual","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.500077Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:7ba30de173d18b6894724b705ca233de691b4040b7b5dd0d15f74bbf836bd424","observation_id":"733b9199-ea20-4194-8e79-e50f98cde3ce","resolution":{"observed_at":"2026-08-01T13:00:56.500077Z","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.1002/rsa.20918","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random Struct","venue":"Random Structures and Algorithms","work_id":"4f7c727b-f37f-4899-b102-0071d8ab14b7","year":2020},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.567289Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:b8a9a666bf8c7c40f335d2b53c4fc37e101e74d2405de607d865317bc2aed9f9","observation_id":"d3989471-6b48-41bf-a0ee-c1239a09a05c","resolution":{"observed_at":"2026-08-01T13:04:34.193854Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14771","last_updated":"2022-10-16T14:49:50Z","snapshot_observed_at":"2026-08-10T17:39:20.329409Z","submitted_at":"2021-11-29T18:21:29Z","title":"A fast algorithm on average for solving the Hamilton Cycle problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14771","snapshot_observed_at":"2026-08-01T13:00:56.634335Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.634335Z"},"links":{"cited_paper":"/paper/2111.14771","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:b56f34473a6c3be98066053610372be34a17ff52967baf798d56dc96a2051cce","observation_id":"e8f309fd-faa5-4ae0-8e74-7e6b304abd58","resolution":{"observed_at":"2026-08-01T13:00:56.634335Z","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-01T13:00:56.723142Z","title":"Scott and Gregory B","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.723142Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:3c3a8f04fe2db79624405485105d336586896246105d8c4813b085db163fc16d","observation_id":"6036ae49-9cfc-4f1b-bcb7-f0e17c566a94","resolution":{"observed_at":"2026-08-01T13:00:56.723142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.04969","last_updated":"2015-05-19T12:40:31Z","snapshot_observed_at":"2026-08-04T16:58:49.757501Z","submitted_at":"2015-05-19T12:40:31Z","title":"Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\\mathcal{G}(n,p)$ random model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.04969","snapshot_observed_at":"2026-08-01T13:00:56.770832Z","title":"Catellier and Tom Denat and Vangelis Th","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.770832Z"},"links":{"cited_paper":"/paper/1505.04969","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:902bb80d14caebe0b93c654e8218922ac6bda9dd28b073eb18a114c767f3cefb","observation_id":"f03b6adb-75ef-4d3c-af33-aae2de5fb4e3","resolution":{"observed_at":"2026-08-01T13:00:56.770832Z","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-01T13:00:56.837537Z","title":"Duke and Hanno Lefmann and Vojtech R","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.837537Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:d9c9b3d011579d276b7ce712471197fff0033da39a2daad03c6e359aa2b0e201","observation_id":"7ccf23cc-b0a5-4be8-81d4-1ff33c2c4060","resolution":{"observed_at":"2026-08-01T13:00:56.837537Z","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-01T13:00:56.924669Z","title":"Bandeira and Jess Banks and Dmitriy Kunisky and Cristopher Moore and Alexander S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:56.924669Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:ebe777aa635f07cbd45aff98fec0fca1a5096ff2294d441ba6e9045c5b62ae31","observation_id":"f67d7b42-dff1-4654-9372-7870c9e0e5cb","resolution":{"observed_at":"2026-08-01T13:00:56.924669Z","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.1137/1.9781611972962.4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semirandom Models as Benchmarks for Coloring Algorithms , booktitle =","venue":null,"work_id":"34703728-5ee5-4c54-98b7-cb91a49fcc51","year":2006},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.012217Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:bba84253163205cf2a99805b0b6a7d02308ffcc69828006a4e8d051c1211270a","observation_id":"8dc0f2c0-5571-4797-b4b2-58e6def84b4d","resolution":{"observed_at":"2026-08-01T13:04:34.125695Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/(sici)1098-2418(1999010)14:1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T13:04:34.002937Z","title":"Random Struct","venue":null,"work_id":"70b4ea7e-2db9-4598-8aac-7bdfb7c080ea","year":1999},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.091846Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:0f9503491f2b19fad293ef82c1f63d50cf0505b72712f584e0e8e3fdd9614a00","observation_id":"b6764ef9-c270-48bd-b474-6dd3e152faa4","resolution":{"observed_at":"2026-08-01T13:04:34.066003Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T13:00:57.163760Z","title":"Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities , pages=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.163760Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:e54f7f94f52307c1305ff29ff64640ff183af6810ee240bfdb987b5f4ba49584","observation_id":"a3b7abb6-381d-42f0-9313-4ef4d151348f","resolution":{"observed_at":"2026-08-01T13:00:57.163760Z","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/j.jalgor.2004.07.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving NP-hard semirandom graph problems in polynomial expected time , journal =","venue":"Journal of Algorithms","work_id":"7c767e44-1b79-4581-a56d-ad581d659587","year":2007},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.280420Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:3c0f727922367b44013d8007f3d28b19a3dca30c177a5565770149081c69adc7","observation_id":"5b7f1de8-a3cc-4014-8444-a8476012e3d2","resolution":{"observed_at":"2026-08-01T13:04:33.999446Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2008.04.011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the tractability of coloring semirandom graphs , journal =","venue":"Information Processing Letters","work_id":"fecaf7d2-c80e-4a46-9c49-fa8101430a64","year":2008},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.396764Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:e6a6652871c3efc72de4dc1ded286b2c9235c652ef097e0c1ab150490e5f7df7","observation_id":"aa76b601-9bab-4777-8555-744df6ada23a","resolution":{"observed_at":"2026-08-01T13:04:33.929404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T13:00:57.506632Z","title":"Algorithmic Barriers from Phase Transitions , booktitle =","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.506632Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:e2577f899728fcdc06c62a183ade0f4fd2342a179f11c04511fe3b20c03972e0","observation_id":"70d71545-3965-4dc0-908d-d751f3f3d53d","resolution":{"observed_at":"2026-08-01T13:00:57.506632Z","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.37236/3337","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Upper-Bounding the k-Colorability Threshold by Counting Covers , journal =","venue":"The Electronic Journal of Combinatorics","work_id":"8812c393-7538-4170-8ea1-115fa8d9ac54","year":2013},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.600969Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:5bafe473312b593aedc9b23290f39b8aaa71fd25027a549125f708b6ad2a577f","observation_id":"7cde9ae0-3b6d-487e-882f-ee54be4125df","resolution":{"observed_at":"2026-08-01T13:04:33.839066Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2013.48","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chasing the K-Colorability Threshold , booktitle =","venue":null,"work_id":"1d4e9127-cc9e-4efc-b855-1129df6fce6d","year":2013},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.651246Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:4cd18670bfa2557651b81e40c7f65c8905a31445580271d057fb728ac35ff613","observation_id":"8ad52a7e-f6b5-4300-98df-4f4ae0f3b4fb","resolution":{"observed_at":"2026-08-01T13:04:33.762197Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx-random.2014.449","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Condensation Phase Transition in Random Graph Coloring , booktitle =","venue":null,"work_id":"f3e9aef7-9d16-429c-87fe-e04d560de7e9","year":2014},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.713924Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:cc4149bba9a9cbdbfdd8f98d162753ee5a4db8afd6b1c35925f56aadb1ec1dcf","observation_id":"cd5fbf98-3663-44cf-9a54-610ba5a6d250","resolution":{"observed_at":"2026-08-01T13:04:33.692947Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0963548316000390","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planting Colourings Silently , journal =","venue":"Combinatorics Probability Computing","work_id":"53c026e5-28d8-4a85-8abd-33a5e6ac68f9","year":2017},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.821349Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:f36716b569545a363bd9816f3b77dd8f27a753541d56ff66318e7df0e6be7de4","observation_id":"93e62300-00c2-4f34-bbcf-e43cb73a6f3a","resolution":{"observed_at":"2026-08-01T13:04:33.594200Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.16531","last_updated":"2025-09-05T17:58:45Z","snapshot_observed_at":"2026-08-07T07:25:12.213772Z","submitted_at":"2025-08-22T16:54:18Z","title":"Quality control in sublinear time: a case study via random graphs","version":2},"cited_work":{"arxiv_id":"2508.16531","doi":"10.48550/arxiv.2508.16531","metadata_source":"pith","pith_arxiv_id":"2508.16531","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Quality control in sublinear time: a case study via random graphs","venue":"cs.DS","work_id":"621bea93-6a25-4ac9-9c93-b111a3dbda78","year":2025},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:57.942192Z"},"links":{"cited_paper":"/paper/2508.16531","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:a1d659a31a67b6132e7fcc9e6fd568be0c9db9cc344736831ee2db4f776dee4f","observation_id":"d1e01075-8755-4fc1-822d-d306ae921e1d","resolution":{"observed_at":"2026-08-01T13:04:33.554039Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T13:00:58.009046Z","title":"Fast Local Computation Algorithms , booktitle =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.009046Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:564e5d5124a6f193599cad372d507442fbe97992950fa39df685bf1631e08ff0","observation_id":"c4cf9fe2-f774-4604-9f12-d45202bf6678","resolution":{"observed_at":"2026-08-01T13:00:58.009046Z","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.1137/1.9781611973099.89","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Space-efficient local computation algorithms , booktitle =","venue":null,"work_id":"e9a239e7-042e-42b7-8350-29b6d63e16fc","year":2012},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.089424Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:03e5a8525fcb3277eda579fe67876617d820a2d9696ba0faee2048f28ddae466","observation_id":"c950ce58-cbbf-49a6-be76-8f88179afd16","resolution":{"observed_at":"2026-08-01T13:04:33.458812Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T13:00:58.158976Z","title":"1992 , url =","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.158976Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:d39e4631fb2d3368e684d213f32bce20290a7f70059de1afaf56cf1aa956917a","observation_id":"93a85330-d67e-45c1-9716-67743e856b63","resolution":{"observed_at":"2026-08-01T13:00:58.158976Z","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-01T13:00:58.221500Z","title":"Harris and Johannes Schneider and Hsin","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.221500Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:781550415bf092158d95e073516a75c0540f28cc8d605a83a05ec7868b1d7cd6","observation_id":"76f3379b-d004-41b6-bd3c-89093639b52d","resolution":{"observed_at":"2026-08-01T13:00:58.221500Z","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.1145/3605896","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2023 , url =","venue":"ACM Transactions on Parallel Computing","work_id":"b22adaca-7b77-46ae-b3f1-a92cfb677cec","year":2023},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.269432Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:12d917c2b4dd58578a71dec04c010617d4a3ac7913ca15c4c8e6721d5b61f2b3","observation_id":"5ef953a1-86a2-40d3-b937-e0090c2b7231","resolution":{"observed_at":"2026-08-01T13:04:33.385926Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2019.10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2019 , url =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"8ca9d0b8-997b-4e11-b466-acbbd2fc8c0b","year":2019},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.305353Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:323873f7bb13dfd5243b349bd09dbbea3ee606d98305b1a8156b71b7fb1863cb","observation_id":"5281fb95-4d96-4a05-8d0b-40cbea3f495b","resolution":{"observed_at":"2026-08-01T13:04:33.301287Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.142","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Distributed Palette Sparsification Theorem , booktitle =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"f3316567-0f3e-4bb4-965a-7466b9395ef0","year":2024},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.354722Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:cbf81fb514fc8588296e69450a8240033d64d52aaef439cdc9262f71d8d18c68","observation_id":"f33d50d1-4849-4499-8422-89d7d8d0d4af","resolution":{"observed_at":"2026-08-01T13:04:33.242482Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10990","last_updated":"2021-03-19T19:17:14Z","snapshot_observed_at":"2026-08-05T00:34:13.281370Z","submitted_at":"2021-03-19T19:17:14Z","title":"Local Computation Algorithms for Coloring of Uniform Hypergraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.10990","snapshot_observed_at":"2026-08-01T13:00:58.404960Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.404960Z"},"links":{"cited_paper":"/paper/2103.10990","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:065dfec56abfc7139a99b2f643058c0d6c2cc4dcce60021947d232334a31e204","observation_id":"1d4ed68c-33ea-4850-b583-4397b7db996a","resolution":{"observed_at":"2026-08-01T13:00:58.404960Z","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.2023.48","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach , booktitle =","venue":"arXiv (Cornell University)","work_id":"c781b81f-e9c3-4b44-99e3-da18b56d2fbf","year":2023},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.465521Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:62c301c212eca213263f071b5cf4817c6cff2b5b491f109f3d41d5ca44e6b326","observation_id":"95de429d-47b6-4dde-8ff8-38593cd9a4a5","resolution":{"observed_at":"2026-08-01T13:04:33.183824Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T13:00:58.500751Z","title":"Sublinear Algorithms for (","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.500751Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:299959ed188b1357066174c5f0e57bb92da66b3d756269806fb3b664f8967a16","observation_id":"d6a8ca65-dc7e-4cda-b00a-7d889a5e6cc4","resolution":{"observed_at":"2026-08-01T13:00:58.500751Z","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.approx/random.2020.6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Palette Sparsification Beyond (","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"26163c1b-53b5-409b-a6f2-cdbdd75f608b","year":2020},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.549069Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:82174404fecf336f14eaa99e92868a371b9a192702b8503a35ef752e23ab0872","observation_id":"caa96760-74b4-48ec-b47a-54f26438906b","resolution":{"observed_at":"2026-08-01T13:04:33.114938Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06024","last_updated":"2025-02-09T20:40:54Z","snapshot_observed_at":"2026-08-08T16:57:13.787600Z","submitted_at":"2025-02-09T20:40:54Z","title":"Improved Sublinear Algorithms for Classical and Quantum Graph Coloring","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06024","snapshot_observed_at":"2026-08-01T13:00:58.623912Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.623912Z"},"links":{"cited_paper":"/paper/2502.06024","citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:89eb78ca15352e10d2514b31cabeae156f04995dfdbf75d656f191b4e18b3838","observation_id":"0cf41ade-ac2b-4799-94fd-c5fad10cf933","resolution":{"observed_at":"2026-08-01T13:00:58.623912Z","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.46298/theoretics.26.3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TheoretiCS , volume =","venue":"TheoretiCS","work_id":"d9189e62-f0a9-4fc9-8505-1d10d25c9f7d","year":2026},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.689115Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:ee7810abc6c3f7efb508db07c0a283d0e458e75dc24e4621e35f92275c626850","observation_id":"e176e460-86de-4e01-a829-7fb13d9836aa","resolution":{"observed_at":"2026-08-01T13:04:33.034942Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-01T13:00:58.746366Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.746366Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:732f7fa363994dcb64d59a16715ce95a5e354693dbdb1ba77969f0e14affc508","observation_id":"407a958a-a7ff-402b-96fb-5c7c14cd8c81","resolution":{"observed_at":"2026-08-01T13:00:58.746366Z","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-01T13:00:58.848641Z","title":"The Complexity of (","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T13:00:58.848641Z"},"links":{"citing_paper":"/paper/2607.26592"},"observation_digest":"sha256:40bbdf891c5e7313d85a5a204ca67bfb6c11d49614b76a26964c81e01944c8a5","observation_id":"a9cfd449-e08e-433e-99b9-4b54ee6234ec","resolution":{"observed_at":"2026-08-01T13:00:58.848641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.26592","last_updated":"2026-07-29T08:13:43Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-01T23:27:54.532100Z","submitted_at":"2026-07-29T08:13:43Z","title":"Graph k-Coloring in Average Sublinear Time"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":16,"verified_fuzzy":0},"total_outbound_references":58},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2607.26592."}