{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MRPDUBIX3A6ASRPQQI676GGNWS","short_pith_number":"pith:MRPDUBIX","schema_version":"1.0","canonical_sha256":"645e3a0517d83c0945f0823dff18cdb4a426aa3c3be5af0762c09468d15d4014","source":{"kind":"arxiv","id":"1211.5256","version":2},"attestation_state":"computed","paper":{"title":"Model Checking Parse Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anudhyan Boral, Sylvain Schmitz","submitted_at":"2012-11-22T11:04:11Z","abstract_excerpt":"Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward the adequacy of propositional dynamic logic (PDL) on trees in these applications, and study as a sanity check the complexity of the corresponding model-checking problem: although complete for exponential time in the general case, we find natural restrictions on grammars for our applications and establish complex"},"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":"1211.5256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-22T11:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"88f3a1e10d3101fa812bffa0b1d2ecfc90fdadac356dc6f9ba7ec9fd59cea66d","abstract_canon_sha256":"3481f54902b728b07ac6bd6302fe0e7d926efb73dfc4d0846462c8a1bd3c38db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:20.927247Z","signature_b64":"UzPee92aHf1pO1qLwc092IRQZ63kQrtQp8cLzfa0wjweUI9EAPFoJTSmuaRP+rHfrx1g5T/idpKW99aOrCnODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645e3a0517d83c0945f0823dff18cdb4a426aa3c3be5af0762c09468d15d4014","last_reissued_at":"2026-05-18T03:15:20.926666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:20.926666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking Parse Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anudhyan Boral, Sylvain Schmitz","submitted_at":"2012-11-22T11:04:11Z","abstract_excerpt":"Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward the adequacy of propositional dynamic logic (PDL) on trees in these applications, and study as a sanity check the complexity of the corresponding model-checking problem: although complete for exponential time in the general case, we find natural restrictions on grammars for our applications and establish complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5256","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":"1211.5256","created_at":"2026-05-18T03:15:20.926766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5256v2","created_at":"2026-05-18T03:15:20.926766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5256","created_at":"2026-05-18T03:15:20.926766+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRPDUBIX3A6A","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRPDUBIX3A6ASRPQ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRPDUBIX","created_at":"2026-05-18T12:27:14.488303+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/MRPDUBIX3A6ASRPQQI676GGNWS","json":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS.json","graph_json":"https://pith.science/api/pith-number/MRPDUBIX3A6ASRPQQI676GGNWS/graph.json","events_json":"https://pith.science/api/pith-number/MRPDUBIX3A6ASRPQQI676GGNWS/events.json","paper":"https://pith.science/paper/MRPDUBIX"},"agent_actions":{"view_html":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS","download_json":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS.json","view_paper":"https://pith.science/paper/MRPDUBIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5256&json=true","fetch_graph":"https://pith.science/api/pith-number/MRPDUBIX3A6ASRPQQI676GGNWS/graph.json","fetch_events":"https://pith.science/api/pith-number/MRPDUBIX3A6ASRPQQI676GGNWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS/action/storage_attestation","attest_author":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS/action/author_attestation","sign_citation":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS/action/citation_signature","submit_replication":"https://pith.science/pith/MRPDUBIX3A6ASRPQQI676GGNWS/action/replication_record"}},"created_at":"2026-05-18T03:15:20.926766+00:00","updated_at":"2026-05-18T03:15:20.926766+00:00"}