{"as_of":"2026-08-10T23:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b7b4886195e4d810c10cd2d0491c3b4bb19cb5b3e4022486c8161e3563b99f1f","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:12:12.555647Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":4,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0709.2090","last_updated":"2008-10-13T16:31:19Z","snapshot_observed_at":"2026-08-06T11:50:17.647756Z","submitted_at":"2007-09-13T14:46:45Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0709.2090","snapshot_observed_at":"2026-08-10T18:12:12.555647Z","title":"On the complexity of computing zero-error and Holevo capacity of quantum channels,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.11576","last_updated":"2025-01-20T16:26:21Z","snapshot_observed_at":"2026-08-10T18:03:16.133752Z","submitted_at":"2025-01-20T16:26:21Z","title":"Riemannian Optimization for Holevo Capacity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:12:12.555647Z"},"links":{"cited_paper":"/paper/0709.2090","citing_paper":"/paper/2501.11576"},"observation_digest":"sha256:0065069153ef50ac6d4714a08f36ea43400a04e8c496ef58ba0f1dde6567f4aa","observation_id":"ef5d907b-6cbf-4588-9f2b-35faf58a8ce3","resolution":{"observed_at":"2026-08-10T18:12:12.555647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0709.2090","last_updated":"2008-10-13T16:31:19Z","snapshot_observed_at":"2026-08-06T11:50:17.647756Z","submitted_at":"2007-09-13T14:46:45Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0709.2090","snapshot_observed_at":"2026-08-05T20:25:29.324897Z","title":"Beigi and P","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.10664","last_updated":"2025-08-14T14:03:38Z","snapshot_observed_at":"2026-08-10T21:32:18.988193Z","submitted_at":"2025-08-14T14:03:38Z","title":"Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T20:25:29.324897Z"},"links":{"cited_paper":"/paper/0709.2090","citing_paper":"/paper/2508.10664"},"observation_digest":"sha256:8a8b9b7287d27d1e5abcd6ed3e8bc73bbc61233e85bc8e9245750956b36fe1a3","observation_id":"661e0c3b-0dd9-431c-90ce-4d68ce35206b","resolution":{"observed_at":"2026-08-05T20:25:29.324897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0709.2090","last_updated":"2008-10-13T16:31:19Z","snapshot_observed_at":"2026-08-06T11:50:17.647756Z","submitted_at":"2007-09-13T14:46:45Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0709.2090","snapshot_observed_at":"2026-08-03T08:15:27.095700Z","title":"Beigi and P","venue":null,"work_id":null,"year":2090},"citing_paper":{"arxiv_id":"2601.18538","last_updated":"2026-07-12T19:11:37Z","snapshot_observed_at":"2026-08-03T08:15:25.460348Z","submitted_at":"2026-01-26T14:45:23Z","title":"Sufficient conditions for additivity of the zero-error classical capacity of quantum channels","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T08:15:27.095700Z"},"links":{"cited_paper":"/paper/0709.2090","citing_paper":"/paper/2601.18538"},"observation_digest":"sha256:6c38efb749a52949379e055cfaae9e17e59886676efe579212d5b4e9bccaf9f6","observation_id":"e7e28546-a162-4f40-bd2b-99bce8cad15f","resolution":{"observed_at":"2026-08-03T08:15:27.095700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0709.2090","last_updated":"2008-10-13T16:31:19Z","snapshot_observed_at":"2026-08-06T11:50:17.647756Z","submitted_at":"2007-09-13T14:46:45Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels","version":3},"cited_work":{"arxiv_id":"0709.2090","doi":"10.48550/arxiv.0709.2090","metadata_source":"pith","pith_arxiv_id":"0709.2090","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels","venue":"quant-ph","work_id":"fa80a4d5-8b69-4685-8abb-dcfb2f4f76c3","year":2007},"citing_paper":{"arxiv_id":"2607.28961","last_updated":"2026-07-31T02:30:11Z","snapshot_observed_at":"2026-08-08T00:33:08.824743Z","submitted_at":"2026-07-31T02:30:11Z","title":"The Shape of Information: Global Information Geometric Limits in Multi-task Quantum Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T16:36:19.459071Z"},"links":{"cited_paper":"/paper/0709.2090","citing_paper":"/paper/2607.28961"},"observation_digest":"sha256:df4704262333ef3195724c5372ef5e3bc84f88e0e91d2357e936d1764021ed2d","observation_id":"cebb634b-eac6-4288-bf0d-bf6cf1bab930","resolution":{"observed_at":"2026-08-03T16:38:30.535324Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0709.2090/citation-record","integrity":"/paper/0709.2090/integrity","json":"/paper/0709.2090/citation-record.json","paper":"/paper/0709.2090"},"outbound":[],"paper":{"arxiv_id":"0709.2090","last_updated":"2008-10-13T16:31:19Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T11:50:17.647756Z","submitted_at":"2007-09-13T14:46:45Z","title":"On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:0709.2090."}