{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AZVTWGHPQT7K4AE7PTA7M7W6LM","short_pith_number":"pith:AZVTWGHP","canonical_record":{"source":{"id":"1808.08094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-24T11:26:40Z","cross_cats_sorted":[],"title_canon_sha256":"e5d36cd07e002b0876dbedf55ab42db51b4255bc9f0db8927979079f29e24165","abstract_canon_sha256":"e1b496c5bddc78bf766ef6ef72caa8e22790da2e20a8149bf046225261549455"},"schema_version":"1.0"},"canonical_sha256":"066b3b18ef84feae009f7cc1f67ede5b3ed5575b94a419f6f10c953f13c5cba3","source":{"kind":"arxiv","id":"1808.08094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08094","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08094v2","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08094","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"AZVTWGHPQT7K","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AZVTWGHPQT7K4AE7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AZVTWGHP","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AZVTWGHPQT7K4AE7PTA7M7W6LM","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-24T11:26:40Z","cross_cats_sorted":[],"title_canon_sha256":"e5d36cd07e002b0876dbedf55ab42db51b4255bc9f0db8927979079f29e24165","abstract_canon_sha256":"e1b496c5bddc78bf766ef6ef72caa8e22790da2e20a8149bf046225261549455"},"schema_version":"1.0"},"canonical_sha256":"066b3b18ef84feae009f7cc1f67ede5b3ed5575b94a419f6f10c953f13c5cba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:50.394674Z","signature_b64":"TCQtxdzpGX/ntAe+ONSXLzMmy2ocAkVjfVcPUrWdj7edvctv/ncdBc8gEGamo22Ui0BcFwIhy/n8lx5KjiY3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"066b3b18ef84feae009f7cc1f67ede5b3ed5575b94a419f6f10c953f13c5cba3","last_reissued_at":"2026-05-18T00:05:50.393963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:50.393963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08094","source_version":2,"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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Z5EwT2HgAifJkZz/9Uej1VaUWxYGshvTelXUtOL7HnflzOVuHq83ULDZl/wxgUiA9etl/91KUYzsDL9OO7KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:45:28.897356Z"},"content_sha256":"4a9cb315cd5890a64657c242156a67b52e5501244f003c2f87568a4378733249","schema_version":"1.0","event_id":"sha256:4a9cb315cd5890a64657c242156a67b52e5501244f003c2f87568a4378733249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AZVTWGHPQT7K4AE7PTA7M7W6LM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a constraint solver for proving confluence with invariant and equivalence of realistic CHR programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Henning Christiansen, Maja Kirkeby","submitted_at":"2018-08-24T11:26:40Z","abstract_excerpt":"Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general property of confluence modulo equivalence ensures that equivalent inputs are related to equivalent outputs, that need not be identical. Confluence under invariants is also considered. Constraint Handling Rules (CHR) is an important example of a rewrite based logic programming language, and we aim at a mechanizable method for proving confluence modulo equivalence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08094","kind":"arxiv","version":2},"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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6AqENfin+Sn6kaQ3N/k7XqEAKXhCpYwpsRF5Pe3iMlIfR57kJdg2Q2gerbdeNEAnYpWTYiB5TV8pM4JyzXPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:45:28.897713Z"},"content_sha256":"a497742b0bc15856c7a42d4999e9b0d8441f5f7cb3624781314c5d0c167bf24d","schema_version":"1.0","event_id":"sha256:a497742b0bc15856c7a42d4999e9b0d8441f5f7cb3624781314c5d0c167bf24d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM/bundle.json","state_url":"https://pith.science/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM/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-24T20:45:28Z","links":{"resolver":"https://pith.science/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM","bundle":"https://pith.science/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM/bundle.json","state":"https://pith.science/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZVTWGHPQT7K4AE7PTA7M7W6LM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AZVTWGHPQT7K4AE7PTA7M7W6LM","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":"e1b496c5bddc78bf766ef6ef72caa8e22790da2e20a8149bf046225261549455","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-24T11:26:40Z","title_canon_sha256":"e5d36cd07e002b0876dbedf55ab42db51b4255bc9f0db8927979079f29e24165"},"schema_version":"1.0","source":{"id":"1808.08094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08094","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08094v2","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08094","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"AZVTWGHPQT7K","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AZVTWGHPQT7K4AE7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AZVTWGHP","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a497742b0bc15856c7a42d4999e9b0d8441f5f7cb3624781314c5d0c167bf24d","target":"graph","created_at":"2026-05-18T00:05:50Z","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":"Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general property of confluence modulo equivalence ensures that equivalent inputs are related to equivalent outputs, that need not be identical. Confluence under invariants is also considered. Constraint Handling Rules (CHR) is an important example of a rewrite based logic programming language, and we aim at a mechanizable method for proving confluence modulo equivalence ","authors_text":"Henning Christiansen, Maja Kirkeby","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-24T11:26:40Z","title":"Towards a constraint solver for proving confluence with invariant and equivalence of realistic CHR programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08094","kind":"arxiv","version":2},"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:4a9cb315cd5890a64657c242156a67b52e5501244f003c2f87568a4378733249","target":"record","created_at":"2026-05-18T00:05:50Z","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":"e1b496c5bddc78bf766ef6ef72caa8e22790da2e20a8149bf046225261549455","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-24T11:26:40Z","title_canon_sha256":"e5d36cd07e002b0876dbedf55ab42db51b4255bc9f0db8927979079f29e24165"},"schema_version":"1.0","source":{"id":"1808.08094","kind":"arxiv","version":2}},"canonical_sha256":"066b3b18ef84feae009f7cc1f67ede5b3ed5575b94a419f6f10c953f13c5cba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"066b3b18ef84feae009f7cc1f67ede5b3ed5575b94a419f6f10c953f13c5cba3","first_computed_at":"2026-05-18T00:05:50.393963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:50.393963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TCQtxdzpGX/ntAe+ONSXLzMmy2ocAkVjfVcPUrWdj7edvctv/ncdBc8gEGamo22Ui0BcFwIhy/n8lx5KjiY3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:50.394674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a9cb315cd5890a64657c242156a67b52e5501244f003c2f87568a4378733249","sha256:a497742b0bc15856c7a42d4999e9b0d8441f5f7cb3624781314c5d0c167bf24d"],"state_sha256":"dbb077b137b91506e046ba6ba44b485d4c028111fefaa18ab9fb15b7d840da61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7hmPJ2iGSkKjJfiFwMLY8nl9yrZdQSFc+JPrS2MrXTopC1bunDgxozoTQFt01CB72fMWj16X2/pPxnRCCrpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:45:28.899637Z","bundle_sha256":"317e1f27fc5779c2509143108cdc41b1719ae52a1cbde1fd422460a2152e9a1a"}}