{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QSSODCAYGIZ7NWVZ55IRXGQXTV","short_pith_number":"pith:QSSODCAY","canonical_record":{"source":{"id":"1504.06240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T16:20:58Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"title_canon_sha256":"084bda57fdf050cdf2d3629d96b9a1327c72019a6653784fe595b324ff166d20","abstract_canon_sha256":"1983d0443fefff83144a4aaa2708a1c5269949123765576c2d9c71400ef8b105"},"schema_version":"1.0"},"canonical_sha256":"84a4e188183233f6dab9ef511b9a179d64a5a5ffc7f84152a2ead764c2d53d00","source":{"kind":"arxiv","id":"1504.06240","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06240","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06240v3","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06240","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"QSSODCAYGIZ7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QSSODCAYGIZ7NWVZ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QSSODCAY","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QSSODCAYGIZ7NWVZ55IRXGQXTV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T16:20:58Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"title_canon_sha256":"084bda57fdf050cdf2d3629d96b9a1327c72019a6653784fe595b324ff166d20","abstract_canon_sha256":"1983d0443fefff83144a4aaa2708a1c5269949123765576c2d9c71400ef8b105"},"schema_version":"1.0"},"canonical_sha256":"84a4e188183233f6dab9ef511b9a179d64a5a5ffc7f84152a2ead764c2d53d00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:11.878791Z","signature_b64":"Z+Cw8l2pSmoAVhsyC60lfGZ9lJdbzrnI5+0lXrEQ3c+zTHEdxw2Lc6//08xNHkNnNi4bn+m+NkjhDE9sM+9aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84a4e188183233f6dab9ef511b9a179d64a5a5ffc7f84152a2ead764c2d53d00","last_reissued_at":"2026-05-18T00:38:11.878220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:11.878220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06240","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-18T00:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OftqUVLf0W6/v1DQ/wxBBda4uSHQeeNQ1vHISKhCUk0HR10c2SjQ+Z3CzKC1buOj7ncm3d/IAYISFhXXv5KqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:25:48.938551Z"},"content_sha256":"2a6e35bf8ebff75624bd680df9b7fdaed8ac316c35c27e417769d97727eb0588","schema_version":"1.0","event_id":"sha256:2a6e35bf8ebff75624bd680df9b7fdaed8ac316c35c27e417769d97727eb0588"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QSSODCAYGIZ7NWVZ55IRXGQXTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando Soler-Toscano, Hector Zenil","submitted_at":"2015-04-23T16:20:58Z","abstract_excerpt":"Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ones not different to entropy estimations, here we explore an alternative and complementary approach. We study formal properties of a Levin-inspired measure $m$ calculated from the output distribution of small Turing machines. We introduce and justify finite approximations $m_k$ that have been used in some applications as an alternative to lossless compression algorithms for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06240","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-18T00:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"styFIlEBhbV27aPE2Q+NBRPCq72Hgi2EFLHi4omK3Yr2MEY7cIstUs+LiU5pl+1q8lWRNv0sAjHJFi5FUMcrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:25:48.939067Z"},"content_sha256":"097f2bec8460a7b1e7bebdd73cb2009897598a05c868a4610580aa1eec367468","schema_version":"1.0","event_id":"sha256:097f2bec8460a7b1e7bebdd73cb2009897598a05c868a4610580aa1eec367468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV/bundle.json","state_url":"https://pith.science/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV/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-05-25T22:25:48Z","links":{"resolver":"https://pith.science/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV","bundle":"https://pith.science/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV/bundle.json","state":"https://pith.science/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSSODCAYGIZ7NWVZ55IRXGQXTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QSSODCAYGIZ7NWVZ55IRXGQXTV","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":"1983d0443fefff83144a4aaa2708a1c5269949123765576c2d9c71400ef8b105","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T16:20:58Z","title_canon_sha256":"084bda57fdf050cdf2d3629d96b9a1327c72019a6653784fe595b324ff166d20"},"schema_version":"1.0","source":{"id":"1504.06240","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06240","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06240v3","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06240","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"QSSODCAYGIZ7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QSSODCAYGIZ7NWVZ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QSSODCAY","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:097f2bec8460a7b1e7bebdd73cb2009897598a05c868a4610580aa1eec367468","target":"graph","created_at":"2026-05-18T00:38:11Z","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":"Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ones not different to entropy estimations, here we explore an alternative and complementary approach. We study formal properties of a Levin-inspired measure $m$ calculated from the output distribution of small Turing machines. We introduce and justify finite approximations $m_k$ that have been used in some applications as an alternative to lossless compression algorithms for ","authors_text":"Fernando Soler-Toscano, Hector Zenil","cross_cats":["cs.CC","cs.FL","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T16:20:58Z","title":"A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06240","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:2a6e35bf8ebff75624bd680df9b7fdaed8ac316c35c27e417769d97727eb0588","target":"record","created_at":"2026-05-18T00:38:11Z","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":"1983d0443fefff83144a4aaa2708a1c5269949123765576c2d9c71400ef8b105","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T16:20:58Z","title_canon_sha256":"084bda57fdf050cdf2d3629d96b9a1327c72019a6653784fe595b324ff166d20"},"schema_version":"1.0","source":{"id":"1504.06240","kind":"arxiv","version":3}},"canonical_sha256":"84a4e188183233f6dab9ef511b9a179d64a5a5ffc7f84152a2ead764c2d53d00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84a4e188183233f6dab9ef511b9a179d64a5a5ffc7f84152a2ead764c2d53d00","first_computed_at":"2026-05-18T00:38:11.878220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:11.878220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z+Cw8l2pSmoAVhsyC60lfGZ9lJdbzrnI5+0lXrEQ3c+zTHEdxw2Lc6//08xNHkNnNi4bn+m+NkjhDE9sM+9aAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:11.878791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06240","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a6e35bf8ebff75624bd680df9b7fdaed8ac316c35c27e417769d97727eb0588","sha256:097f2bec8460a7b1e7bebdd73cb2009897598a05c868a4610580aa1eec367468"],"state_sha256":"48b16dcbc487a459f7592f3d46e6f516abdab4202a3ce6f519ca2fbeb56bff39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+uUS684buAA8kjktYFNfdAUUG3BDK8mWyIrkrILde0SmOCLfJO5AW5YKBFueS/ciR/DVfmQZhygdO/A9huBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:25:48.942805Z","bundle_sha256":"8ba6ae50ecc3ef51239309233bd5380a207b385e5e7a972d88d3b18a64c263ca"}}