{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5ZIEHW2NZBZ77DXTEXLEFQTD5K","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":"c53b1dcbb61523e2c7809da1c88ebc389acddaaa8848ca558b0e0aca15ce0a99","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-06T22:21:59Z","title_canon_sha256":"3b9e86667fbcad320e94cbf86873bb3e1988e6111af3131b0c5318bbe05b563f"},"schema_version":"1.0","source":{"id":"1504.01431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01431","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01431v2","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01431","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"5ZIEHW2NZBZ7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZIEHW2NZBZ77DXT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZIEHW2N","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:57eefab4816f21590aa1ef744c63cda6cad90b296e7359d0a0c15695c8670d11","target":"graph","created_at":"2026-05-18T01:27:46Z","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"},"paper":{"abstract_excerpt":"The CFG recognition problem is: given a context-free grammar $\\mathcal{G}$ and a string $w$ of length $n$, decide if $w$ can be obtained from $\\mathcal{G}$. This is the most basic parsing question and is a core computer science problem. Valiant's parser from 1975 solves the problem in $O(n^{\\omega})$ time, where $\\omega<2.373$ is the matrix multiplication exponent. Dozens of parsing algorithms have been proposed over the years, yet Valiant's upper bound remains unbeaten. The best combinatorial algorithms have mildly subcubic $O(n^3/\\log^3{n})$ complexity.\n  Lee (JACM'01) provided evidence that","authors_text":"Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-06T22:21:59Z","title":"If the Current Clique Algorithms are Optimal, so is Valiant's Parser"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01431","kind":"arxiv","version":2},"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:1816918661f139071eb5fef10d1c7317373a53c85f0e4100fd584b22d6fb9749","target":"record","created_at":"2026-05-18T01:27:46Z","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":"c53b1dcbb61523e2c7809da1c88ebc389acddaaa8848ca558b0e0aca15ce0a99","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-06T22:21:59Z","title_canon_sha256":"3b9e86667fbcad320e94cbf86873bb3e1988e6111af3131b0c5318bbe05b563f"},"schema_version":"1.0","source":{"id":"1504.01431","kind":"arxiv","version":2}},"canonical_sha256":"ee5043db4dc873ff8ef325d642c263eab68044f0948715d1820f10fbe2901f03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee5043db4dc873ff8ef325d642c263eab68044f0948715d1820f10fbe2901f03","first_computed_at":"2026-05-18T01:27:46.181856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:46.181856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/aL5RWOR5y7mP2Ni9u8uw7rOOkR1OtaEcQW3MfvKj0PAO0uTyDoVllpPKwH23+4Pkommn43Eelj9T/UHTiEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:46.182446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1816918661f139071eb5fef10d1c7317373a53c85f0e4100fd584b22d6fb9749","sha256:57eefab4816f21590aa1ef744c63cda6cad90b296e7359d0a0c15695c8670d11"],"state_sha256":"d82e063a1fa922d4a1bcadff4c84760079a2bc784f0976e66fc7518f94665803"}