{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QHH75XGBG2XR5U357M4WG3FZYI","short_pith_number":"pith:QHH75XGB","canonical_record":{"source":{"id":"1307.4007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-15T16:22:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64c1e92d143390309933f5a2235a0a4c368bc3efb145d8f2d37988bbdc751fa4","abstract_canon_sha256":"c9a9ed5f4fe958c48817cdceb5807529ddc20fbc544f3b596886337014158bec"},"schema_version":"1.0"},"canonical_sha256":"81cffedcc136af1ed37dfb39636cb9c22661487b8b2caf9fd99c04abd79d3f77","source":{"kind":"arxiv","id":"1307.4007","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4007","created_at":"2026-05-18T03:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4007v3","created_at":"2026-05-18T03:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4007","created_at":"2026-05-18T03:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"QHH75XGBG2XR","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QHH75XGBG2XR5U35","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QHH75XGB","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QHH75XGBG2XR5U357M4WG3FZYI","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-15T16:22:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"64c1e92d143390309933f5a2235a0a4c368bc3efb145d8f2d37988bbdc751fa4","abstract_canon_sha256":"c9a9ed5f4fe958c48817cdceb5807529ddc20fbc544f3b596886337014158bec"},"schema_version":"1.0"},"canonical_sha256":"81cffedcc136af1ed37dfb39636cb9c22661487b8b2caf9fd99c04abd79d3f77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:59.330510Z","signature_b64":"k6fr13rQBP3+dcDSbvHExboDCqBQO8x9XKREvnJnOMR9kmH59A2AEVhYfUy1mcuJbvl4JIb0cpp+I6ow+04HCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81cffedcc136af1ed37dfb39636cb9c22661487b8b2caf9fd99c04abd79d3f77","last_reissued_at":"2026-05-18T03:02:59.329724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:59.329724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4007","source_version":3,"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-18T03:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ftrqX3bsUO0z86GzoFNIVnjxyExUo3kgTaGGbwnFbhbbof1Ueuca/i2H0UvE4PFPwpy2WLtKZe2auaUgzlnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:20:23.662791Z"},"content_sha256":"469f82e12c900c206432357fe756a583d51fe36e869abb0e10877ae5e5c36e33","schema_version":"1.0","event_id":"sha256:469f82e12c900c206432357fe756a583d51fe36e869abb0e10877ae5e5c36e33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QHH75XGBG2XR5U357M4WG3FZYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetry of the Kolmogorov complexity of online predicting odd and even bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bruno Bauwens","submitted_at":"2013-07-15T16:22:29Z","abstract_excerpt":"Symmetry of information states that $C(x) + C(y|x) = C(x,y) + O(\\log C(x))$. We show that a similar relation for online Kolmogorov complexity does not hold. Let the even (online Kolmogorov) complexity of an n-bitstring $x_1x_2... x_n$ be the length of a shortest program that computes $x_2$ on input $x_1$, computes $x_4$ on input $x_1x_2x_3$, etc; and similar for odd complexity. We show that for all n there exist an n-bit x such that both odd and even complexity are almost as large as the Kolmogorov complexity of the whole string. Moreover, flipping odd and even bits to obtain a sequence $x_2x_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4007","kind":"arxiv","version":3},"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-18T03:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NpGePRWknRu9d4069QsEmWemER8eQHb07EngQDZ1IHPsJVXVZdWZYFtbvVGhJIfx7HHq2WB76OkxGo3UreRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:20:23.663461Z"},"content_sha256":"1a7ed609937042b7002e42b6132390e3b3c3652670cd90d5cf4994278615c7c5","schema_version":"1.0","event_id":"sha256:1a7ed609937042b7002e42b6132390e3b3c3652670cd90d5cf4994278615c7c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHH75XGBG2XR5U357M4WG3FZYI/bundle.json","state_url":"https://pith.science/pith/QHH75XGBG2XR5U357M4WG3FZYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHH75XGBG2XR5U357M4WG3FZYI/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-08T03:20:23Z","links":{"resolver":"https://pith.science/pith/QHH75XGBG2XR5U357M4WG3FZYI","bundle":"https://pith.science/pith/QHH75XGBG2XR5U357M4WG3FZYI/bundle.json","state":"https://pith.science/pith/QHH75XGBG2XR5U357M4WG3FZYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHH75XGBG2XR5U357M4WG3FZYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QHH75XGBG2XR5U357M4WG3FZYI","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":"c9a9ed5f4fe958c48817cdceb5807529ddc20fbc544f3b596886337014158bec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-15T16:22:29Z","title_canon_sha256":"64c1e92d143390309933f5a2235a0a4c368bc3efb145d8f2d37988bbdc751fa4"},"schema_version":"1.0","source":{"id":"1307.4007","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4007","created_at":"2026-05-18T03:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4007v3","created_at":"2026-05-18T03:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4007","created_at":"2026-05-18T03:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"QHH75XGBG2XR","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QHH75XGBG2XR5U35","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QHH75XGB","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:1a7ed609937042b7002e42b6132390e3b3c3652670cd90d5cf4994278615c7c5","target":"graph","created_at":"2026-05-18T03:02:59Z","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":"Symmetry of information states that $C(x) + C(y|x) = C(x,y) + O(\\log C(x))$. We show that a similar relation for online Kolmogorov complexity does not hold. Let the even (online Kolmogorov) complexity of an n-bitstring $x_1x_2... x_n$ be the length of a shortest program that computes $x_2$ on input $x_1$, computes $x_4$ on input $x_1x_2x_3$, etc; and similar for odd complexity. We show that for all n there exist an n-bit x such that both odd and even complexity are almost as large as the Kolmogorov complexity of the whole string. Moreover, flipping odd and even bits to obtain a sequence $x_2x_","authors_text":"Bruno Bauwens","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-15T16:22:29Z","title":"Asymmetry of the Kolmogorov complexity of online predicting odd and even bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4007","kind":"arxiv","version":3},"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:469f82e12c900c206432357fe756a583d51fe36e869abb0e10877ae5e5c36e33","target":"record","created_at":"2026-05-18T03:02:59Z","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":"c9a9ed5f4fe958c48817cdceb5807529ddc20fbc544f3b596886337014158bec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-15T16:22:29Z","title_canon_sha256":"64c1e92d143390309933f5a2235a0a4c368bc3efb145d8f2d37988bbdc751fa4"},"schema_version":"1.0","source":{"id":"1307.4007","kind":"arxiv","version":3}},"canonical_sha256":"81cffedcc136af1ed37dfb39636cb9c22661487b8b2caf9fd99c04abd79d3f77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81cffedcc136af1ed37dfb39636cb9c22661487b8b2caf9fd99c04abd79d3f77","first_computed_at":"2026-05-18T03:02:59.329724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:59.329724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k6fr13rQBP3+dcDSbvHExboDCqBQO8x9XKREvnJnOMR9kmH59A2AEVhYfUy1mcuJbvl4JIb0cpp+I6ow+04HCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:59.330510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4007","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:469f82e12c900c206432357fe756a583d51fe36e869abb0e10877ae5e5c36e33","sha256:1a7ed609937042b7002e42b6132390e3b3c3652670cd90d5cf4994278615c7c5"],"state_sha256":"be12aea000ef5a6ecef420140da33a349a07a7ad4a4a032485947df86b06d716"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKH8ACOUmlx1/XQH8b+/+VWKNCv55DfGHg7y2vUA1TVPjBB3G+PPRGvhCBbX8oCKtPzNznC8tL/RexxPD4ZvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:20:23.667059Z","bundle_sha256":"aa995f35e50ac3eeb0d9f5a52f974f89389da68b2efbb61b34089baeed9e9e1b"}}