{"as_of":"2026-08-12T19:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b0cdff45b49a1bbc531e0f794949b9a8e77bca652a7ff21d58c9e4afb7618387","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T10:42:28.587548Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.27159/citation-record","integrity":"/paper/2607.27159/integrity","json":"/paper/2607.27159/citation-record.json","paper":"/paper/2607.27159"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T10:42:27.294116Z","title":"444--452","venue":null,"work_id":null,"year":1995},"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":1,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.294116Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:e10739e0ae8e26ae2f42c77d0ab08430d40b501bd8cb743af2a12f9bc6f90472","observation_id":"877597bd-354d-4815-9e46-7aec8c8cdb34","resolution":{"observed_at":"2026-07-30T10:42:27.294116Z","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-07-30T10:42:27.341256Z","title":"2, 168--204","venue":null,"work_id":null,"year":2005},"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":2,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.341256Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:e32a679738e8c5a475f5b7a75c289f7f3387c6e37b94ba8d39b791064f15a161","observation_id":"35918084-7655-4425-821f-f26c4c00e7b8","resolution":{"observed_at":"2026-07-30T10:42:27.341256Z","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-07-30T10:42:27.438099Z","title":"2, 546--563","venue":null,"work_id":null,"year":2009},"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":3,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.438099Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:1c3e6856c990bfe066184fcabea7dc11aa26315515cc8c4d6458e4ced1d21b59","observation_id":"0d261cde-26fe-4e6f-8863-4eec0bd58dd7","resolution":{"observed_at":"2026-07-30T10:42:27.438099Z","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-07-30T10:42:27.554745Z","title":null,"venue":null,"work_id":null,"year":2008},"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":4,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.554745Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:34b9c5857ecc5b5509b0aacaa630ca1cc76430021ebb2d4928cda39dd27ac421","observation_id":"2190a172-ec1e-4d1f-a056-156ba1aed998","resolution":{"observed_at":"2026-07-30T10:42:27.554745Z","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-07-30T10:42:27.619985Z","title":"6, 547--556","venue":null,"work_id":null,"year":2004},"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":5,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.619985Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:16208a3c6b05c486e35996db2ac279e4fdf50fd4c16721a45c249619f127613e","observation_id":"a27c743f-23f2-4ec6-90a0-222a90862de0","resolution":{"observed_at":"2026-07-30T10:42:27.619985Z","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-07-30T10:42:27.702753Z","title":"2, 131--140","venue":null,"work_id":null,"year":2003},"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":6,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.702753Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:5a41eec3e3522c2e4587688ed94f8ec85b6d2e888d8295fb8536ab638ce3d376","observation_id":"67134832-d2f9-408a-a612-34a75dabb867","resolution":{"observed_at":"2026-07-30T10:42:27.702753Z","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-07-30T10:42:27.763812Z","title":null,"venue":null,"work_id":null,"year":2007},"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":7,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.763812Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:05b9e6dfd3eb1027b6ceb0977267a8e1ed4526088881a881a0b7d77a9804c394","observation_id":"f48147cd-b7cc-476f-97ca-1757256afd6e","resolution":{"observed_at":"2026-07-30T10:42:27.763812Z","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-07-30T10:42:27.846208Z","title":"29, wh freeman New York, 2002","venue":null,"work_id":null,"year":2002},"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":8,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.846208Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:2628b899928f1dae08c0f44af4198011f32e05129cf505a032ff2e2fb561498e","observation_id":"a8f3a2db-0977-48cf-b564-bcf2c3070398","resolution":{"observed_at":"2026-07-30T10:42:27.846208Z","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-07-30T10:42:27.981900Z","title":"3, 1--17","venue":null,"work_id":null,"year":2016},"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":9,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:27.981900Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:ec7a96102d51ba95ec29e7d639ca4dc4772175fdf1007581ad2cd5ebd41a5f5f","observation_id":"02ef92e1-81b8-4c79-8c90-5cab19939607","resolution":{"observed_at":"2026-07-30T10:42:27.981900Z","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-07-30T10:42:28.096671Z","title":"219--241","venue":null,"work_id":null,"year":1958},"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":10,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.096671Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:8385852f164c564b683f3a92341006ff3289150409f73ca6c17330676a5cf17b","observation_id":"7f5c25f0-04a9-4b7f-9d0b-dca3d0a43a5b","resolution":{"observed_at":"2026-07-30T10:42:28.096671Z","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-07-30T10:42:28.182222Z","title":"3, 66--67","venue":null,"work_id":null,"year":1976},"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":11,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.182222Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:3003d19d1f4732c03c2428d01e645f8d02ff1774a051cdcd5ffc64d529a977ca","observation_id":"d70ab50a-015b-436f-b2c9-5feb56378b65","resolution":{"observed_at":"2026-07-30T10:42:28.182222Z","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-07-30T10:42:28.279125Z","title":"3, 337--364","venue":null,"work_id":null,"year":2005},"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":12,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.279125Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:3836fc6917ec401c828e161397a8359ee0779e658d84b2ecaeef5b7a3545e4e3","observation_id":"6b27ead9-590b-447d-a2a2-36329d878750","resolution":{"observed_at":"2026-07-30T10:42:28.279125Z","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-07-30T10:42:28.315190Z","title":"177--188","venue":null,"work_id":null,"year":1993},"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":13,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.315190Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:b6ec15ecf9532915cdd217829540725f9a8825c6aaa84b084a5e80736a74b662","observation_id":"41733b33-6b7d-4839-810d-ce2e08e8db59","resolution":{"observed_at":"2026-07-30T10:42:28.315190Z","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-07-30T10:42:28.361535Z","title":null,"venue":null,"work_id":null,"year":1999},"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":14,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.361535Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:78c8c57fb44812c866ec4783aa5f892a19a63f0992d9b8e86271e0357577c7e4","observation_id":"b0dca4d6-a179-461f-b728-89a9776b41c1","resolution":{"observed_at":"2026-07-30T10:42:28.361535Z","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-07-30T10:42:28.401704Z","title":null,"venue":null,"work_id":null,"year":2024},"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":15,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.401704Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:6b0f1fc488040757d7905d1840da115da45f84cd0fbcddc67d7a5303bd8ca3ae","observation_id":"4154b326-075a-4950-a464-bfee8d073c16","resolution":{"observed_at":"2026-07-30T10:42:28.401704Z","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-07-30T10:42:28.461829Z","title":null,"venue":null,"work_id":null,"year":2021},"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":16,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.461829Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:987181685910971faee347f2c9f8d44032ad6bc18f75d2ee54339e1e95c98b5f","observation_id":"a24f1d94-0ce1-49f1-8adc-aafeddac9d00","resolution":{"observed_at":"2026-07-30T10:42:28.461829Z","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-07-30T10:42:28.526376Z","title":"985--998","venue":null,"work_id":null,"year":2023},"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":17,"source":"arxiv_source","source_observed_at":"2026-07-30T10:42:28.526376Z"},"links":{"citing_paper":"/paper/2607.27159"},"observation_digest":"sha256:fe5c6bd842c83488335cb238ddefb9ac5f5b50ab1b6c09c4b15ad08c8c283ba4","observation_id":"29889195-6cd4-4c6c-a041-b5f3de4de23f","resolution":{"observed_at":"2026-07-30T10:42:28.526376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}}],"paper":{"arxiv_id":"2607.27159","last_updated":"2026-07-29T17:36:11Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":18},"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 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2607.27159."}