{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:J62R2LCJ45GF63LSC3OFV27IPF","short_pith_number":"pith:J62R2LCJ","schema_version":"1.0","canonical_sha256":"4fb51d2c49e74c5f6d7216dc5aebe8797b94bba6d46fb4772269c2762f51dea3","source":{"kind":"arxiv","id":"2203.00812","version":2},"attestation_state":"computed","paper":{"title":"Efficient Dynamic Clustering: Capturing Patterns from Historical Cluster Evolution","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Binbin Gu, Faisal Nawab, Saeed Kargar","submitted_at":"2022-03-02T01:10:43Z","abstract_excerpt":"Clustering aims to group unlabeled objects based on similarity inherent among them into clusters. It is important for many tasks such as anomaly detection, database sharding, record linkage, and others. Some clustering methods are taken as batch algorithms that incur a high overhead as they cluster all the objects in the database from scratch or assume an incremental workload. In practice, database objects are updated, added, and removed from databases continuously which makes previous results stale. Running batch algorithms is infeasible in such scenarios as it would incur a significant overh"},"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":"2203.00812","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2022-03-02T01:10:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fc76a04a50f7258b2a8f75180afe4a5ea11833f9315c90922cc3d8105af5969d","abstract_canon_sha256":"7be79f04c692b731498d9ebd3f33b499e81174c9cf02a2527c3ee23b7382f23c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:25.694301Z","signature_b64":"nAu9zgM4sQl/EnbUX3K1CY1gdksvZQGwCBjMS6YCJm8sj4Ie6/1D6rULLCvHNqqaHBCOMFL+RKkYJX+qZxbcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fb51d2c49e74c5f6d7216dc5aebe8797b94bba6d46fb4772269c2762f51dea3","last_reissued_at":"2026-07-05T09:41:25.693855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:25.693855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dynamic Clustering: Capturing Patterns from Historical Cluster Evolution","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Binbin Gu, Faisal Nawab, Saeed Kargar","submitted_at":"2022-03-02T01:10:43Z","abstract_excerpt":"Clustering aims to group unlabeled objects based on similarity inherent among them into clusters. It is important for many tasks such as anomaly detection, database sharding, record linkage, and others. Some clustering methods are taken as batch algorithms that incur a high overhead as they cluster all the objects in the database from scratch or assume an incremental workload. In practice, database objects are updated, added, and removed from databases continuously which makes previous results stale. Running batch algorithms is infeasible in such scenarios as it would incur a significant overh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00812","kind":"arxiv","version":2},"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/2203.00812/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":"2203.00812","created_at":"2026-07-05T09:41:25.693910+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00812v2","created_at":"2026-07-05T09:41:25.693910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00812","created_at":"2026-07-05T09:41:25.693910+00:00"},{"alias_kind":"pith_short_12","alias_value":"J62R2LCJ45GF","created_at":"2026-07-05T09:41:25.693910+00:00"},{"alias_kind":"pith_short_16","alias_value":"J62R2LCJ45GF63LS","created_at":"2026-07-05T09:41:25.693910+00:00"},{"alias_kind":"pith_short_8","alias_value":"J62R2LCJ","created_at":"2026-07-05T09:41:25.693910+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/J62R2LCJ45GF63LSC3OFV27IPF","json":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF.json","graph_json":"https://pith.science/api/pith-number/J62R2LCJ45GF63LSC3OFV27IPF/graph.json","events_json":"https://pith.science/api/pith-number/J62R2LCJ45GF63LSC3OFV27IPF/events.json","paper":"https://pith.science/paper/J62R2LCJ"},"agent_actions":{"view_html":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF","download_json":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF.json","view_paper":"https://pith.science/paper/J62R2LCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00812&json=true","fetch_graph":"https://pith.science/api/pith-number/J62R2LCJ45GF63LSC3OFV27IPF/graph.json","fetch_events":"https://pith.science/api/pith-number/J62R2LCJ45GF63LSC3OFV27IPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF/action/storage_attestation","attest_author":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF/action/author_attestation","sign_citation":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF/action/citation_signature","submit_replication":"https://pith.science/pith/J62R2LCJ45GF63LSC3OFV27IPF/action/replication_record"}},"created_at":"2026-07-05T09:41:25.693910+00:00","updated_at":"2026-07-05T09:41:25.693910+00:00"}