{"as_of":"2026-08-12T13:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2ab66b170bc5e1b681bbc3a8d787d6f807099da843e7ab3b4d074199aa3b95a","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T05:03:39.386291Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"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/2607.13540/citation-record","integrity":"/paper/2607.13540/integrity","json":"/paper/2607.13540/citation-record.json","paper":"/paper/2607.13540"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:03:37.243612Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:37.243612Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:778b93c0c553c3a7374986e257942066d40582273302e81539c2929271e0c099","observation_id":"84b03891-41fa-41cd-ac4c-9e9366427818","resolution":{"observed_at":"2026-08-02T05:03:37.243612Z","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-02T05:03:37.355429Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:37.355429Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:3a8cf5d74a2e6becc257f5241fa510d7863599cfbee114f6c9a21ccdcaa1e803","observation_id":"25136a00-14c8-4537-a899-6159dedc3118","resolution":{"observed_at":"2026-08-02T05:03:37.355429Z","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-02T05:03:37.490884Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:37.490884Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:4b0f5f53263a913d4a8776fddd448712828e14e7725238030b85b4daa2361045","observation_id":"d78dda8c-a519-4c96-a42c-a6b1df2958f9","resolution":{"observed_at":"2026-08-02T05:03:37.490884Z","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-02T05:03:37.574254Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:37.574254Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:d2919f8700ecee548a04d11d8b60f630ac46dc8be4319814f5d764bf876ae91b","observation_id":"795cb606-fe5e-4ef9-922d-fabd598651b2","resolution":{"observed_at":"2026-08-02T05:03:37.574254Z","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-02T05:03:37.700410Z","title":"Ilango, The Oracle Derandomization Hypothesis is False (And More) Assuming No Natural Proofs,Electronic Colloquium on Computational Complexity, Report No.190, (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:37.700410Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:1888477a3ba4cb4754885560184ff22eb9cca7b201546697f7566c26a715b2cb","observation_id":"db7222b8-7ec7-48dd-9c15-40f0da43ce70","resolution":{"observed_at":"2026-08-02T05:03:37.700410Z","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-02T05:03:37.870475Z","title":"Khaniki, Jump operators, Interactive Proofs and Proof Complex- ity Generators, in:Proc","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:37.870475Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:d2419a6359cc1b97c153e294b182696465983f82965cb3af1e9101298d80809c","observation_id":"3e82c1df-0430-4040-8ada-c40fcfb20c51","resolution":{"observed_at":"2026-08-02T05:03:37.870475Z","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-02T05:03:38.027345Z","title":"Kraj ´ ıˇ cek,Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, Vol.60, Cambridge University Press, (1995)","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.027345Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:1ee24125630ae42d95f1b3c1011de524d6ff4a29b60ce33788dc5389d0b42105","observation_id":"160a23ff-e758-4601-be70-189f853f68d1","resolution":{"observed_at":"2026-08-02T05:03:38.027345Z","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-02T05:03:38.131038Z","title":"Kraj ´ ıˇ cek, On the computational complexity of finding hard tau- tologies,Bulletin of the London Mathematical Society,46(1), (2014), pp.111-125","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.131038Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:5737171a944d509b4d4f52f0ca2741083f192c087951d977fa66cad78cdfc3ff","observation_id":"7d15e44c-c8cb-493c-9d16-774346ad6401","resolution":{"observed_at":"2026-08-02T05:03:38.131038Z","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-02T05:03:38.272558Z","title":"Kraj ´ ıˇ cek,Proof complexity, Encyclopedia of Mathematics and Its Applications, Vol.170, Cambridge University Press, (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.272558Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:016c1b4cc404eb8128e69e11ff5ff49bf49a0a34e9630c391622736a066a6bbf","observation_id":"4cd74cca-cd89-4a61-8e7c-bfa5b8557c0a","resolution":{"observed_at":"2026-08-02T05:03:38.272558Z","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-02T05:03:38.432619Z","title":"Kraj ´ ıˇ cek,Proof complexity generators, London Mathematical Society Lecture Note Series, No.497, Cambridge University Press, (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.432619Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:2595db296db075ce49cf2bfe2984f94c9244e7d8dfb6a07b0e7dbcf846d945e1","observation_id":"e5616e99-24cf-4d1a-8b60-49341f81b7f1","resolution":{"observed_at":"2026-08-02T05:03:38.432619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.04830","last_updated":"2026-04-13T11:14:59Z","snapshot_observed_at":"2026-07-06T22:53:41.734429Z","submitted_at":"2026-04-06T16:32:46Z","title":"Failure of the strong feasible disjunction property","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.04830","snapshot_observed_at":"2026-08-02T05:03:38.614147Z","title":"Kraj ´ ıˇ cek, Failure of the strong feasible disjunction property, submit- ted (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.614147Z"},"links":{"cited_paper":"/paper/2604.04830","citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:66d654ae1578f40941d4d769c6ea7ec3171f545d09895732ad339e775becfc4f","observation_id":"3fabeb1b-b730-4f5e-aac0-ab2cb9ddb1d5","resolution":{"observed_at":"2026-08-02T05:03:38.614147Z","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-02T05:03:38.766105Z","title":"Kraj ´ ıˇ cek and P","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.766105Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:66151a2837648c01fd58e846c58f1995f99e0f89ebde67997fbf4fdce2de413e","observation_id":"c56ccac7-b130-4d97-8401-b8ca15d5acb9","resolution":{"observed_at":"2026-08-02T05:03:38.766105Z","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-02T05:03:38.887978Z","title":"Kraj ´ ıˇ cek and P","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:38.887978Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:7df5bf0c3da094972b1aaf70b7c329e20f5a33dec7201d930ec087002c63fc3b","observation_id":"70f56477-c54a-4e2e-9050-e315be3352c6","resolution":{"observed_at":"2026-08-02T05:03:38.887978Z","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-02T05:03:39.069860Z","title":"Pudl´ ak, Incompleteness in the finite Domain,Bull","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:39.069860Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:0c8070f27184b9a335315357afa08f5bce866dc59b49ee7610e54d3f5dafc193","observation_id":"e746a34b-1abb-4566-890c-89e8815408ef","resolution":{"observed_at":"2026-08-02T05:03:39.069860Z","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-02T05:03:39.239027Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:39.239027Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:900255e27b03a41ae12b3566570a303eb615f51893e4217125b6f2945d3628b5","observation_id":"9c81ab3f-4042-4afc-aa36-bc343fd9491b","resolution":{"observed_at":"2026-08-02T05:03:39.239027Z","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-02T05:03:39.386291Z","title":"Rudich, Super-bits, demi-bits, and N P/qpoly-natural proofs, in: Proc","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T05:03:39.386291Z"},"links":{"citing_paper":"/paper/2607.13540"},"observation_digest":"sha256:6fb4ccc7e834c6d44af454a506ba21cb5d4a1f395712251e6c42f8ba7fd7300e","observation_id":"52c2f598-5a3e-4372-bdc3-d2fe3e5b8053","resolution":{"observed_at":"2026-08-02T05:03:39.386291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13540","last_updated":"2026-07-15T07:43:08Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-04T16:13:27.346338Z","submitted_at":"2026-07-15T07:43:08Z","title":"A proof complexity perspective on effectively zero-knowledge proofs"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":16},"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 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.13540."}