{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2CLFTQKXMQ4M222OOW25TQ64EO","short_pith_number":"pith:2CLFTQKX","schema_version":"1.0","canonical_sha256":"d09659c1576438cd6b4e75b5d9c3dc23a81e79272acfe620c2a07c24e17a317a","source":{"kind":"arxiv","id":"1010.1128","version":3},"attestation_state":"computed","paper":{"title":"A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Georg Moser, Martin Avanzini, Naohi Eguchi","submitted_at":"2010-10-06T11:48:44Z","abstract_excerpt":"In this paper we present a new path order for rewrite systems, the exponential path order EPOSTAR. Suppose a term rewrite system is compatible with EPOSTAR, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPOSTAR equals the class of functions computable in exponential time on a Turing maschine."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1010.1128","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2010-10-06T11:48:44Z","cross_cats_sorted":[],"title_canon_sha256":"24c0d986389aabe3c440e093233a57b4cb878543a726e8a30d13181635644cef","abstract_canon_sha256":"6a3b2b170c9cfcc60517362b23b799e557105d989367fb75174c9b1911b27b55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:22.186379Z","signature_b64":"PCHpLH4HLdjs2Rax94RidDJHSfqQa90MMpCOxgm4ysCcFhhWIQ2uiqMjQwvjff6Mfr8vDkX59g80gJEnxsq9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d09659c1576438cd6b4e75b5d9c3dc23a81e79272acfe620c2a07c24e17a317a","last_reissued_at":"2026-05-18T04:20:22.185772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:22.185772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Georg Moser, Martin Avanzini, Naohi Eguchi","submitted_at":"2010-10-06T11:48:44Z","abstract_excerpt":"In this paper we present a new path order for rewrite systems, the exponential path order EPOSTAR. Suppose a term rewrite system is compatible with EPOSTAR, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPOSTAR equals the class of functions computable in exponential time on a Turing maschine."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1128","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.1128","created_at":"2026-05-18T04:20:22.185853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1128v3","created_at":"2026-05-18T04:20:22.185853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1128","created_at":"2026-05-18T04:20:22.185853+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CLFTQKXMQ4M","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CLFTQKXMQ4M222O","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CLFTQKX","created_at":"2026-05-18T12:26:03.138858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO","json":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO.json","graph_json":"https://pith.science/api/pith-number/2CLFTQKXMQ4M222OOW25TQ64EO/graph.json","events_json":"https://pith.science/api/pith-number/2CLFTQKXMQ4M222OOW25TQ64EO/events.json","paper":"https://pith.science/paper/2CLFTQKX"},"agent_actions":{"view_html":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO","download_json":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO.json","view_paper":"https://pith.science/paper/2CLFTQKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1128&json=true","fetch_graph":"https://pith.science/api/pith-number/2CLFTQKXMQ4M222OOW25TQ64EO/graph.json","fetch_events":"https://pith.science/api/pith-number/2CLFTQKXMQ4M222OOW25TQ64EO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO/action/storage_attestation","attest_author":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO/action/author_attestation","sign_citation":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO/action/citation_signature","submit_replication":"https://pith.science/pith/2CLFTQKXMQ4M222OOW25TQ64EO/action/replication_record"}},"created_at":"2026-05-18T04:20:22.185853+00:00","updated_at":"2026-05-18T04:20:22.185853+00:00"}