{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SIBOMKCASNA3M5IMWF2LN2Z2V4","short_pith_number":"pith:SIBOMKCA","canonical_record":{"source":{"id":"1101.4341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2011-01-23T04:25:37Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"6415323397a6f61e4245c0d5077c879ee851c0d43cdf10ba28a03da9013db035","abstract_canon_sha256":"fc65365650e8a8a016b108f9f42dff243592621d19ee28eb8984c28acd7d498b"},"schema_version":"1.0"},"canonical_sha256":"9202e628409341b6750cb174b6eb3aaf1322f21ba7573d329f2ef66512027e2b","source":{"kind":"arxiv","id":"1101.4341","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4341","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4341v1","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4341","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"SIBOMKCASNA3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SIBOMKCASNA3M5IM","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SIBOMKCA","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SIBOMKCASNA3M5IMWF2LN2Z2V4","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2011-01-23T04:25:37Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"6415323397a6f61e4245c0d5077c879ee851c0d43cdf10ba28a03da9013db035","abstract_canon_sha256":"fc65365650e8a8a016b108f9f42dff243592621d19ee28eb8984c28acd7d498b"},"schema_version":"1.0"},"canonical_sha256":"9202e628409341b6750cb174b6eb3aaf1322f21ba7573d329f2ef66512027e2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:50.427593Z","signature_b64":"X8Y30Bk/WPbocdwV8GtS3pJkS6NAvQAiPNbF9kEOUSCFgOgsrNy5K8WnOgFq+ucBCy04jRY+F+jH1dVgrtl+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9202e628409341b6750cb174b6eb3aaf1322f21ba7573d329f2ef66512027e2b","last_reissued_at":"2026-05-18T02:22:50.427096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:50.427096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4341","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-05-18T02:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dfnJpKmxVm2H62TG2yReEhFEY4JwVuCPdQ3KDMMCKePKnJaXLzqVaP7W/rBfm0Z3WJtVxmQype3uqer+GmGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:07:35.267364Z"},"content_sha256":"32e901b32cc9a8fac5cdaf3ee45276c806c2691dc135e0255b4861c022228444","schema_version":"1.0","event_id":"sha256:32e901b32cc9a8fac5cdaf3ee45276c806c2691dc135e0255b4861c022228444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SIBOMKCASNA3M5IMWF2LN2Z2V4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossless Compression and Complexity of Chaotic Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"nlin.CD","authors_text":"Arjun Venugopal T., Mathew Shaji Kavalekalam, Nithin Krishnan, Nithin Nagaraj","submitted_at":"2011-01-23T04:25:37Z","abstract_excerpt":"We investigate the complexity of short symbolic sequences of chaotic dynamical systems by using lossless compression algorithms. In particular, we study Non-Sequential Recursive Pair Substitution (NSRPS), a lossless compression algorithm first proposed by W. Ebeling et al. [Math. Biosc. 52, 1980] and Jim\\'{e}nez-Monta\\~{n}o et al. [arXiv:cond-mat/0204134, 2002]) which was subsequently shown to be optimal. NSPRS has also been used to estimate Entropy of written English (P. Grassberger [arXiv:physics/0207023, 2002]). We propose a new measure of complexity - defined as the number of iterations of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4341","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":""},"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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4CDVJHjkwz+oyUejF5UKi3POJxc/EFoRV8Dv+gGlXZmtXMZHk/NYZwugYHhat3KWLMIyztQRU1N0SP+GoXZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:07:35.268076Z"},"content_sha256":"d946a1b6a7061b548c0f90cd06a26121065ba3b9130bec168bf0ba0f79b715b5","schema_version":"1.0","event_id":"sha256:d946a1b6a7061b548c0f90cd06a26121065ba3b9130bec168bf0ba0f79b715b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/bundle.json","state_url":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/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-30T01:07:35Z","links":{"resolver":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4","bundle":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/bundle.json","state":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SIBOMKCASNA3M5IMWF2LN2Z2V4","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":"fc65365650e8a8a016b108f9f42dff243592621d19ee28eb8984c28acd7d498b","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2011-01-23T04:25:37Z","title_canon_sha256":"6415323397a6f61e4245c0d5077c879ee851c0d43cdf10ba28a03da9013db035"},"schema_version":"1.0","source":{"id":"1101.4341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4341","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4341v1","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4341","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"SIBOMKCASNA3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SIBOMKCASNA3M5IM","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SIBOMKCA","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:d946a1b6a7061b548c0f90cd06a26121065ba3b9130bec168bf0ba0f79b715b5","target":"graph","created_at":"2026-05-18T02:22:50Z","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 complexity of short symbolic sequences of chaotic dynamical systems by using lossless compression algorithms. In particular, we study Non-Sequential Recursive Pair Substitution (NSRPS), a lossless compression algorithm first proposed by W. Ebeling et al. [Math. Biosc. 52, 1980] and Jim\\'{e}nez-Monta\\~{n}o et al. [arXiv:cond-mat/0204134, 2002]) which was subsequently shown to be optimal. NSPRS has also been used to estimate Entropy of written English (P. Grassberger [arXiv:physics/0207023, 2002]). We propose a new measure of complexity - defined as the number of iterations of","authors_text":"Arjun Venugopal T., Mathew Shaji Kavalekalam, Nithin Krishnan, Nithin Nagaraj","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2011-01-23T04:25:37Z","title":"Lossless Compression and Complexity of Chaotic Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4341","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:32e901b32cc9a8fac5cdaf3ee45276c806c2691dc135e0255b4861c022228444","target":"record","created_at":"2026-05-18T02:22:50Z","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":"fc65365650e8a8a016b108f9f42dff243592621d19ee28eb8984c28acd7d498b","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2011-01-23T04:25:37Z","title_canon_sha256":"6415323397a6f61e4245c0d5077c879ee851c0d43cdf10ba28a03da9013db035"},"schema_version":"1.0","source":{"id":"1101.4341","kind":"arxiv","version":1}},"canonical_sha256":"9202e628409341b6750cb174b6eb3aaf1322f21ba7573d329f2ef66512027e2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9202e628409341b6750cb174b6eb3aaf1322f21ba7573d329f2ef66512027e2b","first_computed_at":"2026-05-18T02:22:50.427096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:50.427096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8Y30Bk/WPbocdwV8GtS3pJkS6NAvQAiPNbF9kEOUSCFgOgsrNy5K8WnOgFq+ucBCy04jRY+F+jH1dVgrtl+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:50.427593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32e901b32cc9a8fac5cdaf3ee45276c806c2691dc135e0255b4861c022228444","sha256:d946a1b6a7061b548c0f90cd06a26121065ba3b9130bec168bf0ba0f79b715b5"],"state_sha256":"699258db52c31dde2d69b95d4e90798d14d9aad57dd3a9139c95e9ddec5fd89d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsjVxgFso6zNrZKZqKBucdLbE2qZUiWa0H9RNOnfIxXO92hixGEq26WJgZfKIc90ltiN5Rmmir+qiFl3LillAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:07:35.271734Z","bundle_sha256":"d23955eba420584c7e62992c25c019e858001f89124435abf435288c7f2f7800"}}