{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JHDP76OOYJ5E2KSMYKNONKDAFV","short_pith_number":"pith:JHDP76OO","canonical_record":{"source":{"id":"1208.1901","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-08-09T13:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"9d523528f84829c3f8a2b596d1c15825d3e745c3950e5943a446d40932f79659","abstract_canon_sha256":"7b508587ba745d4b2069ce88be945c114199eff2a7ad8367a3e3ed0922ef2f2a"},"schema_version":"1.0"},"canonical_sha256":"49c6fff9cec27a4d2a4cc29ae6a8602d4e5791b505bb47df06f6b0c2be53b9ed","source":{"kind":"arxiv","id":"1208.1901","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1901","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1901v4","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1901","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"JHDP76OOYJ5E","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JHDP76OOYJ5E2KSM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JHDP76OO","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JHDP76OOYJ5E2KSMYKNONKDAFV","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1901","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-08-09T13:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"9d523528f84829c3f8a2b596d1c15825d3e745c3950e5943a446d40932f79659","abstract_canon_sha256":"7b508587ba745d4b2069ce88be945c114199eff2a7ad8367a3e3ed0922ef2f2a"},"schema_version":"1.0"},"canonical_sha256":"49c6fff9cec27a4d2a4cc29ae6a8602d4e5791b505bb47df06f6b0c2be53b9ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:44.059741Z","signature_b64":"LHymtugdktGR1zhUFRu/LLaRN8BpCrUxKW0BS5N8ap8epTHsBErUehgvuD5nhZyeVFZRKw8FH9I+rFBJxG4jAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49c6fff9cec27a4d2a4cc29ae6a8602d4e5791b505bb47df06f6b0c2be53b9ed","last_reissued_at":"2026-05-18T03:42:44.058434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:44.058434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1901","source_version":4,"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnmfuXa1hYsQsG6tRcXlmqU3FxGcAUXtM8cUb3qaPQkvmSQw4gB0R119wTXeMh/x8+0hjbiOM9NyrxfOuMN7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:39:31.242422Z"},"content_sha256":"fced0c27927a8547c8cba3450ecb32ad5f3ad2b48e2b70dc6d4b79cf98d17d84","schema_version":"1.0","event_id":"sha256:fced0c27927a8547c8cba3450ecb32ad5f3ad2b48e2b70dc6d4b79cf98d17d84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JHDP76OOYJ5E2KSMYKNONKDAFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distribution of ITRM-recognizable reals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2012-08-09T13:24:37Z","abstract_excerpt":"Infinite Time Register Machines ($ITRM$'s) are a well-established machine model for infinitary computations. Their computational strength relative to oracles is understood, see e.g. Koepke (2009), Koepke and Welch (2011) and Koepke and Miller (2008). We consider the notion of recognizability, which was first formulated for Infinite Time Turing Machines in Hamkins and Lewis (200) and applied to $ITRM$'s in Carl et al. (2010). A real $x$ is $ITRM$-recognizable iff there is an $ITRM$-program $P$ such that $P^{y}$ stops with output 1 iff $y=x$, and otherwise stops with output 0. In Carl et al. (20"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1901","kind":"arxiv","version":4},"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlTAwRoErzoYSrpVDwOrOw2w0WZzuY6RidjpCVXbAjJI1aESR4gr2QJg7kVxnFZQiGmVf1OWOlHJ+S7BPMMrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:39:31.242777Z"},"content_sha256":"287c6b7f33ee47330294ccfc56606d6c28449219d7169552d10ebab037f95e7a","schema_version":"1.0","event_id":"sha256:287c6b7f33ee47330294ccfc56606d6c28449219d7169552d10ebab037f95e7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHDP76OOYJ5E2KSMYKNONKDAFV/bundle.json","state_url":"https://pith.science/pith/JHDP76OOYJ5E2KSMYKNONKDAFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHDP76OOYJ5E2KSMYKNONKDAFV/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-30T19:39:31Z","links":{"resolver":"https://pith.science/pith/JHDP76OOYJ5E2KSMYKNONKDAFV","bundle":"https://pith.science/pith/JHDP76OOYJ5E2KSMYKNONKDAFV/bundle.json","state":"https://pith.science/pith/JHDP76OOYJ5E2KSMYKNONKDAFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHDP76OOYJ5E2KSMYKNONKDAFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JHDP76OOYJ5E2KSMYKNONKDAFV","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":"7b508587ba745d4b2069ce88be945c114199eff2a7ad8367a3e3ed0922ef2f2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-08-09T13:24:37Z","title_canon_sha256":"9d523528f84829c3f8a2b596d1c15825d3e745c3950e5943a446d40932f79659"},"schema_version":"1.0","source":{"id":"1208.1901","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1901","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1901v4","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1901","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"JHDP76OOYJ5E","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JHDP76OOYJ5E2KSM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JHDP76OO","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:287c6b7f33ee47330294ccfc56606d6c28449219d7169552d10ebab037f95e7a","target":"graph","created_at":"2026-05-18T03:42:44Z","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":"Infinite Time Register Machines ($ITRM$'s) are a well-established machine model for infinitary computations. Their computational strength relative to oracles is understood, see e.g. Koepke (2009), Koepke and Welch (2011) and Koepke and Miller (2008). We consider the notion of recognizability, which was first formulated for Infinite Time Turing Machines in Hamkins and Lewis (200) and applied to $ITRM$'s in Carl et al. (2010). A real $x$ is $ITRM$-recognizable iff there is an $ITRM$-program $P$ such that $P^{y}$ stops with output 1 iff $y=x$, and otherwise stops with output 0. In Carl et al. (20","authors_text":"Merlin Carl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-08-09T13:24:37Z","title":"The distribution of ITRM-recognizable reals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1901","kind":"arxiv","version":4},"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:fced0c27927a8547c8cba3450ecb32ad5f3ad2b48e2b70dc6d4b79cf98d17d84","target":"record","created_at":"2026-05-18T03:42:44Z","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":"7b508587ba745d4b2069ce88be945c114199eff2a7ad8367a3e3ed0922ef2f2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-08-09T13:24:37Z","title_canon_sha256":"9d523528f84829c3f8a2b596d1c15825d3e745c3950e5943a446d40932f79659"},"schema_version":"1.0","source":{"id":"1208.1901","kind":"arxiv","version":4}},"canonical_sha256":"49c6fff9cec27a4d2a4cc29ae6a8602d4e5791b505bb47df06f6b0c2be53b9ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49c6fff9cec27a4d2a4cc29ae6a8602d4e5791b505bb47df06f6b0c2be53b9ed","first_computed_at":"2026-05-18T03:42:44.058434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:44.058434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHymtugdktGR1zhUFRu/LLaRN8BpCrUxKW0BS5N8ap8epTHsBErUehgvuD5nhZyeVFZRKw8FH9I+rFBJxG4jAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:44.059741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1901","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fced0c27927a8547c8cba3450ecb32ad5f3ad2b48e2b70dc6d4b79cf98d17d84","sha256:287c6b7f33ee47330294ccfc56606d6c28449219d7169552d10ebab037f95e7a"],"state_sha256":"0218a81e6f076d009778a01df0e697fda608bb38a58dce65776e343b156d3e0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gM420CAk3Y4mMiVYJZyjSGYsVxUctWzW+HoBq4B5a9SeB3wOBW6ZzyIJDV7oZLn/rP2LA6THTuIC6mZuCNbTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:39:31.244815Z","bundle_sha256":"a4e96ec5c60183cf4855c56c65d0c5ef3f826919b8b8544ce407dee25cb9889d"}}