{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SIBOMKCASNA3M5IMWF2LN2Z2V4","short_pith_number":"pith:SIBOMKCA","schema_version":"1.0","canonical_sha256":"9202e628409341b6750cb174b6eb3aaf1322f21ba7573d329f2ef66512027e2b","source":{"kind":"arxiv","id":"1101.4341","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.4341","created_at":"2026-05-18T02:22:50.427167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4341v1","created_at":"2026-05-18T02:22:50.427167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4341","created_at":"2026-05-18T02:22:50.427167+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIBOMKCASNA3","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIBOMKCASNA3M5IM","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIBOMKCA","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4","json":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4.json","graph_json":"https://pith.science/api/pith-number/SIBOMKCASNA3M5IMWF2LN2Z2V4/graph.json","events_json":"https://pith.science/api/pith-number/SIBOMKCASNA3M5IMWF2LN2Z2V4/events.json","paper":"https://pith.science/paper/SIBOMKCA"},"agent_actions":{"view_html":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4","download_json":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4.json","view_paper":"https://pith.science/paper/SIBOMKCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4341&json=true","fetch_graph":"https://pith.science/api/pith-number/SIBOMKCASNA3M5IMWF2LN2Z2V4/graph.json","fetch_events":"https://pith.science/api/pith-number/SIBOMKCASNA3M5IMWF2LN2Z2V4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/action/storage_attestation","attest_author":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/action/author_attestation","sign_citation":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/action/citation_signature","submit_replication":"https://pith.science/pith/SIBOMKCASNA3M5IMWF2LN2Z2V4/action/replication_record"}},"created_at":"2026-05-18T02:22:50.427167+00:00","updated_at":"2026-05-18T02:22:50.427167+00:00"}