{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UZPYSPUFX6NKT7INDUE6NJFOEX","short_pith_number":"pith:UZPYSPUF","canonical_record":{"source":{"id":"1808.04626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T10:56:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20cea456cecade8ae1d364d62cae002901eaa76cff53ad4c7abb6b43d1127af9","abstract_canon_sha256":"53974de3f3facc5918d46536562387b8c2829c41c6c9024e9dc32ee464b7a248"},"schema_version":"1.0"},"canonical_sha256":"a65f893e85bf9aa9fd0d1d09e6a4ae25f3be36f048f0ff1efa1dd5bf388da35b","source":{"kind":"arxiv","id":"1808.04626","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04626","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04626v3","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04626","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"UZPYSPUFX6NK","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZPYSPUFX6NKT7IN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZPYSPUF","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UZPYSPUFX6NKT7INDUE6NJFOEX","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T10:56:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20cea456cecade8ae1d364d62cae002901eaa76cff53ad4c7abb6b43d1127af9","abstract_canon_sha256":"53974de3f3facc5918d46536562387b8c2829c41c6c9024e9dc32ee464b7a248"},"schema_version":"1.0"},"canonical_sha256":"a65f893e85bf9aa9fd0d1d09e6a4ae25f3be36f048f0ff1efa1dd5bf388da35b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:14.779164Z","signature_b64":"6CqXGW0GyRJovEOWYnoWCJl2RW10Jcjl9m+UvK1eHnA8w2AsDGAsZ9I+8tisXZaCRssEBn7ekVpC+S0/L+tZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65f893e85bf9aa9fd0d1d09e6a4ae25f3be36f048f0ff1efa1dd5bf388da35b","last_reissued_at":"2026-05-17T23:56:14.778443Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:14.778443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04626","source_version":3,"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-17T23:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJIW5fsQce2SlVRm/TUqVJcI+ThPWapIK/iweiqSnyNEkrFod92RHo1i+q3vexO5MKSVl1j0uVT+VyiYGo9dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:11:00.176775Z"},"content_sha256":"05e7e98e2d5ad280a92c648337b4c685301be1d98068b65d4ea30b73e96bec6b","schema_version":"1.0","event_id":"sha256:05e7e98e2d5ad280a92c648337b4c685301be1d98068b65d4ea30b73e96bec6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UZPYSPUFX6NKT7INDUE6NJFOEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random noise increases Kolmogorov complexity and Hausdorff dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Shen, Gleb Posobin","submitted_at":"2018-08-14T10:56:20Z","abstract_excerpt":"Consider a binary string $x$ of length $n$ whose Kolmogorov complexity is $\\alpha n$ for some $\\alpha<1$. We want to increase the complexity of $x$ by changing a small fraction of bits in $x$. This is always possible: Buhrman, Fortnow, Newman and Vereshchagin (2005) showed that the increase can be at least $\\delta n$ for large $n$ (where $\\delta$ is some positive number that depends on $\\alpha$ and the allowed fraction of changed bits).\n  We consider a related question: what happens with the complexity of $x$ when we randomly change a small fraction of the bits (changing each bit independently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04626","kind":"arxiv","version":3},"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-17T23:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEAOr8j0X27YpgfajPN8XzStLGlf44YlpH0/SPTtjqaauPBXf7KcDe1EWu2dA6VZRFCzRM+yqYBntaactZNVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:11:00.177130Z"},"content_sha256":"f66d1fcd8c25955750526678b4aa1f403c13cb1fc567404826a9497ab4bd981f","schema_version":"1.0","event_id":"sha256:f66d1fcd8c25955750526678b4aa1f403c13cb1fc567404826a9497ab4bd981f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZPYSPUFX6NKT7INDUE6NJFOEX/bundle.json","state_url":"https://pith.science/pith/UZPYSPUFX6NKT7INDUE6NJFOEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZPYSPUFX6NKT7INDUE6NJFOEX/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-07-02T23:11:00Z","links":{"resolver":"https://pith.science/pith/UZPYSPUFX6NKT7INDUE6NJFOEX","bundle":"https://pith.science/pith/UZPYSPUFX6NKT7INDUE6NJFOEX/bundle.json","state":"https://pith.science/pith/UZPYSPUFX6NKT7INDUE6NJFOEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZPYSPUFX6NKT7INDUE6NJFOEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UZPYSPUFX6NKT7INDUE6NJFOEX","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":"53974de3f3facc5918d46536562387b8c2829c41c6c9024e9dc32ee464b7a248","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T10:56:20Z","title_canon_sha256":"20cea456cecade8ae1d364d62cae002901eaa76cff53ad4c7abb6b43d1127af9"},"schema_version":"1.0","source":{"id":"1808.04626","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04626","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04626v3","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04626","created_at":"2026-05-17T23:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"UZPYSPUFX6NK","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZPYSPUFX6NKT7IN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZPYSPUF","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:f66d1fcd8c25955750526678b4aa1f403c13cb1fc567404826a9497ab4bd981f","target":"graph","created_at":"2026-05-17T23:56:14Z","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":"Consider a binary string $x$ of length $n$ whose Kolmogorov complexity is $\\alpha n$ for some $\\alpha<1$. We want to increase the complexity of $x$ by changing a small fraction of bits in $x$. This is always possible: Buhrman, Fortnow, Newman and Vereshchagin (2005) showed that the increase can be at least $\\delta n$ for large $n$ (where $\\delta$ is some positive number that depends on $\\alpha$ and the allowed fraction of changed bits).\n  We consider a related question: what happens with the complexity of $x$ when we randomly change a small fraction of the bits (changing each bit independently","authors_text":"Alexander Shen, Gleb Posobin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T10:56:20Z","title":"Random noise increases Kolmogorov complexity and Hausdorff dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04626","kind":"arxiv","version":3},"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:05e7e98e2d5ad280a92c648337b4c685301be1d98068b65d4ea30b73e96bec6b","target":"record","created_at":"2026-05-17T23:56:14Z","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":"53974de3f3facc5918d46536562387b8c2829c41c6c9024e9dc32ee464b7a248","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T10:56:20Z","title_canon_sha256":"20cea456cecade8ae1d364d62cae002901eaa76cff53ad4c7abb6b43d1127af9"},"schema_version":"1.0","source":{"id":"1808.04626","kind":"arxiv","version":3}},"canonical_sha256":"a65f893e85bf9aa9fd0d1d09e6a4ae25f3be36f048f0ff1efa1dd5bf388da35b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a65f893e85bf9aa9fd0d1d09e6a4ae25f3be36f048f0ff1efa1dd5bf388da35b","first_computed_at":"2026-05-17T23:56:14.778443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:14.778443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6CqXGW0GyRJovEOWYnoWCJl2RW10Jcjl9m+UvK1eHnA8w2AsDGAsZ9I+8tisXZaCRssEBn7ekVpC+S0/L+tZAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:14.779164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04626","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05e7e98e2d5ad280a92c648337b4c685301be1d98068b65d4ea30b73e96bec6b","sha256:f66d1fcd8c25955750526678b4aa1f403c13cb1fc567404826a9497ab4bd981f"],"state_sha256":"1514accfb91f76b001e6edee0eb1952c6f33e92f76be790864bf5d8d61e1498c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOMX5ILZkK3XNKaZ0wPtrmhSaYk3eTYWqEi7YwoHa4N1OEAR/0xtxh+kbdyhwDzkx3j+sB3EQxlZ+z7fTxCbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:11:00.179124Z","bundle_sha256":"f8ed0de1531677b1318be5a07d9c33838623ead23f4486e4c641545a78a59109"}}