{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CMH576DHDTYZ6GCQYSCOQMPKHP","short_pith_number":"pith:CMH576DH","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"},"canonical_sha256":"130fdff8671cf19f1850c484e831ea3bead3acd128300505d649098616881dc6","source":{"kind":"arxiv","id":"1006.0701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0701","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0701v1","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0701","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"CMH576DHDTYZ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CMH576DHDTYZ6GCQ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CMH576DH","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CMH576DHDTYZ6GCQYSCOQMPKHP","target":"record","payload":{"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"},"canonical_sha256":"130fdff8671cf19f1850c484e831ea3bead3acd128300505d649098616881dc6","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"},"source_kind":"arxiv","source_id":"1006.0701","source_version":1,"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-18T02:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKB5p/+s5yOwytydo2wXOKfygAVIdsKuslnVPLjPw+uI+zQS/raU0oB4JOZpZW1jnUJZvSyOLa9QS2vRlI3IAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:59:15.880222Z"},"content_sha256":"33a861c5e045db00878186f598b5e516328a06d12ac4583bd6669ecf1f3e14e0","schema_version":"1.0","event_id":"sha256:33a861c5e045db00878186f598b5e516328a06d12ac4583bd6669ecf1f3e14e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CMH576DHDTYZ6GCQYSCOQMPKHP","target":"graph","payload":{"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"},"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-18T02:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+FVi7p3NZCONLVEqlaJHPZwj346ki22Izqq7D8SEVCv1cR8x12jeBl2V6ZPcambCDV8AXV4zGrR6rDr+vUHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:59:15.880588Z"},"content_sha256":"3b427ab5d79731119c98f810138a8c3d8ee4ec6d32b4e6362a29b01d34d1e6d3","schema_version":"1.0","event_id":"sha256:3b427ab5d79731119c98f810138a8c3d8ee4ec6d32b4e6362a29b01d34d1e6d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/bundle.json","state_url":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/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-21T21:59:15Z","links":{"resolver":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP","bundle":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/bundle.json","state":"https://pith.science/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMH576DHDTYZ6GCQYSCOQMPKHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CMH576DHDTYZ6GCQYSCOQMPKHP","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":"c86e28d2a2f7f93a86ac99f6dcf3b8ee5a789ab20ecc577daf20ce4255160374","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-03T17:31:14Z","title_canon_sha256":"e009ba194ba7dab13a799d078d94229d1caa3b6413c6f6a4e33066e6ca841748"},"schema_version":"1.0","source":{"id":"1006.0701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0701","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0701v1","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0701","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"CMH576DHDTYZ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CMH576DHDTYZ6GCQ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CMH576DH","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:3b427ab5d79731119c98f810138a8c3d8ee4ec6d32b4e6362a29b01d34d1e6d3","target":"graph","created_at":"2026-05-18T02:07:05Z","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":"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","authors_text":"Marius Zimand","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-03T17:31:14Z","title":"Impossibility of independence amplification in Kolmogorov complexity theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0701","kind":"arxiv","version":1},"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:33a861c5e045db00878186f598b5e516328a06d12ac4583bd6669ecf1f3e14e0","target":"record","created_at":"2026-05-18T02:07:05Z","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":"c86e28d2a2f7f93a86ac99f6dcf3b8ee5a789ab20ecc577daf20ce4255160374","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-03T17:31:14Z","title_canon_sha256":"e009ba194ba7dab13a799d078d94229d1caa3b6413c6f6a4e33066e6ca841748"},"schema_version":"1.0","source":{"id":"1006.0701","kind":"arxiv","version":1}},"canonical_sha256":"130fdff8671cf19f1850c484e831ea3bead3acd128300505d649098616881dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"130fdff8671cf19f1850c484e831ea3bead3acd128300505d649098616881dc6","first_computed_at":"2026-05-18T02:07:05.172378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:05.172378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dPgf7A/Wkw3Ziqycrtqk6o1khYwyWSXmaZhRZegcQeKW3ax8sC218dHEEPK/MNYdYb8WBEZn7zu+09xhWW1jDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:05.172997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.0701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33a861c5e045db00878186f598b5e516328a06d12ac4583bd6669ecf1f3e14e0","sha256:3b427ab5d79731119c98f810138a8c3d8ee4ec6d32b4e6362a29b01d34d1e6d3"],"state_sha256":"95f935594ebf1e40730a73b4f7cf944cfb5a8b1b188f87bf4b19b365f7b32772"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/79xSY7I44kJqSHtXr99U+yKgOSKNQuZ9pG3dKo7PdFw/YQXgkTnmkwzuiAvtAALOTB3wXlmuGMa6anX8kHpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:59:15.882555Z","bundle_sha256":"289f686df8a488661406dccb3372fd0ebf0dbe1025a87f2d08ec78154d7dcbcc"}}