{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WB3NWOHUBZH7ZNBZ6KBSUHS6XJ","short_pith_number":"pith:WB3NWOHU","schema_version":"1.0","canonical_sha256":"b076db38f40e4ffcb439f2832a1e5eba58792824c0467cc939614c47b6f765f4","source":{"kind":"arxiv","id":"1308.4171","version":1},"attestation_state":"computed","paper":{"title":"Towards an Effective Decision Procedure for LTL formulas with Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alicia Villanueva, Laura Titolo, Marco Comini","submitted_at":"2013-08-19T20:52:31Z","abstract_excerpt":"This paper presents an ongoing work that is part of a more wide-ranging project whose final scope is to define a method to validate LTL formulas w.r.t. a program written in the timed concurrent constraint language tccp, which is a logic concurrent constraint language based on the concurrent constraint paradigm of Saraswat. Some inherent notions to tccp processes are non-determinism, dealing with partial information in states and the monotonic evolution of the information. In order to check an LTL property for a process, our approach is based on the abstract diagnosis technique. The concluding "},"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":"1308.4171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-08-19T20:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"03fd2e76513494222a24b1a9e42303ab4e7ff72350a46054d675ee4e38307460","abstract_canon_sha256":"53751eaafaa22f064aacef88bece8a2919dc8f0ebf0a6b10d37f871f2427f9f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.567143Z","signature_b64":"WMjbDlc13f4TlrUGb+ZbBdALL3OPqRZnbO0mn3DSWcA/+Yk35qV7wJHSBeiQlje/4eL8NbQPXTR3dniTG7WUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b076db38f40e4ffcb439f2832a1e5eba58792824c0467cc939614c47b6f765f4","last_reissued_at":"2026-05-18T03:15:33.566292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.566292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards an Effective Decision Procedure for LTL formulas with Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alicia Villanueva, Laura Titolo, Marco Comini","submitted_at":"2013-08-19T20:52:31Z","abstract_excerpt":"This paper presents an ongoing work that is part of a more wide-ranging project whose final scope is to define a method to validate LTL formulas w.r.t. a program written in the timed concurrent constraint language tccp, which is a logic concurrent constraint language based on the concurrent constraint paradigm of Saraswat. Some inherent notions to tccp processes are non-determinism, dealing with partial information in states and the monotonic evolution of the information. In order to check an LTL property for a process, our approach is based on the abstract diagnosis technique. The concluding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4171","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":"1308.4171","created_at":"2026-05-18T03:15:33.566461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4171v1","created_at":"2026-05-18T03:15:33.566461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4171","created_at":"2026-05-18T03:15:33.566461+00:00"},{"alias_kind":"pith_short_12","alias_value":"WB3NWOHUBZH7","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WB3NWOHUBZH7ZNBZ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WB3NWOHU","created_at":"2026-05-18T12:28:04.890932+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/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ","json":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ.json","graph_json":"https://pith.science/api/pith-number/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/graph.json","events_json":"https://pith.science/api/pith-number/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/events.json","paper":"https://pith.science/paper/WB3NWOHU"},"agent_actions":{"view_html":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ","download_json":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ.json","view_paper":"https://pith.science/paper/WB3NWOHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4171&json=true","fetch_graph":"https://pith.science/api/pith-number/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/action/storage_attestation","attest_author":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/action/author_attestation","sign_citation":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/action/citation_signature","submit_replication":"https://pith.science/pith/WB3NWOHUBZH7ZNBZ6KBSUHS6XJ/action/replication_record"}},"created_at":"2026-05-18T03:15:33.566461+00:00","updated_at":"2026-05-18T03:15:33.566461+00:00"}