{"as_of":"2026-08-20T08:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fbe8f8350c8958c7fc65ecfad08bf21b245af3a789e80be7703cce07432b5eda","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:13:17.738836Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T04:42:34.307432Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.14344","last_updated":"2021-03-22T00:09:15Z","snapshot_observed_at":"2026-07-06T09:24:18.562003Z","submitted_at":"2020-05-28T15:55:38Z","title":"Chook -- A comprehensive suite for generating binary optimization problems with planted solutions","version":2},"cited_work":{"arxiv_id":"2005.14344","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.14344","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Perera, I","venue":null,"work_id":"97475b7e-ca6e-4830-9d14-9c0deacd4cdc","year":2005},"citing_paper":{"arxiv_id":"2411.10406","last_updated":"2026-03-13T03:26:12Z","snapshot_observed_at":"2026-08-14T00:03:54.115153Z","submitted_at":"2024-11-15T18:22:46Z","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","version":3},"reference_index":130,"source":"pdf_text","source_observed_at":"2026-05-18T22:41:36.363536Z"},"links":{"cited_paper":"/paper/2005.14344","citing_paper":"/paper/2411.10406"},"observation_digest":"sha256:2fe4d50d29073f2c3e63bae4e5327e24e34ff97ae0b7e568d02997eeb7499403","observation_id":"e2ac05fb-04a3-4ec6-8100-7bb2547c29c6","resolution":{"observed_at":"2026-05-18T22:41:36.704081Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14344","last_updated":"2021-03-22T00:09:15Z","snapshot_observed_at":"2026-07-06T09:24:18.562003Z","submitted_at":"2020-05-28T15:55:38Z","title":"Chook -- A comprehensive suite for generating binary optimization problems with planted solutions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14344","snapshot_observed_at":"2026-08-12T13:13:17.738836Z","title":"Perera, I","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16431","last_updated":"2025-06-16T09:51:19Z","snapshot_observed_at":"2026-08-15T21:16:32.019822Z","submitted_at":"2024-11-25T14:35:14Z","title":"Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T13:13:17.738836Z"},"links":{"cited_paper":"/paper/2005.14344","citing_paper":"/paper/2411.16431"},"observation_digest":"sha256:4bcad5795d1acf0c84e7b2ec5bbd02846ee397a99ac2d11637d3315d95b27450","observation_id":"af305017-cbeb-4e92-935c-ae7a539db2b4","resolution":{"observed_at":"2026-08-12T13:13:17.738836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14344","last_updated":"2021-03-22T00:09:15Z","snapshot_observed_at":"2026-07-06T09:24:18.562003Z","submitted_at":"2020-05-28T15:55:38Z","title":"Chook -- A comprehensive suite for generating binary optimization problems with planted solutions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14344","snapshot_observed_at":"2026-08-12T06:09:07.465873Z","title":"Perera, I","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.19604","last_updated":"2025-06-02T20:24:10Z","snapshot_observed_at":"2026-08-19T19:55:13.848712Z","submitted_at":"2024-11-29T10:43:23Z","title":"Continuous Approximation of the Ising Hamiltonian: Exact Ground States and Applications to Fidelity Assessment in Ising Machines","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T06:09:07.465873Z"},"links":{"cited_paper":"/paper/2005.14344","citing_paper":"/paper/2411.19604"},"observation_digest":"sha256:8581e29def7447c7fb2e8d3f09c52ce12c2d77c441270cf4cf0efd6325340ad0","observation_id":"6a2c0a35-5f20-4091-9454-a6a33971fdcf","resolution":{"observed_at":"2026-08-12T06:09:07.465873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14344","last_updated":"2021-03-22T00:09:15Z","snapshot_observed_at":"2026-07-06T09:24:18.562003Z","submitted_at":"2020-05-28T15:55:38Z","title":"Chook -- A comprehensive suite for generating binary optimization problems with planted solutions","version":2},"cited_work":{"arxiv_id":"2005.14344","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.14344","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Perera, I","venue":null,"work_id":"97475b7e-ca6e-4830-9d14-9c0deacd4cdc","year":2005},"citing_paper":{"arxiv_id":"2501.19221","last_updated":"2026-05-04T14:14:47Z","snapshot_observed_at":"2026-08-13T01:15:25.025968Z","submitted_at":"2025-01-31T15:27:50Z","title":"VeloxQ: A Fast and Efficient QUBO Solver","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-23T04:38:56.945516Z"},"links":{"cited_paper":"/paper/2005.14344","citing_paper":"/paper/2501.19221"},"observation_digest":"sha256:1a5a1976c2784b837464ded32e1c0ab34e7471ab41be5eab9912da94f1079305","observation_id":"52e2a70d-00ce-42c8-ad57-23490ffffd3c","resolution":{"observed_at":"2026-05-23T04:42:34.310065Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14344","last_updated":"2021-03-22T00:09:15Z","snapshot_observed_at":"2026-07-06T09:24:18.562003Z","submitted_at":"2020-05-28T15:55:38Z","title":"Chook -- A comprehensive suite for generating binary optimization problems with planted solutions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14344","snapshot_observed_at":"2026-07-12T19:44:00.781847Z","title":"Chook–a comprehensive suite for generating binary optimization problems with planted solutions,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.30355","last_updated":"2026-06-01T03:59:44Z","snapshot_observed_at":"2026-08-17T05:47:32.323641Z","submitted_at":"2026-04-16T17:42:58Z","title":"Cosm: Collective Switched Motion for Fast and Accurate Sparse Ising Optimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-12T19:44:00.781847Z"},"links":{"cited_paper":"/paper/2005.14344","citing_paper":"/paper/2605.30355"},"observation_digest":"sha256:9241f68053c1cbfb2100a5d26ba826f06cf8131800d8cf465aaea3a0e61c1b7a","observation_id":"773cd5f2-acfa-4b51-a7cc-98cd7a060e53","resolution":{"observed_at":"2026-07-12T19:44:00.781847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2005.14344/citation-record","integrity":"/paper/2005.14344/integrity","json":"/paper/2005.14344/citation-record.json","paper":"/paper/2005.14344"},"outbound":[],"paper":{"arxiv_id":"2005.14344","last_updated":"2021-03-22T00:09:15Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T09:24:18.562003Z","submitted_at":"2020-05-28T15:55:38Z","title":"Chook -- A comprehensive suite for generating binary optimization problems with planted solutions"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2005.14344."}