{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q6WSDTQIX5US5KZ7MVTC2NMMLP","short_pith_number":"pith:Q6WSDTQI","schema_version":"1.0","canonical_sha256":"87ad21ce08bf692eab3f65662d358c5bf3032c93d59717fcb550c0cf7b238cc4","source":{"kind":"arxiv","id":"2501.15964","version":1},"attestation_state":"computed","paper":{"title":"PyClustrPath: An efficient Python package for generating clustering paths with GPU acceleration","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongfei Wu, Yancheng Yuan","submitted_at":"2025-01-27T11:14:06Z","abstract_excerpt":"Convex clustering is a popular clustering model without requiring the number of clusters as prior knowledge. It can generate a clustering path by continuously solving the model with a sequence of regularization parameter values. This paper introduces {\\it PyClustrPath}, a highly efficient Python package for solving the convex clustering model with GPU acceleration. {\\it PyClustrPath} implements popular first-order and second-order algorithms with a clean modular design. Such a design makes {\\it PyClustrPath} more scalable to incorporate new algorithms for solving the convex clustering model in"},"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":"2501.15964","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-27T11:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"481c48ddd284d379a8f274cce332b7fc15b3c15da3ee238f536159ffe3a21e9a","abstract_canon_sha256":"650f4b29fd053666c9dbd1481025e93ddfc0bd494c9d02eaf907506b52f76c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:52.867501Z","signature_b64":"+nApkRpDD+2U2sh6qVMuMyZa/xRmhz+zdBFJQ4rLyBivGXBr9Z3HoociwOG9k+rWwY0Xt+ZOGXcFrS9hufi3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87ad21ce08bf692eab3f65662d358c5bf3032c93d59717fcb550c0cf7b238cc4","last_reissued_at":"2026-07-05T10:05:52.866998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:52.866998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PyClustrPath: An efficient Python package for generating clustering paths with GPU acceleration","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongfei Wu, Yancheng Yuan","submitted_at":"2025-01-27T11:14:06Z","abstract_excerpt":"Convex clustering is a popular clustering model without requiring the number of clusters as prior knowledge. It can generate a clustering path by continuously solving the model with a sequence of regularization parameter values. This paper introduces {\\it PyClustrPath}, a highly efficient Python package for solving the convex clustering model with GPU acceleration. {\\it PyClustrPath} implements popular first-order and second-order algorithms with a clean modular design. Such a design makes {\\it PyClustrPath} more scalable to incorporate new algorithms for solving the convex clustering model in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15964","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/2501.15964/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":"2501.15964","created_at":"2026-07-05T10:05:52.867050+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15964v1","created_at":"2026-07-05T10:05:52.867050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15964","created_at":"2026-07-05T10:05:52.867050+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6WSDTQIX5US","created_at":"2026-07-05T10:05:52.867050+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6WSDTQIX5US5KZ7","created_at":"2026-07-05T10:05:52.867050+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6WSDTQI","created_at":"2026-07-05T10:05:52.867050+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/Q6WSDTQIX5US5KZ7MVTC2NMMLP","json":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP.json","graph_json":"https://pith.science/api/pith-number/Q6WSDTQIX5US5KZ7MVTC2NMMLP/graph.json","events_json":"https://pith.science/api/pith-number/Q6WSDTQIX5US5KZ7MVTC2NMMLP/events.json","paper":"https://pith.science/paper/Q6WSDTQI"},"agent_actions":{"view_html":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP","download_json":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP.json","view_paper":"https://pith.science/paper/Q6WSDTQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15964&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6WSDTQIX5US5KZ7MVTC2NMMLP/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6WSDTQIX5US5KZ7MVTC2NMMLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP/action/storage_attestation","attest_author":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP/action/author_attestation","sign_citation":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP/action/citation_signature","submit_replication":"https://pith.science/pith/Q6WSDTQIX5US5KZ7MVTC2NMMLP/action/replication_record"}},"created_at":"2026-07-05T10:05:52.867050+00:00","updated_at":"2026-07-05T10:05:52.867050+00:00"}