{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UPT3YDPA34ECCZISONAORX2Z2F","short_pith_number":"pith:UPT3YDPA","schema_version":"1.0","canonical_sha256":"a3e7bc0de0df082165127340e8df59d170d1f6aef95aaf68ebcb772116dcf38a","source":{"kind":"arxiv","id":"1609.05984","version":4},"attestation_state":"computed","paper":{"title":"List approximation for increasing Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.LO"],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2016-09-20T01:19:02Z","abstract_excerpt":"It is impossible to effectively modify a string in order to increase its Kolmogorov complexity. But is it possible to construct a few strings, not longer than the input string, so that most of them have larger complexity? We show that the answer is yes. We present an algorithm that on input a string $x$ of length $n$ returns a list with $O(n^2)$ many strings, all of length $n$, such that 99\\% of them are more complex than $x$, provided the complexity of $x$ is less than $n - \\log \\log n - O(1)$. We obtain similar results for other parameters, including a polynomial-time construction."},"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":"1609.05984","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T01:19:02Z","cross_cats_sorted":["cs.IT","math.IT","math.LO"],"title_canon_sha256":"76b0f87939f1597252b85f892e652b23920e007778e3cfc67ba70f400dd77735","abstract_canon_sha256":"dc69c6b3a1f00452444f867bec77f647b66cc41ee96b799fd0b48d3aad2b7fa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:22.475984Z","signature_b64":"bN1ec2xd2cMB0e3RrPESh0/grfNuXjLPwZIz0Udc8Riqj2eCw/LFhS6gjIy5DWvGQwGzPFP9KhNz1iDWRronDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3e7bc0de0df082165127340e8df59d170d1f6aef95aaf68ebcb772116dcf38a","last_reissued_at":"2026-05-18T00:51:22.475217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:22.475217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List approximation for increasing Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.LO"],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2016-09-20T01:19:02Z","abstract_excerpt":"It is impossible to effectively modify a string in order to increase its Kolmogorov complexity. But is it possible to construct a few strings, not longer than the input string, so that most of them have larger complexity? We show that the answer is yes. We present an algorithm that on input a string $x$ of length $n$ returns a list with $O(n^2)$ many strings, all of length $n$, such that 99\\% of them are more complex than $x$, provided the complexity of $x$ is less than $n - \\log \\log n - O(1)$. We obtain similar results for other parameters, including a polynomial-time construction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05984","kind":"arxiv","version":4},"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":"1609.05984","created_at":"2026-05-18T00:51:22.475348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05984v4","created_at":"2026-05-18T00:51:22.475348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05984","created_at":"2026-05-18T00:51:22.475348+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPT3YDPA34EC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPT3YDPA34ECCZIS","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPT3YDPA","created_at":"2026-05-18T12:30:46.583412+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/UPT3YDPA34ECCZISONAORX2Z2F","json":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F.json","graph_json":"https://pith.science/api/pith-number/UPT3YDPA34ECCZISONAORX2Z2F/graph.json","events_json":"https://pith.science/api/pith-number/UPT3YDPA34ECCZISONAORX2Z2F/events.json","paper":"https://pith.science/paper/UPT3YDPA"},"agent_actions":{"view_html":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F","download_json":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F.json","view_paper":"https://pith.science/paper/UPT3YDPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05984&json=true","fetch_graph":"https://pith.science/api/pith-number/UPT3YDPA34ECCZISONAORX2Z2F/graph.json","fetch_events":"https://pith.science/api/pith-number/UPT3YDPA34ECCZISONAORX2Z2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/action/storage_attestation","attest_author":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/action/author_attestation","sign_citation":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/action/citation_signature","submit_replication":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/action/replication_record"}},"created_at":"2026-05-18T00:51:22.475348+00:00","updated_at":"2026-05-18T00:51:22.475348+00:00"}