{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4M2IQZU5UZJJEOX7LABPONZSW5","short_pith_number":"pith:4M2IQZU5","canonical_record":{"source":{"id":"2606.27151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-25T15:21:12Z","cross_cats_sorted":[],"title_canon_sha256":"c03b31bb76ae360959719a9cc28c4885cdd9ae4aa2d60657edf8f580e9da473d","abstract_canon_sha256":"aa0d89389e7cdb512be7f80a4a03651a029cd2b6651658c1c8d4614c6c6324e6"},"schema_version":"1.0"},"canonical_sha256":"e33488669da652923aff5802f73732b77934c7465ebf05c0b7d49d3f7096f700","source":{"kind":"arxiv","id":"2606.27151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27151","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27151v1","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27151","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"4M2IQZU5UZJJ","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"pith_short_16","alias_value":"4M2IQZU5UZJJEOX7","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"pith_short_8","alias_value":"4M2IQZU5","created_at":"2026-06-26T01:16:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4M2IQZU5UZJJEOX7LABPONZSW5","target":"record","payload":{"canonical_record":{"source":{"id":"2606.27151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-25T15:21:12Z","cross_cats_sorted":[],"title_canon_sha256":"c03b31bb76ae360959719a9cc28c4885cdd9ae4aa2d60657edf8f580e9da473d","abstract_canon_sha256":"aa0d89389e7cdb512be7f80a4a03651a029cd2b6651658c1c8d4614c6c6324e6"},"schema_version":"1.0"},"canonical_sha256":"e33488669da652923aff5802f73732b77934c7465ebf05c0b7d49d3f7096f700","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:11.602268Z","signature_b64":"OeXNIhVbnJsc2CGod2DTcMjzvg9Zg4ZwEgu8EbrSBIHgyPtLGGruVA53GmJILEsRqJZwyZIomJKxGCdZFDB0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33488669da652923aff5802f73732b77934c7465ebf05c0b7d49d3f7096f700","last_reissued_at":"2026-06-26T01:16:11.601913Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:11.601913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.27151","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-06-26T01:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+mcB2e3DVkUN3nBAdNJtD2ozOHrhzwg19jfttrzzOwS/CFuyhpqakUJqeW6MPLk67kbS7enylcqCwn51oA6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T00:29:22.219125Z"},"content_sha256":"a684fe740a0b295010e46264a94556009d4af1927cb33103cf672034841d74df","schema_version":"1.0","event_id":"sha256:a684fe740a0b295010e46264a94556009d4af1927cb33103cf672034841d74df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4M2IQZU5UZJJEOX7LABPONZSW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scott complexity of trees of finite rank via degrees of categoricity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Mohammad Mahmoud","submitted_at":"2026-06-25T15:21:12Z","abstract_excerpt":"In earlier work we constructed, for each computable ordinal $\\alpha$, a computable tree of rank $\\alpha+1$ whose strong degree of categoricity is $\\mathbf{0}^{(2\\alpha)}$ for finite $\\alpha$ (and $\\mathbf{0}^{(2\\alpha+1)}$ for infinite $\\alpha$), and showed these degrees are optimal. Those results are lightface: they concern computable copies and Turing degrees of isomorphisms. In this paper we determine the boldface content of the construction. We isolate a simple transfer principle showing that a degree-of-categoricity lower bound which holds \\emph{uniformly relative to every oracle} defeats"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27151","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.27151/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-06-26T01:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OskHJPNDNJcWgiujNXLREIDaQJaWWd22H28LiR5VpCTqzK9o5/7w6jCxWe8YzG/0wENJsk/KV2thLmulZYSFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T00:29:22.219772Z"},"content_sha256":"02d55f8ca0fb5b22aab137ec67f02cd800362577b17305a87daa479f51ffff48","schema_version":"1.0","event_id":"sha256:02d55f8ca0fb5b22aab137ec67f02cd800362577b17305a87daa479f51ffff48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M2IQZU5UZJJEOX7LABPONZSW5/bundle.json","state_url":"https://pith.science/pith/4M2IQZU5UZJJEOX7LABPONZSW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M2IQZU5UZJJEOX7LABPONZSW5/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-12T00:29:22Z","links":{"resolver":"https://pith.science/pith/4M2IQZU5UZJJEOX7LABPONZSW5","bundle":"https://pith.science/pith/4M2IQZU5UZJJEOX7LABPONZSW5/bundle.json","state":"https://pith.science/pith/4M2IQZU5UZJJEOX7LABPONZSW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M2IQZU5UZJJEOX7LABPONZSW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4M2IQZU5UZJJEOX7LABPONZSW5","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":"aa0d89389e7cdb512be7f80a4a03651a029cd2b6651658c1c8d4614c6c6324e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-25T15:21:12Z","title_canon_sha256":"c03b31bb76ae360959719a9cc28c4885cdd9ae4aa2d60657edf8f580e9da473d"},"schema_version":"1.0","source":{"id":"2606.27151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27151","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27151v1","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27151","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"4M2IQZU5UZJJ","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"pith_short_16","alias_value":"4M2IQZU5UZJJEOX7","created_at":"2026-06-26T01:16:11Z"},{"alias_kind":"pith_short_8","alias_value":"4M2IQZU5","created_at":"2026-06-26T01:16:11Z"}],"graph_snapshots":[{"event_id":"sha256:02d55f8ca0fb5b22aab137ec67f02cd800362577b17305a87daa479f51ffff48","target":"graph","created_at":"2026-06-26T01:16:11Z","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/2606.27151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In earlier work we constructed, for each computable ordinal $\\alpha$, a computable tree of rank $\\alpha+1$ whose strong degree of categoricity is $\\mathbf{0}^{(2\\alpha)}$ for finite $\\alpha$ (and $\\mathbf{0}^{(2\\alpha+1)}$ for infinite $\\alpha$), and showed these degrees are optimal. Those results are lightface: they concern computable copies and Turing degrees of isomorphisms. In this paper we determine the boldface content of the construction. We isolate a simple transfer principle showing that a degree-of-categoricity lower bound which holds \\emph{uniformly relative to every oracle} defeats","authors_text":"Mohammad Mahmoud","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-25T15:21:12Z","title":"Scott complexity of trees of finite rank via degrees of categoricity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27151","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:a684fe740a0b295010e46264a94556009d4af1927cb33103cf672034841d74df","target":"record","created_at":"2026-06-26T01:16:11Z","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":"aa0d89389e7cdb512be7f80a4a03651a029cd2b6651658c1c8d4614c6c6324e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-25T15:21:12Z","title_canon_sha256":"c03b31bb76ae360959719a9cc28c4885cdd9ae4aa2d60657edf8f580e9da473d"},"schema_version":"1.0","source":{"id":"2606.27151","kind":"arxiv","version":1}},"canonical_sha256":"e33488669da652923aff5802f73732b77934c7465ebf05c0b7d49d3f7096f700","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e33488669da652923aff5802f73732b77934c7465ebf05c0b7d49d3f7096f700","first_computed_at":"2026-06-26T01:16:11.601913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:16:11.601913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OeXNIhVbnJsc2CGod2DTcMjzvg9Zg4ZwEgu8EbrSBIHgyPtLGGruVA53GmJILEsRqJZwyZIomJKxGCdZFDB0Dw==","signature_status":"signed_v1","signed_at":"2026-06-26T01:16:11.602268Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.27151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a684fe740a0b295010e46264a94556009d4af1927cb33103cf672034841d74df","sha256:02d55f8ca0fb5b22aab137ec67f02cd800362577b17305a87daa479f51ffff48"],"state_sha256":"8badc720990f0bd1fb941c38a2059d17125d45bb97797885dc49f5cfb1e4ebc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpCDLw33b3kXkoW4QFYmX03gmk+EFBEz3D5U6/HK58XeIbTSsLzhCXNM5cuhim6B31l+U7ttk0yESp87j3sZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T00:29:22.222893Z","bundle_sha256":"6248b2dea3cfcb6389f3bec60acb1b18e6a756df26f4270662ec6e5f26942358"}}