{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TNJ62WH6CZ6LXBPQEXKPO6FVXS","short_pith_number":"pith:TNJ62WH6","schema_version":"1.0","canonical_sha256":"9b53ed58fe167cbb85f025d4f778b5bc823569530c9976e04cf0c186e85c2a4d","source":{"kind":"arxiv","id":"1806.04325","version":2},"attestation_state":"computed","paper":{"title":"Augmenting Stream Constraint Programming with Eventuality Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Allen Z. Zhong, Jasper C.H. Lee, Jimmy H.M. Lee","submitted_at":"2018-06-12T04:20:02Z","abstract_excerpt":"Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Previous works showed promising results for its applicability to real-world planning and control problems. In this paper, motivated by the modelling of planning applications, we improve the expressiveness of the framework by introducing 1) the \"until\" constraint, a new construct that is adapted from Linear Temporal Logic and 2) the @ operator on streams, a syntactic sugar for which we provide a more efficient solving a"},"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":"1806.04325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-12T04:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"0ad89641a90daf1bcfc9ec83fad0530c3a75b0722d174c07703371464192e589","abstract_canon_sha256":"4cd1ea6f9dbfd2512753e2c51dcc6fdecf5f6e6ce8cebd67ec5ac832229376ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:48.000924Z","signature_b64":"sNhqmOS8btHEatnekjR19nbcsmKhNoXZJgqYa5lCTeDn3RzHpp5hSGr2PKwnzUt2O5BQXEnm+oxEDdoSsJaTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b53ed58fe167cbb85f025d4f778b5bc823569530c9976e04cf0c186e85c2a4d","last_reissued_at":"2026-05-18T00:08:48.000271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:48.000271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Augmenting Stream Constraint Programming with Eventuality Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Allen Z. Zhong, Jasper C.H. Lee, Jimmy H.M. Lee","submitted_at":"2018-06-12T04:20:02Z","abstract_excerpt":"Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Previous works showed promising results for its applicability to real-world planning and control problems. In this paper, motivated by the modelling of planning applications, we improve the expressiveness of the framework by introducing 1) the \"until\" constraint, a new construct that is adapted from Linear Temporal Logic and 2) the @ operator on streams, a syntactic sugar for which we provide a more efficient solving a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04325","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":"1806.04325","created_at":"2026-05-18T00:08:48.000383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04325v2","created_at":"2026-05-18T00:08:48.000383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04325","created_at":"2026-05-18T00:08:48.000383+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNJ62WH6CZ6L","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNJ62WH6CZ6LXBPQ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNJ62WH6","created_at":"2026-05-18T12:32:53.628368+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/TNJ62WH6CZ6LXBPQEXKPO6FVXS","json":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS.json","graph_json":"https://pith.science/api/pith-number/TNJ62WH6CZ6LXBPQEXKPO6FVXS/graph.json","events_json":"https://pith.science/api/pith-number/TNJ62WH6CZ6LXBPQEXKPO6FVXS/events.json","paper":"https://pith.science/paper/TNJ62WH6"},"agent_actions":{"view_html":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS","download_json":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS.json","view_paper":"https://pith.science/paper/TNJ62WH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04325&json=true","fetch_graph":"https://pith.science/api/pith-number/TNJ62WH6CZ6LXBPQEXKPO6FVXS/graph.json","fetch_events":"https://pith.science/api/pith-number/TNJ62WH6CZ6LXBPQEXKPO6FVXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS/action/storage_attestation","attest_author":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS/action/author_attestation","sign_citation":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS/action/citation_signature","submit_replication":"https://pith.science/pith/TNJ62WH6CZ6LXBPQEXKPO6FVXS/action/replication_record"}},"created_at":"2026-05-18T00:08:48.000383+00:00","updated_at":"2026-05-18T00:08:48.000383+00:00"}