{"as_of":"2026-08-10T18:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b8e44a1ee319fd5500433dc0ca4107384da07d73f5287dfbe135fb9d61ca228","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T11:58:40.897885Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"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/1907.00529/citation-record","integrity":"/paper/1907.00529/integrity","json":"/paper/1907.00529/citation-record.json","paper":"/paper/1907.00529"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum speedups for exponential-time dynamic program ming algorithms","venue":null,"work_id":"c72a430c-7ec7-4ed0-a960-252b9ceb5952","year":2019},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:fde1aee155a8b3eabd07ce603a799f5f698b833d62f36cfe883d9aead1517d15","observation_id":"d017305a-0618-475e-ab71-7433f2bef1a8","resolution":{"observed_at":"2026-05-25T12:00:46.187339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"3-coloring in time O(1","venue":null,"work_id":"90449f7d-c499-42c8-a5bc-dc5a1f0ec347","year":2005},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:68859975ecc2d9b2abb5e2537d640a5e4343ee9c9a1af151141d486f5dd3258a","observation_id":"24246123-03f9-4136-af8d-f031e1839c87","resolution":{"observed_at":"2026-05-25T12:00:46.166489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inclusion–exclusion alg orithms for counting set partitions","venue":null,"work_id":"d1c4a303-4ed9-475c-9bf4-b7a17def911f","year":2006},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:7068ae1815932821112b4eaab2f6822ffcff3fc7fc0f81466f92a89bfda6458d","observation_id":"c4964d5a-59b9-43e5-b7fa-e7888d9568c3","resolution":{"observed_at":"2026-05-25T12:00:46.174132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exact algorithms for e xact satisfiability and number of perfect matchings","venue":null,"work_id":"34d22209-55af-43e4-9064-74cbe3db34ec","year":2008},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:bc1a0081443d3e7e425e5ad1688fa67547891504eaab05065d6736d896de03b9","observation_id":"14697e37-ab65-47ec-8764-2eed0940f627","resolution":{"observed_at":"2026-05-25T12:00:46.140486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Set pa rtitioning via inclusion-exclusion","venue":null,"work_id":"3d8bd2d7-7420-48bf-acf0-962470f64c81","year":2009},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:cf02440659bc571b64311fadb14d46e37aaeb3f45eff1037622be72a9d7c9bfd","observation_id":"11679610-ef7a-4810-be3f-3165882097d5","resolution":{"observed_at":"2026-05-25T12:00:46.144517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tight bounds on quantum searching","venue":null,"work_id":"7c411525-7503-4b35-b1c2-29e0287c6dd9","year":1998},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:4cf2eb553563f7b9aef243c478c06c551ae6d8172ee5e0750ed68d4ee06389ca","observation_id":"5fa597ac-c8fb-4956-aeee-34230daa4fe6","resolution":{"observed_at":"2026-05-25T12:00:46.160443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"154a6fe4-90d6-4b73-83af-a7a6a624aff3","year":2004},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:72bd6b01cd023fe596d63456f0c036dd764fa3ff4f5aba4964ad99fbf5bf99c9","observation_id":"8c9c8a9c-9c26-4a49-819e-790074a81c1c","resolution":{"observed_at":"2026-05-25T12:00:46.154057Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On prob lems as hard as CNF-SAT","venue":null,"work_id":"33747945-51fd-472b-ac47-e4aefc4f7b35","year":2016},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:aec6c2aa1507d44ef238b158f3dd7fba8e1a5acfcdce81def3a8a65648d78837","observation_id":"09d80a49-faae-44ca-894b-db1c6f8c42e0","resolution":{"observed_at":"2026-05-25T12:00:46.147829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":"quant-ph/9607014","doi":"10.48550/arxiv.quant-ph/9607014","metadata_source":"pith","pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"A Quantum Algorithm for Finding the Minimum","venue":"quant-ph","work_id":"fdbe1db9-85bf-47b2-be13-2717933a2ac6","year":1996},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:9872579cf58b233cc62c411c09ec1bbbeb6ba93d0878848522441f576cdbda7a","observation_id":"28e38fae-bdda-4175-a1ca-6fa3f4df1301","resolution":{"observed_at":"2026-05-25T12:00:45.824687Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fomin, Serge Gaspers, and Saket Saurabh","venue":null,"work_id":"4fed7fe4-979a-4156-a483-e391822ba035","year":2007},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:b50a54bb741172b9ed8d645376daab0eeec7df7f6e46ae63637f90f57c47f19f","observation_id":"f4cc856d-d4da-4724-a251-0315b2626d87","resolution":{"observed_at":"2026-05-25T12:00:46.170777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fomin and Dieter Kratsch","venue":null,"work_id":"dbcd48be-b55a-40b0-9a43-c7b92b93628b","year":2010},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:2d2c38717fc6cd447a4d1cdaec0dde26b274ea8a97237c53b3bf19d79ee2f06c","observation_id":"5a6aa320-d2bb-449c-bd2e-dca692360e41","resolution":{"observed_at":"2026-05-25T12:00:46.150662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Solving NP-complete problems with quantum sear ch","venue":null,"work_id":"0178eae8-df4f-4227-bab1-8f892bb4474d","year":2008},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:a10fb10c65058cf9752ab191edf3a2a2e4236c6e94694c5580a699838557fa99","observation_id":"e93e6c82-d4de-4d92-be62-6fd4a5bea419","resolution":{"observed_at":"2026-05-25T12:00:46.157265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster graph coloring in polyn omial space","venue":null,"work_id":"72daf42a-8681-4c7b-964c-29083ab409ab","year":2017},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:c92c1737afd4e02343aba9f11ca6ac8a9c73e0ba9ae27015240fcb56614f2f4d","observation_id":"748fa19b-35b3-46ef-ac12-8c49d6b33492","resolution":{"observed_at":"2026-05-25T12:00:46.163543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quant um random access memory","venue":null,"work_id":"1d2f68f0-33bf-4e25-b0c0-4ad7d76c23ee","year":2008},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:d40feaba061b625076a06de2b166d6872041b3bfe1ab3e5c22933b61799adb21","observation_id":"ed317cfb-1887-4bb3-b008-bb374955ff87","resolution":{"observed_at":"2026-05-25T12:00:46.190492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"37f01af6-4df7-4a8e-a330-cad790ff5d65","year":1996},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:c102616ff16e62154053919e53ff4caec2c126f40d34e0993b95bb0857c49ec9","observation_id":"33593b5d-6907-4c52-9693-9fcd59a70fc8","resolution":{"observed_at":"2026-05-25T12:00:46.177736Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An O∗ (2n) algorithm for graph coloring and other partitioning problems via inclu sion– exclusion","venue":null,"work_id":"1f409be9-55b4-49f6-9082-e9db93de58fd","year":2006},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:28cc5aa71557dfabf89992792a837288f9f2e07885184242969c36080b244931","observation_id":"ce6e8b08-b7b6-4895-bea8-02f1a4283c6e","resolution":{"observed_at":"2026-05-25T12:00:46.180922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bf04a2f6-7a42-41a7-b6e3-f486ee5c5eeb","year":1976},"citing_paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T11:58:40.897885Z"},"links":{"citing_paper":"/paper/1907.00529"},"observation_digest":"sha256:33210caf54e60fa09917cfa06a768b8f716af6556f77793668cc3a82289b467f","observation_id":"a9713ddd-fc70-47c6-a65d-028b62a03ac2","resolution":{"observed_at":"2026-05-25T12:00:46.184041Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"1907.00529","last_updated":"2019-07-01T03:35:48Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-01T00:02:42.649636Z","submitted_at":"2019-07-01T03:35:48Z","title":"Exponential-time quantum algorithms for graph coloring problems"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":13},"total_outbound_references":17},"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 10 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:1907.00529."}