{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:42AYZJTIGLVKEAXHPRP4X2WQW7","short_pith_number":"pith:42AYZJTI","schema_version":"1.0","canonical_sha256":"e6818ca66832eaa202e77c5fcbead0b7f997bc754899a23a29aae9ab7b475309","source":{"kind":"arxiv","id":"1508.04757","version":1},"attestation_state":"computed","paper":{"title":"Time Series Clustering via Community Detection in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Leonardo N. Ferreira, Liang Zhao","submitted_at":"2015-08-19T19:55:08Z","abstract_excerpt":"In this paper, we propose a technique for time series clustering using community detection in complex networks. Firstly, we present a method to transform a set of time series into a network using different distance functions, where each time series is represented by a vertex and the most similar ones are connected. Then, we apply community detection algorithms to identify groups of strongly connected vertices (called a community) and, consequently, identify time series clusters. Still in this paper, we make a comprehensive analysis on the influence of various combinations of time series distan"},"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":"1508.04757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-19T19:55:08Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"d8358669aae4537dc635263bfd92f334b0c2c3fa5394a64289bce9882d1dcd6c","abstract_canon_sha256":"c4d063cfbb004fc0a45a5772e8acf13dc10ff99cc1f7f7b31e7a1d0265754698"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.849142Z","signature_b64":"e1Y8dc/T3WUw9z6tTo7cfA0EqL+5VS7JuNXPwhkhPFsstjcTblneHjMRuD59RrpUktuY2VR/JjpfCljAZa8VDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6818ca66832eaa202e77c5fcbead0b7f997bc754899a23a29aae9ab7b475309","last_reissued_at":"2026-05-18T01:35:01.848451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.848451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time Series Clustering via Community Detection in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Leonardo N. Ferreira, Liang Zhao","submitted_at":"2015-08-19T19:55:08Z","abstract_excerpt":"In this paper, we propose a technique for time series clustering using community detection in complex networks. Firstly, we present a method to transform a set of time series into a network using different distance functions, where each time series is represented by a vertex and the most similar ones are connected. Then, we apply community detection algorithms to identify groups of strongly connected vertices (called a community) and, consequently, identify time series clusters. Still in this paper, we make a comprehensive analysis on the influence of various combinations of time series distan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04757","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":"1508.04757","created_at":"2026-05-18T01:35:01.848560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04757v1","created_at":"2026-05-18T01:35:01.848560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04757","created_at":"2026-05-18T01:35:01.848560+00:00"},{"alias_kind":"pith_short_12","alias_value":"42AYZJTIGLVK","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"42AYZJTIGLVKEAXH","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"42AYZJTI","created_at":"2026-05-18T12:29:02.477457+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/42AYZJTIGLVKEAXHPRP4X2WQW7","json":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7.json","graph_json":"https://pith.science/api/pith-number/42AYZJTIGLVKEAXHPRP4X2WQW7/graph.json","events_json":"https://pith.science/api/pith-number/42AYZJTIGLVKEAXHPRP4X2WQW7/events.json","paper":"https://pith.science/paper/42AYZJTI"},"agent_actions":{"view_html":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7","download_json":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7.json","view_paper":"https://pith.science/paper/42AYZJTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04757&json=true","fetch_graph":"https://pith.science/api/pith-number/42AYZJTIGLVKEAXHPRP4X2WQW7/graph.json","fetch_events":"https://pith.science/api/pith-number/42AYZJTIGLVKEAXHPRP4X2WQW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7/action/storage_attestation","attest_author":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7/action/author_attestation","sign_citation":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7/action/citation_signature","submit_replication":"https://pith.science/pith/42AYZJTIGLVKEAXHPRP4X2WQW7/action/replication_record"}},"created_at":"2026-05-18T01:35:01.848560+00:00","updated_at":"2026-05-18T01:35:01.848560+00:00"}