{"as_of":"2026-08-12T14:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7c6a680b4a4acf0b79b24fd1c8d391ea58b5b98a4094a3824ca777dc7a0bc699","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T14:17:34.821409Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"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.09963/citation-record","integrity":"/paper/2607.09963/integrity","json":"/paper/2607.09963/citation-record.json","paper":"/paper/2607.09963"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:17:34.821409Z","title":"Derandomizing Arthur- Merlin games and approximate counting implies exponential-size lower bounds","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:393327d6840c4167fb3d8194f73382f289b54ab14c5bc99617d9870ab1abaa63","observation_id":"a0ef85bd-9f98-4e26-8874-a4caa4e1dc26","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"Symmetric exponential time requires near-maximum circuit size","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:9ccd5d142ed799b11398d5bd84053cc314b277f891e95265a072ff60e2beb0ff","observation_id":"9e486f36-bc11-4ada-a43d-bb6d6a0b95a1","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"Maximum circuit lower bounds for exponential-time Arthur Merlin","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:fcd2e2a048e1668a20c2b0750505d7acec2cff16a3eaa18463a46cc57b9fa9a4","observation_id":"ddf8c167-2763-439a-967d-177ef5012951","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"On promise problems: A survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:986624dd295f5148fd02ccb7e0d0ca26dcf31b806ed655a2a4363da0d0afa558","observation_id":"cea7185f-ea61-4ca7-8ae3-cdb94cd4bd38","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"Highly resilient correctors for polynomials","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:2748a2cd275b0653efe9a551ab67fb14022090c06ea21622eec43a5d056ebfc1","observation_id":"1cbd8b1a-3d9a-4c66-aae4-b99d241b8424","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"In search of an easy witness: expo- nential time vs. probabilistic polynomial time","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:f3c3a5b8682a281c243adac2cea1c4a7cebef87761165ad6b77694d4822c43fe","observation_id":"89843aba-117b-4658-907c-a2099d0e80da","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"P = BPP if E requires exponential circuits: derandomizing the XOR lemma","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:12ba81fbe43d1e91a6cbc8def7ae8e5b0ec9a9ee060c39c5c2642dbca693221e","observation_id":"1d752354-4792-4db4-a0eb-0065e82d40a2","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:a8336b4b819d46464c07a8b6aab316b43bf62283114180e1ac295f1b89359c74","observation_id":"8236914d-7510-4fed-9969-1a8b1c442cc7","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","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-07-14T14:17:34.821409Z","title":"NP is as easy as detecting unique solutions","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T14:17:34.821409Z"},"links":{"citing_paper":"/paper/2607.09963"},"observation_digest":"sha256:dccd8cac0212cfc583611c19e62e656a4dcd13dafe4f45645776f814456e6a2b","observation_id":"d031d4d8-cf8a-4b75-be08-c13505c2fafb","resolution":{"observed_at":"2026-07-14T14:17:34.821409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09963","last_updated":"2026-07-10T20:33:08Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T08:03:28.647758Z","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":9},"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 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2607.09963."}