{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MNETOKLU3KPXKLIU63PHYB2DZ2","short_pith_number":"pith:MNETOKLU","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"},"canonical_sha256":"6349372974da9f752d14f6de7c0743ce8c4d35a7dbddfcfddb685b4d37a1d890","source":{"kind":"arxiv","id":"1201.2553","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2553","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2553v2","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2553","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"MNETOKLU3KPX","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MNETOKLU3KPXKLIU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MNETOKLU","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MNETOKLU3KPXKLIU63PHYB2DZ2","target":"record","payload":{"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"},"canonical_sha256":"6349372974da9f752d14f6de7c0743ce8c4d35a7dbddfcfddb685b4d37a1d890","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"},"source_kind":"arxiv","source_id":"1201.2553","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-18T04:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCPZ/CRowRK3IA4QFZDg1Pa3B4729DvQKLaZ8N1GjLuoHOu8Z5UGk4JatQNwvdSfz6eOLMKOes4Zli6ojCAHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:59:11.581424Z"},"content_sha256":"2b35146b85aa180623ef6e2b409d4012c1033cdde2ef00a8cf8e088c3da17767","schema_version":"1.0","event_id":"sha256:2b35146b85aa180623ef6e2b409d4012c1033cdde2ef00a8cf8e088c3da17767"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MNETOKLU3KPXKLIU63PHYB2DZ2","target":"graph","payload":{"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"},"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:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teLep05hYUZFptUDumVwCmzRLyjZsXZJvqM3nlEWICnNWG4IOIlaZ9XZEW0gwLQz/ZqEqKb6dKmC1KVzi/ovCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:59:11.581780Z"},"content_sha256":"9e4984f30ba0b70b17483979a6d3fcd4ff22fca5438b6265d1d9bd028b457fc5","schema_version":"1.0","event_id":"sha256:9e4984f30ba0b70b17483979a6d3fcd4ff22fca5438b6265d1d9bd028b457fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/bundle.json","state_url":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/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-05-21T07:59:11Z","links":{"resolver":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2","bundle":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/bundle.json","state":"https://pith.science/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNETOKLU3KPXKLIU63PHYB2DZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MNETOKLU3KPXKLIU63PHYB2DZ2","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":"dc511c83a58a9e6b085655593dbaca15cae8e3e21896a800cc07f1f4e429f08a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-12T12:57:40Z","title_canon_sha256":"489a6e5880e250400778a8b78c3a28d9ba7de5a92127b4911ff33e24c54f664f"},"schema_version":"1.0","source":{"id":"1201.2553","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2553","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2553v2","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2553","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"MNETOKLU3KPX","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MNETOKLU3KPXKLIU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MNETOKLU","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9e4984f30ba0b70b17483979a6d3fcd4ff22fca5438b6265d1d9bd028b457fc5","target":"graph","created_at":"2026-05-18T04:04:32Z","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":"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","authors_text":"Georg Moser, Martin Avanzini, Naohi Eguchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-12T12:57:40Z","title":"A New Order-theoretic Characterisation of the Polytime Computable Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2553","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:2b35146b85aa180623ef6e2b409d4012c1033cdde2ef00a8cf8e088c3da17767","target":"record","created_at":"2026-05-18T04:04:32Z","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":"dc511c83a58a9e6b085655593dbaca15cae8e3e21896a800cc07f1f4e429f08a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-12T12:57:40Z","title_canon_sha256":"489a6e5880e250400778a8b78c3a28d9ba7de5a92127b4911ff33e24c54f664f"},"schema_version":"1.0","source":{"id":"1201.2553","kind":"arxiv","version":2}},"canonical_sha256":"6349372974da9f752d14f6de7c0743ce8c4d35a7dbddfcfddb685b4d37a1d890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6349372974da9f752d14f6de7c0743ce8c4d35a7dbddfcfddb685b4d37a1d890","first_computed_at":"2026-05-18T04:04:32.744110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:32.744110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tjEcJZSImNV67ECzEd0vunefweJLn3/xqeaGKy3aQ1qU7Fk9e4vk59Nr7Ru5Cew96n4qESkMuVDYQXkkgFZhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:32.744838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2553","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b35146b85aa180623ef6e2b409d4012c1033cdde2ef00a8cf8e088c3da17767","sha256:9e4984f30ba0b70b17483979a6d3fcd4ff22fca5438b6265d1d9bd028b457fc5"],"state_sha256":"4d512ab55465baf09d1a7e2415ddbc809481f77260603691d378c464748a5410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJd+MeROQN2UpfZNSsxCb1tPAkBJimKn2kDgyltBiU5RBNb9C1ISQSfIotA//eTje5KR+mexLtwjvaZzF/fFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T07:59:11.583744Z","bundle_sha256":"bc34b628d4347c903b224e0537f2c8b5314c1f4374bb4e4a179b8b8851881cb5"}}