{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:7WR5YBJL2MANEUSX3XC4DVBZ3B","short_pith_number":"pith:7WR5YBJL","schema_version":"1.0","canonical_sha256":"fda3dc052bd300d25257ddc5c1d439d849192ad4802e753e3dd80dd607c8ca5e","source":{"kind":"arxiv","id":"cmp-lg/9502017","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Consistency Checking of LP Constraints","license":"","headline":"","cross_cats":["cs.CL"],"primary_cat":"cmp-lg","authors_text":"Suresh Manandhar","submitted_at":"1995-02-14T16:53:49Z","abstract_excerpt":"We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order."},"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":"cmp-lg/9502017","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cmp-lg","submitted_at":"1995-02-14T16:53:49Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"73974f6d1532d8af30bed535cfe37b5003b35c0ad5fe92dce47d1dda0fc1fd4b","abstract_canon_sha256":"3ffb534c6c726664198b874d3cd5be80520aa48a5420fc3d637763377d0a78c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:24.151819Z","signature_b64":"KqqnyRMjVwf+/Ddb0gzvdBZOvh+536Yrzbe1tCSzPs6yMaEQAZ0+WtjwPpPFlOrENe/lV3wykfHjkVx04Zx3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda3dc052bd300d25257ddc5c1d439d849192ad4802e753e3dd80dd607c8ca5e","last_reissued_at":"2026-05-18T01:07:24.151361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:24.151361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Consistency Checking of LP Constraints","license":"","headline":"","cross_cats":["cs.CL"],"primary_cat":"cmp-lg","authors_text":"Suresh Manandhar","submitted_at":"1995-02-14T16:53:49Z","abstract_excerpt":"We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cmp-lg/9502017","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":"cmp-lg/9502017","created_at":"2026-05-18T01:07:24.151437+00:00"},{"alias_kind":"arxiv_version","alias_value":"cmp-lg/9502017v2","created_at":"2026-05-18T01:07:24.151437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cmp-lg/9502017","created_at":"2026-05-18T01:07:24.151437+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WR5YBJL2MAN","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WR5YBJL2MANEUSX","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WR5YBJL","created_at":"2026-05-18T12:25:47.700082+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/7WR5YBJL2MANEUSX3XC4DVBZ3B","json":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B.json","graph_json":"https://pith.science/api/pith-number/7WR5YBJL2MANEUSX3XC4DVBZ3B/graph.json","events_json":"https://pith.science/api/pith-number/7WR5YBJL2MANEUSX3XC4DVBZ3B/events.json","paper":"https://pith.science/paper/7WR5YBJL"},"agent_actions":{"view_html":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B","download_json":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B.json","view_paper":"https://pith.science/paper/7WR5YBJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cmp-lg/9502017&json=true","fetch_graph":"https://pith.science/api/pith-number/7WR5YBJL2MANEUSX3XC4DVBZ3B/graph.json","fetch_events":"https://pith.science/api/pith-number/7WR5YBJL2MANEUSX3XC4DVBZ3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B/action/storage_attestation","attest_author":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B/action/author_attestation","sign_citation":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B/action/citation_signature","submit_replication":"https://pith.science/pith/7WR5YBJL2MANEUSX3XC4DVBZ3B/action/replication_record"}},"created_at":"2026-05-18T01:07:24.151437+00:00","updated_at":"2026-05-18T01:07:24.151437+00:00"}