{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RN6ABXA2326NR6IGWBA5CA5FOF","short_pith_number":"pith:RN6ABXA2","canonical_record":{"source":{"id":"1611.03628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-11T09:11:58Z","cross_cats_sorted":[],"title_canon_sha256":"06c8a3ce693b2fc036246dddcbf6075a68852aa7c26df0b6869ffe8d6f04c47b","abstract_canon_sha256":"57b25c9b44392ae8fa6f3ce2ee07fbeebdffab34ad565a86a02963a04c6a3785"},"schema_version":"1.0"},"canonical_sha256":"8b7c00dc1adebcd8f906b041d103a5716d14eeec795c3082323c2ab5adcc4173","source":{"kind":"arxiv","id":"1611.03628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03628","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03628v1","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03628","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"RN6ABXA2326N","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RN6ABXA2326NR6IG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RN6ABXA2","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RN6ABXA2326NR6IGWBA5CA5FOF","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-11T09:11:58Z","cross_cats_sorted":[],"title_canon_sha256":"06c8a3ce693b2fc036246dddcbf6075a68852aa7c26df0b6869ffe8d6f04c47b","abstract_canon_sha256":"57b25c9b44392ae8fa6f3ce2ee07fbeebdffab34ad565a86a02963a04c6a3785"},"schema_version":"1.0"},"canonical_sha256":"8b7c00dc1adebcd8f906b041d103a5716d14eeec795c3082323c2ab5adcc4173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:37.028238Z","signature_b64":"nX7yZ9wAZbvoOZYnl4+hq4+k9j0i9tFT0l0a+o1qaBdpobSAfPP1PQhWcwEgILEuI8end7ngCnODQutpykHqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7c00dc1adebcd8f906b041d103a5716d14eeec795c3082323c2ab5adcc4173","last_reissued_at":"2026-05-18T00:57:37.027621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:37.027621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03628","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-18T00:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+xFtzSosbCwtuwv5b6QI0RuqvQg/+X/rOpFtuIrc3Q2GzeqG/Rv7xbVZFJlrW/RqICUkpATV7/6vnzNLiLzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:26:30.953302Z"},"content_sha256":"8d2985af0c1478e4be2b7d1d95384065c61ef30def7764933b874ad51fb5086d","schema_version":"1.0","event_id":"sha256:8d2985af0c1478e4be2b7d1d95384065c61ef30def7764933b874ad51fb5086d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RN6ABXA2326NR6IGWBA5CA5FOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Proving Confluence Modulo Equivalence for Constraint Handling Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Henning Christiansen, Maja H. Kirkeby","submitted_at":"2016-11-11T09:11:58Z","abstract_excerpt":"Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of confluence modulo equivalence into the context of CHR: while confluence for a terminating program means that all alternative derivations for a query lead to the exact same final state, confluence modulo equivalence only requires the final states to be equivalent with respect to an equivalence relation tailored for the given program. Secondly, we allow non-logical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03628","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-18T00:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZhkjzyL9iZ/wT65aLg8OZoUJl986b3/MWby3DG/CfcbXLpoM4SgYlRT/1rvUUO31qUk5dpFj4EnB3PVDoVzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:26:30.953668Z"},"content_sha256":"fe6ecfb15b0ecb3ccca8715a1e81e898e561afd2e1380d57ea95ded8c2fc1cd8","schema_version":"1.0","event_id":"sha256:fe6ecfb15b0ecb3ccca8715a1e81e898e561afd2e1380d57ea95ded8c2fc1cd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RN6ABXA2326NR6IGWBA5CA5FOF/bundle.json","state_url":"https://pith.science/pith/RN6ABXA2326NR6IGWBA5CA5FOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RN6ABXA2326NR6IGWBA5CA5FOF/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-24T22:26:30Z","links":{"resolver":"https://pith.science/pith/RN6ABXA2326NR6IGWBA5CA5FOF","bundle":"https://pith.science/pith/RN6ABXA2326NR6IGWBA5CA5FOF/bundle.json","state":"https://pith.science/pith/RN6ABXA2326NR6IGWBA5CA5FOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RN6ABXA2326NR6IGWBA5CA5FOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RN6ABXA2326NR6IGWBA5CA5FOF","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":"57b25c9b44392ae8fa6f3ce2ee07fbeebdffab34ad565a86a02963a04c6a3785","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-11T09:11:58Z","title_canon_sha256":"06c8a3ce693b2fc036246dddcbf6075a68852aa7c26df0b6869ffe8d6f04c47b"},"schema_version":"1.0","source":{"id":"1611.03628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03628","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03628v1","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03628","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"RN6ABXA2326N","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RN6ABXA2326NR6IG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RN6ABXA2","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:fe6ecfb15b0ecb3ccca8715a1e81e898e561afd2e1380d57ea95ded8c2fc1cd8","target":"graph","created_at":"2026-05-18T00:57:37Z","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":"Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of confluence modulo equivalence into the context of CHR: while confluence for a terminating program means that all alternative derivations for a query lead to the exact same final state, confluence modulo equivalence only requires the final states to be equivalent with respect to an equivalence relation tailored for the given program. Secondly, we allow non-logical ","authors_text":"Henning Christiansen, Maja H. Kirkeby","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-11T09:11:58Z","title":"On Proving Confluence Modulo Equivalence for Constraint Handling Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03628","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:8d2985af0c1478e4be2b7d1d95384065c61ef30def7764933b874ad51fb5086d","target":"record","created_at":"2026-05-18T00:57:37Z","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":"57b25c9b44392ae8fa6f3ce2ee07fbeebdffab34ad565a86a02963a04c6a3785","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-11T09:11:58Z","title_canon_sha256":"06c8a3ce693b2fc036246dddcbf6075a68852aa7c26df0b6869ffe8d6f04c47b"},"schema_version":"1.0","source":{"id":"1611.03628","kind":"arxiv","version":1}},"canonical_sha256":"8b7c00dc1adebcd8f906b041d103a5716d14eeec795c3082323c2ab5adcc4173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b7c00dc1adebcd8f906b041d103a5716d14eeec795c3082323c2ab5adcc4173","first_computed_at":"2026-05-18T00:57:37.027621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:37.027621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nX7yZ9wAZbvoOZYnl4+hq4+k9j0i9tFT0l0a+o1qaBdpobSAfPP1PQhWcwEgILEuI8end7ngCnODQutpykHqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:37.028238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d2985af0c1478e4be2b7d1d95384065c61ef30def7764933b874ad51fb5086d","sha256:fe6ecfb15b0ecb3ccca8715a1e81e898e561afd2e1380d57ea95ded8c2fc1cd8"],"state_sha256":"8c7592b4f3d6192167807632ab1fdaf59cf075294502dc1f6a3ec8878267fb6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5gN3g8nv+kCNxq83960iFW/vFevusU/7PhDnwLmJ+hP2xXgzRe/B2S1zl7gPQ6LCjIowHA6qdueom98XRucBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:26:30.955619Z","bundle_sha256":"c2d97e822ac15244ab215136aa3914bc8373b88740b4eee1ba72ef868cec2bef"}}