{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IVR7HEUI4I6MJ4UAFI6QLQH64H","short_pith_number":"pith:IVR7HEUI","canonical_record":{"source":{"id":"1108.0330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-01T15:02:43Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"dc2aabc26c0e7c9ba11543878cff180363618aa02851adff64eae4c8193a90b0","abstract_canon_sha256":"d36f39b9689c8f8ce9678cf08c44df4dd4da4ef555a57a6f874ff75692c2386d"},"schema_version":"1.0"},"canonical_sha256":"4563f39288e23cc4f2802a3d05c0fee1e33476d8691b298da16978c6b898dc79","source":{"kind":"arxiv","id":"1108.0330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0330","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0330v1","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0330","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"IVR7HEUI4I6M","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IVR7HEUI4I6MJ4UA","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IVR7HEUI","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IVR7HEUI4I6MJ4UAFI6QLQH64H","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-01T15:02:43Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"dc2aabc26c0e7c9ba11543878cff180363618aa02851adff64eae4c8193a90b0","abstract_canon_sha256":"d36f39b9689c8f8ce9678cf08c44df4dd4da4ef555a57a6f874ff75692c2386d"},"schema_version":"1.0"},"canonical_sha256":"4563f39288e23cc4f2802a3d05c0fee1e33476d8691b298da16978c6b898dc79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:31.269776Z","signature_b64":"/HeXGjutSKI7e1wdTYiV50Db5U1SAttqFxxrNV4lfh8YoLnXdVM0btv0kQLaypguSHSLpuu3+UCzqWMKLDV+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4563f39288e23cc4f2802a3d05c0fee1e33476d8691b298da16978c6b898dc79","last_reissued_at":"2026-05-18T04:16:31.269303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:31.269303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0330","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:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8GPweGhyk5zChgLtLpaY1DJSgsYyps2uN7RgdDE7Dl4+qgnFUtdlztiJXUmGByInzEPBJW4D9NTc/39QYKPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:01:00.569467Z"},"content_sha256":"2aa940f3308d6855921b560f1015486c9d9c176218254df19b54d3c005a60e45","schema_version":"1.0","event_id":"sha256:2aa940f3308d6855921b560f1015486c9d9c176218254df19b54d3c005a60e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IVR7HEUI4I6MJ4UAFI6QLQH64H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(Co-)Inductive semantics for Constraint Handling Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"R\\'emy Haemmerl\\'e","submitted_at":"2011-08-01T15:02:43Z","abstract_excerpt":"In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over the transition system generated by the abstract operational semantics of CHR. Similarly, we demonstrate that the logical reading of states with respect to a set of propagation rules can be characterized b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0330","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:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pD8IILVbZ6E+7TZTsl6EmXtKZLir6zreYLDSs36nJriyY4atZhpDqHB4GrxUYQM59WlqRBf3T6kY0N5TtdwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:01:00.569801Z"},"content_sha256":"5dc029c061b1dc69bcdcfb73b3e1c9571fb40e595e7756eceaaba23cc8b73eed","schema_version":"1.0","event_id":"sha256:5dc029c061b1dc69bcdcfb73b3e1c9571fb40e595e7756eceaaba23cc8b73eed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H/bundle.json","state_url":"https://pith.science/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H/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-28T07:01:00Z","links":{"resolver":"https://pith.science/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H","bundle":"https://pith.science/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H/bundle.json","state":"https://pith.science/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVR7HEUI4I6MJ4UAFI6QLQH64H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IVR7HEUI4I6MJ4UAFI6QLQH64H","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":"d36f39b9689c8f8ce9678cf08c44df4dd4da4ef555a57a6f874ff75692c2386d","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-01T15:02:43Z","title_canon_sha256":"dc2aabc26c0e7c9ba11543878cff180363618aa02851adff64eae4c8193a90b0"},"schema_version":"1.0","source":{"id":"1108.0330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0330","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0330v1","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0330","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"IVR7HEUI4I6M","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IVR7HEUI4I6MJ4UA","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IVR7HEUI","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:5dc029c061b1dc69bcdcfb73b3e1c9571fb40e595e7756eceaaba23cc8b73eed","target":"graph","created_at":"2026-05-18T04:16:31Z","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 address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over the transition system generated by the abstract operational semantics of CHR. Similarly, we demonstrate that the logical reading of states with respect to a set of propagation rules can be characterized b","authors_text":"R\\'emy Haemmerl\\'e","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-01T15:02:43Z","title":"(Co-)Inductive semantics for Constraint Handling Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0330","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:2aa940f3308d6855921b560f1015486c9d9c176218254df19b54d3c005a60e45","target":"record","created_at":"2026-05-18T04:16:31Z","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":"d36f39b9689c8f8ce9678cf08c44df4dd4da4ef555a57a6f874ff75692c2386d","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-01T15:02:43Z","title_canon_sha256":"dc2aabc26c0e7c9ba11543878cff180363618aa02851adff64eae4c8193a90b0"},"schema_version":"1.0","source":{"id":"1108.0330","kind":"arxiv","version":1}},"canonical_sha256":"4563f39288e23cc4f2802a3d05c0fee1e33476d8691b298da16978c6b898dc79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4563f39288e23cc4f2802a3d05c0fee1e33476d8691b298da16978c6b898dc79","first_computed_at":"2026-05-18T04:16:31.269303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:31.269303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HeXGjutSKI7e1wdTYiV50Db5U1SAttqFxxrNV4lfh8YoLnXdVM0btv0kQLaypguSHSLpuu3+UCzqWMKLDV+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:31.269776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aa940f3308d6855921b560f1015486c9d9c176218254df19b54d3c005a60e45","sha256:5dc029c061b1dc69bcdcfb73b3e1c9571fb40e595e7756eceaaba23cc8b73eed"],"state_sha256":"3bd2755c836cfe0d6d4715aa8c4fec1ac402c1dd6e72299056fbc61054344321"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJlmk8ufEUOvME+uCLFJPdnvLsdCEFiEyyERHUnoZC5PITtlC4sBDToTCWeemT2pmQjT15chsgZNo7DSbzpIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:01:00.571812Z","bundle_sha256":"bca52f35dc2689c46d1597610f289b6512422cae8173d1787b2f4429bcbff619"}}