{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TRL2P7Q6NCN3AYZCR3G5E2LXNJ","short_pith_number":"pith:TRL2P7Q6","schema_version":"1.0","canonical_sha256":"9c57a7fe1e689bb063228ecdd269776a6abd79f5f5a7a01e197fb9986d8f24f4","source":{"kind":"arxiv","id":"1405.2538","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Search With Picat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Neng-Fa Zhou","submitted_at":"2014-05-11T14:45:07Z","abstract_excerpt":"Picat, a new member of the logic programming family, follows a different doctrine than Prolog in offering the core logic programming concepts: arrays and maps as built-in data types; implicit pattern matching with explicit unification and explicit non-determinism; functions for deterministic computations; and loops for convenient scripting and modeling purposes. Picat provides facilities for solving combinatorial search problems, including a common interface with CP, SAT, and MIP solvers, tabling for dynamic programming, and a module for planning. Picat's planner module, which is implemented b"},"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":"1405.2538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-05-11T14:45:07Z","cross_cats_sorted":[],"title_canon_sha256":"4fd7c33f7a0682181d413bf409a821d91818d593dc5d2f5fa93a1fd6ec2c78c1","abstract_canon_sha256":"3b33c1820343a25188d6f20dd67ecb2ac0e442b595313ce7aef9249b6ca7e688"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:05.295703Z","signature_b64":"P7+f5kR0I6W4eBzIZ2LfofbRXxhGcI3tFSys0XPynGYnU6NFQhDOhDasn0isWhOTFPaDG8d7PIQgEwIN4mgPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c57a7fe1e689bb063228ecdd269776a6abd79f5f5a7a01e197fb9986d8f24f4","last_reissued_at":"2026-05-18T02:52:05.295267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:05.295267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Search With Picat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Neng-Fa Zhou","submitted_at":"2014-05-11T14:45:07Z","abstract_excerpt":"Picat, a new member of the logic programming family, follows a different doctrine than Prolog in offering the core logic programming concepts: arrays and maps as built-in data types; implicit pattern matching with explicit unification and explicit non-determinism; functions for deterministic computations; and loops for convenient scripting and modeling purposes. Picat provides facilities for solving combinatorial search problems, including a common interface with CP, SAT, and MIP solvers, tabling for dynamic programming, and a module for planning. Picat's planner module, which is implemented b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2538","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.2538","created_at":"2026-05-18T02:52:05.295344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2538v1","created_at":"2026-05-18T02:52:05.295344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2538","created_at":"2026-05-18T02:52:05.295344+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRL2P7Q6NCN3","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRL2P7Q6NCN3AYZC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRL2P7Q6","created_at":"2026-05-18T12:28:49.207871+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/TRL2P7Q6NCN3AYZCR3G5E2LXNJ","json":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ.json","graph_json":"https://pith.science/api/pith-number/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/graph.json","events_json":"https://pith.science/api/pith-number/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/events.json","paper":"https://pith.science/paper/TRL2P7Q6"},"agent_actions":{"view_html":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ","download_json":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ.json","view_paper":"https://pith.science/paper/TRL2P7Q6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2538&json=true","fetch_graph":"https://pith.science/api/pith-number/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/action/storage_attestation","attest_author":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/action/author_attestation","sign_citation":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/action/citation_signature","submit_replication":"https://pith.science/pith/TRL2P7Q6NCN3AYZCR3G5E2LXNJ/action/replication_record"}},"created_at":"2026-05-18T02:52:05.295344+00:00","updated_at":"2026-05-18T02:52:05.295344+00:00"}