{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MEWTAIU2L3QZPXEDDDO44AX2IP","short_pith_number":"pith:MEWTAIU2","canonical_record":{"source":{"id":"1109.5468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-26T07:50:07Z","cross_cats_sorted":[],"title_canon_sha256":"3fb2a6d331df30acd53943189dab5cf3b06c77232a803575f4038cbc346aadc3","abstract_canon_sha256":"62dd6c6b2468e9a11b2de434d5a7d65391f6fee78976eaec812fb85bc7440941"},"schema_version":"1.0"},"canonical_sha256":"612d30229a5ee197dc8318ddce02fa43d4c838cf3981fa62fbbcf5abe64a9f92","source":{"kind":"arxiv","id":"1109.5468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5468","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5468v1","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5468","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"MEWTAIU2L3QZ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MEWTAIU2L3QZPXED","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MEWTAIU2","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MEWTAIU2L3QZPXEDDDO44AX2IP","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-26T07:50:07Z","cross_cats_sorted":[],"title_canon_sha256":"3fb2a6d331df30acd53943189dab5cf3b06c77232a803575f4038cbc346aadc3","abstract_canon_sha256":"62dd6c6b2468e9a11b2de434d5a7d65391f6fee78976eaec812fb85bc7440941"},"schema_version":"1.0"},"canonical_sha256":"612d30229a5ee197dc8318ddce02fa43d4c838cf3981fa62fbbcf5abe64a9f92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:19.731389Z","signature_b64":"7OaA3vP++Ml1N28T8A00LllD8Z9shEdNEcWyBhfH9l7CW8U7F7mhK5RGKHI1Ie7krVtw2EY7GLF1MK/T1TpqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"612d30229a5ee197dc8318ddce02fa43d4c838cf3981fa62fbbcf5abe64a9f92","last_reissued_at":"2026-05-18T04:12:19.730909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:19.730909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5468","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:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ypwg6MxkU69hqPrm1+ykhofEKqcXMEYzSue9r+iKInJ/kzI9cKVqdZRxkjG3ObWzvO5tURVfhmwGIR8LKaEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:29:59.478899Z"},"content_sha256":"153e010a4046a0853d05b89d4a18d0be201dad858ec1991e8bf287ac654660fe","schema_version":"1.0","event_id":"sha256:153e010a4046a0853d05b89d4a18d0be201dad858ec1991e8bf287ac654660fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MEWTAIU2L3QZPXEDDDO44AX2IP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fr\\'ed\\'eric Blanqui (LIAMA), Keiichirou Kusakari, Masahiko Sakai, Yasuo Isogai","submitted_at":"2011-09-26T07:50:07Z","abstract_excerpt":"Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include \\lambda-abstraction but STRSs do not, we restructure the static dependency pair method to allow \\lambda-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5468","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:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/8g7fAUUqXC5lO5aUITH8X+dc1SUC7Y55mU1B6cIc9kFxW2w86ozLfRyZrzsu24yHTTgCNP7/exRywPayKJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:29:59.479453Z"},"content_sha256":"fcb1e798f666e92302b5d58a2af27d2769e162a791ed19490c982eb3121d0d00","schema_version":"1.0","event_id":"sha256:fcb1e798f666e92302b5d58a2af27d2769e162a791ed19490c982eb3121d0d00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEWTAIU2L3QZPXEDDDO44AX2IP/bundle.json","state_url":"https://pith.science/pith/MEWTAIU2L3QZPXEDDDO44AX2IP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEWTAIU2L3QZPXEDDDO44AX2IP/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-11T23:29:59Z","links":{"resolver":"https://pith.science/pith/MEWTAIU2L3QZPXEDDDO44AX2IP","bundle":"https://pith.science/pith/MEWTAIU2L3QZPXEDDDO44AX2IP/bundle.json","state":"https://pith.science/pith/MEWTAIU2L3QZPXEDDDO44AX2IP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEWTAIU2L3QZPXEDDDO44AX2IP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MEWTAIU2L3QZPXEDDDO44AX2IP","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":"62dd6c6b2468e9a11b2de434d5a7d65391f6fee78976eaec812fb85bc7440941","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-26T07:50:07Z","title_canon_sha256":"3fb2a6d331df30acd53943189dab5cf3b06c77232a803575f4038cbc346aadc3"},"schema_version":"1.0","source":{"id":"1109.5468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5468","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5468v1","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5468","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"MEWTAIU2L3QZ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MEWTAIU2L3QZPXED","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MEWTAIU2","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:fcb1e798f666e92302b5d58a2af27d2769e162a791ed19490c982eb3121d0d00","target":"graph","created_at":"2026-05-18T04:12:19Z","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":"Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include \\lambda-abstraction but STRSs do not, we restructure the static dependency pair method to allow \\lambda-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.","authors_text":"Fr\\'ed\\'eric Blanqui (LIAMA), Keiichirou Kusakari, Masahiko Sakai, Yasuo Isogai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-26T07:50:07Z","title":"Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5468","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:153e010a4046a0853d05b89d4a18d0be201dad858ec1991e8bf287ac654660fe","target":"record","created_at":"2026-05-18T04:12:19Z","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":"62dd6c6b2468e9a11b2de434d5a7d65391f6fee78976eaec812fb85bc7440941","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-26T07:50:07Z","title_canon_sha256":"3fb2a6d331df30acd53943189dab5cf3b06c77232a803575f4038cbc346aadc3"},"schema_version":"1.0","source":{"id":"1109.5468","kind":"arxiv","version":1}},"canonical_sha256":"612d30229a5ee197dc8318ddce02fa43d4c838cf3981fa62fbbcf5abe64a9f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"612d30229a5ee197dc8318ddce02fa43d4c838cf3981fa62fbbcf5abe64a9f92","first_computed_at":"2026-05-18T04:12:19.730909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:19.730909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OaA3vP++Ml1N28T8A00LllD8Z9shEdNEcWyBhfH9l7CW8U7F7mhK5RGKHI1Ie7krVtw2EY7GLF1MK/T1TpqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:19.731389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:153e010a4046a0853d05b89d4a18d0be201dad858ec1991e8bf287ac654660fe","sha256:fcb1e798f666e92302b5d58a2af27d2769e162a791ed19490c982eb3121d0d00"],"state_sha256":"08f3ebabc457d32d4c599c4c2a774fa83ef6a99fdffdbe5ec5770cf51708346b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJBWyeUgRER9+Xq6p/y+R9uNz2epEe8yxpRihklPlPHyzpCJktZnJUNNV2MYO0pd/IT0D6gGpCZBqE50xWy9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:29:59.482343Z","bundle_sha256":"ae74585e959f2d86ca1289ce5723e129c567b14c11fb4553908c9a9e32a6352b"}}