{"as_of":"2026-08-06T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6aae7853bf2d53d5d507b4bd65ba08f41a6cdd82694211b4df67833e28dee34d","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-06T06:34:29.942622+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-08-04T13:32:53.606518Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2106.11246","last_updated":"2021-12-17T21:02:15Z","snapshot_observed_at":"2026-08-06T01:28:46.430180Z","submitted_at":"2021-06-21T16:44:53Z","title":"LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.11246","snapshot_observed_at":"2026-08-04T13:32:53.606518Z","title":"LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00145","last_updated":"2026-05-25T17:49:08Z","snapshot_observed_at":"2026-08-04T13:32:42.425803Z","submitted_at":"2025-09-30T18:19:37Z","title":"Domain-Aware Probability Sampling for Hybrid Quantum Systems using Bayesian Optimization","version":4},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-04T13:32:53.606518Z"},"links":{"cited_paper":"/paper/2106.11246","citing_paper":"/paper/2510.00145"},"observation_digest":"sha256:0800fdcc33db7329e5da4a2006379da2fff84cb9bcfd06a69913cfcf7139835a","observation_id":"8dae0440-ced8-485c-9da5-e8a0d669b403","resolution":{"observed_at":"2026-08-04T13:32:53.606518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2106.11246/citation-record","integrity":"/paper/2106.11246/integrity","json":"/paper/2106.11246/citation-record.json","paper":"/paper/2106.11246"},"outbound":[],"paper":{"arxiv_id":"2106.11246","last_updated":"2021-12-17T21:02:15Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T01:28:46.430180Z","submitted_at":"2021-06-21T16:44:53Z","title":"LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.11246."}