{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NJF73NXHX76LXRJRQVBGYKRQIP","short_pith_number":"pith:NJF73NXH","canonical_record":{"source":{"id":"1408.2466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-07-15T02:20:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"48ef464f92c7be0a8311d4b6be398af670e1fa009523079417926226c855096d","abstract_canon_sha256":"57862f570d083efadceee4d700a8c9b09e41656f109c302edb947a81502127e0"},"schema_version":"1.0"},"canonical_sha256":"6a4bfdb6e7bffcbbc53185426c2a3043eb840d7ede192ec0b3084242a6e68503","source":{"kind":"arxiv","id":"1408.2466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2466","created_at":"2026-05-18T02:45:29Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2466v1","created_at":"2026-05-18T02:45:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2466","created_at":"2026-05-18T02:45:29Z"},{"alias_kind":"pith_short_12","alias_value":"NJF73NXHX76L","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NJF73NXHX76LXRJR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NJF73NXH","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NJF73NXHX76LXRJRQVBGYKRQIP","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-07-15T02:20:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"48ef464f92c7be0a8311d4b6be398af670e1fa009523079417926226c855096d","abstract_canon_sha256":"57862f570d083efadceee4d700a8c9b09e41656f109c302edb947a81502127e0"},"schema_version":"1.0"},"canonical_sha256":"6a4bfdb6e7bffcbbc53185426c2a3043eb840d7ede192ec0b3084242a6e68503","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:29.302507Z","signature_b64":"M6ybjNe8Aq5w9l45rBJzaSv68hKtbUK0Ox1WaeoJXliaXw3vgVq4F+4P75guRrheFDcmxYxObxDzxC07OMN2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a4bfdb6e7bffcbbc53185426c2a3043eb840d7ede192ec0b3084242a6e68503","last_reissued_at":"2026-05-18T02:45:29.301914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:29.301914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2466","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-18T02:45:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//48EpY0mVPtc0I3gFC0lIdaX+3neHcAJX/hBAmiaBCvURHVu5ERTjm64dVUtyWQtmYnSkLDz/Rz76t0jLdJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:32:50.728345Z"},"content_sha256":"7208a042a65486bc30b6e9460a99c4b2543122daa920281b3313f5383d5c00f0","schema_version":"1.0","event_id":"sha256:7208a042a65486bc30b6e9460a99c4b2543122daa920281b3313f5383d5c00f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NJF73NXHX76LXRJRQVBGYKRQIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Controlled Natural Language Processing as Answer Set Programming: an Experiment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Rolf Schwitter","submitted_at":"2014-07-15T02:20:23Z","abstract_excerpt":"Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that relies on different software components. We investigate in this paper in an experimental way how well answer set programming (ASP) is suited as a unifying framework for parsing a CNL, deriving a formal representation for the resulting syntax trees, and for reasoning with that representation. We start from a list of input tokens in ASP notation and show how this input can be transformed into a syntax tree using an ASP grammar and then into reified ASP rules in form of a set of facts. These facts"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2466","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-18T02:45:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nS+B6OmRARp1GI6PF3ShhiTmtGGAaLF7oTwPCUQ0niLfLWj3C5gzMKcuuTx4ada6J8oU12najDkHjy6XViafAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:32:50.728702Z"},"content_sha256":"d233d42f08153bb9838132a49dc67ecc14bc9c4729fc796467266d272cf859ed","schema_version":"1.0","event_id":"sha256:d233d42f08153bb9838132a49dc67ecc14bc9c4729fc796467266d272cf859ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJF73NXHX76LXRJRQVBGYKRQIP/bundle.json","state_url":"https://pith.science/pith/NJF73NXHX76LXRJRQVBGYKRQIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJF73NXHX76LXRJRQVBGYKRQIP/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-28T11:32:50Z","links":{"resolver":"https://pith.science/pith/NJF73NXHX76LXRJRQVBGYKRQIP","bundle":"https://pith.science/pith/NJF73NXHX76LXRJRQVBGYKRQIP/bundle.json","state":"https://pith.science/pith/NJF73NXHX76LXRJRQVBGYKRQIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJF73NXHX76LXRJRQVBGYKRQIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NJF73NXHX76LXRJRQVBGYKRQIP","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":"57862f570d083efadceee4d700a8c9b09e41656f109c302edb947a81502127e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-07-15T02:20:23Z","title_canon_sha256":"48ef464f92c7be0a8311d4b6be398af670e1fa009523079417926226c855096d"},"schema_version":"1.0","source":{"id":"1408.2466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2466","created_at":"2026-05-18T02:45:29Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2466v1","created_at":"2026-05-18T02:45:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2466","created_at":"2026-05-18T02:45:29Z"},{"alias_kind":"pith_short_12","alias_value":"NJF73NXHX76L","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NJF73NXHX76LXRJR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NJF73NXH","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d233d42f08153bb9838132a49dc67ecc14bc9c4729fc796467266d272cf859ed","target":"graph","created_at":"2026-05-18T02:45:29Z","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":"Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that relies on different software components. We investigate in this paper in an experimental way how well answer set programming (ASP) is suited as a unifying framework for parsing a CNL, deriving a formal representation for the resulting syntax trees, and for reasoning with that representation. We start from a list of input tokens in ASP notation and show how this input can be transformed into a syntax tree using an ASP grammar and then into reified ASP rules in form of a set of facts. These facts","authors_text":"Rolf Schwitter","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-07-15T02:20:23Z","title":"Controlled Natural Language Processing as Answer Set Programming: an Experiment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2466","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:7208a042a65486bc30b6e9460a99c4b2543122daa920281b3313f5383d5c00f0","target":"record","created_at":"2026-05-18T02:45:29Z","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":"57862f570d083efadceee4d700a8c9b09e41656f109c302edb947a81502127e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-07-15T02:20:23Z","title_canon_sha256":"48ef464f92c7be0a8311d4b6be398af670e1fa009523079417926226c855096d"},"schema_version":"1.0","source":{"id":"1408.2466","kind":"arxiv","version":1}},"canonical_sha256":"6a4bfdb6e7bffcbbc53185426c2a3043eb840d7ede192ec0b3084242a6e68503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a4bfdb6e7bffcbbc53185426c2a3043eb840d7ede192ec0b3084242a6e68503","first_computed_at":"2026-05-18T02:45:29.301914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:29.301914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M6ybjNe8Aq5w9l45rBJzaSv68hKtbUK0Ox1WaeoJXliaXw3vgVq4F+4P75guRrheFDcmxYxObxDzxC07OMN2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:29.302507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7208a042a65486bc30b6e9460a99c4b2543122daa920281b3313f5383d5c00f0","sha256:d233d42f08153bb9838132a49dc67ecc14bc9c4729fc796467266d272cf859ed"],"state_sha256":"cc3a5f9021c91528f8066f449f504836beab4fe2901bcd73e8a694fdb080ee08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/39C/UP4xFEWNxg2QyTXe5WcVqHWzHZOCu4uX75MvlBNgjIs72TTncuMma+JzUibhwPwrnRFgqRZrnRCVGUIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:32:50.730673Z","bundle_sha256":"22cb2718174253527456c5a37bc25e5957395f4e3e442d0ac406b85a976d521f"}}