{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q3G7Q25DWDBKAJ2TQR73J6J3QZ","short_pith_number":"pith:Q3G7Q25D","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"},"canonical_sha256":"86cdf86ba3b0c2a02753847fb4f93b867a94305cd698944d5e20843ad71f6001","source":{"kind":"arxiv","id":"1808.04867","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04867","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04867v3","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04867","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"Q3G7Q25DWDBK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q3G7Q25DWDBKAJ2T","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q3G7Q25D","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q3G7Q25DWDBKAJ2TQR73J6J3QZ","target":"record","payload":{"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"},"canonical_sha256":"86cdf86ba3b0c2a02753847fb4f93b867a94305cd698944d5e20843ad71f6001","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"},"source_kind":"arxiv","source_id":"1808.04867","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7KIcib0j+VaKfuAcZk8kScuYQkjCOncun6QV4sjpmbMH5B3+QjroLoj/zAZ/Pv6JhkgsL5mfUVdZljzC69FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:04:59.400592Z"},"content_sha256":"e84a415d41a604a000c291fdeca23777b7505417849d84714fbc715d10a42174","schema_version":"1.0","event_id":"sha256:e84a415d41a604a000c291fdeca23777b7505417849d84714fbc715d10a42174"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q3G7Q25DWDBKAJ2TQR73J6J3QZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgI60o+XDZc1h9Vm4tos06eLgw+Zmqujk1/63ZqRRc4iEgIACobacw7V0+828XsrYoKTfizeLLQrBSm+IlbdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:04:59.400955Z"},"content_sha256":"07c08d860cd8cd16ee3b8ddf705e0091d42b7d07b3656b6aa428335a38068dd9","schema_version":"1.0","event_id":"sha256:07c08d860cd8cd16ee3b8ddf705e0091d42b7d07b3656b6aa428335a38068dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/bundle.json","state_url":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T04:04:59Z","links":{"resolver":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ","bundle":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/bundle.json","state":"https://pith.science/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3G7Q25DWDBKAJ2TQR73J6J3QZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q3G7Q25DWDBKAJ2TQR73J6J3QZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1d768d7879a36251a276060fdc21e05310d1ef300f221f62dd789a619aa36a8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-14T19:20:37Z","title_canon_sha256":"36e599769f5a50c38bc875b8f209aebc8f5024b7e28df25b79f5cba52f5d8716"},"schema_version":"1.0","source":{"id":"1808.04867","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04867","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04867v3","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04867","created_at":"2026-05-17T23:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"Q3G7Q25DWDBK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q3G7Q25DWDBKAJ2T","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q3G7Q25D","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:07c08d860cd8cd16ee3b8ddf705e0091d42b7d07b3656b6aa428335a38068dd9","target":"graph","created_at":"2026-05-17T23:59:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Carlos Olarte, Moreno Falaschi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-14T19:20:37Z","title":"An Assertion language for slicing Constraint Logic Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04867","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e84a415d41a604a000c291fdeca23777b7505417849d84714fbc715d10a42174","target":"record","created_at":"2026-05-17T23:59:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1d768d7879a36251a276060fdc21e05310d1ef300f221f62dd789a619aa36a8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-14T19:20:37Z","title_canon_sha256":"36e599769f5a50c38bc875b8f209aebc8f5024b7e28df25b79f5cba52f5d8716"},"schema_version":"1.0","source":{"id":"1808.04867","kind":"arxiv","version":3}},"canonical_sha256":"86cdf86ba3b0c2a02753847fb4f93b867a94305cd698944d5e20843ad71f6001","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86cdf86ba3b0c2a02753847fb4f93b867a94305cd698944d5e20843ad71f6001","first_computed_at":"2026-05-17T23:59:32.297716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:32.297716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n6jE+5UrhrZ+4PtHbOc8hTvgCarRJWZEGZiRFQjPlL/LRocsW4GuTCGPyDipNKv4+XJ/1tsIECAEJVL5LXTfAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:32.298272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04867","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e84a415d41a604a000c291fdeca23777b7505417849d84714fbc715d10a42174","sha256:07c08d860cd8cd16ee3b8ddf705e0091d42b7d07b3656b6aa428335a38068dd9"],"state_sha256":"ff4afc58ff0701adb02c0eea03fbd24c88f4cef4cf9bf78715cf45133c2733d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0otI4VJZ2qCCEGQHRA+Ahy8RySEzAqfr5WfKMwk6osigoVcMcRuPmpatNQHHPAnr9uEtHWm+Sybumdx7WiWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:04:59.402795Z","bundle_sha256":"59857c8c413ee542acfb69ad8aa7a32e80ceb15074d13dc61505b40b618f3612"}}