{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:24LCXIUBZC2YSNTBRWSOPBKKZH","short_pith_number":"pith:24LCXIUB","canonical_record":{"source":{"id":"2606.23471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-22T15:17:54Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"36a5c57b2db716eac802cdd4bebfd9e948a80fc9e97850065f641e5fc44c6cd2","abstract_canon_sha256":"7b175512ce76a8f8bf3648b2779bf7b072430d45216eb7464a57873d37078841"},"schema_version":"1.0"},"canonical_sha256":"d7162ba281c8b58936618da4e7854ac9ef9dc60e1289a9b3ee06c77723e76a5a","source":{"kind":"arxiv","id":"2606.23471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23471","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23471v1","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23471","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"24LCXIUBZC2Y","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"pith_short_16","alias_value":"24LCXIUBZC2YSNTB","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"pith_short_8","alias_value":"24LCXIUB","created_at":"2026-06-23T03:14:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:24LCXIUBZC2YSNTBRWSOPBKKZH","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-22T15:17:54Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"36a5c57b2db716eac802cdd4bebfd9e948a80fc9e97850065f641e5fc44c6cd2","abstract_canon_sha256":"7b175512ce76a8f8bf3648b2779bf7b072430d45216eb7464a57873d37078841"},"schema_version":"1.0"},"canonical_sha256":"d7162ba281c8b58936618da4e7854ac9ef9dc60e1289a9b3ee06c77723e76a5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:20.811803Z","signature_b64":"hO7jYXwOJx0uzQzInqQj/uNUWUj86jm9zMG15rjCtAD5DaD06lCobjQuyFXy0GEe1BFEyQCypPRbhQ6tgboADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7162ba281c8b58936618da4e7854ac9ef9dc60e1289a9b3ee06c77723e76a5a","last_reissued_at":"2026-06-23T03:14:20.811417Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:20.811417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23471","source_version":1,"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-06-23T03:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEf/IWqydBnHD6eR0H6aageQgmgLaNmR7rDgIQFtp4EXk0ofm1pssXI3NytzchDsJa6/OfYZ7y/J6UR1s/VRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:54:55.380104Z"},"content_sha256":"f25c50bb2057e0acc2d2fa2f404287b3dc0f394c59f4d0a484aa71d45124d1f9","schema_version":"1.0","event_id":"sha256:f25c50bb2057e0acc2d2fa2f404287b3dc0f394c59f4d0a484aa71d45124d1f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:24LCXIUBZC2YSNTBRWSOPBKKZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Eduardo Yuji Sakabe, Felipe S. Abrah\\~ao, Hector Zenil, Ricardo Gudwin, Santiago Hern\\'andez-Orozco","submitted_at":"2026-06-22T15:17:54Z","abstract_excerpt":"The Block Decomposition Method (BDM) was introduced as an alternative to popular lossless compression methods such as LZW for estimating algorithmic complexity from the principles of algorithmic probability and classical information theory. It extends the Coding Theorem Method (CTM) from small objects to larger ones by combining local estimates of algorithmic complexity with a global account of repetition based on Shannon entropy. Here, we introduce a version of BDM in which dependencies between blocks are utilized to reduce the length of the description based on reusable program code in the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23471","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23471/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-23T03:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aoEk+NqDvOh6SQnGCopSyV82ILShaHJiPq9ha7i+OvUenWdZBhRSzzYZMIyTQ7JpJnkD59CM/b8SKVA3qWPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:54:55.381027Z"},"content_sha256":"cd7bebcafde9891b744b59f745027ac6b4e4ccc44b4145504d46bd5538570953","schema_version":"1.0","event_id":"sha256:cd7bebcafde9891b744b59f745027ac6b4e4ccc44b4145504d46bd5538570953"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24LCXIUBZC2YSNTBRWSOPBKKZH/bundle.json","state_url":"https://pith.science/pith/24LCXIUBZC2YSNTBRWSOPBKKZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24LCXIUBZC2YSNTBRWSOPBKKZH/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-08-04T11:54:55Z","links":{"resolver":"https://pith.science/pith/24LCXIUBZC2YSNTBRWSOPBKKZH","bundle":"https://pith.science/pith/24LCXIUBZC2YSNTBRWSOPBKKZH/bundle.json","state":"https://pith.science/pith/24LCXIUBZC2YSNTBRWSOPBKKZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24LCXIUBZC2YSNTBRWSOPBKKZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:24LCXIUBZC2YSNTBRWSOPBKKZH","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":"7b175512ce76a8f8bf3648b2779bf7b072430d45216eb7464a57873d37078841","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-22T15:17:54Z","title_canon_sha256":"36a5c57b2db716eac802cdd4bebfd9e948a80fc9e97850065f641e5fc44c6cd2"},"schema_version":"1.0","source":{"id":"2606.23471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23471","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23471v1","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23471","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"24LCXIUBZC2Y","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"pith_short_16","alias_value":"24LCXIUBZC2YSNTB","created_at":"2026-06-23T03:14:20Z"},{"alias_kind":"pith_short_8","alias_value":"24LCXIUB","created_at":"2026-06-23T03:14:20Z"}],"graph_snapshots":[{"event_id":"sha256:cd7bebcafde9891b744b59f745027ac6b4e4ccc44b4145504d46bd5538570953","target":"graph","created_at":"2026-06-23T03:14:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.23471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Block Decomposition Method (BDM) was introduced as an alternative to popular lossless compression methods such as LZW for estimating algorithmic complexity from the principles of algorithmic probability and classical information theory. It extends the Coding Theorem Method (CTM) from small objects to larger ones by combining local estimates of algorithmic complexity with a global account of repetition based on Shannon entropy. Here, we introduce a version of BDM in which dependencies between blocks are utilized to reduce the length of the description based on reusable program code in the d","authors_text":"Eduardo Yuji Sakabe, Felipe S. Abrah\\~ao, Hector Zenil, Ricardo Gudwin, Santiago Hern\\'andez-Orozco","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-22T15:17:54Z","title":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23471","kind":"arxiv","version":1},"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:f25c50bb2057e0acc2d2fa2f404287b3dc0f394c59f4d0a484aa71d45124d1f9","target":"record","created_at":"2026-06-23T03:14:20Z","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":"7b175512ce76a8f8bf3648b2779bf7b072430d45216eb7464a57873d37078841","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-22T15:17:54Z","title_canon_sha256":"36a5c57b2db716eac802cdd4bebfd9e948a80fc9e97850065f641e5fc44c6cd2"},"schema_version":"1.0","source":{"id":"2606.23471","kind":"arxiv","version":1}},"canonical_sha256":"d7162ba281c8b58936618da4e7854ac9ef9dc60e1289a9b3ee06c77723e76a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7162ba281c8b58936618da4e7854ac9ef9dc60e1289a9b3ee06c77723e76a5a","first_computed_at":"2026-06-23T03:14:20.811417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:20.811417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hO7jYXwOJx0uzQzInqQj/uNUWUj86jm9zMG15rjCtAD5DaD06lCobjQuyFXy0GEe1BFEyQCypPRbhQ6tgboADQ==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:20.811803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f25c50bb2057e0acc2d2fa2f404287b3dc0f394c59f4d0a484aa71d45124d1f9","sha256:cd7bebcafde9891b744b59f745027ac6b4e4ccc44b4145504d46bd5538570953"],"state_sha256":"2d8a95bebc56540aafac6dff84ced11b5c2580ecdec7d86efeb7280d18c01dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNMuO/jA6qUoa0TzwxA+ip1r/GT9hEknpEzCDHumyK7+CU0Rct+teaE0tTsj+E/oHyPL68J5421lbuasraI5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:54:55.387132Z","bundle_sha256":"ed8e191eb121cdf446870e7c7a02c1657e06989217fe177931983f2474fcd99b"}}