{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C6OQ3XBOCKVETKTMEARC6GLEET","short_pith_number":"pith:C6OQ3XBO","schema_version":"1.0","canonical_sha256":"179d0ddc2e12aa49aa6c20222f196424e3df1db5c347cd7b4d005f23c0278c83","source":{"kind":"arxiv","id":"1311.7278","version":2},"attestation_state":"computed","paper":{"title":"Linear list-approximation for short programs (or the power of a few random bits)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bruno Bauwens, Marius Zimand","submitted_at":"2013-11-28T11:28:31Z","abstract_excerpt":"A $c$-short program for a string $x$ is a description of $x$ of length at most $C(x) + c$, where $C(x)$ is the Kolmogorov complexity of $x$. We show that there exists a randomized algorithm that constructs a list of $n$ elements that contains a $O(\\log n)$-short program for $x$. We also show a polynomial-time randomized construction that achieves the same list size for $O(\\log^2 n)$-short programs. These results beat the lower bounds shown by Bauwens et al. \\cite{bmvz:c:shortlist} for deterministic constructions of such lists. We also prove tight lower bounds for the main parameters of our res"},"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":"1311.7278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-28T11:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"e6e791e52ca037084a12ff9ae9929da8a532a265161afa841d753a400aed3827","abstract_canon_sha256":"c0c5fc9c0b76b7e8650eff5fd911565203430bb4f910c6ef6133de7f12c14189"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.752658Z","signature_b64":"CXqGBYPNogbGteP6+d90X5Uypy6CsDve5OW7GtqjIVdXzCnan42NzT+ItMOwBqzhRFsizIhSGOGmfRw0/DeHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179d0ddc2e12aa49aa6c20222f196424e3df1db5c347cd7b4d005f23c0278c83","last_reissued_at":"2026-05-18T02:29:02.752162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.752162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear list-approximation for short programs (or the power of a few random bits)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bruno Bauwens, Marius Zimand","submitted_at":"2013-11-28T11:28:31Z","abstract_excerpt":"A $c$-short program for a string $x$ is a description of $x$ of length at most $C(x) + c$, where $C(x)$ is the Kolmogorov complexity of $x$. We show that there exists a randomized algorithm that constructs a list of $n$ elements that contains a $O(\\log n)$-short program for $x$. We also show a polynomial-time randomized construction that achieves the same list size for $O(\\log^2 n)$-short programs. These results beat the lower bounds shown by Bauwens et al. \\cite{bmvz:c:shortlist} for deterministic constructions of such lists. We also prove tight lower bounds for the main parameters of our res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7278","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":"1311.7278","created_at":"2026-05-18T02:29:02.752236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7278v2","created_at":"2026-05-18T02:29:02.752236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7278","created_at":"2026-05-18T02:29:02.752236+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6OQ3XBOCKVE","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6OQ3XBOCKVETKTM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6OQ3XBO","created_at":"2026-05-18T12:27:40.988391+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/C6OQ3XBOCKVETKTMEARC6GLEET","json":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET.json","graph_json":"https://pith.science/api/pith-number/C6OQ3XBOCKVETKTMEARC6GLEET/graph.json","events_json":"https://pith.science/api/pith-number/C6OQ3XBOCKVETKTMEARC6GLEET/events.json","paper":"https://pith.science/paper/C6OQ3XBO"},"agent_actions":{"view_html":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET","download_json":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET.json","view_paper":"https://pith.science/paper/C6OQ3XBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7278&json=true","fetch_graph":"https://pith.science/api/pith-number/C6OQ3XBOCKVETKTMEARC6GLEET/graph.json","fetch_events":"https://pith.science/api/pith-number/C6OQ3XBOCKVETKTMEARC6GLEET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET/action/storage_attestation","attest_author":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET/action/author_attestation","sign_citation":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET/action/citation_signature","submit_replication":"https://pith.science/pith/C6OQ3XBOCKVETKTMEARC6GLEET/action/replication_record"}},"created_at":"2026-05-18T02:29:02.752236+00:00","updated_at":"2026-05-18T02:29:02.752236+00:00"}