{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FVTGVVZHORNAMQQP374I556YN6","short_pith_number":"pith:FVTGVVZH","canonical_record":{"source":{"id":"2201.08226","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-01-20T15:31:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a772e5f1ce000d9a1f8cdb84cf28ecaf130563ae7ac4d8decb91c7245a1cab09","abstract_canon_sha256":"d94514b61e5b74c6dbff6d336da1aad7f0516d3ec56fcbfabe5884d66ba636bc"},"schema_version":"1.0"},"canonical_sha256":"2d666ad727745a06420fdff88ef7d86face6020aa2da8f2db64072c414695806","source":{"kind":"arxiv","id":"2201.08226","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.08226","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"2201.08226v2","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08226","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"FVTGVVZHORNA","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"pith_short_16","alias_value":"FVTGVVZHORNAMQQP","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"pith_short_8","alias_value":"FVTGVVZH","created_at":"2026-07-05T03:55:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FVTGVVZHORNAMQQP374I556YN6","target":"record","payload":{"canonical_record":{"source":{"id":"2201.08226","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-01-20T15:31:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a772e5f1ce000d9a1f8cdb84cf28ecaf130563ae7ac4d8decb91c7245a1cab09","abstract_canon_sha256":"d94514b61e5b74c6dbff6d336da1aad7f0516d3ec56fcbfabe5884d66ba636bc"},"schema_version":"1.0"},"canonical_sha256":"2d666ad727745a06420fdff88ef7d86face6020aa2da8f2db64072c414695806","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:31.998390Z","signature_b64":"EV+kEKEDlkDZZRBEKfHNtYtGQA8rEeZtGDF58nS5lqtdn4wGuWnvXjlD7m7WHBEssU+ctjQZ4YlmIdEDFt3xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d666ad727745a06420fdff88ef7d86face6020aa2da8f2db64072c414695806","last_reissued_at":"2026-07-05T03:55:31.997941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:31.997941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.08226","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/7FAQHDY7T+dhSszHY0tNrJ4RnBp97bQj12C18Zse8pWFBraEYug89wrw5V9QcW5B9GA5FB+HPTSSld2PjdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T01:45:32.091515Z"},"content_sha256":"c11cb02a7f8c83d669ca3b0b20708dfa3489ae16c44e0e8c2313771982a235b4","schema_version":"1.0","event_id":"sha256:c11cb02a7f8c83d669ca3b0b20708dfa3489ae16c44e0e8c2313771982a235b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FVTGVVZHORNAMQQP374I556YN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sketch-and-Lift: Scalable Subsampled Semidefinite Program for $K$-means Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Xiaohui Chen, Yubo Zhuang, Yun Yang","submitted_at":"2022-01-20T15:31:28Z","abstract_excerpt":"Semidefinite programming (SDP) is a powerful tool for tackling a wide range of computationally hard problems such as clustering. Despite the high accuracy, semidefinite programs are often too slow in practice with poor scalability on large (or even moderate) datasets. In this paper, we introduce a linear time complexity algorithm for approximating an SDP relaxed $K$-means clustering. The proposed sketch-and-lift (SL) approach solves an SDP on a subsampled dataset and then propagates the solution to all data points by a nearest-centroid rounding procedure. It is shown that the SL approach enjoy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08226","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/2201.08226/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UZTEmUdiriOQLsBKT9AhTMFyYN2FleZ854EXsc/BpZK2cFKVHqL5ntPWydQad1t99eMgRQNWDmOPU2RgXA1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T01:45:32.091894Z"},"content_sha256":"bd258a4c0545366760a85e0a08179362fa04af602ae3d0efe517ae7f31d83293","schema_version":"1.0","event_id":"sha256:bd258a4c0545366760a85e0a08179362fa04af602ae3d0efe517ae7f31d83293"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVTGVVZHORNAMQQP374I556YN6/bundle.json","state_url":"https://pith.science/pith/FVTGVVZHORNAMQQP374I556YN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVTGVVZHORNAMQQP374I556YN6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-25T01:45:32Z","links":{"resolver":"https://pith.science/pith/FVTGVVZHORNAMQQP374I556YN6","bundle":"https://pith.science/pith/FVTGVVZHORNAMQQP374I556YN6/bundle.json","state":"https://pith.science/pith/FVTGVVZHORNAMQQP374I556YN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVTGVVZHORNAMQQP374I556YN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FVTGVVZHORNAMQQP374I556YN6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d94514b61e5b74c6dbff6d336da1aad7f0516d3ec56fcbfabe5884d66ba636bc","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-01-20T15:31:28Z","title_canon_sha256":"a772e5f1ce000d9a1f8cdb84cf28ecaf130563ae7ac4d8decb91c7245a1cab09"},"schema_version":"1.0","source":{"id":"2201.08226","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.08226","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"2201.08226v2","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08226","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"FVTGVVZHORNA","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"pith_short_16","alias_value":"FVTGVVZHORNAMQQP","created_at":"2026-07-05T03:55:31Z"},{"alias_kind":"pith_short_8","alias_value":"FVTGVVZH","created_at":"2026-07-05T03:55:31Z"}],"graph_snapshots":[{"event_id":"sha256:bd258a4c0545366760a85e0a08179362fa04af602ae3d0efe517ae7f31d83293","target":"graph","created_at":"2026-07-05T03:55:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.08226/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programming (SDP) is a powerful tool for tackling a wide range of computationally hard problems such as clustering. Despite the high accuracy, semidefinite programs are often too slow in practice with poor scalability on large (or even moderate) datasets. In this paper, we introduce a linear time complexity algorithm for approximating an SDP relaxed $K$-means clustering. The proposed sketch-and-lift (SL) approach solves an SDP on a subsampled dataset and then propagates the solution to all data points by a nearest-centroid rounding procedure. It is shown that the SL approach enjoy","authors_text":"Xiaohui Chen, Yubo Zhuang, Yun Yang","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-01-20T15:31:28Z","title":"Sketch-and-Lift: Scalable Subsampled Semidefinite Program for $K$-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08226","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c11cb02a7f8c83d669ca3b0b20708dfa3489ae16c44e0e8c2313771982a235b4","target":"record","created_at":"2026-07-05T03:55:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d94514b61e5b74c6dbff6d336da1aad7f0516d3ec56fcbfabe5884d66ba636bc","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-01-20T15:31:28Z","title_canon_sha256":"a772e5f1ce000d9a1f8cdb84cf28ecaf130563ae7ac4d8decb91c7245a1cab09"},"schema_version":"1.0","source":{"id":"2201.08226","kind":"arxiv","version":2}},"canonical_sha256":"2d666ad727745a06420fdff88ef7d86face6020aa2da8f2db64072c414695806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d666ad727745a06420fdff88ef7d86face6020aa2da8f2db64072c414695806","first_computed_at":"2026-07-05T03:55:31.997941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:55:31.997941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EV+kEKEDlkDZZRBEKfHNtYtGQA8rEeZtGDF58nS5lqtdn4wGuWnvXjlD7m7WHBEssU+ctjQZ4YlmIdEDFt3xAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:55:31.998390Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.08226","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c11cb02a7f8c83d669ca3b0b20708dfa3489ae16c44e0e8c2313771982a235b4","sha256:bd258a4c0545366760a85e0a08179362fa04af602ae3d0efe517ae7f31d83293"],"state_sha256":"4bd138361706b201100bd1ef362425f97041c7c21c4c735e8301ff039c52446e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INZZbHUYzQK81241tO02waM5FToElUpTv4vBbElgwjhwSO9ams0Jv21RTJNUUKsU4jRH+UtLngOK7c5Xim7XDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T01:45:32.094165Z","bundle_sha256":"4aeb49c5fa65a1fbebb8eb194dd02b06f4f23d74ac9f0996f979b553ab66b04e"}}