{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MQE35U5RZ6WQ2BGXJQGUM7QULP","short_pith_number":"pith:MQE35U5R","canonical_record":{"source":{"id":"1001.5404","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-01-29T13:44:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fd137fb9b09363e76cdc97d7d2dc6f272c455fee7e5c3071d98323dcce360e12","abstract_canon_sha256":"c7928c5246be5983ce3e6f8c0958eb0b272d33e129de5f7d16189b3e6665d7af"},"schema_version":"1.0"},"canonical_sha256":"6409bed3b1cfad0d04d74c0d467e145bd09b36b99ee56a6ffb80c69149bbcf18","source":{"kind":"arxiv","id":"1001.5404","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5404","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5404v3","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5404","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"MQE35U5RZ6WQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MQE35U5RZ6WQ2BGX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MQE35U5R","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MQE35U5RZ6WQ2BGXJQGUM7QULP","target":"record","payload":{"canonical_record":{"source":{"id":"1001.5404","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-01-29T13:44:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fd137fb9b09363e76cdc97d7d2dc6f272c455fee7e5c3071d98323dcce360e12","abstract_canon_sha256":"c7928c5246be5983ce3e6f8c0958eb0b272d33e129de5f7d16189b3e6665d7af"},"schema_version":"1.0"},"canonical_sha256":"6409bed3b1cfad0d04d74c0d467e145bd09b36b99ee56a6ffb80c69149bbcf18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:23.436119Z","signature_b64":"jNAC/a57tFvoF5lhSl+LP7TwyO98A0JRev8Homh7lrk/Uo9OZCsi6ii0I6Vcj30IJLOleitCBRTa7WT/LV/eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6409bed3b1cfad0d04d74c0d467e145bd09b36b99ee56a6ffb80c69149bbcf18","last_reissued_at":"2026-05-18T04:20:23.435551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:23.435551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.5404","source_version":3,"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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtwngeAaElTSpnSweR0WMv7e418JM/ynOiMz8UbMHkuGLFD9FhpPLvvo2xmund9YoI7npjE0Yq/8xzzFQcLyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:09:03.885964Z"},"content_sha256":"7db1888455aff5a9944823fd30cc7f30146b8ae42e6a51fb2c1d41e8801d644d","schema_version":"1.0","event_id":"sha256:7db1888455aff5a9944823fd30cc7f30146b8ae42e6a51fb2c1d41e8801d644d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MQE35U5RZ6WQ2BGXJQGUM7QULP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Implementation of Rewriting Revisited Technical Report","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Georg Moser, Martin Avanzini","submitted_at":"2010-01-29T13:44:28Z","abstract_excerpt":"Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined.\n  In this paper, we generalise the above result to full rewriting. Following our previous work, we exploit graph rewriting. We give a new proof of the adequacy of graph rewriting for full rewriting that allows for a precise control of the resources copied. In sum we completely des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5404","kind":"arxiv","version":3},"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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uokzRUmcmVR1aNm41YBVSw1tF9xVULSf6Ta3Sc6kBEr5kbc12srQhCNJzMS+83BICnnP7tBPeGp4oNijitSyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:09:03.886757Z"},"content_sha256":"30b405c6851a47973baf767a7b33647df0dcb6dd49a73af02aa4bacc8e3b9809","schema_version":"1.0","event_id":"sha256:30b405c6851a47973baf767a7b33647df0dcb6dd49a73af02aa4bacc8e3b9809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP/bundle.json","state_url":"https://pith.science/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP/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-11T23:09:03Z","links":{"resolver":"https://pith.science/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP","bundle":"https://pith.science/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP/bundle.json","state":"https://pith.science/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQE35U5RZ6WQ2BGXJQGUM7QULP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MQE35U5RZ6WQ2BGXJQGUM7QULP","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":"c7928c5246be5983ce3e6f8c0958eb0b272d33e129de5f7d16189b3e6665d7af","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-01-29T13:44:28Z","title_canon_sha256":"fd137fb9b09363e76cdc97d7d2dc6f272c455fee7e5c3071d98323dcce360e12"},"schema_version":"1.0","source":{"id":"1001.5404","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5404","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5404v3","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5404","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"MQE35U5RZ6WQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MQE35U5RZ6WQ2BGX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MQE35U5R","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:30b405c6851a47973baf767a7b33647df0dcb6dd49a73af02aa4bacc8e3b9809","target":"graph","created_at":"2026-05-18T04:20:23Z","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":"Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined.\n  In this paper, we generalise the above result to full rewriting. Following our previous work, we exploit graph rewriting. We give a new proof of the adequacy of graph rewriting for full rewriting that allows for a precise control of the resources copied. In sum we completely des","authors_text":"Georg Moser, Martin Avanzini","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-01-29T13:44:28Z","title":"Efficient Implementation of Rewriting Revisited Technical Report"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5404","kind":"arxiv","version":3},"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:7db1888455aff5a9944823fd30cc7f30146b8ae42e6a51fb2c1d41e8801d644d","target":"record","created_at":"2026-05-18T04:20:23Z","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":"c7928c5246be5983ce3e6f8c0958eb0b272d33e129de5f7d16189b3e6665d7af","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-01-29T13:44:28Z","title_canon_sha256":"fd137fb9b09363e76cdc97d7d2dc6f272c455fee7e5c3071d98323dcce360e12"},"schema_version":"1.0","source":{"id":"1001.5404","kind":"arxiv","version":3}},"canonical_sha256":"6409bed3b1cfad0d04d74c0d467e145bd09b36b99ee56a6ffb80c69149bbcf18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6409bed3b1cfad0d04d74c0d467e145bd09b36b99ee56a6ffb80c69149bbcf18","first_computed_at":"2026-05-18T04:20:23.435551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:23.435551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jNAC/a57tFvoF5lhSl+LP7TwyO98A0JRev8Homh7lrk/Uo9OZCsi6ii0I6Vcj30IJLOleitCBRTa7WT/LV/eAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:23.436119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.5404","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7db1888455aff5a9944823fd30cc7f30146b8ae42e6a51fb2c1d41e8801d644d","sha256:30b405c6851a47973baf767a7b33647df0dcb6dd49a73af02aa4bacc8e3b9809"],"state_sha256":"050b93fb1aee831e854c0d5590877e0da0d34fa3a2828ad1877463a50c3fe3f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXiytu6j+TBpUnO/TBlX7UutpNirPa+eaOsrueC8Pt7rIesL/2v3AU8KNLePYnr+9ZnHO+gcw1ID0rlfkOI2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:09:03.891903Z","bundle_sha256":"33f968645c7bf4dc0ba5366716b9f5d51f6e27a14e541b6a01297aee865f94e3"}}