{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MNETOKLU3KPXKLIU63PHYB2DZ2","short_pith_number":"pith:MNETOKLU","schema_version":"1.0","canonical_sha256":"6349372974da9f752d14f6de7c0743ce8c4d35a7dbddfcfddb685b4d37a1d890","source":{"kind":"arxiv","id":"1201.2553","version":2},"attestation_state":"computed","paper":{"title":"A New Order-theoretic Characterisation of the Polytime Computable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Georg Moser, Martin Avanzini, Naohi Eguchi","submitted_at":"2012-01-12T12:57:40Z","abstract_excerpt":"We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function gives rise to a rewrite system that is compatible with sPOP*. On the other hand any function defined by a rewrite system compatible with sPOP* is polynomial time computable. Technically sPOP* is a tamed recursive path order with product status. Its distinctive feature is the precise control provided. For any rewrite system that is compatible with sPOP* that mak"},"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":"1201.2553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-12T12:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"489a6e5880e250400778a8b78c3a28d9ba7de5a92127b4911ff33e24c54f664f","abstract_canon_sha256":"dc511c83a58a9e6b085655593dbaca15cae8e3e21896a800cc07f1f4e429f08a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:32.744838Z","signature_b64":"tjEcJZSImNV67ECzEd0vunefweJLn3/xqeaGKy3aQ1qU7Fk9e4vk59Nr7Ru5Cew96n4qESkMuVDYQXkkgFZhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6349372974da9f752d14f6de7c0743ce8c4d35a7dbddfcfddb685b4d37a1d890","last_reissued_at":"2026-05-18T04:04:32.744110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:32.744110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Order-theoretic Characterisation of the Polytime Computable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Georg Moser, Martin Avanzini, Naohi Eguchi","submitted_at":"2012-01-12T12:57:40Z","abstract_excerpt":"We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function gives rise to a rewrite system that is compatible with sPOP*. On the other hand any function defined by a rewrite system compatible with sPOP* is polynomial time computable. Technically sPOP* is a tamed recursive path order with product status. Its distinctive feature is the precise control provided. For any rewrite system that is compatible with sPOP* that mak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2553","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.2553","created_at":"2026-05-18T04:04:32.744219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2553v2","created_at":"2026-05-18T04:04:32.744219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2553","created_at":"2026-05-18T04:04:32.744219+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNETOKLU3KPX","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNETOKLU3KPXKLIU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNETOKLU","created_at":"2026-05-18T12:27:14.488303+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/MNETOKLU3KPXKLIU63PHYB2DZ2","json":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2.json","graph_json":"https://pith.science/api/pith-number/MNETOKLU3KPXKLIU63PHYB2DZ2/graph.json","events_json":"https://pith.science/api/pith-number/MNETOKLU3KPXKLIU63PHYB2DZ2/events.json","paper":"https://pith.science/paper/MNETOKLU"},"agent_actions":{"view_html":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2","download_json":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2.json","view_paper":"https://pith.science/paper/MNETOKLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2553&json=true","fetch_graph":"https://pith.science/api/pith-number/MNETOKLU3KPXKLIU63PHYB2DZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/MNETOKLU3KPXKLIU63PHYB2DZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/action/storage_attestation","attest_author":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/action/author_attestation","sign_citation":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/action/citation_signature","submit_replication":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/action/replication_record"}},"created_at":"2026-05-18T04:04:32.744219+00:00","updated_at":"2026-05-18T04:04:32.744219+00:00"}