{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UGNDJTFB5X4WVZCS2UEHKCYTDA","short_pith_number":"pith:UGNDJTFB","canonical_record":{"source":{"id":"1211.4891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-20T22:05:06Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"title_canon_sha256":"0d4eea37e3abead75199af31b827befbf1e07e1a49e7b7545c8d1c58d9a9bf9b","abstract_canon_sha256":"0e10815ee97159123120881185c320f5fa928535ecff0d6eec843c4634696322"},"schema_version":"1.0"},"canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","source":{"kind":"arxiv","id":"1211.4891","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4891","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4891v3","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4891","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"UGNDJTFB5X4W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UGNDJTFB5X4WVZCS","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UGNDJTFB","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UGNDJTFB5X4WVZCS2UEHKCYTDA","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-20T22:05:06Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"title_canon_sha256":"0d4eea37e3abead75199af31b827befbf1e07e1a49e7b7545c8d1c58d9a9bf9b","abstract_canon_sha256":"0e10815ee97159123120881185c320f5fa928535ecff0d6eec843c4634696322"},"schema_version":"1.0"},"canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:01.602503Z","signature_b64":"3csmIds9CczSpWJsadeSxPDiRgiQTbSwRWEq2dR8vWk+MANppQ9K2QrPu6nhi9zJhr4Xuhw9WEj2p/FoXXq0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","last_reissued_at":"2026-05-18T03:05:01.601999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:01.601999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4891","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:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pUaAPT0Op9B/PDm+LjMo2wxyPnMUjkYwuhmCpeBAEAlrH6T0dOQZVwB/Kj2XyT5bppLYhxyoJj+Q0cZO3UODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:16.042785Z"},"content_sha256":"c45b7e1eaafe9bb43ecd6ee59b1eea7edf5c0da34bf1bb5fb3e5110fa6227b2a","schema_version":"1.0","event_id":"sha256:c45b7e1eaafe9bb43ecd6ee59b1eea7edf5c0da34bf1bb5fb3e5110fa6227b2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UGNDJTFB5X4WVZCS2UEHKCYTDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures","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, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-11-20T22:05:06Z","abstract_excerpt":"We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in agreement with the number of instructions used by the Turing machines producing s, which is consistent with strict integer-value program-size complexity. Nevertheless, K_m proves to be a finer-grained measure and a potential alternative approach to lossless compression algorithms for small entities, where compression fails. We also show that neither K_m nor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4891","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:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"timyGKT9CWPygSoi4dltQ/ddzVigaykuuD1O0Tt4edzplFFNHALzdzzPz0Jveb3A/nppfEEfrDZX/v+afvrZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:16.043159Z"},"content_sha256":"eddd919e0b251b9d49156251fab9d3e88bb446d30ac66b566ad3591a85cc9bb7","schema_version":"1.0","event_id":"sha256:eddd919e0b251b9d49156251fab9d3e88bb446d30ac66b566ad3591a85cc9bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/bundle.json","state_url":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/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-25T11:42:16Z","links":{"resolver":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA","bundle":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/bundle.json","state":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UGNDJTFB5X4WVZCS2UEHKCYTDA","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":"0e10815ee97159123120881185c320f5fa928535ecff0d6eec843c4634696322","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-20T22:05:06Z","title_canon_sha256":"0d4eea37e3abead75199af31b827befbf1e07e1a49e7b7545c8d1c58d9a9bf9b"},"schema_version":"1.0","source":{"id":"1211.4891","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4891","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4891v3","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4891","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"UGNDJTFB5X4W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UGNDJTFB5X4WVZCS","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UGNDJTFB","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:eddd919e0b251b9d49156251fab9d3e88bb446d30ac66b566ad3591a85cc9bb7","target":"graph","created_at":"2026-05-18T03:05:01Z","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 show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in agreement with the number of instructions used by the Turing machines producing s, which is consistent with strict integer-value program-size complexity. Nevertheless, K_m proves to be a finer-grained measure and a potential alternative approach to lossless compression algorithms for small entities, where compression fails. We also show that neither K_m nor","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","cross_cats":["cs.CC","cs.FL","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-20T22:05:06Z","title":"Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4891","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:c45b7e1eaafe9bb43ecd6ee59b1eea7edf5c0da34bf1bb5fb3e5110fa6227b2a","target":"record","created_at":"2026-05-18T03:05:01Z","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":"0e10815ee97159123120881185c320f5fa928535ecff0d6eec843c4634696322","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-20T22:05:06Z","title_canon_sha256":"0d4eea37e3abead75199af31b827befbf1e07e1a49e7b7545c8d1c58d9a9bf9b"},"schema_version":"1.0","source":{"id":"1211.4891","kind":"arxiv","version":3}},"canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","first_computed_at":"2026-05-18T03:05:01.601999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:01.601999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3csmIds9CczSpWJsadeSxPDiRgiQTbSwRWEq2dR8vWk+MANppQ9K2QrPu6nhi9zJhr4Xuhw9WEj2p/FoXXq0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:01.602503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4891","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c45b7e1eaafe9bb43ecd6ee59b1eea7edf5c0da34bf1bb5fb3e5110fa6227b2a","sha256:eddd919e0b251b9d49156251fab9d3e88bb446d30ac66b566ad3591a85cc9bb7"],"state_sha256":"13ec9880084015cc32b5c8c182189c37a5f171c09e1be7a9e74c18e2c181354d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yficRH8d2fs01LuSWEzFf2pATCDg8EqTCFO6j1snqrBiWgqfQd2pVYXrYCxBLLf+6tZwWQHbfmZs8PVkgaLMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:42:16.047369Z","bundle_sha256":"882f8de3cccf44fd2c43f05036ddc5d0680812e6c50be8fe05b18591dc9e988e"}}