{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IA5YIAWVHVNTZ7ZXVVIQQPAGJB","short_pith_number":"pith:IA5YIAWV","canonical_record":{"source":{"id":"2606.11531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-10T00:29:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee627aa3221c9c862d50da53c93d322629f58504cf77374e1039093a37550f35","abstract_canon_sha256":"069d461f7f24e57ebe3d1fb010897f64b24017275a0a7e0f41f01215495b1ed8"},"schema_version":"1.0"},"canonical_sha256":"403b8402d53d5b3cff37ad51083c06485a908ae498e7959afca006a732e551e2","source":{"kind":"arxiv","id":"2606.11531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11531","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11531v1","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11531","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"IA5YIAWVHVNT","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"pith_short_16","alias_value":"IA5YIAWVHVNTZ7ZX","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"pith_short_8","alias_value":"IA5YIAWV","created_at":"2026-06-11T01:09:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IA5YIAWVHVNTZ7ZXVVIQQPAGJB","target":"record","payload":{"canonical_record":{"source":{"id":"2606.11531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-10T00:29:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee627aa3221c9c862d50da53c93d322629f58504cf77374e1039093a37550f35","abstract_canon_sha256":"069d461f7f24e57ebe3d1fb010897f64b24017275a0a7e0f41f01215495b1ed8"},"schema_version":"1.0"},"canonical_sha256":"403b8402d53d5b3cff37ad51083c06485a908ae498e7959afca006a732e551e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:54.532826Z","signature_b64":"FR8/9EttTe0pXjH5uatHOkcu4iTRsUSDAgQdBliRBYuFJxyN4dDHQGTEfhxqLuQJ5P+HbIiaieA5ptT8ljXaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403b8402d53d5b3cff37ad51083c06485a908ae498e7959afca006a732e551e2","last_reissued_at":"2026-06-11T01:09:54.531075Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:54.531075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.11531","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-11T01:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOztkOpZCGiTl7qUQkHiA6Q5NmiAm3wKaORnes+zuHNhCFVgZXiLNtqgDjZNCFjWngdW6DsKFz/pBhNvC5BzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:31:22.198178Z"},"content_sha256":"e6eb13e7cbe65070e6862349bd2ccceee5c9ee4c4beeae030059ef93d57f6235","schema_version":"1.0","event_id":"sha256:e6eb13e7cbe65070e6862349bd2ccceee5c9ee4c4beeae030059ef93d57f6235"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IA5YIAWVHVNTZ7ZXVVIQQPAGJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measuring language complexity from hierarchical reuse of recurring patterns","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CL","authors_text":"Junyi Zhou, Pengyu Liu, Rui Liu, Yu Liu","submitted_at":"2026-06-10T00:29:25Z","abstract_excerpt":"We introduce the ladderpath index as a measure of language complexity grounded in algorithmic information theory. It counts the minimum steps needed to reconstruct a sequence through hierarchical reuse of repeated substructures, capturing an exactly computable but constrained form of algorithmic compressibility related to, but distinct from, Kolmogorov complexity. We apply the ladderpath approach to 21 parallel corpora from the Parallel Universal Dependencies dataset. The ladderpath index is approximately invariant across the languages, and varies much less than the corpus length. This is more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11531","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.11531/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-11T01:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Y3MWqyUFZsAtnA6xCehY+eclU450ueETmuc/UL6mG6ZirYnZAa02QXrXccfaEvQgR3t26Wks6uF7SRnTuPIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:31:22.198575Z"},"content_sha256":"738dd16d335ef8eca0a74efe69da7f8cb57a2ca710f8b0fc48e661750e7c3e74","schema_version":"1.0","event_id":"sha256:738dd16d335ef8eca0a74efe69da7f8cb57a2ca710f8b0fc48e661750e7c3e74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB/bundle.json","state_url":"https://pith.science/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB/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-06-20T10:31:22Z","links":{"resolver":"https://pith.science/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB","bundle":"https://pith.science/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB/bundle.json","state":"https://pith.science/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IA5YIAWVHVNTZ7ZXVVIQQPAGJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IA5YIAWVHVNTZ7ZXVVIQQPAGJB","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":"069d461f7f24e57ebe3d1fb010897f64b24017275a0a7e0f41f01215495b1ed8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-10T00:29:25Z","title_canon_sha256":"ee627aa3221c9c862d50da53c93d322629f58504cf77374e1039093a37550f35"},"schema_version":"1.0","source":{"id":"2606.11531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11531","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11531v1","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11531","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"IA5YIAWVHVNT","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"pith_short_16","alias_value":"IA5YIAWVHVNTZ7ZX","created_at":"2026-06-11T01:09:54Z"},{"alias_kind":"pith_short_8","alias_value":"IA5YIAWV","created_at":"2026-06-11T01:09:54Z"}],"graph_snapshots":[{"event_id":"sha256:738dd16d335ef8eca0a74efe69da7f8cb57a2ca710f8b0fc48e661750e7c3e74","target":"graph","created_at":"2026-06-11T01:09:54Z","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.11531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the ladderpath index as a measure of language complexity grounded in algorithmic information theory. It counts the minimum steps needed to reconstruct a sequence through hierarchical reuse of repeated substructures, capturing an exactly computable but constrained form of algorithmic compressibility related to, but distinct from, Kolmogorov complexity. We apply the ladderpath approach to 21 parallel corpora from the Parallel Universal Dependencies dataset. The ladderpath index is approximately invariant across the languages, and varies much less than the corpus length. This is more","authors_text":"Junyi Zhou, Pengyu Liu, Rui Liu, Yu Liu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-10T00:29:25Z","title":"Measuring language complexity from hierarchical reuse of recurring patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11531","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:e6eb13e7cbe65070e6862349bd2ccceee5c9ee4c4beeae030059ef93d57f6235","target":"record","created_at":"2026-06-11T01:09:54Z","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":"069d461f7f24e57ebe3d1fb010897f64b24017275a0a7e0f41f01215495b1ed8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-10T00:29:25Z","title_canon_sha256":"ee627aa3221c9c862d50da53c93d322629f58504cf77374e1039093a37550f35"},"schema_version":"1.0","source":{"id":"2606.11531","kind":"arxiv","version":1}},"canonical_sha256":"403b8402d53d5b3cff37ad51083c06485a908ae498e7959afca006a732e551e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"403b8402d53d5b3cff37ad51083c06485a908ae498e7959afca006a732e551e2","first_computed_at":"2026-06-11T01:09:54.531075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:54.531075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FR8/9EttTe0pXjH5uatHOkcu4iTRsUSDAgQdBliRBYuFJxyN4dDHQGTEfhxqLuQJ5P+HbIiaieA5ptT8ljXaAQ==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:54.532826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6eb13e7cbe65070e6862349bd2ccceee5c9ee4c4beeae030059ef93d57f6235","sha256:738dd16d335ef8eca0a74efe69da7f8cb57a2ca710f8b0fc48e661750e7c3e74"],"state_sha256":"bd9dedd7cf9de0e4ead838ab1b8db4aac36b50e2d9dae5a34124821c35ddfdc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9y2H9Q4hpSBsmfl0Af/KqBpLsPGElPbcnsIVT9JlsuBVC5sRGx8g03uDfU/p6RXHv5gK84/qTT/G3Bsw+nIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:31:22.200819Z","bundle_sha256":"306a24e00e32936c306f1f32e44faeadd44102c93a87b7a05548599061969b66"}}