{"as_of":"2026-08-22T05:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf97e28362e2916e2edb6066c9b49bba8fa6f354b1f227f15325ca6798d57d36","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T16:13:04.789491Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2606.01163/citation-record","integrity":"/paper/2606.01163/integrity","json":"/paper/2606.01163/citation-record.json","paper":"/paper/2606.01163"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"oso/9780198","doi":"10.1093/acprof:oso/9780198237907.003.0008","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Oxford Univer- sity Press (2018).https://doi.org/10.1093/oso/9780198814788.001.0001","venue":null,"work_id":"a1b77a81-dfdc-490e-805b-591b44077c3d","year":2016},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:284adc36b7cf97f886c4642341114a1633d2ecf5b793589bf7425f873abdd6da","observation_id":"0008d5ca-f44d-4efd-a673-589ec1421184","resolution":{"observed_at":"2026-06-28T16:22:22.685141Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T16:13:04.789491Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:fd58f0f4e8953d393d0576afd6f4f14cc788093b739947414cb58b973bbec36b","observation_id":"d133ed02-e85f-4d24-bde3-13ccec5470f7","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:2611df5c42f03acbf18f6587ef90fefb3c8cb062275965ae95953f0c4fc149ed","observation_id":"ff9724bf-3618-4c20-9261-cd19845dbc41","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"2025 , eprint=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:d79c8ba9a6ae286139f7651e1be968be577bad7c45d33739e4db28224359a60d","observation_id":"ea300634-4b0e-4f52-9aab-f9d70883e65a","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"1963 , journal =","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:c6000549f3144aeae0d3d17ad5e30c209cf3352b06bba1ad289497219dfcb364","observation_id":"0d596e30-8ea9-48ee-b043-1a7d557ef5f0","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"1988 , journal =","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:af750c79e2b7ac09bd90ff865d5caff3674e673dc7e3c6bd9c5288f5de0a0a15","observation_id":"8179fcce-5484-4ab4-808c-93ad61e09591","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"1987 , school =","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:57626dd27403770d53c8b15ea4a5b095827fdd08f1fb17c8f6e90a2da520eeb7","observation_id":"7139b856-6ede-4b2d-8db4-903f60352554","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"Proceedings of the IEEE 29th Annual Symposium on Foundations of Computer Science , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:552f965ee272492902f67e7c7789fc4ec25cd6bf0cdf303907865acbd811d464","observation_id":"f1729ecb-713d-43ce-98dd-f9547107f3a0","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"1995 , journal =","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:624deecdbb37f0a1fb75f0b6c7f8031df8c3b248aa175e9d4725b36315bdae51","observation_id":"70e3568b-856b-4d98-8714-7967def85d94","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"and Skelley, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:ad6040b03d9d1d0f5940319e2bb463cefbe2e97aee13a4e1b7dca43bdb441aab","observation_id":"0a12ed00-5ed9-4bd3-8d63-d80719a2f29b","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"and Krajíček, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:22fe4062c6c65a3f356a9277a8788e6b870d4af2c23bc0805e4547208f6cf51a","observation_id":"ee1dc389-3007-444d-a696-91b523a0fce0","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"1993 , journal =","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:23481da18abb84e9c752039bc2599799c645eda917df19d092266e0b3fa6c446","observation_id":"e724eca3-2f10-4b7f-9cd3-57a615ff9059","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"Feasible mathematics , publisher =","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:962e5b204524bb01c0f000b774116077872faf9ccea482f12b787e7ffa63a3e9","observation_id":"19a64753-dbbe-4936-8049-96e056530502","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"and Wilkie, A","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:fab32bace56d711a7be41b9d018d1dc744f573387770d2f7142d19dfb03df705","observation_id":"a76fe8e3-24d3-49e6-bc08-5d0f6960d7f9","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:6a0c34f9536ae0d9f8f4fcf6bd9ecf5bde9ed49b5ae9c6549392b2b5a6ec0327","observation_id":"f51eeb7f-e874-4acc-b035-2b0d0b4083be","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"2019 , publisher=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:88e9b4ba85f44f6e04160814946674ecd4bcacab1dcc86bfbc0f4ec326f8ee3b","observation_id":"6328b1d7-dddb-4f13-918a-70ba26b947fc","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"A simple proof of the","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:568422bc00846d877a3f8a7c2e16aea2c57fc07403f107a350f1e65c81dd7432","observation_id":"a593c49f-85cc-4e34-a9d6-d867689779a6","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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":"10.1002/1521-3870(200204)48:3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T16:22:22.679874Z","title":"and Krajíček, J","venue":null,"work_id":"5af12e46-02f5-4edb-9155-d6c5d385b03a","year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:2d798eeb3e701ea4464a458ff2116bd6612eb038b67a2a733a758700d2bb011b","observation_id":"59fd868b-9985-43d1-96d5-4331b6f42bbc","resolution":{"observed_at":"2026-06-28T16:22:22.681800Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T16:13:04.789491Z","title":"Arithmetic, proof theory and computational complexity , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:66df53c73e2552ccfca46b84e74f111f96f9a3198de9027f117fbfe9e9943a9e","observation_id":"1f75e660-60aa-4f6a-a2fe-5dae1f8b5f05","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:c4a780ee8584815a1c5333da04cab0ec85c127447510d745a2ccc9efd5d779fd","observation_id":"ce6b62c9-43f8-434d-9b0e-0b3f572980bf","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"and Müller, M","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:20490d5e5e3279594d9196fa1751713cb2bbd351271e1112d258ab944b030fdf","observation_id":"5ab32a1b-b10a-47bc-a507-a4cce9d92451","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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":"10.1016/0304-3975(88)90131-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Vishkin, U","venue":"Theoretical Computer Science","work_id":"59726039-4f7b-4743-b647-8ced38350026","year":1988},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:6c1e584c59f18e85c43fe0a83bd46d97186ce92297830d5d1a819a914f6cdb79","observation_id":"f6d652fa-2831-4938-a606-530814471b7a","resolution":{"observed_at":"2026-06-28T16:22:22.671080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/malq.200410005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":", title =","venue":"Mathematical logic quarterly","work_id":"f200b9ef-d761-42ce-bf0c-b37c43861513","year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:76048b2d35e30fd474b5af936d606d81935b64e18d2bffe3dd161ad1aaa99ef9","observation_id":"786a80d5-842f-4d42-b625-188c74895d6b","resolution":{"observed_at":"2026-06-28T16:22:22.678285Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0022-0000(05)80063-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence","venue":"Journal of Computer and System Sciences","work_id":"759841fc-59a8-45d8-9c49-4bdf336e25ce","year":1994},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:b9de8ea93d1f3be57bbac8b5f6f46ad4075a0e18ca1be1706987fc315c4c3b65","observation_id":"e0866a30-5074-4dc2-b455-4e7ee72e3d7b","resolution":{"observed_at":"2026-06-28T16:22:22.673483Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-07T20:38:22.947902+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-07T20:38:22.947902+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2629555","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Thapen, N","venue":"ACM Transactions on Computational Logic","work_id":"0cc97024-24fb-4c04-b1be-a2341feef4b0","year":2014},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:d7b24a3cef302cbf3e2bf834ec44ad105a113ef218a656ad034ec3bbf9b6aa44","observation_id":"357a9d54-39a2-4d1c-b6ff-ac149931037d","resolution":{"observed_at":"2026-06-28T16:22:22.669440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T16:13:04.789491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:0a64fbdbd5f5981b0ba5823b947e231ec5d269d6ad1a0d90ace4a5ea95f67489","observation_id":"9242abe0-c575-4158-87c3-b8c24b8d6ec1","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"Journal of Symbolic Logic , number =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:a30d56d5edcbca1b7348193fe8a0a7167763bc52687b5c882482221871f8cf14","observation_id":"b2dfb4ed-7b81-4969-b4c8-baa2c71dc7f3","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":"and Ježil, O","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:441cf51cbfc5419141cae7750e9ffeb76090b823cdf86ad9bfdcd217f631141f","observation_id":"3b58614f-fa3a-46b7-b7df-3463cce3c52d","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","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-06-28T16:13:04.789491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-28T16:13:04.789491Z"},"links":{"citing_paper":"/paper/2606.01163"},"observation_digest":"sha256:66d93c7480816c9c4074bdf9ec65ed569fa35c348c1c8fa7b0eb79c23df25188","observation_id":"d99eea8a-ec35-4e94-b987-bd19d8ee4b82","resolution":{"observed_at":"2026-06-28T16:13:04.789491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.01163","last_updated":"2026-05-31T11:11:12Z","latest_version":1,"primary_category":"math.LO","snapshot_observed_at":"2026-08-18T00:19:58.418254Z","submitted_at":"2026-05-31T11:11:12Z","title":"Minimization Principle for Polynomial-Time Predicates and Forcing in Bounded Arithmetic"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":23,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":29},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2606.01163."}