{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VCEL7DRSCPU7QMYWVDA4D2ZQYU","short_pith_number":"pith:VCEL7DRS","canonical_record":{"source":{"id":"1406.2121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-06-09T10:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"ec73ab6a2ff65027df434a7b1fb7d114c67d44ecd07ae08cd46acd8098128052","abstract_canon_sha256":"1e3968606eb1e597cc402d31e158173e0e2f02abfa9b22d46b97cc2c56106609"},"schema_version":"1.0"},"canonical_sha256":"a888bf8e3213e9f83316a8c1c1eb30c52b8f5207113ae0e2414cbf7ea5d7d394","source":{"kind":"arxiv","id":"1406.2121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2121","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2121v1","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2121","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"VCEL7DRSCPU7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VCEL7DRSCPU7QMYW","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VCEL7DRS","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VCEL7DRSCPU7QMYWVDA4D2ZQYU","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-06-09T10:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"ec73ab6a2ff65027df434a7b1fb7d114c67d44ecd07ae08cd46acd8098128052","abstract_canon_sha256":"1e3968606eb1e597cc402d31e158173e0e2f02abfa9b22d46b97cc2c56106609"},"schema_version":"1.0"},"canonical_sha256":"a888bf8e3213e9f83316a8c1c1eb30c52b8f5207113ae0e2414cbf7ea5d7d394","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:11.547495Z","signature_b64":"yHwGbdsE8ui1vUbZwaWvmACEgWFib8n+cqbwPhxCe7B+3pRA5o4c8Ma8l+i9bLBnl5DpY2D+e3Wc1u8JaajkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a888bf8e3213e9f83316a8c1c1eb30c52b8f5207113ae0e2414cbf7ea5d7d394","last_reissued_at":"2026-05-18T02:50:11.546835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:11.546835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2121","source_version":1,"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-18T02:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCDTuHKwpaBKCI89vjm2/KsYsm5K39vdfZYhGTZeXN45KGz4en1FldUJLzenkZdhljPewMECTyEp3t1ZBvtDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:42:58.623219Z"},"content_sha256":"258df02934d0d547c1895be282601c7909db1278ea06298bae1382a37294e246","schema_version":"1.0","event_id":"sha256:258df02934d0d547c1895be282601c7909db1278ea06298bae1382a37294e246"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VCEL7DRSCPU7QMYWVDA4D2ZQYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Handling Rules with Multiset Comprehension Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Edmund S. L. Lam, Iliano Cervesato","submitted_at":"2014-06-09T10:03:26Z","abstract_excerpt":"CHR is a declarative, concurrent and committed choice rule-based constraint programming language. We extend CHR with multiset comprehension patterns, providing the programmer with the ability to write multiset rewriting rules that can match a variable number of constraints in the store. This enables writing more readable, concise and declarative code for algorithms that coordinate large amounts of data or require aggregate operations. We call this extension $\\mathit{CHR}^\\mathit{cp}$. We give a high-level abstract semantics of $\\mathit{CHR}^\\mathit{cp}$, followed by a lower-level operational s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2121","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"},"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-18T02:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AINOZA4nCLg6ck2tbQ/I+ZmRDAAx4QnwUF1rNh9hGl4zLe4FzkZERWAlDP4ktpTfb3nRbDBktzrvl06xnVpXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:42:58.623967Z"},"content_sha256":"29d3bf3db1db57d02c4c716cd69f27ef20c1ba9f82b037bb87d727c460841e24","schema_version":"1.0","event_id":"sha256:29d3bf3db1db57d02c4c716cd69f27ef20c1ba9f82b037bb87d727c460841e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU/bundle.json","state_url":"https://pith.science/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU/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-06T07:42:58Z","links":{"resolver":"https://pith.science/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU","bundle":"https://pith.science/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU/bundle.json","state":"https://pith.science/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCEL7DRSCPU7QMYWVDA4D2ZQYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VCEL7DRSCPU7QMYWVDA4D2ZQYU","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":"1e3968606eb1e597cc402d31e158173e0e2f02abfa9b22d46b97cc2c56106609","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-06-09T10:03:26Z","title_canon_sha256":"ec73ab6a2ff65027df434a7b1fb7d114c67d44ecd07ae08cd46acd8098128052"},"schema_version":"1.0","source":{"id":"1406.2121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2121","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2121v1","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2121","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"VCEL7DRSCPU7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VCEL7DRSCPU7QMYW","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VCEL7DRS","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:29d3bf3db1db57d02c4c716cd69f27ef20c1ba9f82b037bb87d727c460841e24","target":"graph","created_at":"2026-05-18T02:50:11Z","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":"CHR is a declarative, concurrent and committed choice rule-based constraint programming language. We extend CHR with multiset comprehension patterns, providing the programmer with the ability to write multiset rewriting rules that can match a variable number of constraints in the store. This enables writing more readable, concise and declarative code for algorithms that coordinate large amounts of data or require aggregate operations. We call this extension $\\mathit{CHR}^\\mathit{cp}$. We give a high-level abstract semantics of $\\mathit{CHR}^\\mathit{cp}$, followed by a lower-level operational s","authors_text":"Edmund S. L. Lam, Iliano Cervesato","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-06-09T10:03:26Z","title":"Constraint Handling Rules with Multiset Comprehension Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2121","kind":"arxiv","version":1},"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:258df02934d0d547c1895be282601c7909db1278ea06298bae1382a37294e246","target":"record","created_at":"2026-05-18T02:50:11Z","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":"1e3968606eb1e597cc402d31e158173e0e2f02abfa9b22d46b97cc2c56106609","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-06-09T10:03:26Z","title_canon_sha256":"ec73ab6a2ff65027df434a7b1fb7d114c67d44ecd07ae08cd46acd8098128052"},"schema_version":"1.0","source":{"id":"1406.2121","kind":"arxiv","version":1}},"canonical_sha256":"a888bf8e3213e9f83316a8c1c1eb30c52b8f5207113ae0e2414cbf7ea5d7d394","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a888bf8e3213e9f83316a8c1c1eb30c52b8f5207113ae0e2414cbf7ea5d7d394","first_computed_at":"2026-05-18T02:50:11.546835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:11.546835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHwGbdsE8ui1vUbZwaWvmACEgWFib8n+cqbwPhxCe7B+3pRA5o4c8Ma8l+i9bLBnl5DpY2D+e3Wc1u8JaajkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:11.547495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:258df02934d0d547c1895be282601c7909db1278ea06298bae1382a37294e246","sha256:29d3bf3db1db57d02c4c716cd69f27ef20c1ba9f82b037bb87d727c460841e24"],"state_sha256":"5c91a94d0d29e4ab951fa8c7cf997017fb0a8acaa56afb32dc4b2cfc96315cf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjCINkXBggKSOr0W5PuVvD5mfGnkfXUh2hIxUX5qSzdIbhvREeduT4DqvApH8SArYBSd+ppr6SPO3AJkf/CKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T07:42:58.627677Z","bundle_sha256":"abd4b09780b80cf436240f8778d3856e926a155d2ee4d41489ed95630080de49"}}