{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MUVLIBT7M5DT7J5RNJP2BY4DF2","short_pith_number":"pith:MUVLIBT7","canonical_record":{"source":{"id":"1310.5230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T13:42:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6adfaf70d377e58c4944e785300addfff8f7014d1c601782608fa0e67f81bb2f","abstract_canon_sha256":"ffb16ac944d315bfbb23f22bdc5112098e2aa403bd586f019dc448325299a1e0"},"schema_version":"1.0"},"canonical_sha256":"652ab4067f67473fa7b16a5fa0e3832e926e0dee38957357a504084a7d343709","source":{"kind":"arxiv","id":"1310.5230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5230","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5230v1","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5230","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"MUVLIBT7M5DT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUVLIBT7M5DT7J5R","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUVLIBT7","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MUVLIBT7M5DT7J5RNJP2BY4DF2","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T13:42:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6adfaf70d377e58c4944e785300addfff8f7014d1c601782608fa0e67f81bb2f","abstract_canon_sha256":"ffb16ac944d315bfbb23f22bdc5112098e2aa403bd586f019dc448325299a1e0"},"schema_version":"1.0"},"canonical_sha256":"652ab4067f67473fa7b16a5fa0e3832e926e0dee38957357a504084a7d343709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:46.570830Z","signature_b64":"hkrknAibI4m3JDvIkt6ZT03RWF7W0CHViymQCot6GWtJZ2B0PabxUFjoYnh5bGWp0gTOquTDRjvw+ZsiuaBRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"652ab4067f67473fa7b16a5fa0e3832e926e0dee38957357a504084a7d343709","last_reissued_at":"2026-05-18T03:09:46.569987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:46.569987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5230","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-18T03:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ih6/Qtqdf/15IKStFj5JRYm/stE/diif67RQZSFj/xXHF7sDagxNVxRR6+u9ZczvCpagXiTmkeWjE+Vkx8dDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:13.664001Z"},"content_sha256":"1ccff034fc1d0b0ecc23d19789a51cb193baca60c7d39b2052915496e6f0e9fa","schema_version":"1.0","event_id":"sha256:1ccff034fc1d0b0ecc23d19789a51cb193baca60c7d39b2052915496e6f0e9fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MUVLIBT7M5DT7J5RNJP2BY4DF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs","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-10-19T13:42:18Z","abstract_excerpt":"Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C: they are sequences that have infinitely many initial segments with O(1)-maximal plain complexity (among the strings of the same length). Later Miller [17] showed that prefix complexity K can also be used in a similar way: a sequence is 2-random if and only if it has infinitely many initial segments with O(1)-maximal prefix complexity (which is n + K (n) for strings of length n). The known proofs of these r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5230","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-18T03:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pv8yemATx2m4Iq17AfEfrI/28s82ZbNNTAQmqWHH6nBwIpdCN1PXROjLZ1GAJxDpC7x3m0DoH04a0OUhSckbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:13.664740Z"},"content_sha256":"aca0753b15af30c4b03f644125b371c3b6f543a73338d8f08cfb1a3bf51f4e0c","schema_version":"1.0","event_id":"sha256:aca0753b15af30c4b03f644125b371c3b6f543a73338d8f08cfb1a3bf51f4e0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2/bundle.json","state_url":"https://pith.science/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2/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-07T12:01:13Z","links":{"resolver":"https://pith.science/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2","bundle":"https://pith.science/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2/bundle.json","state":"https://pith.science/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUVLIBT7M5DT7J5RNJP2BY4DF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MUVLIBT7M5DT7J5RNJP2BY4DF2","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":"ffb16ac944d315bfbb23f22bdc5112098e2aa403bd586f019dc448325299a1e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T13:42:18Z","title_canon_sha256":"6adfaf70d377e58c4944e785300addfff8f7014d1c601782608fa0e67f81bb2f"},"schema_version":"1.0","source":{"id":"1310.5230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5230","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5230v1","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5230","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"MUVLIBT7M5DT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUVLIBT7M5DT7J5R","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUVLIBT7","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:aca0753b15af30c4b03f644125b371c3b6f543a73338d8f08cfb1a3bf51f4e0c","target":"graph","created_at":"2026-05-18T03:09:46Z","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":"Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C: they are sequences that have infinitely many initial segments with O(1)-maximal plain complexity (among the strings of the same length). Later Miller [17] showed that prefix complexity K can also be used in a similar way: a sequence is 2-random if and only if it has infinitely many initial segments with O(1)-maximal prefix complexity (which is n + K (n) for strings of length n). The known proofs of these r","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-10-19T13:42:18Z","title":"Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5230","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:1ccff034fc1d0b0ecc23d19789a51cb193baca60c7d39b2052915496e6f0e9fa","target":"record","created_at":"2026-05-18T03:09:46Z","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":"ffb16ac944d315bfbb23f22bdc5112098e2aa403bd586f019dc448325299a1e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-19T13:42:18Z","title_canon_sha256":"6adfaf70d377e58c4944e785300addfff8f7014d1c601782608fa0e67f81bb2f"},"schema_version":"1.0","source":{"id":"1310.5230","kind":"arxiv","version":1}},"canonical_sha256":"652ab4067f67473fa7b16a5fa0e3832e926e0dee38957357a504084a7d343709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"652ab4067f67473fa7b16a5fa0e3832e926e0dee38957357a504084a7d343709","first_computed_at":"2026-05-18T03:09:46.569987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:46.569987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hkrknAibI4m3JDvIkt6ZT03RWF7W0CHViymQCot6GWtJZ2B0PabxUFjoYnh5bGWp0gTOquTDRjvw+ZsiuaBRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:46.570830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ccff034fc1d0b0ecc23d19789a51cb193baca60c7d39b2052915496e6f0e9fa","sha256:aca0753b15af30c4b03f644125b371c3b6f543a73338d8f08cfb1a3bf51f4e0c"],"state_sha256":"a67ef2ffd31a832080ca1438b5ed9d1b541faeb9efb04803364e18bb49578d00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9m3J/wNTRRwP4vtskjfbkOCwRgFVdtQoRTKv9LsbdSL6mj4jUjgHykUbRQBeHCBtqcXiuI0N6Qqp2sZ4amFwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:01:13.668528Z","bundle_sha256":"297f127d33b9a208c107269ffd0a926f18568a4d1964002f2e5651871afd2774"}}