{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MEPCKAWMUBR5TPIBRE5XKGXXW2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"47e9734049b956769bcd6e56ab5aeff08c219e58e5449d7aafc4ea8bf120fae2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-10T20:33:08Z","title_canon_sha256":"2e27cee5114b4a9c03f360f6a671b625523d744ecc881295afa38d2537f17ebf"},"schema_version":"1.0","source":{"id":"2607.09963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09963","created_at":"2026-07-14T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09963v1","created_at":"2026-07-14T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09963","created_at":"2026-07-14T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"MEPCKAWMUBR5","created_at":"2026-07-14T00:18:45Z"},{"alias_kind":"pith_short_16","alias_value":"MEPCKAWMUBR5TPIB","created_at":"2026-07-14T00:18:45Z"},{"alias_kind":"pith_short_8","alias_value":"MEPCKAWM","created_at":"2026-07-14T00:18:45Z"}],"graph_snapshots":[{"event_id":"sha256:c057e13ccc77e3d2c8787d5d412c4125408f762ec6455330a9a709a5ebeb71a5","target":"graph","created_at":"2026-07-14T00:18:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.09963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a near-maximum ($2^n / n$) circuit lower bound for the complexity class $\\mathsf{E}^{\\mathrm{pr}\\mathsf{MA}}/_1$, corresponding to exponential time with access to a promise-$\\mathsf{MA}$ oracle and one bit of advice. Our proof incorporates the iterative win-win paradigm (Chen--Lu--Oliveira--Ren--Santhanam, FOCS'23), the reduction from the Range Avoidance problem to circuit lower bounds (Je\\v{r}\\'abek, Ann. Pure Appl. Log. '04; Korten, FOCS'21), and the PCP theorem. Crucial to our proof is the analysis of the complexity class $\\mathsf{P}^\\mathsf{NP}[{\\textsf{#rounds}}=r, {\\textsf{lengt","authors_text":"Hanlin Ren, Ryan Williams","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-10T20:33:08Z","title":"Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09963","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a336bdf2c42cc7fbb7c59ced7c0e1bb2b0293bdb971198ea74ef2328df8b7048","target":"record","created_at":"2026-07-14T00:18:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"47e9734049b956769bcd6e56ab5aeff08c219e58e5449d7aafc4ea8bf120fae2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-10T20:33:08Z","title_canon_sha256":"2e27cee5114b4a9c03f360f6a671b625523d744ecc881295afa38d2537f17ebf"},"schema_version":"1.0","source":{"id":"2607.09963","kind":"arxiv","version":1}},"canonical_sha256":"611e2502cca063d9bd01893b751af7b6a7aeac34fc7ad1b6b7d5761ab1c26145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"611e2502cca063d9bd01893b751af7b6a7aeac34fc7ad1b6b7d5761ab1c26145","first_computed_at":"2026-07-14T00:18:45.059163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T00:18:45.059163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HARXUmikLXLYBAZUSI3EZNt7HLl3p7GPZJaxRDyHy0hb1IIQB79GVYZDv3xh4cTIa829wwOQ9vk/n+TBytPIAw==","signature_status":"signed_v1","signed_at":"2026-07-14T00:18:45.060023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a336bdf2c42cc7fbb7c59ced7c0e1bb2b0293bdb971198ea74ef2328df8b7048","sha256:c057e13ccc77e3d2c8787d5d412c4125408f762ec6455330a9a709a5ebeb71a5"],"state_sha256":"a6ecacdfaeb9130a326aa7e239a7617a9bfc528e1851c88b1cb720b7943dc778"}