{"as_of":"2026-08-12T10:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8526b7599653995bf0dc05fb6444c274b5215dd0923e443a39c83dc04e113c05","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T08:53:07.433451Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"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/2510.19084/citation-record","integrity":"/paper/2510.19084/integrity","json":"/paper/2510.19084/citation-record.json","paper":"/paper/2510.19084"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:02.939202Z","title":"The computational complexity of structure-based causality","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:02.939202Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:5cb62a7202993575649da550d49972bdb2740c182dbea5ea69eec9f0272a06a8","observation_id":"51f15471-d191-4995-8322-34846cfef350","resolution":{"observed_at":"2026-08-04T08:53:02.939202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.007697Z","title":"Generalized intransitive dice: Mimicking an arbitrary tournament","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.007697Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:62be4e188e7064c8c504727913c755add3dae03eb42d7e6d8cf0486da7811ab4","observation_id":"63f05231-64c9-45ca-91fc-f519f81cfe28","resolution":{"observed_at":"2026-08-04T08:53:03.007697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.092369Z","title":"Trading group theory for randomness","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.092369Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:f96df36df76f0fadec8dd23448a63baf629e0f66f42063542066d78350859ecb","observation_id":"b65ed237-0b87-41c5-9e5c-1ba156024692","resolution":{"observed_at":"2026-08-04T08:53:03.092369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.166270Z","title":"Finding and recognizing popular coalition structures","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.166270Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:a4b6fdb1f08d66e449f153ebcf0fdd9011b9277b646411702bf6bab722bf8fc9","observation_id":"a8ea4812-9c3a-4677-b62a-30d1bc45a670","resolution":{"observed_at":"2026-08-04T08:53:03.166270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.260147Z","title":"On the unique satisfiability problem","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.260147Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:3828b2ed55b283a7755ef4a83823c4090bdc141f6a9c9ad89c574612710c4015","observation_id":"d321ed16-918f-40fc-b65a-751ad015b4ae","resolution":{"observed_at":"2026-08-04T08:53:03.260147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.361937Z","title":"Settling the complexity of popularity in additively separable and fractional hedonic games","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.361937Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:30385fa7e1b1c32ea4c908dfbb9574f79abad7167cc45bff4dd5f61526ac6a3f","observation_id":"7bfd7497-7ce0-4f79-91c3-a5e06cacc698","resolution":{"observed_at":"2026-08-04T08:53:03.361937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.423674Z","title":"Does co-np have short interactive proofs? Information Processing Letters , 25(2):127--132, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.423674Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:884e6d0a9641e2deb2b15438b71ccd7fc1644edb63c79c974db57e9f58d725b6","observation_id":"8edcb165-fe61-41d5-a95c-38510a3a4631","resolution":{"observed_at":"2026-08-04T08:53:03.423674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.470177Z","title":"The stability of hedonic coalition structures","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.470177Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:3ba12cae042e7deea70010bcb7dfc08ced38d6096b84a5b888d0f432310a94fd","observation_id":"b59dacbe-37c7-4319-a3a0-8e9fd22f396d","resolution":{"observed_at":"2026-08-04T08:53:03.470177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.538269Z","title":"S ^p_2 ZPP ^ NP","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.538269Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:8d29ae5a0426bca8bb3937d9a9be20134ea2c25be27a313dc27a3f3e26dcd01c","observation_id":"9da5ea63-5c6c-49c1-bf2f-cbd04bdf4fae","resolution":{"observed_at":"2026-08-04T08:53:03.538269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.596362Z","title":"More on BPP and the polynomial-time hierarchy","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.596362Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:fdfbb9451a7faa5afc10e04c169b7a8ffdf8047a54d7ce35ed98d986b3505e72","observation_id":"5443f105-80ba-4a34-bfd4-021d281c1722","resolution":{"observed_at":"2026-08-04T08:53:03.596362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.699403Z","title":"A central limit theorem for intransitive dice","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.699403Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:68b7febd9db14766e2583ae4ed94a091a9e92fa78315f4372ebabedaa8d2eb36","observation_id":"5ca8b879-80cb-4d21-ac18-5b96d1c34a37","resolution":{"observed_at":"2026-08-04T08:53:03.699403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.10067","last_updated":"2024-11-07T08:15:13Z","snapshot_observed_at":"2026-08-07T14:15:57.649455Z","submitted_at":"2020-11-19T19:02:58Z","title":"Intransitive dice tournament is not quasirandom","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.10067","snapshot_observed_at":"2026-08-04T08:53:03.772379Z","title":"Intransitive dice tournament is not quasirandom","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.772379Z"},"links":{"cited_paper":"/paper/2011.10067","citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:a7b66cf91c8e56394cfaebdbf30adf8b3b17ece2a262f3d8adbf358d5f4d3e1d","observation_id":"0c8e318b-83d8-4e4d-8b3b-5e65dd601ec1","resolution":{"observed_at":"2026-08-04T08:53:03.772379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.871990Z","title":"Symmetric exponential time requires near-maximum circuit size","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.871990Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:9b37258d5840bac2d4fe73f6def522700c9e3811a8868a25e772201c5f792423","observation_id":"7f5efb14-dd17-430e-b17d-1fedf139c10d","resolution":{"observed_at":"2026-08-04T08:53:03.871990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:03.957211Z","title":"The complexity of theorem-proving procedures","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:03.957211Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:7ffeb10d826b2a285865b6f95ab1e933ac6b8d35dcf6b83b289ba5739fc197c9","observation_id":"a945b2a6-af31-49b9-b2c7-7c741ab777ac","resolution":{"observed_at":"2026-08-04T08:53:03.957211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.007210Z","title":"Essai sur l'application de l'analyse \\`a la probabilit \\'e des d \\'e cisions rendues \\`a la pluralit \\'e des voix","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.007210Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:9684b1c4e5597fe8ebf189effdc2458b523a992bfd02b3e30aeb0ff92158a286","observation_id":"fc2d1007-7559-438a-95ec-b66af6322cd3","resolution":{"observed_at":"2026-08-04T08:53:04.007210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.108210Z","title":"On the representation of directed graphs as unions of orderings","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.108210Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:78895850315713800ae154f372806a073fa401e9769646472f51b8f25edfbe27","observation_id":"9e21702d-924b-4b64-93ab-4316c41cdd40","resolution":{"observed_at":"2026-08-04T08:53:04.108210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.299245Z","title":"Paradox of nontransitive dice and elusive principle of indifference","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.299245Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:870ae018190a2320c80153ea39a79c0e2efd25654dd7dcdf89a3b6b8f43a58f9","observation_id":"321967db-4419-431b-af7e-deb9186eee45","resolution":{"observed_at":"2026-08-04T08:53:04.299245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.453280Z","title":"Match making: assignments based on bilateral preferences","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.453280Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:53f2407e1fc4dc6bf10f1ffa9974bcc78f37c94f09137ffa3a1d1205197fdd12","observation_id":"a6a1dbea-b0d0-46ac-9cee-bfd8876b5da5","resolution":{"observed_at":"2026-08-04T08:53:04.453280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.636457Z","title":"Complexity measures for public-key cryptosystems","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.636457Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:64c23d61f2ef1ed8dc3654bb8d6ffe8e24dc67e464b6a14965e4fd282900d439","observation_id":"e32d3710-29cb-416f-b47f-84cfb394cd04","resolution":{"observed_at":"2026-08-04T08:53:04.636457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.722872Z","title":"On isomorphisms and density of NP and other complete sets","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.722872Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:9013d551042f2ff90d87b181f9d837f5bf95264af428a52ed381a0a48d97a66d","observation_id":"9db96e4c-ba94-4f4b-b065-c3447de8d8e9","resolution":{"observed_at":"2026-08-04T08:53:04.722872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.793335Z","title":"A game of nontransitive dice","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.793335Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:5c33a298759416416bd02284bf0162ae8568084af38b9b636473d98795dc2b5d","observation_id":"5be3d1f6-066a-4d35-afe7-3185b8d16bea","resolution":{"observed_at":"2026-08-04T08:53:04.793335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:04.915785Z","title":"Deciding the winner in parity games is in UP co- UP","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:04.915785Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:e02e64e3623bc52ed76b3d59ccf882a414008f008ce495a51d004932c657a6cd","observation_id":"2211aa3c-08d8-4d51-9b03-c3864c409f01","resolution":{"observed_at":"2026-08-04T08:53:04.915785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.013257Z","title":"Total functions in the polynomial hierarchy","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.013257Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:0fd0b0ac638c6fdf798bf37bcf26302ba0963296e7b5a109af6335d973fa8bed","observation_id":"e5dc1f7a-6cf7-4831-8a77-9e26debc93ad","resolution":{"observed_at":"2026-08-04T08:53:05.013257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.100062Z","title":"Range avoidance and the complexity of explicit constructions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.100062Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:70eb6b3a75a119e026ca3aae945c75c048c846dadbd2eaa50aa592cc98a91c2b","observation_id":"2ce52f1f-9321-48c6-90f1-8b24e18f80db","resolution":{"observed_at":"2026-08-04T08:53:05.100062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.284532Z","title":"The complexity of optimization problems","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.284532Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:9a1eac17a2236e77b7b53641a2c9b9519a95e2dcfd42256c026a0ebf3b471848","observation_id":"8918e15e-2e17-40fd-9842-d634467f5639","resolution":{"observed_at":"2026-08-04T08:53:05.284532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.426373Z","title":"Symmetric exponential time requires near-maximum circuit size: Simplified, truly uniform","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.426373Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:2de39ceea481ce967c8a3f1d0fbc1fa59586a7b9133ad937e7ffe4553fc8caf1","observation_id":"a475b21d-03ab-4893-ac72-9ad5d6ca3db1","resolution":{"observed_at":"2026-08-04T08:53:05.426373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.546727Z","title":"Unambiguous polynomial hierarchies and exponential size","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.546727Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:8e79846a11bae689152ec471eae8e74dec813c8f1e1a2f664c84921f14ac574a","observation_id":"cb1ef772-d7e0-4340-8965-130547cd008a","resolution":{"observed_at":"2026-08-04T08:53:05.546727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.654631Z","title":"Unambiguous computations and locally definable acceptance types","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.654631Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:776461bfd74eb228fe2f194a2e93b591856379e0da1c54e66b825c82077fe515","observation_id":"fa73017e-c5e5-440c-9f50-65fead9d9bf9","resolution":{"observed_at":"2026-08-04T08:53:05.654631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.768459Z","title":"On the complexity of unique solutions","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.768459Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:06f3638dc5c15f81c5007649d6d6ac203d64dd329d54fd4b0802b7c279dd010b","observation_id":"2a09e7ec-76aa-4695-8a74-34f0253fd11c","resolution":{"observed_at":"2026-08-04T08:53:05.768459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:05.911090Z","title":"Computational Complexity","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:05.911090Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:6191eeaec95d70f772ef4fda1d64cfdca22d8562ab85d0c18c7aac266f6e6af5","observation_id":"a6af9ac6-a01c-4def-9e18-5f67eab944d5","resolution":{"observed_at":"2026-08-04T08:53:05.911090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:06.052535Z","title":"The complexity of facets (and some facets of complexity)","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.052535Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:6c88f6551bdef2046a0135bf8545b7e9cb4ae3e39f2c9d17024e8af9ce90f392","observation_id":"2d80a908-5098-4b78-bf0c-dfe065c0e820","resolution":{"observed_at":"2026-08-04T08:53:06.052535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:06.194776Z","title":"Domination and irredundance in tournaments","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.194776Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:c21a0de5919bc20f48ae04026de0e344880e088d41109d106d13e0b9ccc903b2","observation_id":"3260e62b-40dc-4f5d-88e9-2482d044a2af","resolution":{"observed_at":"2026-08-04T08:53:06.194776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:06.304735Z","title":"Symmetric alternation captures BPP","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.304735Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:880d1587833589b1fdedb7136d658218b82db9c2ce862233014eec38db266d00","observation_id":"b1b0ea68-ce4e-4332-8804-1c7b5a4c4aaf","resolution":{"observed_at":"2026-08-04T08:53:06.304735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.08986","last_updated":"2017-06-27T18:03:03Z","snapshot_observed_at":"2026-07-06T05:48:41.294949Z","submitted_at":"2017-06-27T18:03:03Z","title":"Balanced Non-Transitive Dice II: Tournaments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.08986","snapshot_observed_at":"2026-08-04T08:53:06.449164Z","title":"Balanced non-transitive dice ii: tournaments","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.449164Z"},"links":{"cited_paper":"/paper/1706.08986","citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:0de3babdc660a84cc2cc92b5a31a310c414bb351edc91625abad6127c6fe9ef1","observation_id":"db604a3a-d32b-4170-8abb-53360784e0d5","resolution":{"observed_at":"2026-08-04T08:53:06.449164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:06.543210Z","title":"On the difference between one and many: preliminary version","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.543210Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:4cd39e82f10ceacc7e09ce329613808ea3af57794e3d91453a030513e81bf033","observation_id":"246206a7-561c-4cc0-aed5-32c69f9203c3","resolution":{"observed_at":"2026-08-04T08:53:06.543210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:06.710090Z","title":"The voting problem","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.710090Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:691cabdc9516b2b48a59f493369d5f80bd1961e9975252af7f6bb5ac7a07da06","observation_id":"e96ccaeb-e604-4065-92e3-9787cc8b6ce8","resolution":{"observed_at":"2026-08-04T08:53:06.710090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:06.882384Z","title":"The polynomial-time hierarchy","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:06.882384Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:05688fc5a118b74ca1845c24b1f887e536d1548dd48a8b8f76aa6a99207b0047","observation_id":"517a8d4f-7d78-4cd2-8fbb-ccde36ce531f","resolution":{"observed_at":"2026-08-04T08:53:06.882384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:07.030650Z","title":"A reduction from satisfiability to hamiltonian circuits that preserves the number of solutions","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:07.030650Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:dae546d4e79caef26bfe432d2ed4b3d967dc015fae34325d4f96b65bf80c1707","observation_id":"6f136885-3ad5-407c-a85b-ff818889c54e","resolution":{"observed_at":"2026-08-04T08:53:07.030650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:07.161705Z","title":"Relative complexity of checking and evaluating","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:07.161705Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:8f431b17ee61de9f8718131469d3e4b125b8eaca8895f9f0c18bfd66876c13fc","observation_id":"fde15dbb-5941-448a-8ad9-32822ec2910d","resolution":{"observed_at":"2026-08-04T08:53:07.161705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:07.326670Z","title":"NP is as easy as detecting unique solutions","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:07.326670Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:bd3164af5118a7a2d985cd86d5cdd3595979baa3a3aef79bdc66c40e01211af7","observation_id":"9164ec6d-c78c-49ba-9121-a5f78666aa65","resolution":{"observed_at":"2026-08-04T08:53:07.326670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T08:53:07.433451Z","title":"Complete sets and the polynomial-time hierarchy","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T08:53:07.433451Z"},"links":{"citing_paper":"/paper/2510.19084"},"observation_digest":"sha256:5d562f3dd0c1a8d2c0c9dd7453a841a1370c814df7d513e626a680a80c1c9462","observation_id":"34115b94-01f6-4183-bbcf-4ef7bc68853e","resolution":{"observed_at":"2026-08-04T08:53:07.433451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.19084","last_updated":"2026-07-31T08:08:45Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T08:36:52.665487Z","submitted_at":"2025-10-21T21:22:41Z","title":"Complexity of Unambiguous Problems in $\\Sigma^P_2$"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"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 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2510.19084."}