{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E5R53J75D5EZS4BBGWOXIIRHGP","short_pith_number":"pith:E5R53J75","canonical_record":{"source":{"id":"1805.09390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-23T19:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"1ab2951ec25870d03c095e596e742ef853144052086cbb60002a4c2499f021da","abstract_canon_sha256":"03401e4122ff20bcfce14319c433d2a4bf184bd74163347bf2b16dcfd7fbd847"},"schema_version":"1.0"},"canonical_sha256":"2763dda7fd1f49997021359d74222733cfcf8ad0ea4dea13039444b1d660c8b1","source":{"kind":"arxiv","id":"1805.09390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09390","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09390v1","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09390","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"E5R53J75D5EZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5R53J75D5EZS4BB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5R53J75","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E5R53J75D5EZS4BBGWOXIIRHGP","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-23T19:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"1ab2951ec25870d03c095e596e742ef853144052086cbb60002a4c2499f021da","abstract_canon_sha256":"03401e4122ff20bcfce14319c433d2a4bf184bd74163347bf2b16dcfd7fbd847"},"schema_version":"1.0"},"canonical_sha256":"2763dda7fd1f49997021359d74222733cfcf8ad0ea4dea13039444b1d660c8b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:04.182671Z","signature_b64":"/vdfvc5DlvJ+jcZrwktIs5SDxz/BfZi1JB2rCAsuh9bxcAyMwgHi6p5Ly11bxbwOxE9Np7LOBZrpSUVYSQNFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2763dda7fd1f49997021359d74222733cfcf8ad0ea4dea13039444b1d660c8b1","last_reissued_at":"2026-05-18T00:15:04.182035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:04.182035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09390","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-18T00:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bKmJUbHGnmusmWUhrQghuBAERLnfmejXHJn8xJVsPWAV9mIGji+7P05ybHT6/y/iWnWL57vbo7t4OsWBMx1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:21:41.570979Z"},"content_sha256":"4dec450cc54551dd45e70b9252646f17a784e25105abb7cb81ecefdaf0f50945","schema_version":"1.0","event_id":"sha256:4dec450cc54551dd45e70b9252646f17a784e25105abb7cb81ecefdaf0f50945"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E5R53J75D5EZS4BBGWOXIIRHGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The unified higher-order dependency pair framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carsten Fuhs, Cynthia Kop","submitted_at":"2018-05-23T19:21:16Z","abstract_excerpt":"In recent years, two higher-order extensions of the powerful dependency pair approach for termination analysis of first-order term rewriting have been defined: the static and the dynamic approach. Both approaches offer distinct advantages and disadvantages. However, a grand unifying theory is thus far missing, and both approaches lack the modularity present in the dependency pair framework commonly used in first-order rewriting. Moreover, neither approach can be used to prove non-termination.\n  In this paper, we aim to address this gap by defining a higher-order dependency pair framework, inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09390","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-18T00:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqepYWRewZmDZfop3HyqIgtkH4aQBOpMqtyI7Sl1H+ZDFxPNxki0vvgXB+7PhBtGkGd0W0wvLmvG91JdSH62CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:21:41.571585Z"},"content_sha256":"39bf2c463e182e23886d0453542049f4c6f98074e55a5b57e931129fda5f71f1","schema_version":"1.0","event_id":"sha256:39bf2c463e182e23886d0453542049f4c6f98074e55a5b57e931129fda5f71f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5R53J75D5EZS4BBGWOXIIRHGP/bundle.json","state_url":"https://pith.science/pith/E5R53J75D5EZS4BBGWOXIIRHGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5R53J75D5EZS4BBGWOXIIRHGP/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-25T09:21:41Z","links":{"resolver":"https://pith.science/pith/E5R53J75D5EZS4BBGWOXIIRHGP","bundle":"https://pith.science/pith/E5R53J75D5EZS4BBGWOXIIRHGP/bundle.json","state":"https://pith.science/pith/E5R53J75D5EZS4BBGWOXIIRHGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5R53J75D5EZS4BBGWOXIIRHGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E5R53J75D5EZS4BBGWOXIIRHGP","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":"03401e4122ff20bcfce14319c433d2a4bf184bd74163347bf2b16dcfd7fbd847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-23T19:21:16Z","title_canon_sha256":"1ab2951ec25870d03c095e596e742ef853144052086cbb60002a4c2499f021da"},"schema_version":"1.0","source":{"id":"1805.09390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09390","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09390v1","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09390","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"E5R53J75D5EZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5R53J75D5EZS4BB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5R53J75","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:39bf2c463e182e23886d0453542049f4c6f98074e55a5b57e931129fda5f71f1","target":"graph","created_at":"2026-05-18T00:15:04Z","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":"In recent years, two higher-order extensions of the powerful dependency pair approach for termination analysis of first-order term rewriting have been defined: the static and the dynamic approach. Both approaches offer distinct advantages and disadvantages. However, a grand unifying theory is thus far missing, and both approaches lack the modularity present in the dependency pair framework commonly used in first-order rewriting. Moreover, neither approach can be used to prove non-termination.\n  In this paper, we aim to address this gap by defining a higher-order dependency pair framework, inte","authors_text":"Carsten Fuhs, Cynthia Kop","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-23T19:21:16Z","title":"The unified higher-order dependency pair framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09390","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:4dec450cc54551dd45e70b9252646f17a784e25105abb7cb81ecefdaf0f50945","target":"record","created_at":"2026-05-18T00:15:04Z","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":"03401e4122ff20bcfce14319c433d2a4bf184bd74163347bf2b16dcfd7fbd847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-23T19:21:16Z","title_canon_sha256":"1ab2951ec25870d03c095e596e742ef853144052086cbb60002a4c2499f021da"},"schema_version":"1.0","source":{"id":"1805.09390","kind":"arxiv","version":1}},"canonical_sha256":"2763dda7fd1f49997021359d74222733cfcf8ad0ea4dea13039444b1d660c8b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2763dda7fd1f49997021359d74222733cfcf8ad0ea4dea13039444b1d660c8b1","first_computed_at":"2026-05-18T00:15:04.182035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:04.182035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/vdfvc5DlvJ+jcZrwktIs5SDxz/BfZi1JB2rCAsuh9bxcAyMwgHi6p5Ly11bxbwOxE9Np7LOBZrpSUVYSQNFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:04.182671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dec450cc54551dd45e70b9252646f17a784e25105abb7cb81ecefdaf0f50945","sha256:39bf2c463e182e23886d0453542049f4c6f98074e55a5b57e931129fda5f71f1"],"state_sha256":"c06f19504c9a4d1a31cc5213ace4b918bb13bc10d8f7dbcb806d1e06ccded9e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkKR0HReadaXC5crnplIrdY5bYEq843mhy6xiJesj3x74SGYcMmXMmQH+v+vM3SCctJYbkcrUtwVQH230AzFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:21:41.574304Z","bundle_sha256":"d2e8e6b33ecb50a657890b45293aaa5248267ffcefdad692a2688053d034c8ec"}}