{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KGJ43ICLTEEHSLU45ZR4X6K56W","short_pith_number":"pith:KGJ43ICL","canonical_record":{"source":{"id":"1905.06233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-14T14:06:09Z","cross_cats_sorted":["cs.CL","cs.PL"],"title_canon_sha256":"bbb30181ec76e37f8435909cc2c43a38841477d89863ab167ebedac6fbff0f99","abstract_canon_sha256":"41e24ec4ec7b7ec188ed59149ef2eff08c32d18dfdbb6da82d8886635e475e24"},"schema_version":"1.0"},"canonical_sha256":"5193cda04b9908792e9cee63cbf95df5a322b50e42fee8c3efa4a12f86c9dba4","source":{"kind":"arxiv","id":"1905.06233","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06233","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06233v2","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06233","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"KGJ43ICLTEEH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KGJ43ICLTEEHSLU4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KGJ43ICL","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KGJ43ICLTEEHSLU45ZR4X6K56W","target":"record","payload":{"canonical_record":{"source":{"id":"1905.06233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-14T14:06:09Z","cross_cats_sorted":["cs.CL","cs.PL"],"title_canon_sha256":"bbb30181ec76e37f8435909cc2c43a38841477d89863ab167ebedac6fbff0f99","abstract_canon_sha256":"41e24ec4ec7b7ec188ed59149ef2eff08c32d18dfdbb6da82d8886635e475e24"},"schema_version":"1.0"},"canonical_sha256":"5193cda04b9908792e9cee63cbf95df5a322b50e42fee8c3efa4a12f86c9dba4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:42.214593Z","signature_b64":"rP997avgwJYGcMWJHs+kM06iGUwjmYYmK7TfiyH7YqaUxhcV1FAm7A2kZBjbL7onlQ6l+wS+CZ4aPve5gheZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5193cda04b9908792e9cee63cbf95df5a322b50e42fee8c3efa4a12f86c9dba4","last_reissued_at":"2026-05-17T23:43:42.214046Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:42.214046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.06233","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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWvQlnlvHLrfkrHV4FeaMHlU58qvu0+5HLYEYEwJZ/hVNOGvrydlqm29deTOJzUGiJwUs1TDvZOUW7gfJvpgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:58:09.423880Z"},"content_sha256":"57b2b86a96a72cd61e235eb1f79a19af32f9041f3a024db1fe58841a78c83a0f","schema_version":"1.0","event_id":"sha256:57b2b86a96a72cd61e235eb1f79a19af32f9041f3a024db1fe58841a78c83a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KGJ43ICLTEEHSLU45ZR4X6K56W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic Encodings of Constructor Rewriting Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.PL"],"primary_cat":"cs.LO","authors_text":"Horatiu Cirstea, Pierre-Etienne Moreau","submitted_at":"2019-05-14T14:06:09Z","abstract_excerpt":"Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the negation over patterns. We propose in this paper a concise and clear algorithm computing the difference over patterns which can be used to define generic encodings of constructor term rewriting systems with negation and order into classical term rewriting systems. As a direct consequence, established methods used for term rewriting systems can be a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06233","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-17T23:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4rgD82QpFZDJ6oqJEEvbeJ0wBe0My6wxjqeafcptc7aQ/frG+khQyFvTcktLN48r+LA2lj4dhmVckcyNFfNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:58:09.424255Z"},"content_sha256":"9201a8f3898c201269af8a515683671066d82783f9a616d0a93c22e66c678e19","schema_version":"1.0","event_id":"sha256:9201a8f3898c201269af8a515683671066d82783f9a616d0a93c22e66c678e19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGJ43ICLTEEHSLU45ZR4X6K56W/bundle.json","state_url":"https://pith.science/pith/KGJ43ICLTEEHSLU45ZR4X6K56W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGJ43ICLTEEHSLU45ZR4X6K56W/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-07-02T08:58:09Z","links":{"resolver":"https://pith.science/pith/KGJ43ICLTEEHSLU45ZR4X6K56W","bundle":"https://pith.science/pith/KGJ43ICLTEEHSLU45ZR4X6K56W/bundle.json","state":"https://pith.science/pith/KGJ43ICLTEEHSLU45ZR4X6K56W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGJ43ICLTEEHSLU45ZR4X6K56W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KGJ43ICLTEEHSLU45ZR4X6K56W","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":"41e24ec4ec7b7ec188ed59149ef2eff08c32d18dfdbb6da82d8886635e475e24","cross_cats_sorted":["cs.CL","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-14T14:06:09Z","title_canon_sha256":"bbb30181ec76e37f8435909cc2c43a38841477d89863ab167ebedac6fbff0f99"},"schema_version":"1.0","source":{"id":"1905.06233","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06233","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06233v2","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06233","created_at":"2026-05-17T23:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"KGJ43ICLTEEH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KGJ43ICLTEEHSLU4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KGJ43ICL","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:9201a8f3898c201269af8a515683671066d82783f9a616d0a93c22e66c678e19","target":"graph","created_at":"2026-05-17T23:43:42Z","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":"Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the negation over patterns. We propose in this paper a concise and clear algorithm computing the difference over patterns which can be used to define generic encodings of constructor term rewriting systems with negation and order into classical term rewriting systems. As a direct consequence, established methods used for term rewriting systems can be a","authors_text":"Horatiu Cirstea, Pierre-Etienne Moreau","cross_cats":["cs.CL","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-14T14:06:09Z","title":"Generic Encodings of Constructor Rewriting Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06233","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:57b2b86a96a72cd61e235eb1f79a19af32f9041f3a024db1fe58841a78c83a0f","target":"record","created_at":"2026-05-17T23:43:42Z","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":"41e24ec4ec7b7ec188ed59149ef2eff08c32d18dfdbb6da82d8886635e475e24","cross_cats_sorted":["cs.CL","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-14T14:06:09Z","title_canon_sha256":"bbb30181ec76e37f8435909cc2c43a38841477d89863ab167ebedac6fbff0f99"},"schema_version":"1.0","source":{"id":"1905.06233","kind":"arxiv","version":2}},"canonical_sha256":"5193cda04b9908792e9cee63cbf95df5a322b50e42fee8c3efa4a12f86c9dba4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5193cda04b9908792e9cee63cbf95df5a322b50e42fee8c3efa4a12f86c9dba4","first_computed_at":"2026-05-17T23:43:42.214046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:42.214046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rP997avgwJYGcMWJHs+kM06iGUwjmYYmK7TfiyH7YqaUxhcV1FAm7A2kZBjbL7onlQ6l+wS+CZ4aPve5gheZDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:42.214593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06233","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57b2b86a96a72cd61e235eb1f79a19af32f9041f3a024db1fe58841a78c83a0f","sha256:9201a8f3898c201269af8a515683671066d82783f9a616d0a93c22e66c678e19"],"state_sha256":"90491cda5ee867b6584afb2db8f2ad9acf7bfdf8a042d54c9b64c663b31edef8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wne7GVxNXcB7MJ8HCz4VILtwCKQyDfQTJBAKHRKY6v1oPRlf32JE8NoMLTx0In97OyZmtFjBkvPsyPvh84NYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:58:09.426273Z","bundle_sha256":"e6d4f476c5facb7952598e310a18d16c3e30551c17dc5ba9ff4a163d14ba7daf"}}