{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YUHTLCG4QWAJSB6ZWM5EXCGGAK","short_pith_number":"pith:YUHTLCG4","schema_version":"1.0","canonical_sha256":"c50f3588dc85809907d9b33a4b88c602bb3de294d7ad5e62aed3aeba388b0e26","source":{"kind":"arxiv","id":"1704.05964","version":1},"attestation_state":"computed","paper":{"title":"Temporal Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alfred Rossi, Anastasios Sidiropoulos, Tamal K. Dey","submitted_at":"2017-04-20T00:17:43Z","abstract_excerpt":"We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological surveys and contagious disease surveillance. In this more general setting existing algorithms for classical (i.e.~static) clustering problems are not applicable anymore.\n  We propose a set of optimization problems which we collectively refer to as 'temporal clustering'. The quality of a solution to a temporal clustering instance can be quantified using three para"},"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":"1704.05964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T00:17:43Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"301abcba548bb1151c0042822f393bc27766354f9c787c7ab97e057857d9e017","abstract_canon_sha256":"9e52ea5903ee58a29cd3cb5e921274400f3e8f7e4ffa56a6f7e7ec55e04c4ad1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:50.857038Z","signature_b64":"oWH7d63NbVf6eS13caX84EME4B/aYNwPS7lt72RjVxhJolbsw8oEBIX51OHV/j43/02C5IzlrcDkz7p7aTQ8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c50f3588dc85809907d9b33a4b88c602bb3de294d7ad5e62aed3aeba388b0e26","last_reissued_at":"2026-05-18T00:32:50.856308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:50.856308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alfred Rossi, Anastasios Sidiropoulos, Tamal K. Dey","submitted_at":"2017-04-20T00:17:43Z","abstract_excerpt":"We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological surveys and contagious disease surveillance. In this more general setting existing algorithms for classical (i.e.~static) clustering problems are not applicable anymore.\n  We propose a set of optimization problems which we collectively refer to as 'temporal clustering'. The quality of a solution to a temporal clustering instance can be quantified using three para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05964","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":"1704.05964","created_at":"2026-05-18T00:32:50.856432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05964v1","created_at":"2026-05-18T00:32:50.856432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05964","created_at":"2026-05-18T00:32:50.856432+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUHTLCG4QWAJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUHTLCG4QWAJSB6Z","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUHTLCG4","created_at":"2026-05-18T12:31:56.362134+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/YUHTLCG4QWAJSB6ZWM5EXCGGAK","json":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK.json","graph_json":"https://pith.science/api/pith-number/YUHTLCG4QWAJSB6ZWM5EXCGGAK/graph.json","events_json":"https://pith.science/api/pith-number/YUHTLCG4QWAJSB6ZWM5EXCGGAK/events.json","paper":"https://pith.science/paper/YUHTLCG4"},"agent_actions":{"view_html":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK","download_json":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK.json","view_paper":"https://pith.science/paper/YUHTLCG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05964&json=true","fetch_graph":"https://pith.science/api/pith-number/YUHTLCG4QWAJSB6ZWM5EXCGGAK/graph.json","fetch_events":"https://pith.science/api/pith-number/YUHTLCG4QWAJSB6ZWM5EXCGGAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK/action/storage_attestation","attest_author":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK/action/author_attestation","sign_citation":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK/action/citation_signature","submit_replication":"https://pith.science/pith/YUHTLCG4QWAJSB6ZWM5EXCGGAK/action/replication_record"}},"created_at":"2026-05-18T00:32:50.856432+00:00","updated_at":"2026-05-18T00:32:50.856432+00:00"}