{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3D6KOVFHHNCI4YNZQJQHWAEGPW","short_pith_number":"pith:3D6KOVFH","schema_version":"1.0","canonical_sha256":"d8fca754a73b448e61b982607b00867da07c67f9b0f13f8a6395706d7167c461","source":{"kind":"arxiv","id":"1403.0461","version":2},"attestation_state":"computed","paper":{"title":"Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Francesco Santini, Maria Chiara Meo, Maurizio Gabbrielli, Stefano Bistarelli","submitted_at":"2014-02-24T12:23:38Z","abstract_excerpt":"We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tell and ask agents are now equipped with a preference (or consistency) threshold which is used to determine their success or suspension. In the paper we provide a language to describe the agents 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":"1403.0461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-02-24T12:23:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"997ce06e91cd244aa6c1413f49b74af03e1fd625c488fe28b2944f6ab6d461a3","abstract_canon_sha256":"84470397dfb2e513aff20850c3f1ed92c142eb4adf7e57416c44063ef28da898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:56.128252Z","signature_b64":"1V9vl5Tz9tUwc/CnE9+eO5AhUEbUb5/CfPGam0TxuTceGi2t13CsEDpF2ehWhUWPdrR8CA630tasbcPqPjOKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8fca754a73b448e61b982607b00867da07c67f9b0f13f8a6395706d7167c461","last_reissued_at":"2026-05-18T01:30:56.127770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:56.127770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Francesco Santini, Maria Chiara Meo, Maurizio Gabbrielli, Stefano Bistarelli","submitted_at":"2014-02-24T12:23:38Z","abstract_excerpt":"We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tell and ask agents are now equipped with a preference (or consistency) threshold which is used to determine their success or suspension. In the paper we provide a language to describe the agents b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0461","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":"1403.0461","created_at":"2026-05-18T01:30:56.127862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0461v2","created_at":"2026-05-18T01:30:56.127862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0461","created_at":"2026-05-18T01:30:56.127862+00:00"},{"alias_kind":"pith_short_12","alias_value":"3D6KOVFHHNCI","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3D6KOVFHHNCI4YNZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3D6KOVFH","created_at":"2026-05-18T12:28:11.866339+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/3D6KOVFHHNCI4YNZQJQHWAEGPW","json":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW.json","graph_json":"https://pith.science/api/pith-number/3D6KOVFHHNCI4YNZQJQHWAEGPW/graph.json","events_json":"https://pith.science/api/pith-number/3D6KOVFHHNCI4YNZQJQHWAEGPW/events.json","paper":"https://pith.science/paper/3D6KOVFH"},"agent_actions":{"view_html":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW","download_json":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW.json","view_paper":"https://pith.science/paper/3D6KOVFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0461&json=true","fetch_graph":"https://pith.science/api/pith-number/3D6KOVFHHNCI4YNZQJQHWAEGPW/graph.json","fetch_events":"https://pith.science/api/pith-number/3D6KOVFHHNCI4YNZQJQHWAEGPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW/action/storage_attestation","attest_author":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW/action/author_attestation","sign_citation":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW/action/citation_signature","submit_replication":"https://pith.science/pith/3D6KOVFHHNCI4YNZQJQHWAEGPW/action/replication_record"}},"created_at":"2026-05-18T01:30:56.127862+00:00","updated_at":"2026-05-18T01:30:56.127862+00:00"}