{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V3V5HB4RCHFJVLKOEKH23TTYIP","short_pith_number":"pith:V3V5HB4R","schema_version":"1.0","canonical_sha256":"aeebd3879111ca9aad4e228fadce7843f22b257cd1e65cb74537efe99e9cf5ae","source":{"kind":"arxiv","id":"2402.16853","version":1},"attestation_state":"computed","paper":{"title":"PyRQA -- Conducting Recurrence Quantification Analysis on Very Long Time Series Efficiently","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mike Sips, Norbert Marwan, Tobias Rawald","submitted_at":"2024-01-18T15:57:21Z","abstract_excerpt":"PyRQA is a software package that efficiently conducts recurrence quantification analysis (RQA) on time series consisting of more than one million data points. RQA is a method from non-linear time series analysis that quantifies the recurrent behaviour of systems. Existing implementations to RQA are not capable of analysing such very long time series at all or require large amounts of time to calculate the quantitative measures. PyRQA overcomes their limitations by conducting the RQA computations in a highly parallel manner. Building on the OpenCL framework, PyRQA leverages the computing capabi"},"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":"2402.16853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2024-01-18T15:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"3cb449f64fdd7e9a35043b6cb13ebbf99c12293e6c9673d6b0465801710a1161","abstract_canon_sha256":"10995d1fa4e55fe62ddf6424b67bbbc60cd7121d62ecb4d3e2a6f85aa2ef2229"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:46.077183Z","signature_b64":"5Ktun3fhkeBW3/RPdFW1IirBtbgMMzzCUVmV057GHDNCyyvthxHcT4h3npIXTtEU5d4SA15og+GIK112hnc7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeebd3879111ca9aad4e228fadce7843f22b257cd1e65cb74537efe99e9cf5ae","last_reissued_at":"2026-07-05T07:50:46.076742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:46.076742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PyRQA -- Conducting Recurrence Quantification Analysis on Very Long Time Series Efficiently","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mike Sips, Norbert Marwan, Tobias Rawald","submitted_at":"2024-01-18T15:57:21Z","abstract_excerpt":"PyRQA is a software package that efficiently conducts recurrence quantification analysis (RQA) on time series consisting of more than one million data points. RQA is a method from non-linear time series analysis that quantifies the recurrent behaviour of systems. Existing implementations to RQA are not capable of analysing such very long time series at all or require large amounts of time to calculate the quantitative measures. PyRQA overcomes their limitations by conducting the RQA computations in a highly parallel manner. Building on the OpenCL framework, PyRQA leverages the computing capabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16853","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/2402.16853/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.16853","created_at":"2026-07-05T07:50:46.076800+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.16853v1","created_at":"2026-07-05T07:50:46.076800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16853","created_at":"2026-07-05T07:50:46.076800+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3V5HB4RCHFJ","created_at":"2026-07-05T07:50:46.076800+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3V5HB4RCHFJVLKO","created_at":"2026-07-05T07:50:46.076800+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3V5HB4R","created_at":"2026-07-05T07:50:46.076800+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21135","citing_title":"HiddenObject: Modality-Agnostic Fusion for Multimodal Hidden Object Detection","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP","json":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP.json","graph_json":"https://pith.science/api/pith-number/V3V5HB4RCHFJVLKOEKH23TTYIP/graph.json","events_json":"https://pith.science/api/pith-number/V3V5HB4RCHFJVLKOEKH23TTYIP/events.json","paper":"https://pith.science/paper/V3V5HB4R"},"agent_actions":{"view_html":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP","download_json":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP.json","view_paper":"https://pith.science/paper/V3V5HB4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.16853&json=true","fetch_graph":"https://pith.science/api/pith-number/V3V5HB4RCHFJVLKOEKH23TTYIP/graph.json","fetch_events":"https://pith.science/api/pith-number/V3V5HB4RCHFJVLKOEKH23TTYIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP/action/storage_attestation","attest_author":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP/action/author_attestation","sign_citation":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP/action/citation_signature","submit_replication":"https://pith.science/pith/V3V5HB4RCHFJVLKOEKH23TTYIP/action/replication_record"}},"created_at":"2026-07-05T07:50:46.076800+00:00","updated_at":"2026-07-05T07:50:46.076800+00:00"}