{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:3VWRDRALVE6WCQZXFNGNOPAYBH","short_pith_number":"pith:3VWRDRAL","canonical_record":{"source":{"id":"cs/0408025","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2004-08-10T07:55:35Z","cross_cats_sorted":[],"title_canon_sha256":"9bcb5c239dc94a3ce34b486907064c266052deab88a11aec26edb5fe5b85e4ec","abstract_canon_sha256":"f57d49d47818c3a2669ef44204d5dd388e4861241efb79fd16f4d64d8b347c99"},"schema_version":"1.0"},"canonical_sha256":"dd6d11c40ba93d6143372b4cd73c1809d1450cd526490f663d57be309c2ea220","source":{"kind":"arxiv","id":"cs/0408025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0408025","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0408025v1","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0408025","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"3VWRDRALVE6W","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"3VWRDRALVE6WCQZX","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"3VWRDRAL","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:3VWRDRALVE6WCQZXFNGNOPAYBH","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0408025","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2004-08-10T07:55:35Z","cross_cats_sorted":[],"title_canon_sha256":"9bcb5c239dc94a3ce34b486907064c266052deab88a11aec26edb5fe5b85e4ec","abstract_canon_sha256":"f57d49d47818c3a2669ef44204d5dd388e4861241efb79fd16f4d64d8b347c99"},"schema_version":"1.0"},"canonical_sha256":"dd6d11c40ba93d6143372b4cd73c1809d1450cd526490f663d57be309c2ea220","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.418410Z","signature_b64":"4wZw5r8by0OwpkQ1LPQUrhB8C9IhnHdTZjNTiAlkV2UNOEyAznnHg4AdEuqtLHJrSxjPVdLmnEix0L63EKg7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd6d11c40ba93d6143372b4cd73c1809d1450cd526490f663d57be309c2ea220","last_reissued_at":"2026-05-18T04:41:26.417892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.417892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0408025","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-18T04:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PL4X28nj3kl2kO8RzJbWVcmvti356R9W0mEldcHLtfpQKLkBW+Z92bJUQfARnLV/2gVerMDaW8yeQvqlDCbJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:56:11.470134Z"},"content_sha256":"6b2c57d4dac250b8229f5718ce8107cb066e9f162f07b4277551ad47bf99ec68","schema_version":"1.0","event_id":"sha256:6b2c57d4dac250b8229f5718ce8107cb066e9f162f07b4277551ad47bf99ec68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:3VWRDRALVE6WCQZXFNGNOPAYBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing compilation of constraint handling rules in HAL","license":"","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Christian Holzbaur, Gregory J. Duck, Maria Garcia de la Banda, Peter J. Stuckey","submitted_at":"2004-08-10T07:55:35Z","abstract_excerpt":"In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we show how we can use different kinds of information in the compilation of CHRs in order to obtain access efficiency, and a better translation of the CHR rules into the underlying language, which in this case is HAL. The kinds of information used include the types, modes, deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0408025","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-18T04:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bv67jLLjKfKTRR3xYuKVt/XFRRzMHtVoB1F9dPXc929lW6pwCAQ+GO7Z58JFgv6BUdxuhSsEkTsR4oDGkrfBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:56:11.470839Z"},"content_sha256":"481fcbc0c1072c35ad3875bdcaec12464c3810fa94c77c4daefcf120d9c3382c","schema_version":"1.0","event_id":"sha256:481fcbc0c1072c35ad3875bdcaec12464c3810fa94c77c4daefcf120d9c3382c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VWRDRALVE6WCQZXFNGNOPAYBH/bundle.json","state_url":"https://pith.science/pith/3VWRDRALVE6WCQZXFNGNOPAYBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VWRDRALVE6WCQZXFNGNOPAYBH/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-05-26T09:56:11Z","links":{"resolver":"https://pith.science/pith/3VWRDRALVE6WCQZXFNGNOPAYBH","bundle":"https://pith.science/pith/3VWRDRALVE6WCQZXFNGNOPAYBH/bundle.json","state":"https://pith.science/pith/3VWRDRALVE6WCQZXFNGNOPAYBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VWRDRALVE6WCQZXFNGNOPAYBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:3VWRDRALVE6WCQZXFNGNOPAYBH","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":"f57d49d47818c3a2669ef44204d5dd388e4861241efb79fd16f4d64d8b347c99","cross_cats_sorted":[],"license":"","primary_cat":"cs.PL","submitted_at":"2004-08-10T07:55:35Z","title_canon_sha256":"9bcb5c239dc94a3ce34b486907064c266052deab88a11aec26edb5fe5b85e4ec"},"schema_version":"1.0","source":{"id":"cs/0408025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0408025","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0408025v1","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0408025","created_at":"2026-05-18T04:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"3VWRDRALVE6W","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"3VWRDRALVE6WCQZX","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"3VWRDRAL","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:481fcbc0c1072c35ad3875bdcaec12464c3810fa94c77c4daefcf120d9c3382c","target":"graph","created_at":"2026-05-18T04:41:26Z","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":"In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we show how we can use different kinds of information in the compilation of CHRs in order to obtain access efficiency, and a better translation of the CHR rules into the underlying language, which in this case is HAL. The kinds of information used include the types, modes, deter","authors_text":"Christian Holzbaur, Gregory J. Duck, Maria Garcia de la Banda, Peter J. Stuckey","cross_cats":[],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2004-08-10T07:55:35Z","title":"Optimizing compilation of constraint handling rules in HAL"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0408025","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:6b2c57d4dac250b8229f5718ce8107cb066e9f162f07b4277551ad47bf99ec68","target":"record","created_at":"2026-05-18T04:41:26Z","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":"f57d49d47818c3a2669ef44204d5dd388e4861241efb79fd16f4d64d8b347c99","cross_cats_sorted":[],"license":"","primary_cat":"cs.PL","submitted_at":"2004-08-10T07:55:35Z","title_canon_sha256":"9bcb5c239dc94a3ce34b486907064c266052deab88a11aec26edb5fe5b85e4ec"},"schema_version":"1.0","source":{"id":"cs/0408025","kind":"arxiv","version":1}},"canonical_sha256":"dd6d11c40ba93d6143372b4cd73c1809d1450cd526490f663d57be309c2ea220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd6d11c40ba93d6143372b4cd73c1809d1450cd526490f663d57be309c2ea220","first_computed_at":"2026-05-18T04:41:26.417892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:26.417892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4wZw5r8by0OwpkQ1LPQUrhB8C9IhnHdTZjNTiAlkV2UNOEyAznnHg4AdEuqtLHJrSxjPVdLmnEix0L63EKg7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:26.418410Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0408025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b2c57d4dac250b8229f5718ce8107cb066e9f162f07b4277551ad47bf99ec68","sha256:481fcbc0c1072c35ad3875bdcaec12464c3810fa94c77c4daefcf120d9c3382c"],"state_sha256":"9e926255a4f2a3ba4a0ab329f5f1c74fa8b01140bf2c10636278d75b137b2328"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUAPFquYGekl/5iXb8kl9+3BFCchxrcwssy2iae6DxIPECDqL4KVMi56qFLk++TjAhcnQIzl5dE0LxUhjK1qBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:56:11.474626Z","bundle_sha256":"ee3b157a7beeb71df0c1ed4166db42f33d5b0e355e9339897aa88ba0af39072d"}}