{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5ZIEHW2NZBZ77DXTEXLEFQTD5K","short_pith_number":"pith:5ZIEHW2N","schema_version":"1.0","canonical_sha256":"ee5043db4dc873ff8ef325d642c263eab68044f0948715d1820f10fbe2901f03","source":{"kind":"arxiv","id":"1504.01431","version":2},"attestation_state":"computed","paper":{"title":"If the Current Clique Algorithms are Optimal, so is Valiant's Parser","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams","submitted_at":"2015-04-06T22:21:59Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.01431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-06T22:21:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3b9e86667fbcad320e94cbf86873bb3e1988e6111af3131b0c5318bbe05b563f","abstract_canon_sha256":"c53b1dcbb61523e2c7809da1c88ebc389acddaaa8848ca558b0e0aca15ce0a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:46.182446Z","signature_b64":"4/aL5RWOR5y7mP2Ni9u8uw7rOOkR1OtaEcQW3MfvKj0PAO0uTyDoVllpPKwH23+4Pkommn43Eelj9T/UHTiEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5043db4dc873ff8ef325d642c263eab68044f0948715d1820f10fbe2901f03","last_reissued_at":"2026-05-18T01:27:46.181856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:46.181856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"If the Current Clique Algorithms are Optimal, so is Valiant's Parser","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams","submitted_at":"2015-04-06T22:21:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01431","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.01431","created_at":"2026-05-18T01:27:46.181948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01431v2","created_at":"2026-05-18T01:27:46.181948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01431","created_at":"2026-05-18T01:27:46.181948+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZIEHW2NZBZ7","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZIEHW2NZBZ77DXT","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZIEHW2N","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K","json":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K.json","graph_json":"https://pith.science/api/pith-number/5ZIEHW2NZBZ77DXTEXLEFQTD5K/graph.json","events_json":"https://pith.science/api/pith-number/5ZIEHW2NZBZ77DXTEXLEFQTD5K/events.json","paper":"https://pith.science/paper/5ZIEHW2N"},"agent_actions":{"view_html":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K","download_json":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K.json","view_paper":"https://pith.science/paper/5ZIEHW2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01431&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZIEHW2NZBZ77DXTEXLEFQTD5K/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZIEHW2NZBZ77DXTEXLEFQTD5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K/action/storage_attestation","attest_author":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K/action/author_attestation","sign_citation":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K/action/citation_signature","submit_replication":"https://pith.science/pith/5ZIEHW2NZBZ77DXTEXLEFQTD5K/action/replication_record"}},"created_at":"2026-05-18T01:27:46.181948+00:00","updated_at":"2026-05-18T01:27:46.181948+00:00"}