{"as_of":"2026-08-18T11:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:760690a6ac9cc161073d0069f18c7e1e2d8d2bca43c864c4a9064f28dbc308ce","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T03:52:17.171544Z","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-01T17:25:50.763337Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.02812","last_updated":"2021-06-28T11:59:59Z","snapshot_observed_at":"2026-08-16T18:19:29.388402Z","submitted_at":"2021-06-05T06:43:48Z","title":"Optimizing Ansatz Design in QAOA for Max-cut","version":4},"cited_work":{"arxiv_id":"2106.02812","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.02812","snapshot_observed_at":"2026-07-01T17:25:50.763337Z","title":"Optimizing","venue":null,"work_id":"170dc03f-0bf9-4e43-a2fc-6b4a69da7289","year":null},"citing_paper":{"arxiv_id":"2606.28169","last_updated":"2026-06-26T15:02:02Z","snapshot_observed_at":"2026-08-03T01:41:22.268005Z","submitted_at":"2026-06-26T15:02:02Z","title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-06-29T03:52:17.171544Z"},"links":{"cited_paper":"/paper/2106.02812","citing_paper":"/paper/2606.28169"},"observation_digest":"sha256:50f6f1c64bcfd638560e37a030bdbdd47b59aff55beb5b635f186eb6a1219908","observation_id":"e0f508f1-2baf-4ad1-84f4-97706fc76846","resolution":{"observed_at":"2026-07-01T17:25:50.765095Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.02812/citation-record","integrity":"/paper/2106.02812/integrity","json":"/paper/2106.02812/citation-record.json","paper":"/paper/2106.02812"},"outbound":[],"paper":{"arxiv_id":"2106.02812","last_updated":"2021-06-28T11:59:59Z","latest_version":4,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T18:19:29.388402Z","submitted_at":"2021-06-05T06:43:48Z","title":"Optimizing Ansatz Design in QAOA for Max-cut"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.02812."}