{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QEKIZSOVGKK5LAJEO7G5IP6244","short_pith_number":"pith:QEKIZSOV","schema_version":"1.0","canonical_sha256":"81148cc9d53295d5812477cdd43fdae733aa90c8f38de93970349e72b961845f","source":{"kind":"arxiv","id":"0904.3116","version":4},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0904.3116","created_at":"2026-05-18T04:26:33.428912+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.3116v4","created_at":"2026-05-18T04:26:33.428912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3116","created_at":"2026-05-18T04:26:33.428912+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEKIZSOVGKK5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEKIZSOVGKK5LAJE","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEKIZSOV","created_at":"2026-05-18T12:26:01.383474+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/QEKIZSOVGKK5LAJEO7G5IP6244","json":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244.json","graph_json":"https://pith.science/api/pith-number/QEKIZSOVGKK5LAJEO7G5IP6244/graph.json","events_json":"https://pith.science/api/pith-number/QEKIZSOVGKK5LAJEO7G5IP6244/events.json","paper":"https://pith.science/paper/QEKIZSOV"},"agent_actions":{"view_html":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244","download_json":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244.json","view_paper":"https://pith.science/paper/QEKIZSOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.3116&json=true","fetch_graph":"https://pith.science/api/pith-number/QEKIZSOVGKK5LAJEO7G5IP6244/graph.json","fetch_events":"https://pith.science/api/pith-number/QEKIZSOVGKK5LAJEO7G5IP6244/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/action/storage_attestation","attest_author":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/action/author_attestation","sign_citation":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/action/citation_signature","submit_replication":"https://pith.science/pith/QEKIZSOVGKK5LAJEO7G5IP6244/action/replication_record"}},"created_at":"2026-05-18T04:26:33.428912+00:00","updated_at":"2026-05-18T04:26:33.428912+00:00"}