{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2FG4PLERLQ6GB6QJ735BZDOGQS","short_pith_number":"pith:2FG4PLER","canonical_record":{"source":{"id":"1811.11630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-28T15:31:36Z","cross_cats_sorted":[],"title_canon_sha256":"8719ffc65f609cbba667df5be723746ac00ed58d96747f48525661171270f46f","abstract_canon_sha256":"1298cc8d0656de1fb2dcd0562a90308646d08a0cc97cefc36d2a6b177284a70d"},"schema_version":"1.0"},"canonical_sha256":"d14dc7ac915c3c60fa09fefa1c8dc68487f68475de22e31585e8783907f97dfd","source":{"kind":"arxiv","id":"1811.11630","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11630","created_at":"2026-05-17T23:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11630v3","created_at":"2026-05-17T23:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11630","created_at":"2026-05-17T23:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"2FG4PLERLQ6G","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2FG4PLERLQ6GB6QJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2FG4PLER","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2FG4PLERLQ6GB6QJ735BZDOGQS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-28T15:31:36Z","cross_cats_sorted":[],"title_canon_sha256":"8719ffc65f609cbba667df5be723746ac00ed58d96747f48525661171270f46f","abstract_canon_sha256":"1298cc8d0656de1fb2dcd0562a90308646d08a0cc97cefc36d2a6b177284a70d"},"schema_version":"1.0"},"canonical_sha256":"d14dc7ac915c3c60fa09fefa1c8dc68487f68475de22e31585e8783907f97dfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:01.196416Z","signature_b64":"Ss2gm5a8c9iErZoeMa/z8NrMjBNGKHxfe5tb6VzEuRnzndBXsy8S099ZxHPEjuDXR1fhg9lrzMIrYC2HSj9MBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d14dc7ac915c3c60fa09fefa1c8dc68487f68475de22e31585e8783907f97dfd","last_reissued_at":"2026-05-17T23:59:01.195992Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:01.195992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11630","source_version":3,"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-17T23:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgynthJ5yufhFo8GW8vuKOr4XA4oZITLBaglVECm9Yud1LJVZDGNGvG7zgaOA1vJG9s87mVIy0kShHi/VT97Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:54:58.340213Z"},"content_sha256":"91c8ea488f25dc48f300ba721aad0322ca18d031c3d86698f7f1e06e2feaee95","schema_version":"1.0","event_id":"sha256:91c8ea488f25dc48f300ba721aad0322ca18d031c3d86698f7f1e06e2feaee95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2FG4PLERLQ6GB6QJ735BZDOGQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effectivity and Reducibility with Ordinal Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2018-11-28T15:31:36Z","abstract_excerpt":"This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or can be encoded by countable objects. We propose a notion of effectivity based on Koepke's Ordinal Turing Machines (OTMs) that applies to arbitrary set-theoretical $\\Pi_{2}$-statements, along with according variants of effective reducibility and Weihrauch reducibility. As a sample application, we compare various choice principles with respect to effectivity.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11630","kind":"arxiv","version":3},"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-17T23:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkZvj857KsXrpktKbAPIsqPyWoC8brtBUta2saxS/CnZkxFNiDMA2F7fJ/FETZM73pSVPEdXDmuST1t6lfwyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:54:58.340566Z"},"content_sha256":"b5fd6e4a1680e902e51506e18c9f6a36e79456a645bd9ee492c651ebb27d2931","schema_version":"1.0","event_id":"sha256:b5fd6e4a1680e902e51506e18c9f6a36e79456a645bd9ee492c651ebb27d2931"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FG4PLERLQ6GB6QJ735BZDOGQS/bundle.json","state_url":"https://pith.science/pith/2FG4PLERLQ6GB6QJ735BZDOGQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FG4PLERLQ6GB6QJ735BZDOGQS/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-30T17:54:58Z","links":{"resolver":"https://pith.science/pith/2FG4PLERLQ6GB6QJ735BZDOGQS","bundle":"https://pith.science/pith/2FG4PLERLQ6GB6QJ735BZDOGQS/bundle.json","state":"https://pith.science/pith/2FG4PLERLQ6GB6QJ735BZDOGQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FG4PLERLQ6GB6QJ735BZDOGQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2FG4PLERLQ6GB6QJ735BZDOGQS","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":"1298cc8d0656de1fb2dcd0562a90308646d08a0cc97cefc36d2a6b177284a70d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-28T15:31:36Z","title_canon_sha256":"8719ffc65f609cbba667df5be723746ac00ed58d96747f48525661171270f46f"},"schema_version":"1.0","source":{"id":"1811.11630","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11630","created_at":"2026-05-17T23:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11630v3","created_at":"2026-05-17T23:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11630","created_at":"2026-05-17T23:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"2FG4PLERLQ6G","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2FG4PLERLQ6GB6QJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2FG4PLER","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:b5fd6e4a1680e902e51506e18c9f6a36e79456a645bd9ee492c651ebb27d2931","target":"graph","created_at":"2026-05-17T23:59:01Z","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":"This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or can be encoded by countable objects. We propose a notion of effectivity based on Koepke's Ordinal Turing Machines (OTMs) that applies to arbitrary set-theoretical $\\Pi_{2}$-statements, along with according variants of effective reducibility and Weihrauch reducibility. As a sample application, we compare various choice principles with respect to effectivity.\n","authors_text":"Merlin Carl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-28T15:31:36Z","title":"Effectivity and Reducibility with Ordinal Turing Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11630","kind":"arxiv","version":3},"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:91c8ea488f25dc48f300ba721aad0322ca18d031c3d86698f7f1e06e2feaee95","target":"record","created_at":"2026-05-17T23:59:01Z","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":"1298cc8d0656de1fb2dcd0562a90308646d08a0cc97cefc36d2a6b177284a70d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-11-28T15:31:36Z","title_canon_sha256":"8719ffc65f609cbba667df5be723746ac00ed58d96747f48525661171270f46f"},"schema_version":"1.0","source":{"id":"1811.11630","kind":"arxiv","version":3}},"canonical_sha256":"d14dc7ac915c3c60fa09fefa1c8dc68487f68475de22e31585e8783907f97dfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d14dc7ac915c3c60fa09fefa1c8dc68487f68475de22e31585e8783907f97dfd","first_computed_at":"2026-05-17T23:59:01.195992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:01.195992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ss2gm5a8c9iErZoeMa/z8NrMjBNGKHxfe5tb6VzEuRnzndBXsy8S099ZxHPEjuDXR1fhg9lrzMIrYC2HSj9MBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:01.196416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11630","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91c8ea488f25dc48f300ba721aad0322ca18d031c3d86698f7f1e06e2feaee95","sha256:b5fd6e4a1680e902e51506e18c9f6a36e79456a645bd9ee492c651ebb27d2931"],"state_sha256":"e0dd63c956b4c8b5b855bf178724c0d930e8a0817ae8708cddbba53e5db9dfc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsbgpYA3bYXJH1I00qQbWugGTqjZfvoEmTHDGtK7ncn5NpB3gBeEfUuwTIri2j41fAma3AsIn5G2g2DE4zRvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:54:58.342732Z","bundle_sha256":"d39aa3ea2c9516e75b3c8489242886ceacdb266f37f73cbe931fb579f4b35905"}}