{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VDCKLLRANT6SOZQ75ERO2XTT7G","short_pith_number":"pith:VDCKLLRA","canonical_record":{"source":{"id":"1001.2686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-15T13:22:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1bece6fb14331938e94139872dd73b16b0f82dfdc5c457b58266aa1f9e5db1e5","abstract_canon_sha256":"766e2fe55586a6dcf9dc3630e17c4bed5b15f6f6e3b1267b41ea0a52698c719b"},"schema_version":"1.0"},"canonical_sha256":"a8c4a5ae206cfd27661fe922ed5e73f9b52c928a61ceb602d45014aa6771bd39","source":{"kind":"arxiv","id":"1001.2686","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2686","created_at":"2026-05-18T02:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2686v2","created_at":"2026-05-18T02:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2686","created_at":"2026-05-18T02:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"VDCKLLRANT6S","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VDCKLLRANT6SOZQ7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VDCKLLRA","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VDCKLLRANT6SOZQ75ERO2XTT7G","target":"record","payload":{"canonical_record":{"source":{"id":"1001.2686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-15T13:22:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1bece6fb14331938e94139872dd73b16b0f82dfdc5c457b58266aa1f9e5db1e5","abstract_canon_sha256":"766e2fe55586a6dcf9dc3630e17c4bed5b15f6f6e3b1267b41ea0a52698c719b"},"schema_version":"1.0"},"canonical_sha256":"a8c4a5ae206cfd27661fe922ed5e73f9b52c928a61ceb602d45014aa6771bd39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:43.818951Z","signature_b64":"O4rRgE5lmOCSvaMREMQEsTcTl0Spk680pEcJIyH/8RA8av+QDQPUYsm3YqFj3NAZQJO+9gziLFgVTA6g5PPYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8c4a5ae206cfd27661fe922ed5e73f9b52c928a61ceb602d45014aa6771bd39","last_reissued_at":"2026-05-18T02:09:43.818126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:43.818126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.2686","source_version":2,"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-18T02:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmUbwr4zjb7eIZoen3lgRbqQfX1TKH7LBqLcJa+g4xH118lcOW0XHOrPqKJ5oeMz6wTk56/WpcvBF21gV/t/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:24:10.776223Z"},"content_sha256":"ad6c401a2249ea793a08a16ace10f99b80bde4039425ede6078e676d8cc6dcdb","schema_version":"1.0","event_id":"sha256:ad6c401a2249ea793a08a16ace10f99b80bde4039425ede6078e676d8cc6dcdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VDCKLLRANT6SOZQ75ERO2XTT7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective complexity of stationary process realizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arleta Szkola, Markus Mueller, Nihat Ay","submitted_at":"2010-01-15T13:22:58Z","abstract_excerpt":"The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by means of ensembles, that is probability distributions on finite binary strings. In our previous paper we propose a definition of effective complexity in precise terms of algorithmic information theory. Here we investigate the effective complexity of binary strings generated by stationary, in general not computable, processes. We show that under not too strong conditions long typical process realizations are effectively"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2686","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"},"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-18T02:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVy0ikme6P+nDUa7L/VjlmCL3GmtxJmdC/FMcFs0Xkx+oTkUYbCF1aBNYs/jckOZmcl0XWAds9qAYT8ivM2vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:24:10.776587Z"},"content_sha256":"8de1d58d4beb34af7444984070d3137d990a78c436f76fa027b88ee4ac9ee49f","schema_version":"1.0","event_id":"sha256:8de1d58d4beb34af7444984070d3137d990a78c436f76fa027b88ee4ac9ee49f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDCKLLRANT6SOZQ75ERO2XTT7G/bundle.json","state_url":"https://pith.science/pith/VDCKLLRANT6SOZQ75ERO2XTT7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDCKLLRANT6SOZQ75ERO2XTT7G/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:24:10Z","links":{"resolver":"https://pith.science/pith/VDCKLLRANT6SOZQ75ERO2XTT7G","bundle":"https://pith.science/pith/VDCKLLRANT6SOZQ75ERO2XTT7G/bundle.json","state":"https://pith.science/pith/VDCKLLRANT6SOZQ75ERO2XTT7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDCKLLRANT6SOZQ75ERO2XTT7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VDCKLLRANT6SOZQ75ERO2XTT7G","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":"766e2fe55586a6dcf9dc3630e17c4bed5b15f6f6e3b1267b41ea0a52698c719b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-15T13:22:58Z","title_canon_sha256":"1bece6fb14331938e94139872dd73b16b0f82dfdc5c457b58266aa1f9e5db1e5"},"schema_version":"1.0","source":{"id":"1001.2686","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2686","created_at":"2026-05-18T02:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2686v2","created_at":"2026-05-18T02:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2686","created_at":"2026-05-18T02:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"VDCKLLRANT6S","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VDCKLLRANT6SOZQ7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VDCKLLRA","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:8de1d58d4beb34af7444984070d3137d990a78c436f76fa027b88ee4ac9ee49f","target":"graph","created_at":"2026-05-18T02:09:43Z","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":"The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by means of ensembles, that is probability distributions on finite binary strings. In our previous paper we propose a definition of effective complexity in precise terms of algorithmic information theory. Here we investigate the effective complexity of binary strings generated by stationary, in general not computable, processes. We show that under not too strong conditions long typical process realizations are effectively","authors_text":"Arleta Szkola, Markus Mueller, Nihat Ay","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-15T13:22:58Z","title":"Effective complexity of stationary process realizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2686","kind":"arxiv","version":2},"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:ad6c401a2249ea793a08a16ace10f99b80bde4039425ede6078e676d8cc6dcdb","target":"record","created_at":"2026-05-18T02:09:43Z","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":"766e2fe55586a6dcf9dc3630e17c4bed5b15f6f6e3b1267b41ea0a52698c719b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-15T13:22:58Z","title_canon_sha256":"1bece6fb14331938e94139872dd73b16b0f82dfdc5c457b58266aa1f9e5db1e5"},"schema_version":"1.0","source":{"id":"1001.2686","kind":"arxiv","version":2}},"canonical_sha256":"a8c4a5ae206cfd27661fe922ed5e73f9b52c928a61ceb602d45014aa6771bd39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8c4a5ae206cfd27661fe922ed5e73f9b52c928a61ceb602d45014aa6771bd39","first_computed_at":"2026-05-18T02:09:43.818126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:43.818126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O4rRgE5lmOCSvaMREMQEsTcTl0Spk680pEcJIyH/8RA8av+QDQPUYsm3YqFj3NAZQJO+9gziLFgVTA6g5PPYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:43.818951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.2686","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6c401a2249ea793a08a16ace10f99b80bde4039425ede6078e676d8cc6dcdb","sha256:8de1d58d4beb34af7444984070d3137d990a78c436f76fa027b88ee4ac9ee49f"],"state_sha256":"4e06f76b33088a2bc721edceb58cca668fce91506f5e8db19934956ec9902292"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUDI/zBGz1LfIk3/6s1tYxHPqfKYixb6DrQ3Xf6/axVBr9hFGywM7aPeWoZ7lAuDHn8HMD5J2RwrAJV2Q+uPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:24:10.778452Z","bundle_sha256":"346eb619ea4f4dcbdaec48f510d7d557fe2c9eadb9068e51842dbbbcaf5aaab0"}}