{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ROVPG4EJWCLIJV7EAS6EIXDLHM","short_pith_number":"pith:ROVPG4EJ","canonical_record":{"source":{"id":"1702.06594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2017-02-21T21:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"3c2434874ce9e1ba99e4993268570dc23af769502c18589e55158302d43b3862","abstract_canon_sha256":"522a10a7eb277313eb7c8b97394b2d14cf5049ee9d1028842baa8c3bcdb72f52"},"schema_version":"1.0"},"canonical_sha256":"8baaf37089b09684d7e404bc445c6b3b09644e054c812088d985a2dfe10d836e","source":{"kind":"arxiv","id":"1702.06594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06594","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06594v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06594","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"ROVPG4EJWCLI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"ROVPG4EJWCLIJV7E","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"ROVPG4EJ","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ROVPG4EJWCLIJV7EAS6EIXDLHM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2017-02-21T21:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"3c2434874ce9e1ba99e4993268570dc23af769502c18589e55158302d43b3862","abstract_canon_sha256":"522a10a7eb277313eb7c8b97394b2d14cf5049ee9d1028842baa8c3bcdb72f52"},"schema_version":"1.0"},"canonical_sha256":"8baaf37089b09684d7e404bc445c6b3b09644e054c812088d985a2dfe10d836e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.824186Z","signature_b64":"sgLxDvNqhVErdMQ8T2tmC3pFdoCPu8Lx++NyTjSEBpXnCGyihStASRRNogcLg8pGvOUw7A5ZnH15KOKDpWb5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8baaf37089b09684d7e404bc445c6b3b09644e054c812088d985a2dfe10d836e","last_reissued_at":"2026-05-18T00:16:50.823555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.823555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06594","source_version":2,"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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofVLx8PVL2GOwGO0aIOzoMpfk+4v1MD8s9pMS3qKu5tg4gc1c6YaHzfod2kp+xYMb416wT/wJf6HrnvNRsGUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:55:27.621963Z"},"content_sha256":"8fa04fba1659ad3cf49640813a26cfb416f4ab40a0e54f3f53fca2bb6c40d336","schema_version":"1.0","event_id":"sha256:8fa04fba1659ad3cf49640813a26cfb416f4ab40a0e54f3f53fca2bb6c40d336"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ROVPG4EJWCLIJV7EAS6EIXDLHM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of CCG Parsing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Giorgio Satta, Marco Kuhlmann, Peter Jonsson","submitted_at":"2017-02-21T21:36:51Z","abstract_excerpt":"We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst case exponential time when the size of the grammar, and not only the length of the input sentence, is included in the analysis. This sets the formalism of Vijay-Shanker and Weir (1994) apart from weakly equivalent formalisms such as Tree-Adjoining Grammar (TAG), for which parsing can be performed in time polynomial in the combined size of grammar and input sentence. Our result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06594","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"},"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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lKGHqbQMULrBsbu6KV8AAc93Z5Q918iSWjfeqhZ7egSPXN89hmq0rZbk2bYplNpIDbTfFs3Ujn/Jmo7e9o8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:55:27.622326Z"},"content_sha256":"615e9417fd1e5570e39031093d4be74f906ffb7f64f58f619eb63a50ba7370b3","schema_version":"1.0","event_id":"sha256:615e9417fd1e5570e39031093d4be74f906ffb7f64f58f619eb63a50ba7370b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM/bundle.json","state_url":"https://pith.science/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM/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-05-30T08:55:27Z","links":{"resolver":"https://pith.science/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM","bundle":"https://pith.science/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM/bundle.json","state":"https://pith.science/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROVPG4EJWCLIJV7EAS6EIXDLHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ROVPG4EJWCLIJV7EAS6EIXDLHM","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":"522a10a7eb277313eb7c8b97394b2d14cf5049ee9d1028842baa8c3bcdb72f52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2017-02-21T21:36:51Z","title_canon_sha256":"3c2434874ce9e1ba99e4993268570dc23af769502c18589e55158302d43b3862"},"schema_version":"1.0","source":{"id":"1702.06594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06594","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06594v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06594","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"ROVPG4EJWCLI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"ROVPG4EJWCLIJV7E","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"ROVPG4EJ","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:615e9417fd1e5570e39031093d4be74f906ffb7f64f58f619eb63a50ba7370b3","target":"graph","created_at":"2026-05-18T00:16:50Z","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":"We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst case exponential time when the size of the grammar, and not only the length of the input sentence, is included in the analysis. This sets the formalism of Vijay-Shanker and Weir (1994) apart from weakly equivalent formalisms such as Tree-Adjoining Grammar (TAG), for which parsing can be performed in time polynomial in the combined size of grammar and input sentence. Our result","authors_text":"Giorgio Satta, Marco Kuhlmann, Peter Jonsson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2017-02-21T21:36:51Z","title":"On the Complexity of CCG Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06594","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:8fa04fba1659ad3cf49640813a26cfb416f4ab40a0e54f3f53fca2bb6c40d336","target":"record","created_at":"2026-05-18T00:16:50Z","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":"522a10a7eb277313eb7c8b97394b2d14cf5049ee9d1028842baa8c3bcdb72f52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2017-02-21T21:36:51Z","title_canon_sha256":"3c2434874ce9e1ba99e4993268570dc23af769502c18589e55158302d43b3862"},"schema_version":"1.0","source":{"id":"1702.06594","kind":"arxiv","version":2}},"canonical_sha256":"8baaf37089b09684d7e404bc445c6b3b09644e054c812088d985a2dfe10d836e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8baaf37089b09684d7e404bc445c6b3b09644e054c812088d985a2dfe10d836e","first_computed_at":"2026-05-18T00:16:50.823555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:50.823555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sgLxDvNqhVErdMQ8T2tmC3pFdoCPu8Lx++NyTjSEBpXnCGyihStASRRNogcLg8pGvOUw7A5ZnH15KOKDpWb5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:50.824186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fa04fba1659ad3cf49640813a26cfb416f4ab40a0e54f3f53fca2bb6c40d336","sha256:615e9417fd1e5570e39031093d4be74f906ffb7f64f58f619eb63a50ba7370b3"],"state_sha256":"d1538a9da58c5762d99b0d93a650013ebbe211f161ba6cf77fa545d1d33e23a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BPch6SuqTzhx4zW8fbtehOyvKBtQwyR7FfbwWiSUjx7D2BAzWaPAzfjG5il5XbzEWqB1TicbESa0VmAMef7+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:55:27.624787Z","bundle_sha256":"876d1e1f1679fca6f72db69417dbb79e73bda22dbbb4da2089a10e0538404b79"}}