{"as_of":"2026-08-11T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93d1b9c3f9fe87282f412bf2d5aecaf96b552f8c7c7915ad40096a90e38e6eae","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:16:02.895423Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2412.19623/citation-record","integrity":"/paper/2412.19623/integrity","json":"/paper/2412.19623/citation-record.json","paper":"/paper/2412.19623"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.225711Z","title":"On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz","venue":null,"work_id":"5fb3f3a6-ceee-4881-90c9-426cd6cf02e3","year":2017},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.837824Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:628d80ff1c1bda2486e6c21d84c7794e71b36b03890388a145053a026b869433","observation_id":"8a2a7a8c-4649-4ee6-af18-0d40c9d5c1a5","resolution":{"observed_at":"2026-08-11T00:16:03.233581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.098975Z","title":"Quantum 3-SAT Is QMA1-Complete","venue":null,"work_id":"cefdbff8-064e-4bb7-87f5-c5ff2c32a245","year":2013},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.875715Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:7927b2b0db596a68dbc83cd3f3ec712e057d9290a6fcb910782b9f92b21212ac","observation_id":"5cea2ecb-ed30-4e14-9f64-b5edb0d87be3","resolution":{"observed_at":"2026-08-11T00:16:03.112352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.246710Z","title":"[BH16] Fernando G","venue":null,"work_id":"6cb74e7c-07ca-48c3-84ac-89516fc3b4ad","year":2022},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":262,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.830262Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:e2db7303d1c2e462126334776e3341c2cb95be3d077bb10bb9efee2a6f7c20fb","observation_id":"2a53f0cb-7adb-461d-ae1d-381cc353bc28","resolution":{"observed_at":"2026-08-11T00:16:03.254287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.063006Z","title":"Efficiently Computing Real Roots of Sparse Polyno- mials","venue":null,"work_id":"0672b0c4-f6db-465c-8595-f34759460db7","year":2017},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.881424Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:789fd0246e67699345725be150b6253e38dbd85a5fbc8696a3afac915313a479","observation_id":"cf5abc49-e086-4b4b-ac17-346b69cdebd5","resolution":{"observed_at":"2026-08-11T00:16:03.071274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.191242Z","title":"Further Collapses in TFNP","venue":null,"work_id":"2599dc7e-7911-4585-99be-94dc2b0d6c3f","year":2022},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.853983Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:5493ceee353508c313cdf6a324d8bb7cad50b91598ae2db49d2cb098a83d3b6e","observation_id":"4cfacea7-7ca0-4da7-a50a-6f7b53153b73","resolution":{"observed_at":"2026-08-11T00:16:03.203150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"0907.1297","last_updated":"2014-09-18T15:20:16Z","snapshot_observed_at":"2026-08-05T05:09:13.025546Z","submitted_at":"2009-07-07T20:49:59Z","title":"Bounds on the quantum satisfiability threshold","version":3},"cited_work":{"arxiv_id":"0907.1297","doi":null,"metadata_source":"pith","pith_arxiv_id":"0907.1297","snapshot_observed_at":"2026-08-11T00:16:02.967220Z","title":"Bounds on the quantum satisfiability threshold","venue":"quant-ph","work_id":"0a81a6e2-0ee5-4c24-9372-538fcb39ff72","year":2009},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.846743Z"},"links":{"cited_paper":"/paper/0907.1297","citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:693aa7f9490dce433d49c3ec40d636f17184d53bf06a6ec8ab17b474611d65d0","observation_id":"51ac1720-4e0d-44b2-a639-849f9292e65b","resolution":{"observed_at":"2026-08-11T00:16:02.976630Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.299223Z","title":"A Linear Time Algorithm for Quantum 2-SAT","venue":null,"work_id":"9c61178b-4384-4366-8a41-95ad17a5a6e9","year":2016},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.813220Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:eb916654b3863b2e748146a9792d3693f65ba05d375e22881f155e34ed7fec59","observation_id":"bb2a5265-3d46-4dde-bd3b-2845c4ae0236","resolution":{"observed_at":"2026-08-11T00:16:03.307873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.029477Z","title":"Intersection Classes in TFNP and Proof Complexity","venue":null,"work_id":"0f256bb7-9381-4d1f-9565-078242d5a700","year":2024},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.888554Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:3205b07df870574d182bdac8b3045fe8ff6914941e3fef242f5aca8eb17fb18d","observation_id":"04111d07-a9f0-419d-9e6d-aae08d803cb9","resolution":{"observed_at":"2026-08-11T00:16:03.040425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.143708Z","title":"On the Com- plexity of Modulo-q Arguments and the Chevalley - Warning Theorem","venue":null,"work_id":"90e3613e-cb5d-4b05-bac3-0594d4095a60","year":2020},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.867689Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:c766237c466f77d6cef80b18ca61cdb8707bb9547f678d59248120dbe32eb40a","observation_id":"bc9fc027-6c2f-4e03-8d4e-cad16d30811e","resolution":{"observed_at":"2026-08-11T00:16:03.153329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.274718Z","title":"[BEKT22] Evangelos Bartzos, Ioannis Z","venue":null,"work_id":"a2f9d682-4aca-46e4-84a8-640525a3c647","year":2022},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.824615Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:0db8f43f75245fc258240dfcfc00e19a2aab3ec39888d7157b47d46c18dfaca3","observation_id":"cc78327e-e4a5-460b-b0d5-d801efb8fda4","resolution":{"observed_at":"2026-08-11T00:16:03.282244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:03.328901Z","title":"Linear Time Algo- rithm for Quantum 2SAT","venue":null,"work_id":"5a170d4c-2352-4d51-8517-87b7b4128378","year":2016},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.804259Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:e10472e873a34e496be64e556e8dba87b921bdc19263d70f93fcbca868b8c545","observation_id":"d261773e-7229-49fa-84c5-b7d16a9f5634","resolution":{"observed_at":"2026-08-11T00:16:03.335835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:16:02.995938Z","title":"Computing Minimal Multi-homogeneous Bézout Numbers Is Hard","venue":null,"work_id":"92fb3a95-79ee-4448-a2fd-72acdad6cc2b","year":2005},"citing_paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T00:16:02.895423Z"},"links":{"citing_paper":"/paper/2412.19623"},"observation_digest":"sha256:a86d8c471c3b4b42e9cb76b7513c0ac2127219e976064582f4efbfa81e6bdaf4","observation_id":"b4c73c78-d007-4e91-ab8e-370c400d39f8","resolution":{"observed_at":"2026-08-11T00:16:03.008888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2412.19623","last_updated":"2025-06-19T07:46:53Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T05:12:53.661612Z","submitted_at":"2024-12-27T12:57:06Z","title":"An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":11},"total_outbound_references":12},"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 11 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2412.19623."}