{"as_of":"2026-08-12T23:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f067649d5ff694a656cc1e1f17ac2be751e79d15e04866a4e410088d6421695","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-12T06:34:41.77262+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-10T14:55:22.148574Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T14:55:22.509440Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.01052","last_updated":"2020-05-03T11:08:37Z","snapshot_observed_at":"2026-08-12T18:00:18.709176Z","submitted_at":"2020-05-03T11:08:37Z","title":"A dynamic programming approach for distributing quantum circuits by bipartite graphs","version":1},"cited_work":{"arxiv_id":"2005.01052","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.01052","snapshot_observed_at":"2026-08-10T14:55:22.509440Z","title":"A dynamic programming approach for distributing quantum circuits by bipartite graphs","venue":"quant-ph","work_id":"e7af8584-dd80-4313-a4fd-ea35c8616f87","year":2020},"citing_paper":{"arxiv_id":"2501.14947","last_updated":"2025-01-24T22:16:31Z","snapshot_observed_at":"2026-08-11T09:01:33.480180Z","submitted_at":"2025-01-24T22:16:31Z","title":"Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T14:55:22.148574Z"},"links":{"cited_paper":"/paper/2005.01052","citing_paper":"/paper/2501.14947"},"observation_digest":"sha256:03eb199e56f3dce66e503b90a7b2941a4827b6688a38619dc8239ef6c2791a21","observation_id":"1feded81-96c7-44b8-a2be-74861f34c0ae","resolution":{"observed_at":"2026-08-10T14:55:22.514836Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.01052/citation-record","integrity":"/paper/2005.01052/integrity","json":"/paper/2005.01052/citation-record.json","paper":"/paper/2005.01052"},"outbound":[],"paper":{"arxiv_id":"2005.01052","last_updated":"2020-05-03T11:08:37Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T18:00:18.709176Z","submitted_at":"2020-05-03T11:08:37Z","title":"A dynamic programming approach for distributing quantum circuits by bipartite graphs"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.01052."}