{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NG5JY4QJAU4LEIE4VUQRRAJ42S","short_pith_number":"pith:NG5JY4QJ","canonical_record":{"source":{"id":"1103.5082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T21:00:46Z","cross_cats_sorted":[],"title_canon_sha256":"191450ddb4c922d6970124258f46b8a2e8ce4327eb4bb831537b8148c4192a21","abstract_canon_sha256":"ad1e926a9ad8df327d5328fa41f2df197b42fd7cef9f7d1a668d980795d74484"},"schema_version":"1.0"},"canonical_sha256":"69ba9c72090538b2209cad2118813cd482620392e6482644cdecb4a96f1551af","source":{"kind":"arxiv","id":"1103.5082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5082","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5082v1","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5082","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"NG5JY4QJAU4L","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NG5JY4QJAU4LEIE4","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NG5JY4QJ","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NG5JY4QJAU4LEIE4VUQRRAJ42S","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T21:00:46Z","cross_cats_sorted":[],"title_canon_sha256":"191450ddb4c922d6970124258f46b8a2e8ce4327eb4bb831537b8148c4192a21","abstract_canon_sha256":"ad1e926a9ad8df327d5328fa41f2df197b42fd7cef9f7d1a668d980795d74484"},"schema_version":"1.0"},"canonical_sha256":"69ba9c72090538b2209cad2118813cd482620392e6482644cdecb4a96f1551af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:38.667021Z","signature_b64":"7x4xQvnYznm0wlhd+eVkhX6O8JEN8yT4wK0Y/Rv3vylrhxuBXnGUats6q5NaOistW81MSz4AkHJ/aIEs9vSPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ba9c72090538b2209cad2118813cd482620392e6482644cdecb4a96f1551af","last_reissued_at":"2026-05-18T04:25:38.666568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:38.666568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5082","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-18T04:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSMEsV7hJED/gC7oaIFFbHvhOGvDHTG+eHM8tWnqxRiQvFk9ChmgdpqWDg6l+It5NZJg9LRC+Dld45BCtFDECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:48:38.620924Z"},"content_sha256":"f34171eea25be69033c8dea109e4bfd368eb44be37881777daf4f98724e3df02","schema_version":"1.0","event_id":"sha256:f34171eea25be69033c8dea109e4bfd368eb44be37881777daf4f98724e3df02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NG5JY4QJAU4LEIE4VUQRRAJ42S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Schnabl, Georg Moser","submitted_at":"2011-03-25T21:00:46Z","abstract_excerpt":"We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs, or the subterm criterion. We show that the derivational complexity of such systems is bounded by a multiple recursive function, provided the derivational complexity induced by the employed base techniques is at most multiple recursive. Moreover we show that this upper bound is tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5082","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-18T04:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5Jtk8dkwoEU4pxdUnNHTU5UivY7mfUiZSJPlZcLfFuLFhS8e69K2B5L3U+0cpF6N5o4yZwKw3sOCpEhPXT5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:48:38.621262Z"},"content_sha256":"59767f9770cee292e87091cd88b320743b07447e55daca0e3f11f84d965fcbd7","schema_version":"1.0","event_id":"sha256:59767f9770cee292e87091cd88b320743b07447e55daca0e3f11f84d965fcbd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S/bundle.json","state_url":"https://pith.science/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S/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-04T21:48:38Z","links":{"resolver":"https://pith.science/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S","bundle":"https://pith.science/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S/bundle.json","state":"https://pith.science/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NG5JY4QJAU4LEIE4VUQRRAJ42S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NG5JY4QJAU4LEIE4VUQRRAJ42S","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":"ad1e926a9ad8df327d5328fa41f2df197b42fd7cef9f7d1a668d980795d74484","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T21:00:46Z","title_canon_sha256":"191450ddb4c922d6970124258f46b8a2e8ce4327eb4bb831537b8148c4192a21"},"schema_version":"1.0","source":{"id":"1103.5082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5082","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5082v1","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5082","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"NG5JY4QJAU4L","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NG5JY4QJAU4LEIE4","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NG5JY4QJ","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:59767f9770cee292e87091cd88b320743b07447e55daca0e3f11f84d965fcbd7","target":"graph","created_at":"2026-05-18T04:25:38Z","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 study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs, or the subterm criterion. We show that the derivational complexity of such systems is bounded by a multiple recursive function, provided the derivational complexity induced by the employed base techniques is at most multiple recursive. Moreover we show that this upper bound is tight.","authors_text":"Andreas Schnabl, Georg Moser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T21:00:46Z","title":"Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5082","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:f34171eea25be69033c8dea109e4bfd368eb44be37881777daf4f98724e3df02","target":"record","created_at":"2026-05-18T04:25:38Z","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":"ad1e926a9ad8df327d5328fa41f2df197b42fd7cef9f7d1a668d980795d74484","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-03-25T21:00:46Z","title_canon_sha256":"191450ddb4c922d6970124258f46b8a2e8ce4327eb4bb831537b8148c4192a21"},"schema_version":"1.0","source":{"id":"1103.5082","kind":"arxiv","version":1}},"canonical_sha256":"69ba9c72090538b2209cad2118813cd482620392e6482644cdecb4a96f1551af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ba9c72090538b2209cad2118813cd482620392e6482644cdecb4a96f1551af","first_computed_at":"2026-05-18T04:25:38.666568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:38.666568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7x4xQvnYznm0wlhd+eVkhX6O8JEN8yT4wK0Y/Rv3vylrhxuBXnGUats6q5NaOistW81MSz4AkHJ/aIEs9vSPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:38.667021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34171eea25be69033c8dea109e4bfd368eb44be37881777daf4f98724e3df02","sha256:59767f9770cee292e87091cd88b320743b07447e55daca0e3f11f84d965fcbd7"],"state_sha256":"140c88daf717ab8bae7294299180deb23f6e95b8534a525e67965069999c00c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEQ9buaZNwwCBAHKs1bA7ooszFGTwg4baq6Ivz6C1tuEwLdfSnTzk/KKdM7JhgUo/7R+XojEBPxO+RtcSvrAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:48:38.623164Z","bundle_sha256":"0950eb62f9595277be07bf147b8e07ef7cadf35ec4c64a152dff48318a7a974a"}}