{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HI7TTZV5F4Y6VJYMZQ23O6K5NY","short_pith_number":"pith:HI7TTZV5","canonical_record":{"source":{"id":"1107.5886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-29T07:15:04Z","cross_cats_sorted":["cs.CC","math.LO"],"title_canon_sha256":"153d73a84438dc0a7f8b52a6e2e58eab9d498af9d6a5b5708befbc806a651ea3","abstract_canon_sha256":"ca1d3d0bf5ad5b981ae45376a05895b68fbab459eeb5771e6b91ba954552ee24"},"schema_version":"1.0"},"canonical_sha256":"3a3f39e6bd2f31eaa70ccc35b7795d6e2970a72b1c53f8b248c122c97de179b4","source":{"kind":"arxiv","id":"1107.5886","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5886","created_at":"2026-05-18T03:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5886v1","created_at":"2026-05-18T03:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5886","created_at":"2026-05-18T03:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"HI7TTZV5F4Y6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HI7TTZV5F4Y6VJYM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HI7TTZV5","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HI7TTZV5F4Y6VJYMZQ23O6K5NY","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-29T07:15:04Z","cross_cats_sorted":["cs.CC","math.LO"],"title_canon_sha256":"153d73a84438dc0a7f8b52a6e2e58eab9d498af9d6a5b5708befbc806a651ea3","abstract_canon_sha256":"ca1d3d0bf5ad5b981ae45376a05895b68fbab459eeb5771e6b91ba954552ee24"},"schema_version":"1.0"},"canonical_sha256":"3a3f39e6bd2f31eaa70ccc35b7795d6e2970a72b1c53f8b248c122c97de179b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:54.468371Z","signature_b64":"/b25cHrFT3P1PT7ER71+iVwxZY69HiKv2jYxxPJ7EFyGRqeJeXMfjZ2+TwrxgViKSeWm0/mhRZ5hnzelJxOCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3f39e6bd2f31eaa70ccc35b7795d6e2970a72b1c53f8b248c122c97de179b4","last_reissued_at":"2026-05-18T03:31:54.467911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:54.467911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5886","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-18T03:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZhpZ4S+gXR4kZrx19FrEMpnXLRYUG8jcdWZ4eXEsXU8KR59u9BmkUzaH6ZwzMHhRNIw6OgfLW2xnwsopYNaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:57:23.102135Z"},"content_sha256":"9403be983d0447efad3dcf3ddcdee557ae88fecd20bf6e87b223e52700599352","schema_version":"1.0","event_id":"sha256:9403be983d0447efad3dcf3ddcdee557ae88fecd20bf6e87b223e52700599352"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HI7TTZV5F4Y6VJYMZQ23O6K5NY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Olivier Finkel (ELM)","submitted_at":"2011-07-29T07:15:04Z","abstract_excerpt":"It was noticed by Harel in [Har86] that \"one can define $\\Sigma_1^1$-complete versions of the well-known Post Correspondence Problem\". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular $\\omega$-language is $\\Sigma_1^1$-complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is $\\Pi_1^1$-complete to determine whether two given infinitary rational relations are disjoint. Then we prove that there is an amazing gap between two decision problems about $\\omega$-rational functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5886","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-18T03:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jJFofFAM4T0g1Ts/nd2qsKJr73CPfGWw0IQl/dsfijylgMG44dw75CvKo+JzP00nOvSHYmmoN2dAUDKuq3yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:57:23.102489Z"},"content_sha256":"31e58b287ab2fd9d25ea69e7ca201f1fbc0c147cf19c484080c05e3c67972214","schema_version":"1.0","event_id":"sha256:31e58b287ab2fd9d25ea69e7ca201f1fbc0c147cf19c484080c05e3c67972214"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY/bundle.json","state_url":"https://pith.science/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY/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-03T12:57:23Z","links":{"resolver":"https://pith.science/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY","bundle":"https://pith.science/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY/bundle.json","state":"https://pith.science/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HI7TTZV5F4Y6VJYMZQ23O6K5NY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HI7TTZV5F4Y6VJYMZQ23O6K5NY","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":"ca1d3d0bf5ad5b981ae45376a05895b68fbab459eeb5771e6b91ba954552ee24","cross_cats_sorted":["cs.CC","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-29T07:15:04Z","title_canon_sha256":"153d73a84438dc0a7f8b52a6e2e58eab9d498af9d6a5b5708befbc806a651ea3"},"schema_version":"1.0","source":{"id":"1107.5886","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5886","created_at":"2026-05-18T03:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5886v1","created_at":"2026-05-18T03:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5886","created_at":"2026-05-18T03:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"HI7TTZV5F4Y6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HI7TTZV5F4Y6VJYM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HI7TTZV5","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:31e58b287ab2fd9d25ea69e7ca201f1fbc0c147cf19c484080c05e3c67972214","target":"graph","created_at":"2026-05-18T03:31:54Z","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":"It was noticed by Harel in [Har86] that \"one can define $\\Sigma_1^1$-complete versions of the well-known Post Correspondence Problem\". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular $\\omega$-language is $\\Sigma_1^1$-complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is $\\Pi_1^1$-complete to determine whether two given infinitary rational relations are disjoint. Then we prove that there is an amazing gap between two decision problems about $\\omega$-rational functio","authors_text":"Olivier Finkel (ELM)","cross_cats":["cs.CC","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-29T07:15:04Z","title":"Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5886","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:9403be983d0447efad3dcf3ddcdee557ae88fecd20bf6e87b223e52700599352","target":"record","created_at":"2026-05-18T03:31:54Z","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":"ca1d3d0bf5ad5b981ae45376a05895b68fbab459eeb5771e6b91ba954552ee24","cross_cats_sorted":["cs.CC","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-29T07:15:04Z","title_canon_sha256":"153d73a84438dc0a7f8b52a6e2e58eab9d498af9d6a5b5708befbc806a651ea3"},"schema_version":"1.0","source":{"id":"1107.5886","kind":"arxiv","version":1}},"canonical_sha256":"3a3f39e6bd2f31eaa70ccc35b7795d6e2970a72b1c53f8b248c122c97de179b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a3f39e6bd2f31eaa70ccc35b7795d6e2970a72b1c53f8b248c122c97de179b4","first_computed_at":"2026-05-18T03:31:54.467911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:54.467911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/b25cHrFT3P1PT7ER71+iVwxZY69HiKv2jYxxPJ7EFyGRqeJeXMfjZ2+TwrxgViKSeWm0/mhRZ5hnzelJxOCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:54.468371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5886","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9403be983d0447efad3dcf3ddcdee557ae88fecd20bf6e87b223e52700599352","sha256:31e58b287ab2fd9d25ea69e7ca201f1fbc0c147cf19c484080c05e3c67972214"],"state_sha256":"82e034279fdbdd372de482d0a264f230ab18f82ef12895b608d5a86c8e768d79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivGVd8pa8af37qDR56dzEk5onSL7hAx5c5hZRm2at0B+QQXslwDBEoPBwsO8Wg9pV7F3OfRwTCiLiaZ3I3dwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:57:23.104328Z","bundle_sha256":"c604395d170a052c2b87a7df07c953d31631a1db03486768fe5fc4bbb1e83afe"}}