{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:43T3GQOUJQRZUDGOLPXXWNGNMN","short_pith_number":"pith:43T3GQOU","canonical_record":{"source":{"id":"1109.4357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-20T16:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"140dbb98853b38c00e684b0ad02d21e67ca7d2551771528aba55f2bb6c509ebe","abstract_canon_sha256":"8cacca32a98da0c36cf0a192c7dc7ae3e16ae8c325fc51cf90537c0f8ea41021"},"schema_version":"1.0"},"canonical_sha256":"e6e7b341d44c239a0cce5bef7b34cd637e5f9e74df74657e32903f59a61b80df","source":{"kind":"arxiv","id":"1109.4357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4357","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4357v1","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4357","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"43T3GQOUJQRZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"43T3GQOUJQRZUDGO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"43T3GQOU","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:43T3GQOUJQRZUDGOLPXXWNGNMN","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-20T16:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"140dbb98853b38c00e684b0ad02d21e67ca7d2551771528aba55f2bb6c509ebe","abstract_canon_sha256":"8cacca32a98da0c36cf0a192c7dc7ae3e16ae8c325fc51cf90537c0f8ea41021"},"schema_version":"1.0"},"canonical_sha256":"e6e7b341d44c239a0cce5bef7b34cd637e5f9e74df74657e32903f59a61b80df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:43.457269Z","signature_b64":"D/G1YlFgz3rmQXK2L4AQNnxpVlko4bD3q9C8LaDTF9/xKtb3DpIUD3Vb/7UZkqv3HzYDEwcHVGfct8I0njnuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e7b341d44c239a0cce5bef7b34cd637e5f9e74df74657e32903f59a61b80df","last_reissued_at":"2026-05-18T04:12:43.456703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:43.456703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4357","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2yMh0dTKstv6pTySqTPZZXKcULghSYDvf6Cq8BoJrxFQtyzm5d1TphM5qbUO2sx/Scdx7UGnYyA0O0SPgIhyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:23:10.293627Z"},"content_sha256":"95256e0a7dc3d55b7111e77e0a565124b5c77991f660da184f99f31dc6cc9148","schema_version":"1.0","event_id":"sha256:95256e0a7dc3d55b7111e77e0a565124b5c77991f660da184f99f31dc6cc9148"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:43T3GQOUJQRZUDGOLPXXWNGNMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Argument filterings and usable rules in 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, Sho Suzuki","submitted_at":"2011-09-20T16:59:48Z","abstract_excerpt":"The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed lambda-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4357","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWm/a1/c20yCiyw9VZ9nVOuB3nzEWI0C394iu2mdVx+DTO/WH30XwKCMWyxb/EKtUb6KoA12AU9xn5cPhNTRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:23:10.294240Z"},"content_sha256":"0c14b70a353d4104fbf233234911f43c15bfd7d6bf6a2019a09a9d9d18399fff","schema_version":"1.0","event_id":"sha256:0c14b70a353d4104fbf233234911f43c15bfd7d6bf6a2019a09a9d9d18399fff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/bundle.json","state_url":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/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-11T22:23:10Z","links":{"resolver":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN","bundle":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/bundle.json","state":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:43T3GQOUJQRZUDGOLPXXWNGNMN","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":"8cacca32a98da0c36cf0a192c7dc7ae3e16ae8c325fc51cf90537c0f8ea41021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-20T16:59:48Z","title_canon_sha256":"140dbb98853b38c00e684b0ad02d21e67ca7d2551771528aba55f2bb6c509ebe"},"schema_version":"1.0","source":{"id":"1109.4357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4357","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4357v1","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4357","created_at":"2026-05-18T04:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"43T3GQOUJQRZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"43T3GQOUJQRZUDGO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"43T3GQOU","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:0c14b70a353d4104fbf233234911f43c15bfd7d6bf6a2019a09a9d9d18399fff","target":"graph","created_at":"2026-05-18T04:12:43Z","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":"The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed lambda-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filteri","authors_text":"Fr\\'ed\\'eric Blanqui (LIAMA), Keiichirou Kusakari, Sho Suzuki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-20T16:59:48Z","title":"Argument filterings and usable rules in higher-order rewrite systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4357","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:95256e0a7dc3d55b7111e77e0a565124b5c77991f660da184f99f31dc6cc9148","target":"record","created_at":"2026-05-18T04:12:43Z","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":"8cacca32a98da0c36cf0a192c7dc7ae3e16ae8c325fc51cf90537c0f8ea41021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-20T16:59:48Z","title_canon_sha256":"140dbb98853b38c00e684b0ad02d21e67ca7d2551771528aba55f2bb6c509ebe"},"schema_version":"1.0","source":{"id":"1109.4357","kind":"arxiv","version":1}},"canonical_sha256":"e6e7b341d44c239a0cce5bef7b34cd637e5f9e74df74657e32903f59a61b80df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6e7b341d44c239a0cce5bef7b34cd637e5f9e74df74657e32903f59a61b80df","first_computed_at":"2026-05-18T04:12:43.456703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:43.456703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D/G1YlFgz3rmQXK2L4AQNnxpVlko4bD3q9C8LaDTF9/xKtb3DpIUD3Vb/7UZkqv3HzYDEwcHVGfct8I0njnuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:43.457269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95256e0a7dc3d55b7111e77e0a565124b5c77991f660da184f99f31dc6cc9148","sha256:0c14b70a353d4104fbf233234911f43c15bfd7d6bf6a2019a09a9d9d18399fff"],"state_sha256":"70add528cda0eb1d1c009192484cb9a9753058a7b9bd7e478b8ed32832341615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJGbu579nfliSTF2ooVGxx/EvJ74I7Jflz6MuHbfULqqHo137m95iLdjVqZ3DoRQ/DJSuV7qMPcfUB0rsIuUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:23:10.297661Z","bundle_sha256":"a3a2b9684c20ef2450c4dd517f804ccff83797211b0cfef5334a9ce4991d1c13"}}