{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WIIJZE3ZXJ4R3IIJOELRMHK3LV","short_pith_number":"pith:WIIJZE3Z","schema_version":"1.0","canonical_sha256":"b2109c9379ba791da1097117161d5b5d7200e800c23723c6bedab6414be69a72","source":{"kind":"arxiv","id":"1408.5636","version":2},"attestation_state":"computed","paper":{"title":"Random strings and tt-degrees of Turing complete C.E. sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joseph Miller (University of Wisconson, Madison), Mingzhong Cai (University of Wisconson, Rachel Epstein (Swathmore College), Rodney G Downey (Victoria University Wellington), Steffen Lempp (University of Wisconson","submitted_at":"2014-08-24T21:17:28Z","abstract_excerpt":"We investigate the truth-table degrees of (co-)c.e.\\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the degree~0, even within the c.e. truth-table degrees, but when taking the meet over all such truth-table degrees, the infinite meet is indeed~0. The latter result proves a conjecture of Allender, Friedman"},"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.5636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-24T21:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"abc81cca2320243fa517a0bb2a7779790e26e25754fdefa0d6ab6d4f8a3ab298","abstract_canon_sha256":"05dd1fdf94dbb33a92446be713c307c8aa0dc6b9a3795e7569f17fec6b1c2c3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.604746Z","signature_b64":"W08Bv1lQia6+/fB39nVoW6lfQwrm3DmJ7e9siZBsHI3S7b6m1Nb9bLj5d73u15rtJQax0iS3Hux4NxPGPJbVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2109c9379ba791da1097117161d5b5d7200e800c23723c6bedab6414be69a72","last_reissued_at":"2026-05-18T01:37:35.604287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.604287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random strings and tt-degrees of Turing complete C.E. sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joseph Miller (University of Wisconson, Madison), Mingzhong Cai (University of Wisconson, Rachel Epstein (Swathmore College), Rodney G Downey (Victoria University Wellington), Steffen Lempp (University of Wisconson","submitted_at":"2014-08-24T21:17:28Z","abstract_excerpt":"We investigate the truth-table degrees of (co-)c.e.\\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the degree~0, even within the c.e. truth-table degrees, but when taking the meet over all such truth-table degrees, the infinite meet is indeed~0. The latter result proves a conjecture of Allender, Friedman"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5636","kind":"arxiv","version":2},"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.5636","created_at":"2026-05-18T01:37:35.604364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5636v2","created_at":"2026-05-18T01:37:35.604364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5636","created_at":"2026-05-18T01:37:35.604364+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIIJZE3ZXJ4R","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIIJZE3ZXJ4R3IIJ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIIJZE3Z","created_at":"2026-05-18T12:28:54.890064+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/WIIJZE3ZXJ4R3IIJOELRMHK3LV","json":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV.json","graph_json":"https://pith.science/api/pith-number/WIIJZE3ZXJ4R3IIJOELRMHK3LV/graph.json","events_json":"https://pith.science/api/pith-number/WIIJZE3ZXJ4R3IIJOELRMHK3LV/events.json","paper":"https://pith.science/paper/WIIJZE3Z"},"agent_actions":{"view_html":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV","download_json":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV.json","view_paper":"https://pith.science/paper/WIIJZE3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5636&json=true","fetch_graph":"https://pith.science/api/pith-number/WIIJZE3ZXJ4R3IIJOELRMHK3LV/graph.json","fetch_events":"https://pith.science/api/pith-number/WIIJZE3ZXJ4R3IIJOELRMHK3LV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV/action/storage_attestation","attest_author":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV/action/author_attestation","sign_citation":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV/action/citation_signature","submit_replication":"https://pith.science/pith/WIIJZE3ZXJ4R3IIJOELRMHK3LV/action/replication_record"}},"created_at":"2026-05-18T01:37:35.604364+00:00","updated_at":"2026-05-18T01:37:35.604364+00:00"}