{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:64FFQ6T37MUWHA4NVDOURXXLIV","short_pith_number":"pith:64FFQ6T3","schema_version":"1.0","canonical_sha256":"f70a587a7bfb2963838da8dd48deeb455c7674fc8d4618d403b9354dc7982719","source":{"kind":"arxiv","id":"2006.13713","version":1},"attestation_state":"computed","paper":{"title":"Coconut: a scalable bottom-up approach for building data series indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haridimos Kondylakis, Kostas Zoumpatianos, Niv Dayan, Themis Palpanas","submitted_at":"2020-06-20T01:52:13Z","abstract_excerpt":"Many modern applications produce massive amounts of data series that need to be analyzed, requiring efficient similarity search operations. However, the state-of-the-art data series indexes that are used for this purpose do not scale well for massive datasets in terms of performance, or storage costs. We pinpoint the problem to the fact that existing summarizations of data series used for indexing cannot be sorted while keeping similar data series close to each other in the sorted order. This leads to two design problems. First, traditional bulk-loading algorithms based on sorting cannot be us"},"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":"2006.13713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-06-20T01:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"0734d4b779d4ea0bf719b6eae5bea6ea24e7975f5252d24c9336c3c708104af2","abstract_canon_sha256":"7dd0f0988ffc189985196abf65d5cccf3fed3e40f3865ef5440a5be3674b93e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:19.051942Z","signature_b64":"0gW8Jp9/9IWKcaRd4c9GcijXjXX9XCg+N2CA7mTPhwfvSha6M2IMFXGd1jGJ0VnepDB6l377qrzkLOHwGt6YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f70a587a7bfb2963838da8dd48deeb455c7674fc8d4618d403b9354dc7982719","last_reissued_at":"2026-07-05T01:13:19.051536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:19.051536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coconut: a scalable bottom-up approach for building data series indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haridimos Kondylakis, Kostas Zoumpatianos, Niv Dayan, Themis Palpanas","submitted_at":"2020-06-20T01:52:13Z","abstract_excerpt":"Many modern applications produce massive amounts of data series that need to be analyzed, requiring efficient similarity search operations. However, the state-of-the-art data series indexes that are used for this purpose do not scale well for massive datasets in terms of performance, or storage costs. We pinpoint the problem to the fact that existing summarizations of data series used for indexing cannot be sorted while keeping similar data series close to each other in the sorted order. This leads to two design problems. First, traditional bulk-loading algorithms based on sorting cannot be us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13713","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/2006.13713/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":"2006.13713","created_at":"2026-07-05T01:13:19.051596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.13713v1","created_at":"2026-07-05T01:13:19.051596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13713","created_at":"2026-07-05T01:13:19.051596+00:00"},{"alias_kind":"pith_short_12","alias_value":"64FFQ6T37MUW","created_at":"2026-07-05T01:13:19.051596+00:00"},{"alias_kind":"pith_short_16","alias_value":"64FFQ6T37MUWHA4N","created_at":"2026-07-05T01:13:19.051596+00:00"},{"alias_kind":"pith_short_8","alias_value":"64FFQ6T3","created_at":"2026-07-05T01:13:19.051596+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/64FFQ6T37MUWHA4NVDOURXXLIV","json":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV.json","graph_json":"https://pith.science/api/pith-number/64FFQ6T37MUWHA4NVDOURXXLIV/graph.json","events_json":"https://pith.science/api/pith-number/64FFQ6T37MUWHA4NVDOURXXLIV/events.json","paper":"https://pith.science/paper/64FFQ6T3"},"agent_actions":{"view_html":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV","download_json":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV.json","view_paper":"https://pith.science/paper/64FFQ6T3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.13713&json=true","fetch_graph":"https://pith.science/api/pith-number/64FFQ6T37MUWHA4NVDOURXXLIV/graph.json","fetch_events":"https://pith.science/api/pith-number/64FFQ6T37MUWHA4NVDOURXXLIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV/action/storage_attestation","attest_author":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV/action/author_attestation","sign_citation":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV/action/citation_signature","submit_replication":"https://pith.science/pith/64FFQ6T37MUWHA4NVDOURXXLIV/action/replication_record"}},"created_at":"2026-07-05T01:13:19.051596+00:00","updated_at":"2026-07-05T01:13:19.051596+00:00"}