{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JDDEZGAG7YOMFQPCT6L3FPSWNP","short_pith_number":"pith:JDDEZGAG","schema_version":"1.0","canonical_sha256":"48c64c9806fe1cc2c1e29f97b2be566bc3c95af4ce205f984a88157414a9cbc0","source":{"kind":"arxiv","id":"2208.13428","version":5},"attestation_state":"computed","paper":{"title":"Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrej Dudenhefner","submitted_at":"2022-08-29T08:52:21Z","abstract_excerpt":"Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality (existence of a diverging configuration). The particular Turing reduction is intricate, uses non-computational principles, and involves various intermediate models of computation. The present work gives a constructive many-one reduction from the Turing machine halting problem to semi-unification. This establishes RE-completeness of semi-unification under ma"},"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":"2208.13428","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-08-29T08:52:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1ebe9d0e5d739eefc13175b77caa4a32ef54446ed91188aa4fc087f56eadc69","abstract_canon_sha256":"805b454d1a376023d284c8338422b9eef3b804aafea9e648c0cb79050f5f4bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:40.529464Z","signature_b64":"RYmJgYWfmhHnVYtKy8wEa7dO+4OOs8dB5FhrPIIpiXqj5tFj5orkc6b6bjnoQsI83t5/8ywCpYJPZDPEN9AdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c64c9806fe1cc2c1e29f97b2be566bc3c95af4ce205f984a88157414a9cbc0","last_reissued_at":"2026-07-05T07:44:40.529091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:40.529091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrej Dudenhefner","submitted_at":"2022-08-29T08:52:21Z","abstract_excerpt":"Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality (existence of a diverging configuration). The particular Turing reduction is intricate, uses non-computational principles, and involves various intermediate models of computation. The present work gives a constructive many-one reduction from the Turing machine halting problem to semi-unification. This establishes RE-completeness of semi-unification under ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13428","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.13428/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.13428","created_at":"2026-07-05T07:44:40.529150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.13428v5","created_at":"2026-07-05T07:44:40.529150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13428","created_at":"2026-07-05T07:44:40.529150+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDDEZGAG7YOM","created_at":"2026-07-05T07:44:40.529150+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDDEZGAG7YOMFQPC","created_at":"2026-07-05T07:44:40.529150+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDDEZGAG","created_at":"2026-07-05T07:44:40.529150+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/JDDEZGAG7YOMFQPCT6L3FPSWNP","json":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP.json","graph_json":"https://pith.science/api/pith-number/JDDEZGAG7YOMFQPCT6L3FPSWNP/graph.json","events_json":"https://pith.science/api/pith-number/JDDEZGAG7YOMFQPCT6L3FPSWNP/events.json","paper":"https://pith.science/paper/JDDEZGAG"},"agent_actions":{"view_html":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP","download_json":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP.json","view_paper":"https://pith.science/paper/JDDEZGAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.13428&json=true","fetch_graph":"https://pith.science/api/pith-number/JDDEZGAG7YOMFQPCT6L3FPSWNP/graph.json","fetch_events":"https://pith.science/api/pith-number/JDDEZGAG7YOMFQPCT6L3FPSWNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/action/storage_attestation","attest_author":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/action/author_attestation","sign_citation":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/action/citation_signature","submit_replication":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/action/replication_record"}},"created_at":"2026-07-05T07:44:40.529150+00:00","updated_at":"2026-07-05T07:44:40.529150+00:00"}