{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ARSUPK5A6XWWXDAEOWUCWQUDOV","short_pith_number":"pith:ARSUPK5A","schema_version":"1.0","canonical_sha256":"046547aba0f5ed6b8c0475a82b42837577436a7e2ed5f07227f5721a1875d34e","source":{"kind":"arxiv","id":"1608.00692","version":2},"attestation_state":"computed","paper":{"title":"Kobayashi compressibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"George Barmpalias, Rodney G. Downey","submitted_at":"2016-08-02T04:12:08Z","abstract_excerpt":"Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle. Kobayashi compressibility has remained a relatively obscure notion, with the exception of some work on resource bounded Kolmogorov complexity. The main goal of this note is to show that it is relevant to a number of topics in current research on algorithmic randomness. We prove that Kobayashi compressibility can be used in order to define Martin-Loef randomness, a strong version of finite randomness and Kurtz randomness, strictly in"},"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":"1608.00692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-02T04:12:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1cb3e213950d57e6980deec822a91d965be34e63f4c2518838e405210aa873c3","abstract_canon_sha256":"abf0acf46b7950bed97317b497baed1698f545571af1cd0251701c8972c8eed1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:58.732795Z","signature_b64":"BA0Vn/rQx6nMqo8fI6f3GDW/v+9hoy7vsz4B+K2wiQ+7b2ywdS2EfMfqXeDMjx8urI3zox/3aiCH2U5pGVbcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046547aba0f5ed6b8c0475a82b42837577436a7e2ed5f07227f5721a1875d34e","last_reissued_at":"2026-05-18T00:49:58.732140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:58.732140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kobayashi compressibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"George Barmpalias, Rodney G. Downey","submitted_at":"2016-08-02T04:12:08Z","abstract_excerpt":"Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle. Kobayashi compressibility has remained a relatively obscure notion, with the exception of some work on resource bounded Kolmogorov complexity. The main goal of this note is to show that it is relevant to a number of topics in current research on algorithmic randomness. We prove that Kobayashi compressibility can be used in order to define Martin-Loef randomness, a strong version of finite randomness and Kurtz randomness, strictly in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00692","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":"1608.00692","created_at":"2026-05-18T00:49:58.732231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00692v2","created_at":"2026-05-18T00:49:58.732231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00692","created_at":"2026-05-18T00:49:58.732231+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARSUPK5A6XWW","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARSUPK5A6XWWXDAE","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARSUPK5A","created_at":"2026-05-18T12:30:07.202191+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/ARSUPK5A6XWWXDAEOWUCWQUDOV","json":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV.json","graph_json":"https://pith.science/api/pith-number/ARSUPK5A6XWWXDAEOWUCWQUDOV/graph.json","events_json":"https://pith.science/api/pith-number/ARSUPK5A6XWWXDAEOWUCWQUDOV/events.json","paper":"https://pith.science/paper/ARSUPK5A"},"agent_actions":{"view_html":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV","download_json":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV.json","view_paper":"https://pith.science/paper/ARSUPK5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00692&json=true","fetch_graph":"https://pith.science/api/pith-number/ARSUPK5A6XWWXDAEOWUCWQUDOV/graph.json","fetch_events":"https://pith.science/api/pith-number/ARSUPK5A6XWWXDAEOWUCWQUDOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV/action/storage_attestation","attest_author":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV/action/author_attestation","sign_citation":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV/action/citation_signature","submit_replication":"https://pith.science/pith/ARSUPK5A6XWWXDAEOWUCWQUDOV/action/replication_record"}},"created_at":"2026-05-18T00:49:58.732231+00:00","updated_at":"2026-05-18T00:49:58.732231+00:00"}