{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q3G7Q25DWDBKAJ2TQR73J6J3QZ","short_pith_number":"pith:Q3G7Q25D","schema_version":"1.0","canonical_sha256":"86cdf86ba3b0c2a02753847fb4f93b867a94305cd698944d5e20843ad71f6001","source":{"kind":"arxiv","id":"1808.04867","version":3},"attestation_state":"computed","paper":{"title":"An Assertion language for slicing Constraint Logic Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carlos Olarte, Moreno Falaschi","submitted_at":"2018-08-14T19:20:37Z","abstract_excerpt":"Constraint Logic Programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints in a shared store. In a previous paper, we developed a framework for dynamic slicing of CCP where the user first identifies that a (partial) computation is wrong. Then, she marks (selects) some parts of the final state corresponding to the data (constraints) and processes that she wants to study more deeply. An automatic pro"},"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":"1808.04867","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-14T19:20:37Z","cross_cats_sorted":[],"title_canon_sha256":"36e599769f5a50c38bc875b8f209aebc8f5024b7e28df25b79f5cba52f5d8716","abstract_canon_sha256":"1d768d7879a36251a276060fdc21e05310d1ef300f221f62dd789a619aa36a8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:32.298272Z","signature_b64":"n6jE+5UrhrZ+4PtHbOc8hTvgCarRJWZEGZiRFQjPlL/LRocsW4GuTCGPyDipNKv4+XJ/1tsIECAEJVL5LXTfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86cdf86ba3b0c2a02753847fb4f93b867a94305cd698944d5e20843ad71f6001","last_reissued_at":"2026-05-17T23:59:32.297716Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:32.297716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Assertion language for slicing Constraint Logic Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carlos Olarte, Moreno Falaschi","submitted_at":"2018-08-14T19:20:37Z","abstract_excerpt":"Constraint Logic Programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints in a shared store. In a previous paper, we developed a framework for dynamic slicing of CCP where the user first identifies that a (partial) computation is wrong. Then, she marks (selects) some parts of the final state corresponding to the data (constraints) and processes that she wants to study more deeply. An automatic pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04867","kind":"arxiv","version":3},"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":"1808.04867","created_at":"2026-05-17T23:59:32.297805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04867v3","created_at":"2026-05-17T23:59:32.297805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04867","created_at":"2026-05-17T23:59:32.297805+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3G7Q25DWDBK","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3G7Q25DWDBKAJ2T","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3G7Q25D","created_at":"2026-05-18T12:32:46.962924+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/Q3G7Q25DWDBKAJ2TQR73J6J3QZ","json":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ.json","graph_json":"https://pith.science/api/pith-number/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/graph.json","events_json":"https://pith.science/api/pith-number/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/events.json","paper":"https://pith.science/paper/Q3G7Q25D"},"agent_actions":{"view_html":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ","download_json":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ.json","view_paper":"https://pith.science/paper/Q3G7Q25D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04867&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/action/storage_attestation","attest_author":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/action/author_attestation","sign_citation":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/action/citation_signature","submit_replication":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/action/replication_record"}},"created_at":"2026-05-17T23:59:32.297805+00:00","updated_at":"2026-05-17T23:59:32.297805+00:00"}