{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UPT3YDPA34ECCZISONAORX2Z2F","short_pith_number":"pith:UPT3YDPA","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"},"canonical_sha256":"a3e7bc0de0df082165127340e8df59d170d1f6aef95aaf68ebcb772116dcf38a","source":{"kind":"arxiv","id":"1609.05984","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05984","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05984v4","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05984","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"UPT3YDPA34EC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPT3YDPA34ECCZIS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPT3YDPA","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UPT3YDPA34ECCZISONAORX2Z2F","target":"record","payload":{"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"},"canonical_sha256":"a3e7bc0de0df082165127340e8df59d170d1f6aef95aaf68ebcb772116dcf38a","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"},"source_kind":"arxiv","source_id":"1609.05984","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gx3F4GvPZ2IZMbCfRhdRYqHHRH+hw624260512EPpQmJgMG08uIzmB+GN2OLaiFI8MwvUNNd6V+V26nlCdJhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:19:20.643109Z"},"content_sha256":"e59e255fe412ad83a714f30af801632adbe9a73a4a515c1e65ed7c531736fb13","schema_version":"1.0","event_id":"sha256:e59e255fe412ad83a714f30af801632adbe9a73a4a515c1e65ed7c531736fb13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UPT3YDPA34ECCZISONAORX2Z2F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8w6+kqakNtlzqqMlCAzSSYZLg/sdFDB8BM+10vMOvXrX/JHjkwdXxTZDZTcYYNHo6TthotyUsyEgkKeNVZN7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:19:20.643464Z"},"content_sha256":"42e3b230b972c46c4af7a02f3527103a3ca544f368935fc8ad07194fe99aaa8a","schema_version":"1.0","event_id":"sha256:42e3b230b972c46c4af7a02f3527103a3ca544f368935fc8ad07194fe99aaa8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/bundle.json","state_url":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPT3YDPA34ECCZISONAORX2Z2F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T23:19:20Z","links":{"resolver":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F","bundle":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/bundle.json","state":"https://pith.science/pith/UPT3YDPA34ECCZISONAORX2Z2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPT3YDPA34ECCZISONAORX2Z2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UPT3YDPA34ECCZISONAORX2Z2F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dc69c6b3a1f00452444f867bec77f647b66cc41ee96b799fd0b48d3aad2b7fa0","cross_cats_sorted":["cs.IT","math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T01:19:02Z","title_canon_sha256":"76b0f87939f1597252b85f892e652b23920e007778e3cfc67ba70f400dd77735"},"schema_version":"1.0","source":{"id":"1609.05984","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05984","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05984v4","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05984","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"UPT3YDPA34EC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPT3YDPA34ECCZIS","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPT3YDPA","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:42e3b230b972c46c4af7a02f3527103a3ca544f368935fc8ad07194fe99aaa8a","target":"graph","created_at":"2026-05-18T00:51:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Marius Zimand","cross_cats":["cs.IT","math.IT","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T01:19:02Z","title":"List approximation for increasing Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05984","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e59e255fe412ad83a714f30af801632adbe9a73a4a515c1e65ed7c531736fb13","target":"record","created_at":"2026-05-18T00:51:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dc69c6b3a1f00452444f867bec77f647b66cc41ee96b799fd0b48d3aad2b7fa0","cross_cats_sorted":["cs.IT","math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-20T01:19:02Z","title_canon_sha256":"76b0f87939f1597252b85f892e652b23920e007778e3cfc67ba70f400dd77735"},"schema_version":"1.0","source":{"id":"1609.05984","kind":"arxiv","version":4}},"canonical_sha256":"a3e7bc0de0df082165127340e8df59d170d1f6aef95aaf68ebcb772116dcf38a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3e7bc0de0df082165127340e8df59d170d1f6aef95aaf68ebcb772116dcf38a","first_computed_at":"2026-05-18T00:51:22.475217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:22.475217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bN1ec2xd2cMB0e3RrPESh0/grfNuXjLPwZIz0Udc8Riqj2eCw/LFhS6gjIy5DWvGQwGzPFP9KhNz1iDWRronDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:22.475984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05984","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e59e255fe412ad83a714f30af801632adbe9a73a4a515c1e65ed7c531736fb13","sha256:42e3b230b972c46c4af7a02f3527103a3ca544f368935fc8ad07194fe99aaa8a"],"state_sha256":"c00fb6aa849ae087f9c521e5a6280c10d735d9fc4a3487f1459af16db47f8cc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JS+T/rz/8n/YZMH6tu/O7cfkVk7p845yyIHQ+26smZRblbiq9jIPOyNXb5S94ZeEPOh1emTAi/YbKOkWDa3LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:19:20.645373Z","bundle_sha256":"a7b8594108fe978452159533db31933c9c4f15aac9260d1acac7a7f8e9a5d010"}}