{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FVBRCJEV47GXSL4YGEWMORITE4","short_pith_number":"pith:FVBRCJEV","canonical_record":{"source":{"id":"1707.03457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-11T20:48:57Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ac606d575332575ed95607f49bccc61cd2f11659090943958d95d6823b0a9e8b","abstract_canon_sha256":"d8955f5c5821113f3afcc473ce1b589705507572182957808d9e15bcb346e5f8"},"schema_version":"1.0"},"canonical_sha256":"2d43112495e7cd792f98312cc74513272245771ed5909545c002826195efc96c","source":{"kind":"arxiv","id":"1707.03457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03457","created_at":"2026-05-18T00:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03457v1","created_at":"2026-05-18T00:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03457","created_at":"2026-05-18T00:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"FVBRCJEV47GX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVBRCJEV47GXSL4Y","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVBRCJEV","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FVBRCJEV47GXSL4YGEWMORITE4","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-11T20:48:57Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ac606d575332575ed95607f49bccc61cd2f11659090943958d95d6823b0a9e8b","abstract_canon_sha256":"d8955f5c5821113f3afcc473ce1b589705507572182957808d9e15bcb346e5f8"},"schema_version":"1.0"},"canonical_sha256":"2d43112495e7cd792f98312cc74513272245771ed5909545c002826195efc96c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:25.973478Z","signature_b64":"ZapmCuiVqRWn57IEbeJzuyYO1GKxVW1Z7DAovmCAfvv2TsfBfPMqIfBgGdkCz4s09Kp1iE1+16qqrrQEZDL6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d43112495e7cd792f98312cc74513272245771ed5909545c002826195efc96c","last_reissued_at":"2026-05-18T00:40:25.972745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:25.972745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03457","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:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHQp0tS/wcn/4FC37WtIHU1QawH4vJUN9SKzWE1BG1kP/mHRiS7luuwC9UilgWV9Xi4Q55CmShtgl9doeoGyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:38:49.103433Z"},"content_sha256":"176426f152100cc0aecb08e8331a21d233b21c76a82d38410dd101d020c2aec5","schema_version":"1.0","event_id":"sha256:176426f152100cc0aecb08e8331a21d233b21c76a82d38410dd101d020c2aec5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FVBRCJEV47GXSL4YGEWMORITE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Context-Free Tree Grammars: Lexicalization and Characterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.FL","authors_text":"Andreas Maletti, Joost Engelfriet, Sebastian Maneth","submitted_at":"2017-07-11T20:48:57Z","abstract_excerpt":"Multiple (simple) context-free tree grammars are investigated, where \"simple\" means \"linear and nondeleting\". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol. Due to this transformation, the rank of the nonterminals increases at most by 1, and the multiplicity (or fan-out) of the grammar increases at most by the maximal rank of the lexical symbols; in particular, the multiplicity does not increase when all lex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03457","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:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YJzsR0CA2dsS2yISg3QWoxPAAWWGq+EqnHh8qe7x5b1rUB0zuNLCyzMbt73+qECvJtHyYneS4z0pAbs8FkVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:38:49.104202Z"},"content_sha256":"9af1b4d74bb3b1b0a021507c254fb12ad37d605120a50a25c67cf6ec8162fdab","schema_version":"1.0","event_id":"sha256:9af1b4d74bb3b1b0a021507c254fb12ad37d605120a50a25c67cf6ec8162fdab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVBRCJEV47GXSL4YGEWMORITE4/bundle.json","state_url":"https://pith.science/pith/FVBRCJEV47GXSL4YGEWMORITE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVBRCJEV47GXSL4YGEWMORITE4/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-06-09T03:38:49Z","links":{"resolver":"https://pith.science/pith/FVBRCJEV47GXSL4YGEWMORITE4","bundle":"https://pith.science/pith/FVBRCJEV47GXSL4YGEWMORITE4/bundle.json","state":"https://pith.science/pith/FVBRCJEV47GXSL4YGEWMORITE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVBRCJEV47GXSL4YGEWMORITE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FVBRCJEV47GXSL4YGEWMORITE4","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":"d8955f5c5821113f3afcc473ce1b589705507572182957808d9e15bcb346e5f8","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-11T20:48:57Z","title_canon_sha256":"ac606d575332575ed95607f49bccc61cd2f11659090943958d95d6823b0a9e8b"},"schema_version":"1.0","source":{"id":"1707.03457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03457","created_at":"2026-05-18T00:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03457v1","created_at":"2026-05-18T00:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03457","created_at":"2026-05-18T00:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"FVBRCJEV47GX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVBRCJEV47GXSL4Y","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVBRCJEV","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:9af1b4d74bb3b1b0a021507c254fb12ad37d605120a50a25c67cf6ec8162fdab","target":"graph","created_at":"2026-05-18T00:40:25Z","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":"Multiple (simple) context-free tree grammars are investigated, where \"simple\" means \"linear and nondeleting\". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol. Due to this transformation, the rank of the nonterminals increases at most by 1, and the multiplicity (or fan-out) of the grammar increases at most by the maximal rank of the lexical symbols; in particular, the multiplicity does not increase when all lex","authors_text":"Andreas Maletti, Joost Engelfriet, Sebastian Maneth","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-11T20:48:57Z","title":"Multiple Context-Free Tree Grammars: Lexicalization and Characterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03457","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:176426f152100cc0aecb08e8331a21d233b21c76a82d38410dd101d020c2aec5","target":"record","created_at":"2026-05-18T00:40:25Z","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":"d8955f5c5821113f3afcc473ce1b589705507572182957808d9e15bcb346e5f8","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-11T20:48:57Z","title_canon_sha256":"ac606d575332575ed95607f49bccc61cd2f11659090943958d95d6823b0a9e8b"},"schema_version":"1.0","source":{"id":"1707.03457","kind":"arxiv","version":1}},"canonical_sha256":"2d43112495e7cd792f98312cc74513272245771ed5909545c002826195efc96c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d43112495e7cd792f98312cc74513272245771ed5909545c002826195efc96c","first_computed_at":"2026-05-18T00:40:25.972745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:25.972745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZapmCuiVqRWn57IEbeJzuyYO1GKxVW1Z7DAovmCAfvv2TsfBfPMqIfBgGdkCz4s09Kp1iE1+16qqrrQEZDL6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:25.973478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:176426f152100cc0aecb08e8331a21d233b21c76a82d38410dd101d020c2aec5","sha256:9af1b4d74bb3b1b0a021507c254fb12ad37d605120a50a25c67cf6ec8162fdab"],"state_sha256":"0341476bd482df34a81fba8fa52e9861897fd259135c5a89dd6bdaa170f01b37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxsg/HR5ovTamwh0mSXY/n8uyYbRCNHvUgdq2UWcJsZTmCYWU1OW0TV2cCBLxuApqV+LDwvJ7S8LPT6cCWSJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:38:49.108515Z","bundle_sha256":"c5aff10927b639681ed4c60cd2f59b48bd7df07d3e6f0c9f5f75bc8a93fb8e6d"}}