{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QEKIZSOVGKK5LAJEO7G5IP6244","short_pith_number":"pith:QEKIZSOV","canonical_record":{"source":{"id":"0904.3116","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-04-20T21:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"1193996050acf015d947ba5e7224168a278d0091ac7c7fd700aca63de3eca36a","abstract_canon_sha256":"14bddba76f3bbe31499efda184c58a94c59e43bb5b46e0f84db2f124c16d0685"},"schema_version":"1.0"},"canonical_sha256":"81148cc9d53295d5812477cdd43fdae733aa90c8f38de93970349e72b961845f","source":{"kind":"arxiv","id":"0904.3116","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3116","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3116v4","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3116","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"QEKIZSOVGKK5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QEKIZSOVGKK5LAJE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QEKIZSOV","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QEKIZSOVGKK5LAJEO7G5IP6244","target":"record","payload":{"canonical_record":{"source":{"id":"0904.3116","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-04-20T21:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"1193996050acf015d947ba5e7224168a278d0091ac7c7fd700aca63de3eca36a","abstract_canon_sha256":"14bddba76f3bbe31499efda184c58a94c59e43bb5b46e0f84db2f124c16d0685"},"schema_version":"1.0"},"canonical_sha256":"81148cc9d53295d5812477cdd43fdae733aa90c8f38de93970349e72b961845f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:33.429444Z","signature_b64":"lNhACC/vzftGYamBlu3aaOX7oDPYx7PTqbCWfgMqwYaxLFfBJQn8Ou5FCU+qCcSrSUN01ctgMUmC5BH1Mp54DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81148cc9d53295d5812477cdd43fdae733aa90c8f38de93970349e72b961845f","last_reissued_at":"2026-05-18T04:26:33.428819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:33.428819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.3116","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-18T04:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17pwf9c5aWT57DYkJ1+avHV42gfeLSe1jIrc8kwhGsEZjeVGa9eCK4XaMMzvV8+DJLZuQDytaKVgzinU+gaGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:02:24.419659Z"},"content_sha256":"fb6800f652b74946ef52898fa76a30fda9684adf7cf450ce6b32d2152c47c78e","schema_version":"1.0","event_id":"sha256:fb6800f652b74946ef52898fa76a30fda9684adf7cf450ce6b32d2152c47c78e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QEKIZSOVGKK5LAJEO7G5IP6244","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variations on Muchnik's Conditional Complexity Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Shen, Andrei Romashchenko, Daniil Musatov","submitted_at":"2009-04-20T21:05:09Z","abstract_excerpt":"Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be generalized to prove a version of Muchnik's theorem for space-bounded Kolmogorov complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3116","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-18T04:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwwPyPNSm7rLODNe2N8S99NVakKCaozUZwM/bXFX84He8mv0bpJkvM/DiiG4KzaUmLpms9wOx2EnDPXKlTI1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:02:24.419997Z"},"content_sha256":"959c3af73529d88a9f2eec1a039ff7ff102abd20d4047c0806fb5dcd5de14eb6","schema_version":"1.0","event_id":"sha256:959c3af73529d88a9f2eec1a039ff7ff102abd20d4047c0806fb5dcd5de14eb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/bundle.json","state_url":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEKIZSOVGKK5LAJEO7G5IP6244/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-20T01:02:24Z","links":{"resolver":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244","bundle":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/bundle.json","state":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEKIZSOVGKK5LAJEO7G5IP6244/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QEKIZSOVGKK5LAJEO7G5IP6244","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":"14bddba76f3bbe31499efda184c58a94c59e43bb5b46e0f84db2f124c16d0685","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-04-20T21:05:09Z","title_canon_sha256":"1193996050acf015d947ba5e7224168a278d0091ac7c7fd700aca63de3eca36a"},"schema_version":"1.0","source":{"id":"0904.3116","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3116","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3116v4","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3116","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"QEKIZSOVGKK5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QEKIZSOVGKK5LAJE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QEKIZSOV","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:959c3af73529d88a9f2eec1a039ff7ff102abd20d4047c0806fb5dcd5de14eb6","target":"graph","created_at":"2026-05-18T04:26:33Z","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":"Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be generalized to prove a version of Muchnik's theorem for space-bounded Kolmogorov complexity.","authors_text":"Alexander Shen, Andrei Romashchenko, Daniil Musatov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-04-20T21:05:09Z","title":"Variations on Muchnik's Conditional Complexity Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3116","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:fb6800f652b74946ef52898fa76a30fda9684adf7cf450ce6b32d2152c47c78e","target":"record","created_at":"2026-05-18T04:26:33Z","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":"14bddba76f3bbe31499efda184c58a94c59e43bb5b46e0f84db2f124c16d0685","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-04-20T21:05:09Z","title_canon_sha256":"1193996050acf015d947ba5e7224168a278d0091ac7c7fd700aca63de3eca36a"},"schema_version":"1.0","source":{"id":"0904.3116","kind":"arxiv","version":4}},"canonical_sha256":"81148cc9d53295d5812477cdd43fdae733aa90c8f38de93970349e72b961845f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81148cc9d53295d5812477cdd43fdae733aa90c8f38de93970349e72b961845f","first_computed_at":"2026-05-18T04:26:33.428819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:33.428819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNhACC/vzftGYamBlu3aaOX7oDPYx7PTqbCWfgMqwYaxLFfBJQn8Ou5FCU+qCcSrSUN01ctgMUmC5BH1Mp54DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:33.429444Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.3116","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb6800f652b74946ef52898fa76a30fda9684adf7cf450ce6b32d2152c47c78e","sha256:959c3af73529d88a9f2eec1a039ff7ff102abd20d4047c0806fb5dcd5de14eb6"],"state_sha256":"f509d942cd8cbd469d458803b41a96f949258ad4a020b7028acd9b99899d207b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l619aCflqpl0rndLo+ad/JXbAvnsQFNg53vR+pLxQ/SU2BKCLIJQEHTtYfCvn3ncWeVc9kr6Hb702g/9u4vEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T01:02:24.422017Z","bundle_sha256":"2d3db67aa304156782bc297440564aa86ba4229ae082b13bc6a9dbf5ee2be714"}}