{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ET6SSQ6XMIPXZJEDCK6FQTMRDY","short_pith_number":"pith:ET6SSQ6X","schema_version":"1.0","canonical_sha256":"24fd2943d7621f7ca48312bc584d911e315a6b6f9f6c6e791b606fdd0c68d129","source":{"kind":"arxiv","id":"1109.6128","version":1},"attestation_state":"computed","paper":{"title":"Strong jump traceability and Demuth randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Daniel Turetsky, Noam Greenberg","submitted_at":"2011-09-28T08:54:38Z","abstract_excerpt":"We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. We show that on the other hand, the class of sets which form a base for Demuth randomness is a proper subclass of the class of strongly jump-traceable sets."},"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":"1109.6128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-09-28T08:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"9fe0f8fa3195c693bd33ff7f4bf2d871ba4989b10d9f86e7863cf28901b2c802","abstract_canon_sha256":"c9a74780c983bb9a716d4962a88b3609479fd4618b7fee2adfb9a56b9b4b1dfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:09.687311Z","signature_b64":"BXxLzt1HdI5/ZIeU6gHs1T9HfHKNITDeqAiDs81YuuW0mbz4r6BJwRcCB1fS7/b38MTL7oFvDnIwgm3ECiXxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24fd2943d7621f7ca48312bc584d911e315a6b6f9f6c6e791b606fdd0c68d129","last_reissued_at":"2026-05-18T04:12:09.686847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:09.686847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong jump traceability and Demuth randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Daniel Turetsky, Noam Greenberg","submitted_at":"2011-09-28T08:54:38Z","abstract_excerpt":"We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. We show that on the other hand, the class of sets which form a base for Demuth randomness is a proper subclass of the class of strongly jump-traceable sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6128","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":"1109.6128","created_at":"2026-05-18T04:12:09.686921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6128v1","created_at":"2026-05-18T04:12:09.686921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6128","created_at":"2026-05-18T04:12:09.686921+00:00"},{"alias_kind":"pith_short_12","alias_value":"ET6SSQ6XMIPX","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"ET6SSQ6XMIPXZJED","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"ET6SSQ6X","created_at":"2026-05-18T12:26:28.662955+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/ET6SSQ6XMIPXZJEDCK6FQTMRDY","json":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY.json","graph_json":"https://pith.science/api/pith-number/ET6SSQ6XMIPXZJEDCK6FQTMRDY/graph.json","events_json":"https://pith.science/api/pith-number/ET6SSQ6XMIPXZJEDCK6FQTMRDY/events.json","paper":"https://pith.science/paper/ET6SSQ6X"},"agent_actions":{"view_html":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY","download_json":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY.json","view_paper":"https://pith.science/paper/ET6SSQ6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6128&json=true","fetch_graph":"https://pith.science/api/pith-number/ET6SSQ6XMIPXZJEDCK6FQTMRDY/graph.json","fetch_events":"https://pith.science/api/pith-number/ET6SSQ6XMIPXZJEDCK6FQTMRDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY/action/storage_attestation","attest_author":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY/action/author_attestation","sign_citation":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY/action/citation_signature","submit_replication":"https://pith.science/pith/ET6SSQ6XMIPXZJEDCK6FQTMRDY/action/replication_record"}},"created_at":"2026-05-18T04:12:09.686921+00:00","updated_at":"2026-05-18T04:12:09.686921+00:00"}