{"as_of":"2026-08-19T22:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9aa929830f955d70741c1284cfe36b1bb20f448433ac36b5777086339ea1fd72","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:56:32.348981Z","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-09T04:49:10.164294Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.06446","last_updated":"2021-07-26T02:35:48Z","snapshot_observed_at":"2026-08-19T19:49:23.126969Z","submitted_at":"2021-06-11T15:02:26Z","title":"Optimal qubit assignment and routing via integer programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06446","snapshot_observed_at":"2026-08-11T11:56:32.348981Z","title":"Nannicini, L","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14918","last_updated":"2025-04-09T17:01:49Z","snapshot_observed_at":"2026-08-16T15:15:47.593898Z","submitted_at":"2024-12-19T14:54:54Z","title":"Short two-qubit pulse sequences for exchange-only spin qubits in 2D layouts","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T11:56:32.348981Z"},"links":{"cited_paper":"/paper/2106.06446","citing_paper":"/paper/2412.14918"},"observation_digest":"sha256:22532eaef2f2ffce7d8cbb12036f677891454ae348ad1caa8edc596877e78d52","observation_id":"4d20987a-c6d2-4a43-a8c9-d752ab52d5a9","resolution":{"observed_at":"2026-08-11T11:56:32.348981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06446","last_updated":"2021-07-26T02:35:48Z","snapshot_observed_at":"2026-08-19T19:49:23.126969Z","submitted_at":"2021-06-11T15:02:26Z","title":"Optimal qubit assignment and routing via integer programming","version":3},"cited_work":{"arxiv_id":"2106.06446","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.06446","snapshot_observed_at":"2026-08-09T04:49:10.164294Z","title":"Optimal qubit assignment and routing via integer programming","venue":"quant-ph","work_id":"4461c35e-54f1-46e5-bac5-d6a09c3b1e10","year":2021},"citing_paper":{"arxiv_id":"2502.03445","last_updated":"2025-02-05T18:42:07Z","snapshot_observed_at":"2026-08-14T09:33:23.547850Z","submitted_at":"2025-02-05T18:42:07Z","title":"TensorQC: Towards Scalable Distributed Quantum Computing via Tensor Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T04:49:09.826111Z"},"links":{"cited_paper":"/paper/2106.06446","citing_paper":"/paper/2502.03445"},"observation_digest":"sha256:ebf61bd981febc6981cfaed01171195dc7bb226b20ff0278bcd684f3973de9e2","observation_id":"f9289f51-dfb7-4f85-a579-b2303a029cbe","resolution":{"observed_at":"2026-08-09T04:49:10.167365Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2106.06446/citation-record","integrity":"/paper/2106.06446/integrity","json":"/paper/2106.06446/citation-record.json","paper":"/paper/2106.06446"},"outbound":[],"paper":{"arxiv_id":"2106.06446","last_updated":"2021-07-26T02:35:48Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T19:49:23.126969Z","submitted_at":"2021-06-11T15:02:26Z","title":"Optimal qubit assignment and routing via integer programming"},"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 2 inbound Pith citation observations for arXiv:2106.06446."}