{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SU5HIEDI3O7O6XGTWWPTVNC6FK","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":"b7df774f507d72886fbe77cde5b58b7a1d887b67fa987eb3c4755ded93e67794","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:56:49Z","title_canon_sha256":"7c22e1b5e9aaf4f7e0d6b3f262bb93fd8ff50c8ec2c84c5213f9120f7f9302c2"},"schema_version":"1.0","source":{"id":"1803.00804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00804","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00804v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00804","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"SU5HIEDI3O7O","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SU5HIEDI3O7O6XGT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SU5HIEDI","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:8b3955b8125393d70c2c34e4150eed85c8e28ba098d210c0ca4ecfadcb18a35a","target":"graph","created_at":"2026-05-18T00:22:07Z","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":"Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar $\\Gamma$ and a string $s$ of length $n$, the task is to decide whether $s$ can be obtained from $\\Gamma$. Rajasekaran and Yooseph's parser (JCSS'98) solves this problem in time $O(n^{2\\omega})$, where $\\omega < 2.373$ is the matrix multiplication exponent. The best algorithms avoiding fast matrix multiplication take time $O(n^6)$.\n  The first evidence for hardness","authors_text":"Karl Bringmann, Philip Wellnitz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:56:49Z","title":"Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00804","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:5f28b108c1efe748dbbdfc478399f47f2f20d3cdd27b9ce372d5403055bc99b7","target":"record","created_at":"2026-05-18T00:22:07Z","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":"b7df774f507d72886fbe77cde5b58b7a1d887b67fa987eb3c4755ded93e67794","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:56:49Z","title_canon_sha256":"7c22e1b5e9aaf4f7e0d6b3f262bb93fd8ff50c8ec2c84c5213f9120f7f9302c2"},"schema_version":"1.0","source":{"id":"1803.00804","kind":"arxiv","version":1}},"canonical_sha256":"953a741068dbbeef5cd3b59f3ab45e2aab37bada85b6613bc1cc5ad9be47d659","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"953a741068dbbeef5cd3b59f3ab45e2aab37bada85b6613bc1cc5ad9be47d659","first_computed_at":"2026-05-18T00:22:07.828711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:07.828711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vlwwt5uUE73Z4LSit4UoWDUG5Y9h0Hv5if1shmcPRbH9jrGhGHq4dkgRL/hs2Nff2JZtIApbopstvYX9aOS/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:07.829433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f28b108c1efe748dbbdfc478399f47f2f20d3cdd27b9ce372d5403055bc99b7","sha256:8b3955b8125393d70c2c34e4150eed85c8e28ba098d210c0ca4ecfadcb18a35a"],"state_sha256":"2d48c97358ebfd0ce5dd982cf24668dd0e812f597f294796d2fa5c6d6c92f445"}