{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HU2IWALRTDG7BBIPEGOVHVRNG7","short_pith_number":"pith:HU2IWALR","canonical_record":{"source":{"id":"1212.6745","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-30T17:06:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"24ff211cca76b9b5b662acb1a8ba6b93fca9db1646652f132737f0573258ac8a","abstract_canon_sha256":"3f31203f2c09403e24b6f95e1475e292f13397701335edc044640727760a47aa"},"schema_version":"1.0"},"canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","source":{"kind":"arxiv","id":"1212.6745","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6745","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6745v4","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6745","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"HU2IWALRTDG7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HU2IWALRTDG7BBIP","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HU2IWALR","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HU2IWALRTDG7BBIPEGOVHVRNG7","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6745","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-30T17:06:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"24ff211cca76b9b5b662acb1a8ba6b93fca9db1646652f132737f0573258ac8a","abstract_canon_sha256":"3f31203f2c09403e24b6f95e1475e292f13397701335edc044640727760a47aa"},"schema_version":"1.0"},"canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.862665Z","signature_b64":"1meRy1ZBcjAX8I0U6AALYSRALVGnsUEHIfnYaoi3m6gp2gjpoSwaFeYSH3B/evVJcYbVNNyRN+oxJDFScFhdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","last_reissued_at":"2026-05-18T01:34:45.861890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.861890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6745","source_version":4,"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-18T01:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IC8B7dktXk1WdSQFwF5CRojaysz94wofnZcZKCXH8iv5Kz8iF5yUMhoKvhi6jHKBu+NqAjG/ROgmuLTpTQUYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:55:03.552244Z"},"content_sha256":"7a862f5f113ef3fef2d9cfca123c2f1a2c194b488d5dd81876fa236ce97d4ce2","schema_version":"1.0","event_id":"sha256:7a862f5f113ef3fef2d9cfca123c2f1a2c194b488d5dd81876fa236ce97d4ce2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HU2IWALRTDG7BBIPEGOVHVRNG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-12-30T17:06:59Z","abstract_excerpt":"We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex $n$-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6745","kind":"arxiv","version":4},"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-18T01:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hin3+8TG74zyAYQtbMcLvk67NzUMqJxcX00QPfs2KC7TymvOVZHlxsKKU/9ChDYwwETYPEAamji+q2t1RyInBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:55:03.552651Z"},"content_sha256":"27749eca3c630306b4ba26036292a0cc3fee2107624022b62ee2081b62c877b8","schema_version":"1.0","event_id":"sha256:27749eca3c630306b4ba26036292a0cc3fee2107624022b62ee2081b62c877b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/bundle.json","state_url":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/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-21T19:55:03Z","links":{"resolver":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7","bundle":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/bundle.json","state":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HU2IWALRTDG7BBIPEGOVHVRNG7","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":"3f31203f2c09403e24b6f95e1475e292f13397701335edc044640727760a47aa","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-30T17:06:59Z","title_canon_sha256":"24ff211cca76b9b5b662acb1a8ba6b93fca9db1646652f132737f0573258ac8a"},"schema_version":"1.0","source":{"id":"1212.6745","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6745","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6745v4","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6745","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"HU2IWALRTDG7","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HU2IWALRTDG7BBIP","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HU2IWALR","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:27749eca3c630306b4ba26036292a0cc3fee2107624022b62ee2081b62c877b8","target":"graph","created_at":"2026-05-18T01:34:45Z","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 propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex $n$-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequ","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-30T17:06:59Z","title":"Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6745","kind":"arxiv","version":4},"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:7a862f5f113ef3fef2d9cfca123c2f1a2c194b488d5dd81876fa236ce97d4ce2","target":"record","created_at":"2026-05-18T01:34:45Z","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":"3f31203f2c09403e24b6f95e1475e292f13397701335edc044640727760a47aa","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-30T17:06:59Z","title_canon_sha256":"24ff211cca76b9b5b662acb1a8ba6b93fca9db1646652f132737f0573258ac8a"},"schema_version":"1.0","source":{"id":"1212.6745","kind":"arxiv","version":4}},"canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","first_computed_at":"2026-05-18T01:34:45.861890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:45.861890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1meRy1ZBcjAX8I0U6AALYSRALVGnsUEHIfnYaoi3m6gp2gjpoSwaFeYSH3B/evVJcYbVNNyRN+oxJDFScFhdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:45.862665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6745","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a862f5f113ef3fef2d9cfca123c2f1a2c194b488d5dd81876fa236ce97d4ce2","sha256:27749eca3c630306b4ba26036292a0cc3fee2107624022b62ee2081b62c877b8"],"state_sha256":"049a81ad3175efbd2c74226459e870eb3e72f58db1c5d1e13902cc15fd79448d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3vda43GzySnXL38Pz5Zddlp1wXTO2Qj3IUBA0CUtyFN/BezScZly3E2UAo8DfI6q74B1rlZlnCn2PR5VvD4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T19:55:03.555046Z","bundle_sha256":"c4812911e5bbcb42643d9a8cff7444adb28c9bdce798e9e518cf743f0b853938"}}