{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SU5HIEDI3O7O6XGTWWPTVNC6FK","short_pith_number":"pith:SU5HIEDI","canonical_record":{"source":{"id":"1803.00804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:56:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7c22e1b5e9aaf4f7e0d6b3f262bb93fd8ff50c8ec2c84c5213f9120f7f9302c2","abstract_canon_sha256":"b7df774f507d72886fbe77cde5b58b7a1d887b67fa987eb3c4755ded93e67794"},"schema_version":"1.0"},"canonical_sha256":"953a741068dbbeef5cd3b59f3ab45e2aab37bada85b6613bc1cc5ad9be47d659","source":{"kind":"arxiv","id":"1803.00804","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SU5HIEDI3O7O6XGTWWPTVNC6FK","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:56:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7c22e1b5e9aaf4f7e0d6b3f262bb93fd8ff50c8ec2c84c5213f9120f7f9302c2","abstract_canon_sha256":"b7df774f507d72886fbe77cde5b58b7a1d887b67fa987eb3c4755ded93e67794"},"schema_version":"1.0"},"canonical_sha256":"953a741068dbbeef5cd3b59f3ab45e2aab37bada85b6613bc1cc5ad9be47d659","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:07.829433Z","signature_b64":"Vlwwt5uUE73Z4LSit4UoWDUG5Y9h0Hv5if1shmcPRbH9jrGhGHq4dkgRL/hs2Nff2JZtIApbopstvYX9aOS/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"953a741068dbbeef5cd3b59f3ab45e2aab37bada85b6613bc1cc5ad9be47d659","last_reissued_at":"2026-05-18T00:22:07.828711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:07.828711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00804","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjjjANgApY63R1e6SzgEHmJctRjc1m+pfIR1WG7yFyBWtpgYM9TiicbwrDa15pxqNJM9t1wU6GIAp3HSDvhBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:53:29.371148Z"},"content_sha256":"5f28b108c1efe748dbbdfc478399f47f2f20d3cdd27b9ce372d5403055bc99b7","schema_version":"1.0","event_id":"sha256:5f28b108c1efe748dbbdfc478399f47f2f20d3cdd27b9ce372d5403055bc99b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SU5HIEDI3O7O6XGTWWPTVNC6FK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Karl Bringmann, Philip Wellnitz","submitted_at":"2018-03-02T10:56:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00804","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dty4Xdy6cwoV1+X86kTq638pVrsmOpQwj6wXvdvvCk1lZ5Lpa/hPzWyPCt1Xa/fSrv0t94+5WLUGcr8/iDJNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:53:29.371527Z"},"content_sha256":"8b3955b8125393d70c2c34e4150eed85c8e28ba098d210c0ca4ecfadcb18a35a","schema_version":"1.0","event_id":"sha256:8b3955b8125393d70c2c34e4150eed85c8e28ba098d210c0ca4ecfadcb18a35a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK/bundle.json","state_url":"https://pith.science/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T00:53:29Z","links":{"resolver":"https://pith.science/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK","bundle":"https://pith.science/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK/bundle.json","state":"https://pith.science/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU5HIEDI3O7O6XGTWWPTVNC6FK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOpDI2R94SLYCPH1FFnSbmqoSjdebQY8BLlVSy94F8su4LxFlT2xxxu12M9BvRRehdmgnkonoUCV9lFtQDiqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T00:53:29.373463Z","bundle_sha256":"0eede357cec056eb786613ede49f5737d3380c117636d34b736ff2ed7aaea389"}}