{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RKCUVPZPZR3QVBEQX4VZQIHJBC","short_pith_number":"pith:RKCUVPZP","canonical_record":{"source":{"id":"1209.3793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2012-09-17T20:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"a15f1f9d2b4e5fdd8e7dd88156fcb80613c62a5a7c96bbe7af8944db539e0eb4","abstract_canon_sha256":"ff7d3db87ba9c07b98c352f3af375f4e7f77ab0449e3e33649dcf600fc66c90f"},"schema_version":"1.0"},"canonical_sha256":"8a854abf2fcc770a8490bf2b9820e908ac7a1a18a64a7e546ccb4b2de2e47194","source":{"kind":"arxiv","id":"1209.3793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3793","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3793v1","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3793","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"RKCUVPZPZR3Q","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RKCUVPZPZR3QVBEQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RKCUVPZP","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RKCUVPZPZR3QVBEQX4VZQIHJBC","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2012-09-17T20:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"a15f1f9d2b4e5fdd8e7dd88156fcb80613c62a5a7c96bbe7af8944db539e0eb4","abstract_canon_sha256":"ff7d3db87ba9c07b98c352f3af375f4e7f77ab0449e3e33649dcf600fc66c90f"},"schema_version":"1.0"},"canonical_sha256":"8a854abf2fcc770a8490bf2b9820e908ac7a1a18a64a7e546ccb4b2de2e47194","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:22.482486Z","signature_b64":"AuYC297BDuBWx4EoofZVNdtFX5LPkrcq3kyoxGQXunpNwpsJSbSo+b4O0e19/YQ28sR4geqn6T/2jIt8lUHbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a854abf2fcc770a8490bf2b9820e908ac7a1a18a64a7e546ccb4b2de2e47194","last_reissued_at":"2026-05-18T03:45:22.481921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:22.481921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3793","source_version":1,"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-18T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrIwUUy84oKExjp1dcpk93YI7h+y7bmQJ9obkNBEFmPmDIovgeevd9M4ys4k2LjYjQUOYT5oR8t8LWtjKTuyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:46:57.424392Z"},"content_sha256":"e72a7919407a23ca5fc7cdbd99945ea606fd14ade14f1547e489451937f10e9b","schema_version":"1.0","event_id":"sha256:e72a7919407a23ca5fc7cdbd99945ea606fd14ade14f1547e489451937f10e9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RKCUVPZPZR3QVBEQX4VZQIHJBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Path Orders: A Maximal Model","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Georg Moser, Martin Avanzini","submitted_at":"2012-09-17T20:38:54Z","abstract_excerpt":"This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3793","kind":"arxiv","version":1},"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-18T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fa29D6eZnd9e6t8MxdA2GZKjeqgTgxAVuHUlSAMuswmRHqJk48PA76VJjDtuZTWW+HmYTZPCDLzjButv+3n0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:46:57.425008Z"},"content_sha256":"e3b1cca85db339b5439bde020d91d8e32dfe98f70798fd4d8325efd05ff04634","schema_version":"1.0","event_id":"sha256:e3b1cca85db339b5439bde020d91d8e32dfe98f70798fd4d8325efd05ff04634"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC/bundle.json","state_url":"https://pith.science/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC/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-22T00:46:57Z","links":{"resolver":"https://pith.science/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC","bundle":"https://pith.science/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC/bundle.json","state":"https://pith.science/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKCUVPZPZR3QVBEQX4VZQIHJBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RKCUVPZPZR3QVBEQX4VZQIHJBC","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":"ff7d3db87ba9c07b98c352f3af375f4e7f77ab0449e3e33649dcf600fc66c90f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2012-09-17T20:38:54Z","title_canon_sha256":"a15f1f9d2b4e5fdd8e7dd88156fcb80613c62a5a7c96bbe7af8944db539e0eb4"},"schema_version":"1.0","source":{"id":"1209.3793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3793","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3793v1","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3793","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"RKCUVPZPZR3Q","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RKCUVPZPZR3QVBEQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RKCUVPZP","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:e3b1cca85db339b5439bde020d91d8e32dfe98f70798fd4d8325efd05ff04634","target":"graph","created_at":"2026-05-18T03:45:22Z","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":"This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experiment","authors_text":"Georg Moser, Martin Avanzini","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2012-09-17T20:38:54Z","title":"Polynomial Path Orders: A Maximal Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3793","kind":"arxiv","version":1},"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:e72a7919407a23ca5fc7cdbd99945ea606fd14ade14f1547e489451937f10e9b","target":"record","created_at":"2026-05-18T03:45:22Z","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":"ff7d3db87ba9c07b98c352f3af375f4e7f77ab0449e3e33649dcf600fc66c90f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2012-09-17T20:38:54Z","title_canon_sha256":"a15f1f9d2b4e5fdd8e7dd88156fcb80613c62a5a7c96bbe7af8944db539e0eb4"},"schema_version":"1.0","source":{"id":"1209.3793","kind":"arxiv","version":1}},"canonical_sha256":"8a854abf2fcc770a8490bf2b9820e908ac7a1a18a64a7e546ccb4b2de2e47194","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a854abf2fcc770a8490bf2b9820e908ac7a1a18a64a7e546ccb4b2de2e47194","first_computed_at":"2026-05-18T03:45:22.481921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:22.481921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AuYC297BDuBWx4EoofZVNdtFX5LPkrcq3kyoxGQXunpNwpsJSbSo+b4O0e19/YQ28sR4geqn6T/2jIt8lUHbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:22.482486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e72a7919407a23ca5fc7cdbd99945ea606fd14ade14f1547e489451937f10e9b","sha256:e3b1cca85db339b5439bde020d91d8e32dfe98f70798fd4d8325efd05ff04634"],"state_sha256":"3e0c873db996318ea570ee788e4a18a702a5d6d74b40e5a35aeef0d3191c2fec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ve4C5C05xOjKqawcHGTk149B/ULy914vsFi2lbZCuy0OH2xlB1PQooQZHUGSbZG6/HtJRwQLlNExUgzrrFJQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:46:57.428297Z","bundle_sha256":"2f887c2b1b61979acecbd13f5a0ef3f523e159b3c5387f7364b7629e4dac25b9"}}