{"as_of":"2026-08-19T14:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91919c524462983d090619c1e87f3221b14db0b722a3deadc30f529083115e0c","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:26:31.871575Z","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-03T01:37:31.086384Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":"2110.10685","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-07-03T01:37:31.086384Z","title":"& Montanaro, A","venue":null,"work_id":"fcd43abb-b8c2-4f49-9203-6561f9bd259c","year":2021},"citing_paper":{"arxiv_id":"2306.11060","last_updated":"2023-06-19T16:50:32Z","snapshot_observed_at":"2026-08-15T10:53:26.685606Z","submitted_at":"2023-06-19T16:50:32Z","title":"PCA and t-SNE analysis in the study of QAOA entangled and non-entangled mixing operators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T07:59:38.222691Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2306.11060"},"observation_digest":"sha256:918200bf7997ae9b7965b8016db7c73fe68e824c9160a8a8fe945e9ddae564f9","observation_id":"857ab017-51bb-4ce0-be9f-b0d7d61607cb","resolution":{"observed_at":"2026-05-24T08:04:09.728152Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-08-12T20:30:26.239153Z","title":"Boulebnane and A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09745","last_updated":"2024-11-14T19:00:09Z","snapshot_observed_at":"2026-08-16T01:43:47.394578Z","submitted_at":"2024-11-14T19:00:09Z","title":"Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T20:30:26.239153Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2411.09745"},"observation_digest":"sha256:0779fba9b3f152b1f40f855a630017e3a12b17d74b8ed411ce27c79f193dd0fd","observation_id":"2c5e005d-2a0b-454d-bb7e-5457970aad9f","resolution":{"observed_at":"2026-08-12T20:30:26.239153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-08-10T13:40:43.924655Z","title":"Boulebnane and A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.16419","last_updated":"2026-07-03T05:10:24Z","snapshot_observed_at":"2026-08-18T03:59:37.467267Z","submitted_at":"2025-01-27T19:00:00Z","title":"Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models","version":4},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-10T13:40:43.924655Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2501.16419"},"observation_digest":"sha256:494341db2692e2b63f082fabbb4c22acb8fd17101acb41cf419cc246020acc2f","observation_id":"4a6e49d2-2b9c-47d2-9638-468f88443dc8","resolution":{"observed_at":"2026-08-10T13:40:43.924655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":"2110.10685","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-07-03T01:37:31.086384Z","title":"& Montanaro, A","venue":null,"work_id":"fcd43abb-b8c2-4f49-9203-6561f9bd259c","year":2021},"citing_paper":{"arxiv_id":"2509.13528","last_updated":"2026-01-24T20:44:39Z","snapshot_observed_at":"2026-08-17T11:46:56.481906Z","submitted_at":"2025-09-16T20:48:53Z","title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:3ae27e9f3dd821e8c692e653f9d20782a3ba43269361014482e2498cac3074ad","observation_id":"0d832883-f0e1-4798-bbd6-255548bb5bb6","resolution":{"observed_at":"2026-05-18T15:36:34.460806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":"2110.10685","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-07-03T01:37:31.086384Z","title":"& Montanaro, A","venue":null,"work_id":"fcd43abb-b8c2-4f49-9203-6561f9bd259c","year":2021},"citing_paper":{"arxiv_id":"2606.09773","last_updated":"2026-06-08T17:33:15Z","snapshot_observed_at":"2026-08-12T16:07:02.361999Z","submitted_at":"2026-06-08T17:33:15Z","title":"From Pauli Strings to Quantum Dynamics: A Unified Characterization","version":1},"reference_index":195,"source":"pdf_text","source_observed_at":"2026-06-27T16:24:42.160089Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2606.09773"},"observation_digest":"sha256:246501e1e5cc8954dcec91a154722b8e5ffd535061aac85dfffa03d9acf2d24d","observation_id":"66bb7bf6-7a2c-4bc2-8687-cefab72f5480","resolution":{"observed_at":"2026-07-03T01:37:31.088000Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.10685","snapshot_observed_at":"2026-08-15T14:26:31.871575Z","title":"Predicting parameters for the quantum approx- imate optimization algorithm for MAX-CUT from the infinite-size limit","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.11385","last_updated":"2026-08-11T19:47:04Z","snapshot_observed_at":"2026-08-16T22:48:08.042074Z","submitted_at":"2026-08-11T19:47:04Z","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T14:26:31.871575Z"},"links":{"cited_paper":"/paper/2110.10685","citing_paper":"/paper/2608.11385"},"observation_digest":"sha256:1f6080a322b34954ed7fc93942254d127e5967aadfc3fe90f14050f44ada5302","observation_id":"ec1f0e30-f922-448f-8048-ed7f3528475a","resolution":{"observed_at":"2026-08-15T14:26:31.871575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2110.10685/citation-record","integrity":"/paper/2110.10685/integrity","json":"/paper/2110.10685/citation-record.json","paper":"/paper/2110.10685"},"outbound":[],"paper":{"arxiv_id":"2110.10685","last_updated":"2021-10-20T17:58:53Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T16:57:54.408261Z","submitted_at":"2021-10-20T17:58:53Z","title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2110.10685."}