{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SWZ5UJDAL767EIJKONWHMPAJXE","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":"1d48b166d76998802f7053290adde7c43dbc9bd558e2f819fd930b1b8e0fec13","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T05:13:10Z","title_canon_sha256":"435f2699a9e78a491a4e0a4dfeebe4365bba37c44ba901d59833d674bde4237c"},"schema_version":"1.0","source":{"id":"1609.00110","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00110","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00110v7","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00110","created_at":"2026-05-18T00:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"SWZ5UJDAL767","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SWZ5UJDAL767EIJK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SWZ5UJDA","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:b9a03562074a8976af6e39d9edb9672706c7e3fe466e535b4880f06220ea74d8","target":"graph","created_at":"2026-05-18T00:12:58Z","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 investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based upon Solomonoff-Levin's theory of algorithmic probability providing a closer connection to algorithmic complexity than previous attempts based on statistical regularities e.g. as spotted by some popular lossless compression schemes. The strategy behind BDM is to find small computer programs that produce the components of a larger, decomposed object. The set of short computer programs can then be artfull","authors_text":"Antonio Rueda-Toicen, Fernando Soler-Toscano, Hector Zenil, Narsis A. Kiani, Santiago Hern\\'andez-Orozco","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T05:13:10Z","title":"A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00110","kind":"arxiv","version":7},"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:977dd9d5d3b146372e57dcdf7ed5d8556a3d795b5829d4e6d54714d0557accf2","target":"record","created_at":"2026-05-18T00:12:58Z","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":"1d48b166d76998802f7053290adde7c43dbc9bd558e2f819fd930b1b8e0fec13","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-01T05:13:10Z","title_canon_sha256":"435f2699a9e78a491a4e0a4dfeebe4365bba37c44ba901d59833d674bde4237c"},"schema_version":"1.0","source":{"id":"1609.00110","kind":"arxiv","version":7}},"canonical_sha256":"95b3da24605ffdf2212a736c763c09b92f9cf87a4c029e8f8831f702c07f7398","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95b3da24605ffdf2212a736c763c09b92f9cf87a4c029e8f8831f702c07f7398","first_computed_at":"2026-05-18T00:12:58.791965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:58.791965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ksfdvw6SGYeYOhpT43Iv/vv7mJlKiVrHapklkVfvLQGaB8pTX9OXyIGT/35MIJliVNwYgAPzrBGbYj6JpUmIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:58.792498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00110","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:977dd9d5d3b146372e57dcdf7ed5d8556a3d795b5829d4e6d54714d0557accf2","sha256:b9a03562074a8976af6e39d9edb9672706c7e3fe466e535b4880f06220ea74d8"],"state_sha256":"ad7745c281593686142dba22d626c0099b5e16835099524e543e159d8e1f00cc"}