{"as_of":"2026-08-12T09:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70c8b05ed0bf568ce5eb16cc51b0a191c64c5ab7ac3e7bb925a5edb1dcec7c6c","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:00:01.376206Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2508.21020/citation-record","integrity":"/paper/2508.21020/integrity","json":"/paper/2508.21020/citation-record.json","paper":"/paper/2508.21020"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3589.18372","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.567410Z","title":"Complexity theory: Current research","venue":null,"work_id":"121f3779-7db1-4633-8b8c-7026a2d3e2b8","year":1993},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.320595Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:fbb724f6ad219f674b5f3ca96e0cf7def40f1c880275da044e80729391b55c38","observation_id":"908f1fec-7467-4a77-9ef3-d4e0ca1cbd78","resolution":{"observed_at":"2026-08-05T15:00:01.574445Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.733372Z","title":"Quantum computational complexity","venue":null,"work_id":"d21fbe4a-1339-42c6-8eeb-5cb7f8b029f3","year":2009},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.324168Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:ddb732ff62c0f50205ec1635cd4c0af4d981f9bc1e1cf4577bd704350142d42d","observation_id":"0610746d-3491-4a18-ad1f-e0d3be48b56f","resolution":{"observed_at":"2026-08-05T15:00:01.735855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.726061Z","title":"The knowledge complexity of interactive proof-systems (extended abstract)","venue":null,"work_id":"fc30c454-b634-455c-946b-c80fa6aa4288","year":1985},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.327557Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:5f1873a28d57393208bcff4c8514eeb4b2c42d0cf6d0f2c97958d9647df0bb6a","observation_id":"bb83998d-ab42-4db1-b631-5e174b1e368d","resolution":{"observed_at":"2026-08-05T15:00:01.728669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.719026Z","title":"The knowledge complexity of interactive proof systems","venue":null,"work_id":"27460ebc-eea6-492a-a4dd-32c9f6de63de","year":1989},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.330579Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:680d94211e0d9fb314a11a4111b1f0c43adfb98b3331ac363cadea7c1be6a588","observation_id":"0f788a69-75e4-473e-ba8e-060a3ec8d7eb","resolution":{"observed_at":"2026-08-05T15:00:01.721480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.712002Z","title":"Trading group theory for randomness","venue":null,"work_id":"09993bcf-b4d3-40aa-a2b4-dd8461d9b8da","year":1985},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.333685Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:9f4b7fa39a72c0229533697cf6fd17e3f0aa7d0df3e6023664e71bd91ef8de2a","observation_id":"8d4e98f6-789c-4c67-9909-5de1e2bc2ee8","resolution":{"observed_at":"2026-08-05T15:00:01.714487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.704538Z","title":"PSPACE has constant-round quantum interactive proof systems","venue":null,"work_id":"2f8fbf12-3938-4123-86b8-ec406ef346af","year":1999},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.336605Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:dc2ed588d756d5f61ef93d78a56f610b06945e826ca86495046ee84417f2c52c","observation_id":"6c32c636-e934-4d2e-b1d4-0dcd31109f16","resolution":{"observed_at":"2026-08-05T15:00:01.707174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.697295Z","title":"Finite state verifiers I: The power of interac- tion","venue":null,"work_id":"edefee77-03e7-4622-b444-7094228a3a7e","year":1992},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.339614Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:3e389fad25247a66a9400e65775a82c516cbeb745e48d4433ad80bccc1027bfe","observation_id":"9aae4f64-1aef-4721-ac8c-ab0f4f58e751","resolution":{"observed_at":"2026-08-05T15:00:01.699886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.689877Z","title":"Space-bounded probabilistic game automata","venue":null,"work_id":"b92477ab-a5e1-4370-8fca-79e2fa24bf96","year":1991},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.342408Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:1f72710361abbc04ffd36512a515fbf6b9550b64c7db346971de288053c38bef","observation_id":"07b5c390-5e31-42de-91ab-9bb41ed99272","resolution":{"observed_at":"2026-08-05T15:00:01.692546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.682539Z","title":"Public-qubits versus private-coins","venue":null,"work_id":"7ded433e-8ab3-4043-ae96-c3468c4d5a68","year":2012},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.345037Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:6943c29b6ab533f42ae4d7f25758947fa741be4626a4c98b20be1698cf51af9b","observation_id":"2b1efd14-a1e4-4f81-b62f-4d8080c3f596","resolution":{"observed_at":"2026-08-05T15:00:01.685036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.674411Z","title":"Public qubits versus private coins","venue":null,"work_id":"3450a56d-225f-4658-ae8f-b669c7b1cd59","year":2013},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.347579Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:4f8bc241efdd1227db84bd317915af4a8b8890e98f07a3b45b0d66e0cfac0ee4","observation_id":"890de728-9a87-4afc-9601-4a04790d80ef","resolution":{"observed_at":"2026-08-05T15:00:01.677335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1507.01988","last_updated":"2018-07-04T10:21:57Z","snapshot_observed_at":"2026-07-06T04:23:08.949794Z","submitted_at":"2015-07-07T23:40:48Z","title":"Automata and Quantum Computing","version":2},"cited_work":{"arxiv_id":"1507.01988","doi":null,"metadata_source":"pith","pith_arxiv_id":"1507.01988","snapshot_observed_at":"2026-08-05T15:00:01.402075Z","title":"Automata and Quantum Computing","venue":"cs.FL","work_id":"62a7f1fb-3f68-41b8-ba7e-7cdd8091a802","year":2015},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.350302Z"},"links":{"cited_paper":"/paper/1507.01988","citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:c34927b0c9b37887fce5f0dca57d7a3e7c8dde18bd07758a75a2313ee902b463","observation_id":"08126d9f-e8b8-4a04-960b-41968f0c4cba","resolution":{"observed_at":"2026-08-05T15:00:01.405858Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.665431Z","title":"Automata and quantum computing","venue":null,"work_id":"13917aae-ba13-4a8f-9e7b-da8187c10177","year":2021},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.353148Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:40e9c04d1c6fcd02208ff5add45102ade460bc0d8ddce7da862d3e15ae1a4283","observation_id":"88614d11-3ec0-4835-80c1-9097e525270c","resolution":{"observed_at":"2026-08-05T15:00:01.668171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.656486Z","title":"Two–way finite automata with quantum and classical states","venue":null,"work_id":"9e1cff9f-5bb0-43c9-ace9-92c34379b1bc","year":2002},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.356330Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:14536392866fb4716e9b0fbbf61977f269407605af76532b3411082e0150dd1a","observation_id":"5b63a09d-19e7-476b-a859-cc4986026c43","resolution":{"observed_at":"2026-08-05T15:00:01.659366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.647341Z","title":"Unbounded-error quantum computation with small space bounds","venue":null,"work_id":"90c80889-7ec7-4049-907c-17335cdd3a9f","year":2011},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.358875Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:336a5ca524608acc434c9ce70d90b4f12290eeed84ec06e41dc360ce8f4837d6","observation_id":"453d6cda-7ff6-4b32-8d76-1facefd05dc1","resolution":{"observed_at":"2026-08-05T15:00:01.650299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.638243Z","title":"Magic coins are useful for small-space quantum machines","venue":null,"work_id":"935e10bc-bb5f-4e61-b994-1c923f0d2558","year":2017},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.361443Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:f0793ce519669d8c21dd43958eeade222923890d9e61a2fa292bd01345b398e4","observation_id":"5639a51f-a23d-4646-9019-b2e109791991","resolution":{"observed_at":"2026-08-05T15:00:01.641088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.629304Z","title":"Quantum complexity theory","venue":null,"work_id":"71ded8b4-777d-4a64-b750-08674acec3b5","year":1997},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.364052Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:3f81bfdcdbba660fe9f9aa2e8f6220a1cff1ac0a9fd9146db3e1d1c9dd621579","observation_id":"2d369556-6106-437b-8ce8-365b8ef0a222","resolution":{"observed_at":"2026-08-05T15:00:01.632057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.619887Z","title":"On the complexity of simulating space-bounded quantum computa- tions","venue":null,"work_id":"994f4d1d-9d91-41a0-94e6-f850bddbb402","year":2003},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.366560Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:f509fd86984d921bd7a84f0a056e0c39c6d4ea658cf1e57cb3bf1f8f736830d2","observation_id":"0f27a694-3b21-43dc-acb3-d8789a1af860","resolution":{"observed_at":"2026-08-05T15:00:01.623163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.609563Z","title":"The complexity of membership problems for circuits over sets of integers","venue":null,"work_id":"e88e1f51-e456-4fb6-b50d-1abca8f4215d","year":2006},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.368987Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:bc90628860896a1d2e2f275b8238a83c57c88b7d74ac786bf4331c4d32e2ef4f","observation_id":"f292147b-134b-4ca1-9bac-792986baf12b","resolution":{"observed_at":"2026-08-05T15:00:01.613075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.600096Z","title":"Reachability in two-clock timed automata is PSPACE-complete","venue":null,"work_id":"5035e714-faee-48e5-9695-de0464cca838","year":2013},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.371221Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:417c285cbf1b10912290f24b2aa5341a74e5c6f452600760dcdc3249157356fa","observation_id":"af195aff-289e-4900-ae98-3d7008f5051b","resolution":{"observed_at":"2026-08-05T15:00:01.603265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.590548Z","title":"Reachability in two-clock timed automata is PSPACE-complete","venue":null,"work_id":"b0a35b96-d99e-4444-9e09-6780e0d9f033","year":2015},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.373533Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:553286c5eb50b0a868dffbc3baa357e2856c3fd200dc2ffa2ead278466348e04","observation_id":"c0be330d-165a-4724-8f5c-ff69c9540967","resolution":{"observed_at":"2026-08-05T15:00:01.593647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:00:01.581248Z","title":"Succinctness of two-way probabilistic and quantum finite automata","venue":null,"work_id":"cfd29b3e-a033-4da9-af5b-ab634f21d230","year":2010},"citing_paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T15:00:01.376206Z"},"links":{"citing_paper":"/paper/2508.21020"},"observation_digest":"sha256:fa3fde51c8792cdef66c2bc4458df3e763ee4932e41040fb636b007efe8408d2","observation_id":"ddc4685f-3d19-4ac1-bf75-220ec5974903","resolution":{"observed_at":"2026-08-05T15:00:01.584172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2508.21020","last_updated":"2025-08-28T17:22:31Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T04:07:59.869388Z","submitted_at":"2025-08-28T17:22:31Z","title":"QIP $ \\subseteq $ AM(2QCFA)"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":21},"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 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2508.21020."}