{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4Y3CGFN6AT62D3TAFELPQNVGUU","short_pith_number":"pith:4Y3CGFN6","schema_version":"1.0","canonical_sha256":"e6362315be04fda1ee602916f836a6a532c2cbb1c8ccb7da73fccd8f7d794f41","source":{"kind":"arxiv","id":"1111.4372","version":2},"attestation_state":"computed","paper":{"title":"An additivity theorem for plain Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Shen, Bruno Bauwens","submitted_at":"2011-11-18T14:27:43Z","abstract_excerpt":"We prove the formula C(a,b) = K(a|C(a,b)) + C(b|a,C(a,b)) + O(1) that expresses the plain complexity of a pair in terms of prefix and plain conditional complexities of its components."},"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":"1111.4372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-18T14:27:43Z","cross_cats_sorted":[],"title_canon_sha256":"57fef6988c670101fe60a4f93cc5c814b075c967fe7c5a31676c2189848f7bda","abstract_canon_sha256":"36c04fdfc5ca302e8e01c07a6fe66aafff7431efd37a68fa7886875ed9cc0806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:14.786002Z","signature_b64":"gga72etltUrnFwMNzuxv7L5lV7MdXKV8+n6dSoFK8WOqn9MesK9Fx0pdFGv/NBS+uajVZXMTapwQqvur+meyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6362315be04fda1ee602916f836a6a532c2cbb1c8ccb7da73fccd8f7d794f41","last_reissued_at":"2026-05-18T04:02:14.785377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:14.785377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An additivity theorem for plain Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Shen, Bruno Bauwens","submitted_at":"2011-11-18T14:27:43Z","abstract_excerpt":"We prove the formula C(a,b) = K(a|C(a,b)) + C(b|a,C(a,b)) + O(1) that expresses the plain complexity of a pair in terms of prefix and plain conditional complexities of its components."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4372","kind":"arxiv","version":2},"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":"1111.4372","created_at":"2026-05-18T04:02:14.785492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4372v2","created_at":"2026-05-18T04:02:14.785492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4372","created_at":"2026-05-18T04:02:14.785492+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Y3CGFN6AT62","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Y3CGFN6AT62D3TA","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Y3CGFN6","created_at":"2026-05-18T12:26:20.644004+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/4Y3CGFN6AT62D3TAFELPQNVGUU","json":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU.json","graph_json":"https://pith.science/api/pith-number/4Y3CGFN6AT62D3TAFELPQNVGUU/graph.json","events_json":"https://pith.science/api/pith-number/4Y3CGFN6AT62D3TAFELPQNVGUU/events.json","paper":"https://pith.science/paper/4Y3CGFN6"},"agent_actions":{"view_html":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU","download_json":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU.json","view_paper":"https://pith.science/paper/4Y3CGFN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4372&json=true","fetch_graph":"https://pith.science/api/pith-number/4Y3CGFN6AT62D3TAFELPQNVGUU/graph.json","fetch_events":"https://pith.science/api/pith-number/4Y3CGFN6AT62D3TAFELPQNVGUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU/action/storage_attestation","attest_author":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU/action/author_attestation","sign_citation":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU/action/citation_signature","submit_replication":"https://pith.science/pith/4Y3CGFN6AT62D3TAFELPQNVGUU/action/replication_record"}},"created_at":"2026-05-18T04:02:14.785492+00:00","updated_at":"2026-05-18T04:02:14.785492+00:00"}