{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7OFFXATC57YACQVSCSXZHOFJTT","short_pith_number":"pith:7OFFXATC","schema_version":"1.0","canonical_sha256":"fb8a5b8262eff00142b214af93b8a99ced997ba7b8744dabc06d4f2482cb3851","source":{"kind":"arxiv","id":"1408.2286","version":1},"attestation_state":"computed","paper":{"title":"Self-embeddings of computable trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Bj{\\o}rn Kjos-Hanssen, James H. Schmerl, Manuel Lerman, Reed Solomon, Stephen Binns","submitted_at":"2014-08-11T00:02:18Z","abstract_excerpt":"We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite $\\Pi^0_1$ antichain. This result is optimal and has connections to the program of reverse mathematics."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1408.2286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-11T00:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"f01755314831525bcc286fab6d4651a84a633fdc3c95422cf18da0006b5b0180","abstract_canon_sha256":"28af5b603ddb6add734687cf3d796808a25db1869dfdb753f4a1a5449ccd7842"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:29.802861Z","signature_b64":"SZVn67cGKaabSS2e6hHeRFDbm7OzoOlSyd1zjhiqyBeT2WoBjPdOPuiFbk3Jeb5BQsYboX0Be8KpXUhBnCweDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb8a5b8262eff00142b214af93b8a99ced997ba7b8744dabc06d4f2482cb3851","last_reissued_at":"2026-05-18T02:45:29.802215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:29.802215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-embeddings of computable trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Bj{\\o}rn Kjos-Hanssen, James H. Schmerl, Manuel Lerman, Reed Solomon, Stephen Binns","submitted_at":"2014-08-11T00:02:18Z","abstract_excerpt":"We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite $\\Pi^0_1$ antichain. This result is optimal and has connections to the program of reverse mathematics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2286","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.2286","created_at":"2026-05-18T02:45:29.802329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2286v1","created_at":"2026-05-18T02:45:29.802329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2286","created_at":"2026-05-18T02:45:29.802329+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OFFXATC57YA","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OFFXATC57YACQVS","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OFFXATC","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT","json":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT.json","graph_json":"https://pith.science/api/pith-number/7OFFXATC57YACQVSCSXZHOFJTT/graph.json","events_json":"https://pith.science/api/pith-number/7OFFXATC57YACQVSCSXZHOFJTT/events.json","paper":"https://pith.science/paper/7OFFXATC"},"agent_actions":{"view_html":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT","download_json":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT.json","view_paper":"https://pith.science/paper/7OFFXATC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2286&json=true","fetch_graph":"https://pith.science/api/pith-number/7OFFXATC57YACQVSCSXZHOFJTT/graph.json","fetch_events":"https://pith.science/api/pith-number/7OFFXATC57YACQVSCSXZHOFJTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT/action/storage_attestation","attest_author":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT/action/author_attestation","sign_citation":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT/action/citation_signature","submit_replication":"https://pith.science/pith/7OFFXATC57YACQVSCSXZHOFJTT/action/replication_record"}},"created_at":"2026-05-18T02:45:29.802329+00:00","updated_at":"2026-05-18T02:45:29.802329+00:00"}