{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N7D343XRHCVV2COO73QH2RXYNS","short_pith_number":"pith:N7D343XR","canonical_record":{"source":{"id":"1705.08632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-24T07:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"06aa35cb77b5e7edc6e9c335746fab6ed9158f6e1f49c87f97d299e99b346978","abstract_canon_sha256":"b62404e41d6d01996017f7005d29ed86b327f0a3bdd1ace03431c344436651c5"},"schema_version":"1.0"},"canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","source":{"kind":"arxiv","id":"1705.08632","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08632","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08632v2","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08632","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"pith_short_12","alias_value":"N7D343XRHCVV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N7D343XRHCVV2COO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N7D343XR","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N7D343XRHCVV2COO73QH2RXYNS","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-24T07:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"06aa35cb77b5e7edc6e9c335746fab6ed9158f6e1f49c87f97d299e99b346978","abstract_canon_sha256":"b62404e41d6d01996017f7005d29ed86b327f0a3bdd1ace03431c344436651c5"},"schema_version":"1.0"},"canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.599964Z","signature_b64":"le9v6B8ZGdGAfLq8jnyNwtTaigGghb3GEIRooTnaINHfCW+uWaKkJbGDWH9WSjkRbM4n3ud3C+IkayjC4xULCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","last_reissued_at":"2026-05-17T23:51:21.599568Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.599568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08632","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:51:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShlgdEzzPMoRJRqKJIe6ngFCsYPouaHSIwY2GbbE6zvbL0BcyOKif+xtHliC797seYx8hLw0plAr76bXI/QRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:26:18.498925Z"},"content_sha256":"a0f42e1a7d2ad3c174b76dde85aa4fa13461ec4f6388c69cddebf8f529ab5166","schema_version":"1.0","event_id":"sha256:a0f42e1a7d2ad3c174b76dde85aa4fa13461ec4f6388c69cddebf8f529ab5166"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N7D343XRHCVV2COO73QH2RXYNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faithful (meta-)encodings of programmable strategies into term rewriting systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Horatiu Cirstea, Pierre-Etienne Moreau, Serguei Lenglet","submitted_at":"2017-05-24T07:06:41Z","abstract_excerpt":"Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con- trol their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08632","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:51:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KwF3zzqBiDsjfxMo91joSMe5F1x7omG0wqrpV4IMXX6te+D+DosyDfdWG5DioVWbF/4jcmjmbccLHhD1ceWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:26:18.499268Z"},"content_sha256":"4f894c5dafca6165e5e6f993ea3fc700ad1b2766c4b3833365f6e031ede5cdff","schema_version":"1.0","event_id":"sha256:4f894c5dafca6165e5e6f993ea3fc700ad1b2766c4b3833365f6e031ede5cdff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/bundle.json","state_url":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7D343XRHCVV2COO73QH2RXYNS/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-02T09:26:18Z","links":{"resolver":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS","bundle":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/bundle.json","state":"https://pith.science/pith/N7D343XRHCVV2COO73QH2RXYNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7D343XRHCVV2COO73QH2RXYNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N7D343XRHCVV2COO73QH2RXYNS","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":"b62404e41d6d01996017f7005d29ed86b327f0a3bdd1ace03431c344436651c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-24T07:06:41Z","title_canon_sha256":"06aa35cb77b5e7edc6e9c335746fab6ed9158f6e1f49c87f97d299e99b346978"},"schema_version":"1.0","source":{"id":"1705.08632","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08632","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08632v2","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08632","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"pith_short_12","alias_value":"N7D343XRHCVV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N7D343XRHCVV2COO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N7D343XR","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:4f894c5dafca6165e5e6f993ea3fc700ad1b2766c4b3833365f6e031ede5cdff","target":"graph","created_at":"2026-05-17T23:51:21Z","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. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con- trol their application. The operational semantics of these strategies are generally accepted and approaches for analyzing the termination of specific strategies have been studied. We propose in this paper a generic encoding of classic control and traversal strategies used in rewrite based languages such as Maude, Stratego and Tom into a plain term","authors_text":"Horatiu Cirstea, Pierre-Etienne Moreau, Serguei Lenglet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-24T07:06:41Z","title":"Faithful (meta-)encodings of programmable strategies into term rewriting systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08632","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:a0f42e1a7d2ad3c174b76dde85aa4fa13461ec4f6388c69cddebf8f529ab5166","target":"record","created_at":"2026-05-17T23:51:21Z","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":"b62404e41d6d01996017f7005d29ed86b327f0a3bdd1ace03431c344436651c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-24T07:06:41Z","title_canon_sha256":"06aa35cb77b5e7edc6e9c335746fab6ed9158f6e1f49c87f97d299e99b346978"},"schema_version":"1.0","source":{"id":"1705.08632","kind":"arxiv","version":2}},"canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fc7be6ef138ab5d09cefee07d46f86ca53624c12c0982a978cc01f09e34f987","first_computed_at":"2026-05-17T23:51:21.599568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:21.599568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"le9v6B8ZGdGAfLq8jnyNwtTaigGghb3GEIRooTnaINHfCW+uWaKkJbGDWH9WSjkRbM4n3ud3C+IkayjC4xULCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:21.599964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08632","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0f42e1a7d2ad3c174b76dde85aa4fa13461ec4f6388c69cddebf8f529ab5166","sha256:4f894c5dafca6165e5e6f993ea3fc700ad1b2766c4b3833365f6e031ede5cdff"],"state_sha256":"536d7dfabd3a96d164e83b920f3479f0c0db3468972bc8f1975daf5940806860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6yVKjg6kUcqCSZ1eV2z9iqukd01vYirjo9uu/VOpIiOSwmMz7nf4BolMUvT1Mlhtrxl30/tIUOoAE/v1V0hoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:26:18.501241Z","bundle_sha256":"662abc1f519f023cb6f9c513086ebfeddf05c2a8f8bd434d2cda111e05ba2eae"}}