{"as_of":"2026-08-10T06:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c52f56e93188273e2ed877a1ae6482469bee2ca0a214324a3f009f7d059f0936","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-09T06:31:02.800959+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-06T16:53:35.701526Z","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-07-04T15:49:56.437500Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.07813","last_updated":"2021-01-19T19:00:40Z","snapshot_observed_at":"2026-08-09T14:38:40.687448Z","submitted_at":"2021-01-19T19:00:40Z","title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.07813","snapshot_observed_at":"2026-08-06T16:53:35.701526Z","title":"arXiv preprint arXiv:2101.07813 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.12536","last_updated":"2025-07-16T18:00:09Z","snapshot_observed_at":"2026-08-06T16:42:18.746867Z","submitted_at":"2025-07-16T18:00:09Z","title":"Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:53:35.701526Z"},"links":{"cited_paper":"/paper/2101.07813","citing_paper":"/paper/2507.12536"},"observation_digest":"sha256:72922a8272681829e6587dc136f83953439a8e865d11d18755848dfd0369334d","observation_id":"f147a54d-2ce5-4505-a7a1-bbdb022df11b","resolution":{"observed_at":"2026-08-06T16:53:35.701526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07813","last_updated":"2021-01-19T19:00:40Z","snapshot_observed_at":"2026-08-09T14:38:40.687448Z","submitted_at":"2021-01-19T19:00:40Z","title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","version":1},"cited_work":{"arxiv_id":"2101.07813","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.07813","snapshot_observed_at":"2026-07-04T15:49:56.437500Z","title":"Solving quadratic unconstrained binary optimization with divide-and-conquer and quantum algorithms.arXiv preprint arXiv:2101.07813, 2021","venue":null,"work_id":"79fa346d-2428-4cb9-b280-32a74cdc0974","year":2021},"citing_paper":{"arxiv_id":"2606.26297","last_updated":"2026-07-02T17:33:16Z","snapshot_observed_at":"2026-08-09T01:03:29.930281Z","submitted_at":"2026-06-24T18:42:16Z","title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T01:27:00.407537Z"},"links":{"cited_paper":"/paper/2101.07813","citing_paper":"/paper/2606.26297"},"observation_digest":"sha256:0b99e93d8d514bcb420893633f8b8331c12c5a81102e3094f1eed3ec9a9a6ab9","observation_id":"58d9f6f4-1957-46cf-a97e-bfbe775e60d5","resolution":{"observed_at":"2026-07-04T15:49:56.442718Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07813","last_updated":"2021-01-19T19:00:40Z","snapshot_observed_at":"2026-08-09T14:38:40.687448Z","submitted_at":"2021-01-19T19:00:40Z","title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","version":1},"cited_work":{"arxiv_id":"2101.07813","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.07813","snapshot_observed_at":"2026-07-04T15:49:56.437500Z","title":"Solving quadratic unconstrained binary optimization with divide-and-conquer and quantum algorithms.arXiv preprint arXiv:2101.07813, 2021","venue":null,"work_id":"79fa346d-2428-4cb9-b280-32a74cdc0974","year":2021},"citing_paper":{"arxiv_id":"2606.26297","last_updated":"2026-07-02T17:33:16Z","snapshot_observed_at":"2026-08-09T01:03:29.930281Z","submitted_at":"2026-06-24T18:42:16Z","title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-30T09:42:42.746337Z"},"links":{"cited_paper":"/paper/2101.07813","citing_paper":"/paper/2606.26297"},"observation_digest":"sha256:0b7b397cdbe7caad071c542aafe98bcd559eeaa57dd5cce998a86b38c318dee0","observation_id":"da23a9b6-e3fd-49b8-93b9-c72ecb90a074","resolution":{"observed_at":"2026-06-30T09:44:37.478596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07813","last_updated":"2021-01-19T19:00:40Z","snapshot_observed_at":"2026-08-09T14:38:40.687448Z","submitted_at":"2021-01-19T19:00:40Z","title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","version":1},"cited_work":{"arxiv_id":"2101.07813","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.07813","snapshot_observed_at":"2026-07-04T15:49:56.437500Z","title":"Solving quadratic unconstrained binary optimization with divide-and-conquer and quantum algorithms.arXiv preprint arXiv:2101.07813, 2021","venue":null,"work_id":"79fa346d-2428-4cb9-b280-32a74cdc0974","year":2021},"citing_paper":{"arxiv_id":"2606.26297","last_updated":"2026-07-02T17:33:16Z","snapshot_observed_at":"2026-08-09T01:03:29.930281Z","submitted_at":"2026-06-24T18:42:16Z","title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-01T06:44:53.310160Z"},"links":{"cited_paper":"/paper/2101.07813","citing_paper":"/paper/2606.26297"},"observation_digest":"sha256:52b177da19810c7a7144b67d39f6c7b4c23445b00505c2895c1649bd0f82c211","observation_id":"55ee7487-1170-4e44-9f91-fbbf257aa18d","resolution":{"observed_at":"2026-07-01T06:45:29.201354Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07813","last_updated":"2021-01-19T19:00:40Z","snapshot_observed_at":"2026-08-09T14:38:40.687448Z","submitted_at":"2021-01-19T19:00:40Z","title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","version":1},"cited_work":{"arxiv_id":"2101.07813","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.07813","snapshot_observed_at":"2026-07-04T15:49:56.437500Z","title":"Solving quadratic unconstrained binary optimization with divide-and-conquer and quantum algorithms.arXiv preprint arXiv:2101.07813, 2021","venue":null,"work_id":"79fa346d-2428-4cb9-b280-32a74cdc0974","year":2021},"citing_paper":{"arxiv_id":"2606.26297","last_updated":"2026-07-02T17:33:16Z","snapshot_observed_at":"2026-08-09T01:03:29.930281Z","submitted_at":"2026-06-24T18:42:16Z","title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-03T23:01:44.193532Z"},"links":{"cited_paper":"/paper/2101.07813","citing_paper":"/paper/2606.26297"},"observation_digest":"sha256:d42de361efe94b87871ea2010ed7ff6e679e3e411f224d1e822252e9586b43c7","observation_id":"452b0ba3-6a86-4366-90d0-88d9be490498","resolution":{"observed_at":"2026-07-03T23:09:00.835172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.07813/citation-record","integrity":"/paper/2101.07813/integrity","json":"/paper/2101.07813/citation-record.json","paper":"/paper/2101.07813"},"outbound":[],"paper":{"arxiv_id":"2101.07813","last_updated":"2021-01-19T19:00:40Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T14:38:40.687448Z","submitted_at":"2021-01-19T19:00:40Z","title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2101.07813."}