{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:673HZOWHB5SMFGCICOTOECPUC7","short_pith_number":"pith:673HZOWH","canonical_record":{"source":{"id":"1006.0051","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-01T03:23:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0371f1424ad17dbdd97d72bbe86c6a031a92320780d0b481e9bb4c9282511a1c","abstract_canon_sha256":"34fcec0c95064a7363ad1c5585296873c55d48574c73a8738484806ddca3a623"},"schema_version":"1.0"},"canonical_sha256":"f7f67cbac70f64c2984813a6e209f417dd617b5c397ff80fbbae3da39d3f1b4a","source":{"kind":"arxiv","id":"1006.0051","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0051","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0051v5","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0051","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"673HZOWHB5SM","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"673HZOWHB5SMFGCI","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"673HZOWH","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:673HZOWHB5SMFGCICOTOECPUC7","target":"record","payload":{"canonical_record":{"source":{"id":"1006.0051","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-01T03:23:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0371f1424ad17dbdd97d72bbe86c6a031a92320780d0b481e9bb4c9282511a1c","abstract_canon_sha256":"34fcec0c95064a7363ad1c5585296873c55d48574c73a8738484806ddca3a623"},"schema_version":"1.0"},"canonical_sha256":"f7f67cbac70f64c2984813a6e209f417dd617b5c397ff80fbbae3da39d3f1b4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:48.563195Z","signature_b64":"TgAxjWqcNX41UI1+higPn2J6DE5GFEPpu1TnzFHTOyPbf2ybYgxrs1La5SwhgobZDVLf7CmXoSQhitzd45ixAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f67cbac70f64c2984813a6e209f417dd617b5c397ff80fbbae3da39d3f1b4a","last_reissued_at":"2026-05-18T02:23:48.562789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:48.562789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.0051","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-18T02:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaM/YcLa8vAJo8ZDDkUe+49pGvhPU7q7UtOIAvxTdSzroSLVZsScj/yx2BN+RYqp+fOv6Mf6Q6ZYEuyO5+NYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:59:01.567535Z"},"content_sha256":"48b34dbb65c64bcc19abc0f76f6664952cdc8ef4259df656cd0526deab4dead3","schema_version":"1.0","event_id":"sha256:48b34dbb65c64bcc19abc0f76f6664952cdc8ef4259df656cd0526deab4dead3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:673HZOWHB5SMFGCICOTOECPUC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Image Characterization and Classification by Physical Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Cedric Gaucherel, Hector Zenil, Jean-Paul Delahaye","submitted_at":"2010-06-01T03:23:25Z","abstract_excerpt":"We present a method for estimating the complexity of an image based on Bennett's concept of logical depth. Bennett identified logical depth as the appropriate measure of organized complexity, and hence as being better suited to the evaluation of the complexity of objects in the physical world. Its use results in a different, and in some sense a finer characterization than is obtained through the application of the concept of Kolmogorov complexity alone. We use this measure to classify images by their information content. The method provides a means for classifying and evaluating the complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0051","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-18T02:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qOg9+J/PhHAsXRYD/eqY4omN61k5uHZLaFJmUZmPeK+wsu4TfeuL2XKEdh9T9IXtlC1DBBz1Pee5/wPkk8uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:59:01.568261Z"},"content_sha256":"7a79140d587d891cd891f6dacdd863e4f0762df5b48bb76891744c421b80f5d4","schema_version":"1.0","event_id":"sha256:7a79140d587d891cd891f6dacdd863e4f0762df5b48bb76891744c421b80f5d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/673HZOWHB5SMFGCICOTOECPUC7/bundle.json","state_url":"https://pith.science/pith/673HZOWHB5SMFGCICOTOECPUC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/673HZOWHB5SMFGCICOTOECPUC7/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-30T19:59:01Z","links":{"resolver":"https://pith.science/pith/673HZOWHB5SMFGCICOTOECPUC7","bundle":"https://pith.science/pith/673HZOWHB5SMFGCICOTOECPUC7/bundle.json","state":"https://pith.science/pith/673HZOWHB5SMFGCICOTOECPUC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/673HZOWHB5SMFGCICOTOECPUC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:673HZOWHB5SMFGCICOTOECPUC7","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":"34fcec0c95064a7363ad1c5585296873c55d48574c73a8738484806ddca3a623","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-01T03:23:25Z","title_canon_sha256":"0371f1424ad17dbdd97d72bbe86c6a031a92320780d0b481e9bb4c9282511a1c"},"schema_version":"1.0","source":{"id":"1006.0051","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0051","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0051v5","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0051","created_at":"2026-05-18T02:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"673HZOWHB5SM","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"673HZOWHB5SMFGCI","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"673HZOWH","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:7a79140d587d891cd891f6dacdd863e4f0762df5b48bb76891744c421b80f5d4","target":"graph","created_at":"2026-05-18T02:23:48Z","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 present a method for estimating the complexity of an image based on Bennett's concept of logical depth. Bennett identified logical depth as the appropriate measure of organized complexity, and hence as being better suited to the evaluation of the complexity of objects in the physical world. Its use results in a different, and in some sense a finer characterization than is obtained through the application of the concept of Kolmogorov complexity alone. We use this measure to classify images by their information content. The method provides a means for classifying and evaluating the complexity","authors_text":"Cedric Gaucherel, Hector Zenil, Jean-Paul Delahaye","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-01T03:23:25Z","title":"Image Characterization and Classification by Physical Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0051","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:48b34dbb65c64bcc19abc0f76f6664952cdc8ef4259df656cd0526deab4dead3","target":"record","created_at":"2026-05-18T02:23:48Z","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":"34fcec0c95064a7363ad1c5585296873c55d48574c73a8738484806ddca3a623","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-01T03:23:25Z","title_canon_sha256":"0371f1424ad17dbdd97d72bbe86c6a031a92320780d0b481e9bb4c9282511a1c"},"schema_version":"1.0","source":{"id":"1006.0051","kind":"arxiv","version":5}},"canonical_sha256":"f7f67cbac70f64c2984813a6e209f417dd617b5c397ff80fbbae3da39d3f1b4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7f67cbac70f64c2984813a6e209f417dd617b5c397ff80fbbae3da39d3f1b4a","first_computed_at":"2026-05-18T02:23:48.562789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:48.562789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgAxjWqcNX41UI1+higPn2J6DE5GFEPpu1TnzFHTOyPbf2ybYgxrs1La5SwhgobZDVLf7CmXoSQhitzd45ixAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:48.563195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.0051","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48b34dbb65c64bcc19abc0f76f6664952cdc8ef4259df656cd0526deab4dead3","sha256:7a79140d587d891cd891f6dacdd863e4f0762df5b48bb76891744c421b80f5d4"],"state_sha256":"757d576cbb4a2455788b50c3e5daf870da7aac790e70549c69abcafa423f48a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IocFOrl668AjA+t8d7M/stvK9VIXVdAs2OQ5mH+YRhf1WdqK2sPYIPhXRoNB2SzOXvbTaR6Z2FxDW4I4GXVyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:59:01.572139Z","bundle_sha256":"cc4add794025c123e2b9bb3605492150e514e113e36ea7145fbc3818b7f94dfb"}}