{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MTTEMGQJND77DXX4UCMBP2JKAD","short_pith_number":"pith:MTTEMGQJ","canonical_record":{"source":{"id":"1510.07202","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-25T03:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"015b214499c48b0aa51fc10797133b0ddadc25e6c78a8f3192eb8438e646658c","abstract_canon_sha256":"2e80b19920fce343064ed48faf34199988493f5f15a1310aaf27add75c0a6cb0"},"schema_version":"1.0"},"canonical_sha256":"64e6461a0968fff1defca09817e92a00fe571278cdf46c92a0f5ac583cdf0091","source":{"kind":"arxiv","id":"1510.07202","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07202","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07202v5","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07202","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"MTTEMGQJND77","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MTTEMGQJND77DXX4","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MTTEMGQJ","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MTTEMGQJND77DXX4UCMBP2JKAD","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07202","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-25T03:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"015b214499c48b0aa51fc10797133b0ddadc25e6c78a8f3192eb8438e646658c","abstract_canon_sha256":"2e80b19920fce343064ed48faf34199988493f5f15a1310aaf27add75c0a6cb0"},"schema_version":"1.0"},"canonical_sha256":"64e6461a0968fff1defca09817e92a00fe571278cdf46c92a0f5ac583cdf0091","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:58.984355Z","signature_b64":"KhAEaCJeLeJRnzsYOG+/gE6vQO2mJgaKZesgEDtWwjfaaiIzpdowXRbu9xIntaz+c1RGVCHzg1BZgUS/ALuDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e6461a0968fff1defca09817e92a00fe571278cdf46c92a0f5ac583cdf0091","last_reissued_at":"2026-05-18T00:59:58.983810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:58.983810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07202","source_version":5,"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-18T00:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aFrd19u/FpriU+zTs8M685k3HUPbDCM8rAAoBfOiDZiRbo46UxzuPRi5cP2d2mUAvbNEH+1jucUV4T8cHf1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:34:26.620514Z"},"content_sha256":"52e6ed6684cf1dc8fd5c99e2461265cd2a7f0f4a72f0a8fd314880ba81f2bb58","schema_version":"1.0","event_id":"sha256:52e6ed6684cf1dc8fd5c99e2461265cd2a7f0f4a72f0a8fd314880ba81f2bb58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MTTEMGQJND77DXX4UCMBP2JKAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomness for computable measures and initial segment complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Christopher P. Porter, Rupert H\\\"olzl","submitted_at":"2015-10-25T03:02:03Z","abstract_excerpt":"We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\\omega$, the so-called proper sequences. Our main results are as follows: (1) We show that the initial segment complexity of a proper sequence $X$ is bounded from below by a computable function (that is, $X$ is complex) if and only if $X$ is random with respect to some computable, continuous measure. (2) We prove that a uniform version of the previous result fails to hold: there is a family of complex sequences that are random with respe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07202","kind":"arxiv","version":5},"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-18T00:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcAFP1SiDZB/ySwc/bbj+p2mBKc7iCYVvEKE+D05UtlZ479nctQyXcZcIcqDVhQyYTik+gJEjo9HMZUr5MpaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:34:26.620858Z"},"content_sha256":"c1da6cae5415dd429550f9340bebdf34ba505af8197132560869df01eb442ed1","schema_version":"1.0","event_id":"sha256:c1da6cae5415dd429550f9340bebdf34ba505af8197132560869df01eb442ed1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTTEMGQJND77DXX4UCMBP2JKAD/bundle.json","state_url":"https://pith.science/pith/MTTEMGQJND77DXX4UCMBP2JKAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTTEMGQJND77DXX4UCMBP2JKAD/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-01T11:34:26Z","links":{"resolver":"https://pith.science/pith/MTTEMGQJND77DXX4UCMBP2JKAD","bundle":"https://pith.science/pith/MTTEMGQJND77DXX4UCMBP2JKAD/bundle.json","state":"https://pith.science/pith/MTTEMGQJND77DXX4UCMBP2JKAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTTEMGQJND77DXX4UCMBP2JKAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MTTEMGQJND77DXX4UCMBP2JKAD","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":"2e80b19920fce343064ed48faf34199988493f5f15a1310aaf27add75c0a6cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-25T03:02:03Z","title_canon_sha256":"015b214499c48b0aa51fc10797133b0ddadc25e6c78a8f3192eb8438e646658c"},"schema_version":"1.0","source":{"id":"1510.07202","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07202","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07202v5","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07202","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"MTTEMGQJND77","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MTTEMGQJND77DXX4","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MTTEMGQJ","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:c1da6cae5415dd429550f9340bebdf34ba505af8197132560869df01eb442ed1","target":"graph","created_at":"2026-05-18T00:59:58Z","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":"We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\\omega$, the so-called proper sequences. Our main results are as follows: (1) We show that the initial segment complexity of a proper sequence $X$ is bounded from below by a computable function (that is, $X$ is complex) if and only if $X$ is random with respect to some computable, continuous measure. (2) We prove that a uniform version of the previous result fails to hold: there is a family of complex sequences that are random with respe","authors_text":"Christopher P. Porter, Rupert H\\\"olzl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-25T03:02:03Z","title":"Randomness for computable measures and initial segment complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07202","kind":"arxiv","version":5},"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:52e6ed6684cf1dc8fd5c99e2461265cd2a7f0f4a72f0a8fd314880ba81f2bb58","target":"record","created_at":"2026-05-18T00:59:58Z","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":"2e80b19920fce343064ed48faf34199988493f5f15a1310aaf27add75c0a6cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-25T03:02:03Z","title_canon_sha256":"015b214499c48b0aa51fc10797133b0ddadc25e6c78a8f3192eb8438e646658c"},"schema_version":"1.0","source":{"id":"1510.07202","kind":"arxiv","version":5}},"canonical_sha256":"64e6461a0968fff1defca09817e92a00fe571278cdf46c92a0f5ac583cdf0091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e6461a0968fff1defca09817e92a00fe571278cdf46c92a0f5ac583cdf0091","first_computed_at":"2026-05-18T00:59:58.983810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:58.983810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KhAEaCJeLeJRnzsYOG+/gE6vQO2mJgaKZesgEDtWwjfaaiIzpdowXRbu9xIntaz+c1RGVCHzg1BZgUS/ALuDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:58.984355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07202","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52e6ed6684cf1dc8fd5c99e2461265cd2a7f0f4a72f0a8fd314880ba81f2bb58","sha256:c1da6cae5415dd429550f9340bebdf34ba505af8197132560869df01eb442ed1"],"state_sha256":"b9dc47e70ad62d66e3ddfbce04b01ea71ac5cc9160a769ae6da7344b2ff49720"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdTsKtgBwoVK2FHku3GRr6++0YU2EPtRO95TcgV3H/GCRPFuJpjftprYccvTqO2yEphbd1JsuwvWWklU7MAVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:34:26.622747Z","bundle_sha256":"1a652a64bb57a2a5bbb3599c1d242bafc1df130919431ea6181d4352416a0ac5"}}