{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JDDEZGAG7YOMFQPCT6L3FPSWNP","short_pith_number":"pith:JDDEZGAG","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"},"canonical_sha256":"48c64c9806fe1cc2c1e29f97b2be566bc3c95af4ce205f984a88157414a9cbc0","source":{"kind":"arxiv","id":"2208.13428","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13428","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13428v5","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13428","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"JDDEZGAG7YOM","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"pith_short_16","alias_value":"JDDEZGAG7YOMFQPC","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"pith_short_8","alias_value":"JDDEZGAG","created_at":"2026-07-05T07:44:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JDDEZGAG7YOMFQPCT6L3FPSWNP","target":"record","payload":{"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"},"canonical_sha256":"48c64c9806fe1cc2c1e29f97b2be566bc3c95af4ce205f984a88157414a9cbc0","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"},"source_kind":"arxiv","source_id":"2208.13428","source_version":5,"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-07-05T07:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krfP9XDg5wQtWkrV7SAi03uvYAJfacx+iLGCN0d0s+9kM6BKTl3aQb/c7/cAZ1CwXTaWq0rorKjgzfm9MempBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:50:16.977569Z"},"content_sha256":"5a21e47f662d55854e1121ba8ee4a822a6e65b403af4a7f85afe0d813fd020b3","schema_version":"1.0","event_id":"sha256:5a21e47f662d55854e1121ba8ee4a822a6e65b403af4a7f85afe0d813fd020b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JDDEZGAG7YOMFQPCT6L3FPSWNP","target":"graph","payload":{"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"},"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-07-05T07:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBgyK0+/5hbK0AOMvp+R2SRPN+Q2IO+HjEBYvZPYwnQFdwaCKzPcWByGG0d16fqkC1ku3gzzPDI7yCmUhMPjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:50:16.978208Z"},"content_sha256":"68c4d605252d374a941f1585608d110b97209eebea521686ad6ffb56d9a8c2b3","schema_version":"1.0","event_id":"sha256:68c4d605252d374a941f1585608d110b97209eebea521686ad6ffb56d9a8c2b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/bundle.json","state_url":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/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-07-07T05:50:16Z","links":{"resolver":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP","bundle":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/bundle.json","state":"https://pith.science/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDDEZGAG7YOMFQPCT6L3FPSWNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JDDEZGAG7YOMFQPCT6L3FPSWNP","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":"805b454d1a376023d284c8338422b9eef3b804aafea9e648c0cb79050f5f4bf0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-08-29T08:52:21Z","title_canon_sha256":"b1ebe9d0e5d739eefc13175b77caa4a32ef54446ed91188aa4fc087f56eadc69"},"schema_version":"1.0","source":{"id":"2208.13428","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13428","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13428v5","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13428","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"JDDEZGAG7YOM","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"pith_short_16","alias_value":"JDDEZGAG7YOMFQPC","created_at":"2026-07-05T07:44:40Z"},{"alias_kind":"pith_short_8","alias_value":"JDDEZGAG","created_at":"2026-07-05T07:44:40Z"}],"graph_snapshots":[{"event_id":"sha256:68c4d605252d374a941f1585608d110b97209eebea521686ad6ffb56d9a8c2b3","target":"graph","created_at":"2026-07-05T07:44:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.13428/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrej Dudenhefner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-08-29T08:52:21Z","title":"Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13428","kind":"arxiv","version":5},"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:5a21e47f662d55854e1121ba8ee4a822a6e65b403af4a7f85afe0d813fd020b3","target":"record","created_at":"2026-07-05T07:44:40Z","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":"805b454d1a376023d284c8338422b9eef3b804aafea9e648c0cb79050f5f4bf0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-08-29T08:52:21Z","title_canon_sha256":"b1ebe9d0e5d739eefc13175b77caa4a32ef54446ed91188aa4fc087f56eadc69"},"schema_version":"1.0","source":{"id":"2208.13428","kind":"arxiv","version":5}},"canonical_sha256":"48c64c9806fe1cc2c1e29f97b2be566bc3c95af4ce205f984a88157414a9cbc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48c64c9806fe1cc2c1e29f97b2be566bc3c95af4ce205f984a88157414a9cbc0","first_computed_at":"2026-07-05T07:44:40.529091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:40.529091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYmJgYWfmhHnVYtKy8wEa7dO+4OOs8dB5FhrPIIpiXqj5tFj5orkc6b6bjnoQsI83t5/8ywCpYJPZDPEN9AdBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:40.529464Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.13428","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a21e47f662d55854e1121ba8ee4a822a6e65b403af4a7f85afe0d813fd020b3","sha256:68c4d605252d374a941f1585608d110b97209eebea521686ad6ffb56d9a8c2b3"],"state_sha256":"6d99ce6172af3cfdbbe12172c00fec93b9d0bade98b9f5cae2ed55d42a572f80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V0a8iSPA4+jXU08IwFO2+lH/DqJocDI8Ojl8kZQvF5sPFlSG0/p4RzEj1Q5FPZRj0M+OIwCNRJRywNFxl95kBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:50:16.981697Z","bundle_sha256":"18f04aa764ff52861b3e55d8cd93d368c361509d9fb08938c558c28dff823878"}}