{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CMH576DHDTYZ6GCQYSCOQMPKHP","short_pith_number":"pith:CMH576DH","schema_version":"1.0","canonical_sha256":"130fdff8671cf19f1850c484e831ea3bead3acd128300505d649098616881dc6","source":{"kind":"arxiv","id":"1006.0701","version":1},"attestation_state":"computed","paper":{"title":"Impossibility of independence amplification in Kolmogorov complexity theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2010-06-03T17:31:14Z","abstract_excerpt":"The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is ${\\rm dep}(x,y) = \\max\\{C(x) - C(x \\mid y), C(y) - C(y\\mid x)\\}$, where $C(\\cdot)$ denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor $f$ such that, for any two $n$-bit strings with complexity $s(n)$ and dependency $\\alpha(n)$, it outputs a string of length $s(n)$ with complexity $s(n)- \\alpha(n)$ conditioned by any one of the i"},"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":"1006.0701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-03T17:31:14Z","cross_cats_sorted":[],"title_canon_sha256":"e009ba194ba7dab13a799d078d94229d1caa3b6413c6f6a4e33066e6ca841748","abstract_canon_sha256":"c86e28d2a2f7f93a86ac99f6dcf3b8ee5a789ab20ecc577daf20ce4255160374"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:05.172997Z","signature_b64":"dPgf7A/Wkw3Ziqycrtqk6o1khYwyWSXmaZhRZegcQeKW3ax8sC218dHEEPK/MNYdYb8WBEZn7zu+09xhWW1jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"130fdff8671cf19f1850c484e831ea3bead3acd128300505d649098616881dc6","last_reissued_at":"2026-05-18T02:07:05.172378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:05.172378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Impossibility of independence amplification in Kolmogorov complexity theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2010-06-03T17:31:14Z","abstract_excerpt":"The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is ${\\rm dep}(x,y) = \\max\\{C(x) - C(x \\mid y), C(y) - C(y\\mid x)\\}$, where $C(\\cdot)$ denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor $f$ such that, for any two $n$-bit strings with complexity $s(n)$ and dependency $\\alpha(n)$, it outputs a string of length $s(n)$ with complexity $s(n)- \\alpha(n)$ conditioned by any one of the i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0701","kind":"arxiv","version":1},"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":"1006.0701","created_at":"2026-05-18T02:07:05.172471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0701v1","created_at":"2026-05-18T02:07:05.172471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0701","created_at":"2026-05-18T02:07:05.172471+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMH576DHDTYZ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMH576DHDTYZ6GCQ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMH576DH","created_at":"2026-05-18T12:26:06.534383+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/CMH576DHDTYZ6GCQYSCOQMPKHP","json":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP.json","graph_json":"https://pith.science/api/pith-number/CMH576DHDTYZ6GCQYSCOQMPKHP/graph.json","events_json":"https://pith.science/api/pith-number/CMH576DHDTYZ6GCQYSCOQMPKHP/events.json","paper":"https://pith.science/paper/CMH576DH"},"agent_actions":{"view_html":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP","download_json":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP.json","view_paper":"https://pith.science/paper/CMH576DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0701&json=true","fetch_graph":"https://pith.science/api/pith-number/CMH576DHDTYZ6GCQYSCOQMPKHP/graph.json","fetch_events":"https://pith.science/api/pith-number/CMH576DHDTYZ6GCQYSCOQMPKHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/action/storage_attestation","attest_author":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/action/author_attestation","sign_citation":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/action/citation_signature","submit_replication":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/action/replication_record"}},"created_at":"2026-05-18T02:07:05.172471+00:00","updated_at":"2026-05-18T02:07:05.172471+00:00"}