{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6C6LFGDOW4SLHPXWHJROYOINLX","short_pith_number":"pith:6C6LFGDO","schema_version":"1.0","canonical_sha256":"f0bcb2986eb724b3bef63a62ec390d5de89670189cae41d98b2655c871a5bc06","source":{"kind":"arxiv","id":"1202.6668","version":2},"attestation_state":"computed","paper":{"title":"Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Shen, Bruno Bauwens","submitted_at":"2012-02-29T20:09:17Z","abstract_excerpt":"Peter Gacs showed (Gacs 1974) that for every n there exists a bit string x of length n whose plain complexity C(x) has almost maximal conditional complexity relative to x, i.e., C(C(x)|x) > log n - log^(2) n - O(1). (Here log^(2) i = log log i.) Following Elena Kalinina (Kalinina 2011), we provide a simple game-based proof of this result; modifying her argument, we get a better (and tight) bound log n - O(1). We also show the same bound for prefix-free complexity.\n  Robert Solovay showed (Solovay 1975) that infinitely many strings x have maximal plain complexity but not maximal prefix complexi"},"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":"1202.6668","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2012-02-29T20:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"bf08417e3e6cd30de144b0064ae5a83261c440cf2dd4bcb2f9051bcec8552999","abstract_canon_sha256":"cc7b59e017a703ad958e7d3010a986c289af6f86061e69f01fb19e884a0f8cc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:39.594653Z","signature_b64":"BNQesm2ItSlONHA6e0qimk+tlLWPVzcG11XKGNadUVcq7iYaSTwJWw9J2Kyam48hVjbjIoe/kqBUMMayFJ1BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0bcb2986eb724b3bef63a62ec390d5de89670189cae41d98b2655c871a5bc06","last_reissued_at":"2026-05-18T03:26:39.594199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:39.594199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Shen, Bruno Bauwens","submitted_at":"2012-02-29T20:09:17Z","abstract_excerpt":"Peter Gacs showed (Gacs 1974) that for every n there exists a bit string x of length n whose plain complexity C(x) has almost maximal conditional complexity relative to x, i.e., C(C(x)|x) > log n - log^(2) n - O(1). (Here log^(2) i = log log i.) Following Elena Kalinina (Kalinina 2011), we provide a simple game-based proof of this result; modifying her argument, we get a better (and tight) bound log n - O(1). We also show the same bound for prefix-free complexity.\n  Robert Solovay showed (Solovay 1975) that infinitely many strings x have maximal plain complexity but not maximal prefix complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6668","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":"1202.6668","created_at":"2026-05-18T03:26:39.594266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6668v2","created_at":"2026-05-18T03:26:39.594266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6668","created_at":"2026-05-18T03:26:39.594266+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C6LFGDOW4SL","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C6LFGDOW4SLHPXW","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C6LFGDO","created_at":"2026-05-18T12:26:56.085431+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/6C6LFGDOW4SLHPXWHJROYOINLX","json":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX.json","graph_json":"https://pith.science/api/pith-number/6C6LFGDOW4SLHPXWHJROYOINLX/graph.json","events_json":"https://pith.science/api/pith-number/6C6LFGDOW4SLHPXWHJROYOINLX/events.json","paper":"https://pith.science/paper/6C6LFGDO"},"agent_actions":{"view_html":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX","download_json":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX.json","view_paper":"https://pith.science/paper/6C6LFGDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6668&json=true","fetch_graph":"https://pith.science/api/pith-number/6C6LFGDOW4SLHPXWHJROYOINLX/graph.json","fetch_events":"https://pith.science/api/pith-number/6C6LFGDOW4SLHPXWHJROYOINLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX/action/storage_attestation","attest_author":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX/action/author_attestation","sign_citation":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX/action/citation_signature","submit_replication":"https://pith.science/pith/6C6LFGDOW4SLHPXWHJROYOINLX/action/replication_record"}},"created_at":"2026-05-18T03:26:39.594266+00:00","updated_at":"2026-05-18T03:26:39.594266+00:00"}