{"as_of":"2026-08-12T03:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e67abbc8dc70fc80f8bc2e55beb12de976c85930f8c48abd664ca35d469ca3d1","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-11T06:34:44.6726+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-06T20:40:29.836660Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.12887","last_updated":"2024-08-07T12:52:41Z","snapshot_observed_at":"2026-08-09T09:34:29.355008Z","submitted_at":"2023-11-21T04:03:26Z","title":"Optimal, and approximately optimal, quantum strategies for $\\mathrm{XOR}^{*}$ and $\\mathrm{FFL}$ games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12887","snapshot_observed_at":"2026-08-06T20:40:29.836660Z","title":"arXiv: 2311.12887 (submitted) (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T23:00:37.137167Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:29.836660Z"},"links":{"cited_paper":"/paper/2311.12887","citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:85fd4e8eaccfe80b04437519b76ce0e63d50ecf9620c57357baef6129b5de6d5","observation_id":"9d6cb0b3-ad49-4f7d-9d2d-84231dcdc9e7","resolution":{"observed_at":"2026-08-06T20:40:29.836660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12887","last_updated":"2024-08-07T12:52:41Z","snapshot_observed_at":"2026-08-09T09:34:29.355008Z","submitted_at":"2023-11-21T04:03:26Z","title":"Optimal, and approximately optimal, quantum strategies for $\\mathrm{XOR}^{*}$ and $\\mathrm{FFL}$ games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12887","snapshot_observed_at":"2026-08-05T21:11:47.476098Z","title":"Optimal, and approximately optimal, quantum strategies for XOR∗ and FFL games","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09380","last_updated":"2025-08-12T22:35:01Z","snapshot_observed_at":"2026-08-09T23:20:18.644834Z","submitted_at":"2025-08-12T22:35:01Z","title":"Parallel repetition of expanded, and multiplayer, Quantum games: anchoring, optimal values, generalized error bounds, dependency-breaking as symmetry-breaking","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T21:11:47.476098Z"},"links":{"cited_paper":"/paper/2311.12887","citing_paper":"/paper/2508.09380"},"observation_digest":"sha256:84124a833c22cf8e7f0c72056da0dd0ec3944389095302b32db034b7a82d42be","observation_id":"a1a9a727-b549-49a5-a6a6-eb280666de28","resolution":{"observed_at":"2026-08-05T21:11:47.476098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12887","last_updated":"2024-08-07T12:52:41Z","snapshot_observed_at":"2026-08-09T09:34:29.355008Z","submitted_at":"2023-11-21T04:03:26Z","title":"Optimal, and approximately optimal, quantum strategies for $\\mathrm{XOR}^{*}$ and $\\mathrm{FFL}$ games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12887","snapshot_observed_at":"2026-08-04T13:00:00.308988Z","title":"arXiv: 2311.12887 (submitted) (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.02402","last_updated":"2026-06-30T21:44:34Z","snapshot_observed_at":"2026-08-08T06:09:59.409594Z","submitted_at":"2025-10-01T21:52:00Z","title":"Probability distributions over CSS codes: two-universality, QKD hashing, collision bounds, security","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T13:00:00.308988Z"},"links":{"cited_paper":"/paper/2311.12887","citing_paper":"/paper/2510.02402"},"observation_digest":"sha256:23e1f4213fed86eeca9149582a077c13e9e32bcc4d0a433613a550a5e1565013","observation_id":"51276cc8-319f-48f2-9a8e-40114b9b97ab","resolution":{"observed_at":"2026-08-04T13:00:00.308988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12887","last_updated":"2024-08-07T12:52:41Z","snapshot_observed_at":"2026-08-09T09:34:29.355008Z","submitted_at":"2023-11-21T04:03:26Z","title":"Optimal, and approximately optimal, quantum strategies for $\\mathrm{XOR}^{*}$ and $\\mathrm{FFL}$ games","version":3},"cited_work":{"arxiv_id":"2311.12887","doi":"10.48550/arxiv.2311.12887","metadata_source":"arxiv_reference","pith_arxiv_id":"2311.12887","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal, and approximately optimal, quantum strategies for XOR ∗ and FFL games.arXiv: 2311.12887(2023), submitted","venue":"arXiv (Cornell University)","work_id":"0f8d6f0e-ac66-4e05-9466-b25b4a373bd0","year":2023},"citing_paper":{"arxiv_id":"2605.08259","last_updated":"2026-05-07T21:57:54Z","snapshot_observed_at":"2026-07-06T23:20:28.875586Z","submitted_at":"2026-05-07T21:57:54Z","title":"Multiplayer parallel repetition without dependency-breaking and anchoring variables: monotonic, concave amplification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T01:22:22.422949Z"},"links":{"cited_paper":"/paper/2311.12887","citing_paper":"/paper/2605.08259"},"observation_digest":"sha256:4118f62d63387bb16242f5c25ea85edbe0a43d651873e98e6ae9f2abb8607b4d","observation_id":"31b75de1-0e68-41b3-9228-5a00ef231f1f","resolution":{"observed_at":"2026-05-12T01:31:16.288749Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.12887/citation-record","integrity":"/paper/2311.12887/integrity","json":"/paper/2311.12887/citation-record.json","paper":"/paper/2311.12887"},"outbound":[],"paper":{"arxiv_id":"2311.12887","last_updated":"2024-08-07T12:52:41Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T09:34:29.355008Z","submitted_at":"2023-11-21T04:03:26Z","title":"Optimal, and approximately optimal, quantum strategies for $\\mathrm{XOR}^{*}$ and $\\mathrm{FFL}$ games"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2311.12887."}