{"as_of":"2026-08-16T10:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4b9bcb235acc243e2b66599a287327dec4e6fa97ee3fbac91bc7fcd04904ab0","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:23:26.556284Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2506.17210/citation-record","integrity":"/paper/2506.17210/integrity","json":"/paper/2506.17210/citation-record.json","paper":"/paper/2506.17210"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.8746","last_updated":"2015-09-11T17:23:44Z","snapshot_observed_at":"2026-08-14T23:05:41.996686Z","submitted_at":"2014-12-30T19:48:55Z","title":"Characterizing Propositional Proofs as Non-Commutative Formulas","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.8746","snapshot_observed_at":"2026-08-15T19:23:26.535531Z","title":"Theorie des Fonctions Numeriques Simplement Periodiques","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.535531Z"},"links":{"cited_paper":"/paper/1412.8746","citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:5db4266fe048c7593a35b464baccd6e0f884263bd283f9e173b3d85d73e0e65b","observation_id":"62cdf3b2-d991-4a27-928f-1c20881cf584","resolution":{"observed_at":"2026-08-15T19:23:26.535531Z","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-15T19:23:26.486615Z","title":"Lower Bounds for Polynomial Cal- culus with Extension Variables over Finite Fields","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.486615Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:de8af86adcbe5aeff4ed6716ca9a08e1ffaf348a74b8ec4df4d6cd528d2d0619","observation_id":"660f0b7c-f58e-4af1-8574-2d7a79208bbe","resolution":{"observed_at":"2026-08-15T19:23:26.486615Z","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-15T19:23:26.530653Z","title":"Characterizing Propositional Proofs as Non- commutative Formulas","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.530653Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:e0c9dda77b6233ab86bffafbacf3f6c7f04a96a1ce803d43499f0ffaad4e2b7d","observation_id":"f1e137f9-8144-4cec-b1b4-f6aa9de70255","resolution":{"observed_at":"2026-08-15T19:23:26.530653Z","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-15T19:23:26.556284Z","title":"Iterated Lower Bound Formulas: A Diagonalization- Based Approach to Proof Complexity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.556284Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:6d0835bf73b2154a5ac39467de4d39e7cf0134589fdc25005b96af61f10698eb","observation_id":"fba73930-358d-4ffa-b04b-e53c516a2592","resolution":{"observed_at":"2026-08-15T19:23:26.556284Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:23:27.310654Z","title":"Unsolvable systems of equations and proof complexity","venue":null,"work_id":"924e57a3-e42b-43ae-a92f-28593bc39f75","year":1997},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.543998Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:0d318fec4eba85ce166bb3215a919a4aae917af4e221f6d984fa498d42410daf","observation_id":"5f57c5b4-7167-43df-aa5a-769b7d794465","resolution":{"observed_at":"2026-08-15T19:23:27.314761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2021.21.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:23:26.700495Z","title":"Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits","venue":null,"work_id":"3e24716d-0915-4542-a247-a6e41ef02116","year":1996},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":200,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.339770Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:463687e3b76c3c1a8dce95d74bb98a02b0e34f5c9f04b9fb5014e2dd94f1327a","observation_id":"813bc3cf-7e09-4e2a-bb40-99764555d558","resolution":{"observed_at":"2026-08-15T19:23:26.743921Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2023.12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:23:26.794742Z","title":"A Lower Bound for Polynomial Calculus with Extension Rule","venue":null,"work_id":"2b058931-a839-43b7-878d-da8c6daaf0c7","year":2023},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":261,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.334892Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:b7490f0f1483145a339439826c512c80ac10bd5d353911a61fec0df543a141b9","observation_id":"c9f690cc-1184-4070-bfb7-058f9be25185","resolution":{"observed_at":"2026-08-15T19:23:26.809901Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-15T19:23:26.355189Z","title":"Quasipolynomial-Time Identity Testing of Non- commutative and Read-Once Oblivious Algebraic Branching Programs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":300,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.355189Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:8a9126688cae0de9a6390ac5fcf3fae69e678e2b27b22f256ea90e03bdd4d4d5","observation_id":"7271c312-8ae7-4ae4-8941-a212168d6d9c","resolution":{"observed_at":"2026-08-15T19:23:26.355189Z","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-15T19:23:26.351108Z","title":"Low-depth algebraic circuit lower bounds over any field","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":305,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.351108Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:204ec580e0a3877ded29c6b9feb4ebb8adfc0223802d92f6b29e50a6a5f3ed83","observation_id":"42642afa-9f51-45d8-b5b8-bf50bf07c8ed","resolution":{"observed_at":"2026-08-15T19:23:26.351108Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.apal.2008.04.001.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:23:26.584369Z","title":"Algebraic Proof Complexity: Progress, Frontiers and Challenges","venue":null,"work_id":"1b2be388-64e7-411b-8a9d-22463b8a4e84","year":2016},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":460,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.548048Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:41c5d1d473c52386b910e5636d83d0c6f430eb6d5c16a0cca756000275eeb19b","observation_id":"e97328aa-d1f0-46ff-93a5-cee49d642cbb","resolution":{"observed_at":"2026-08-15T19:23:26.641626Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-15T19:23:26.539526Z","title":"Algebraic propositional proof systems","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.539526Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:6156f5e47f31185691c9993331cc5525f8a99741041c2dd96fb5ea00e629fa40","observation_id":"320bdeac-9af9-49f6-991f-27068730b419","resolution":{"observed_at":"2026-08-15T19:23:26.539526Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:23:27.297142Z","title":"(Semi)Algebraic proofs over±1 variables","venue":null,"work_id":"df4a7989-b896-4966-8d91-b58da3a3e7ef","year":2016},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.552363Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:fdb050ef7d60583ded377d399a540b20858daf4dba17483d6b32406c811446ba","observation_id":"9a0d5190-827f-44fd-8150-dd88b70575c9","resolution":{"observed_at":"2026-08-15T19:23:27.301472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2408","last_updated":"2013-09-22T22:02:53Z","snapshot_observed_at":"2026-08-15T00:47:04.389680Z","submitted_at":"2012-09-11T19:52:41Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2408","snapshot_observed_at":"2026-08-15T19:23:26.359570Z","title":"Proof Complexity Lower Bounds from Algebraic Circuit Complexity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.359570Z"},"links":{"cited_paper":"/paper/1209.2408","citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:a6abe7d90917e93fc2d65a599869b93c2b8e1cf94ac7ae3578bb29ce553dff90","observation_id":"fbb1d50b-e4f0-4572-8b3f-2d9cff3fc83e","resolution":{"observed_at":"2026-08-15T19:23:26.359570Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:23:27.330489Z","title":"Low- Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization","venue":null,"work_id":"3eb306e5-eb5e-44a0-95e7-a72aa1b9a579","year":2020},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.329619Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:08982f2e95e57ab02e5f1a8405399e48161c691a15aa1d3013735b4a9e62617c","observation_id":"7c1b605b-5ab0-4349-b0e1-91ec17e2afee","resolution":{"observed_at":"2026-08-15T19:23:27.409789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.00792","last_updated":"2022-10-27T17:09:17Z","snapshot_observed_at":"2026-08-13T17:23:37.573312Z","submitted_at":"2021-12-01T19:29:34Z","title":"Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals","version":2},"cited_work":{"arxiv_id":"2112.00792","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.00792","snapshot_observed_at":"2026-08-15T19:23:27.282326Z","title":"Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals","venue":"cs.CC","work_id":"963cfa5b-3b80-443a-a8e7-b00b3e1a6d7b","year":2021},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.271413Z"},"links":{"cited_paper":"/paper/2112.00792","citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:82974290b2e5a2b87b07c0e232d04e6bb349b4a21d3aab320baf189586911613","observation_id":"f90b5602-370a-499d-8780-362623b3a910","resolution":{"observed_at":"2026-08-15T19:23:27.287688Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-15T19:23:26.402200Z","title":"The Surprising Power of Constant Depth Algebraic Proofs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.402200Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:b2e9dfbf9142d1bc35549c1ea219b7500b7a83be601c3728bb86af0be00cc310","observation_id":"1dae1a1e-3efb-4170-b02d-001e9a62a70a","resolution":{"observed_at":"2026-08-15T19:23:26.402200Z","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-15T19:23:26.345010Z","title":"TowardsNP-Pvia Proof Complexity and Search","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.345010Z"},"links":{"citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:1d5cdf3cd6fac9e75f98961143e2ef2362c87753c49897ba6c01e72a22d49064","observation_id":"5f32c96b-aa54-4881-9ada-d2a0c01bf3a6","resolution":{"observed_at":"2026-08-15T19:23:26.345010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":4,"verified_fuzzy":3},"total_outbound_references":17},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2506.17210."}