{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:43T3GQOUJQRZUDGOLPXXWNGNMN","short_pith_number":"pith:43T3GQOU","schema_version":"1.0","canonical_sha256":"e6e7b341d44c239a0cce5bef7b34cd637e5f9e74df74657e32903f59a61b80df","source":{"kind":"arxiv","id":"1109.4357","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.4357","created_at":"2026-05-18T04:12:43.456797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4357v1","created_at":"2026-05-18T04:12:43.456797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4357","created_at":"2026-05-18T04:12:43.456797+00:00"},{"alias_kind":"pith_short_12","alias_value":"43T3GQOUJQRZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"43T3GQOUJQRZUDGO","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"43T3GQOU","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN","json":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN.json","graph_json":"https://pith.science/api/pith-number/43T3GQOUJQRZUDGOLPXXWNGNMN/graph.json","events_json":"https://pith.science/api/pith-number/43T3GQOUJQRZUDGOLPXXWNGNMN/events.json","paper":"https://pith.science/paper/43T3GQOU"},"agent_actions":{"view_html":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN","download_json":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN.json","view_paper":"https://pith.science/paper/43T3GQOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4357&json=true","fetch_graph":"https://pith.science/api/pith-number/43T3GQOUJQRZUDGOLPXXWNGNMN/graph.json","fetch_events":"https://pith.science/api/pith-number/43T3GQOUJQRZUDGOLPXXWNGNMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/action/storage_attestation","attest_author":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/action/author_attestation","sign_citation":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/action/citation_signature","submit_replication":"https://pith.science/pith/43T3GQOUJQRZUDGOLPXXWNGNMN/action/replication_record"}},"created_at":"2026-05-18T04:12:43.456797+00:00","updated_at":"2026-05-18T04:12:43.456797+00:00"}