{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EY6MNMALQ6FTT6UPJ3263XVZVB","short_pith_number":"pith:EY6MNMAL","schema_version":"1.0","canonical_sha256":"263cc6b00b878b39fa8f4ef5eddeb9a8631e9b640f20217151ead890b97edef2","source":{"kind":"arxiv","id":"1605.04418","version":1},"attestation_state":"computed","paper":{"title":"Efficient sequential compression of multi-channel biomedical signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"\\'Alvaro Mart\\'in, Eugenio Rovira, Federico Lecumberry, Gadiel Seroussi, Ignacio Capurro, Ignacio Ram\\'irez","submitted_at":"2016-05-14T13:29:41Z","abstract_excerpt":"This work proposes lossless and near-lossless compression algorithms for multi-channel biomedical signals. The algorithms are sequential and efficient, which makes them suitable for low-latency and low-power signal transmission applications. We make use of information theory and signal processing tools (such as universal coding, universal prediction, and fast online implementations of multivariate recursive least squares), combined with simple methods to exploit spatial as well as temporal redundancies typically present in biomedical signals. The algorithms are tested with publicly available e"},"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":"1605.04418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-14T13:29:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4830235e94566d8dd1c231fa096ef5c96f7a296f61f81e91c6d79cdeff8fcb7","abstract_canon_sha256":"cef64679c7a7e21916066a314df4d51f43fcff5f998fd14a9260dc02a9ec4cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:51.729698Z","signature_b64":"05bpdbZnVGQ6BJ4h6B7HNXAkINpXAbyg4hLQEtqh9VgDqQFha7W6t/nacVV+DJDcVDBAbvmaMw7/mbISEdkQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263cc6b00b878b39fa8f4ef5eddeb9a8631e9b640f20217151ead890b97edef2","last_reissued_at":"2026-05-18T01:14:51.729097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:51.729097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient sequential compression of multi-channel biomedical signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"\\'Alvaro Mart\\'in, Eugenio Rovira, Federico Lecumberry, Gadiel Seroussi, Ignacio Capurro, Ignacio Ram\\'irez","submitted_at":"2016-05-14T13:29:41Z","abstract_excerpt":"This work proposes lossless and near-lossless compression algorithms for multi-channel biomedical signals. The algorithms are sequential and efficient, which makes them suitable for low-latency and low-power signal transmission applications. We make use of information theory and signal processing tools (such as universal coding, universal prediction, and fast online implementations of multivariate recursive least squares), combined with simple methods to exploit spatial as well as temporal redundancies typically present in biomedical signals. The algorithms are tested with publicly available e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04418","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":"1605.04418","created_at":"2026-05-18T01:14:51.729171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04418v1","created_at":"2026-05-18T01:14:51.729171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04418","created_at":"2026-05-18T01:14:51.729171+00:00"},{"alias_kind":"pith_short_12","alias_value":"EY6MNMALQ6FT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EY6MNMALQ6FTT6UP","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EY6MNMAL","created_at":"2026-05-18T12:30:15.759754+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/EY6MNMALQ6FTT6UPJ3263XVZVB","json":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB.json","graph_json":"https://pith.science/api/pith-number/EY6MNMALQ6FTT6UPJ3263XVZVB/graph.json","events_json":"https://pith.science/api/pith-number/EY6MNMALQ6FTT6UPJ3263XVZVB/events.json","paper":"https://pith.science/paper/EY6MNMAL"},"agent_actions":{"view_html":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB","download_json":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB.json","view_paper":"https://pith.science/paper/EY6MNMAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04418&json=true","fetch_graph":"https://pith.science/api/pith-number/EY6MNMALQ6FTT6UPJ3263XVZVB/graph.json","fetch_events":"https://pith.science/api/pith-number/EY6MNMALQ6FTT6UPJ3263XVZVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB/action/storage_attestation","attest_author":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB/action/author_attestation","sign_citation":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB/action/citation_signature","submit_replication":"https://pith.science/pith/EY6MNMALQ6FTT6UPJ3263XVZVB/action/replication_record"}},"created_at":"2026-05-18T01:14:51.729171+00:00","updated_at":"2026-05-18T01:14:51.729171+00:00"}