{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HPU3CUSO27A4EZIYEXQTLKKY7A","short_pith_number":"pith:HPU3CUSO","canonical_record":{"source":{"id":"2412.03332","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T14:03:27Z","cross_cats_sorted":["cs.CC","cs.CG","cs.LG"],"title_canon_sha256":"f49777f124dc786abba126ff4fa34399669d3f9127aa6f1461c5deef219187ca","abstract_canon_sha256":"6176a940795613141090d0e8e9136a133aa282adf1d742fd7a3299a8a46df709"},"schema_version":"1.0"},"canonical_sha256":"3be9b1524ed7c1c2651825e135a958f81432d0dcd5def549134412647451d16c","source":{"kind":"arxiv","id":"2412.03332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03332","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03332v2","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03332","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"HPU3CUSO27A4","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_16","alias_value":"HPU3CUSO27A4EZIY","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_8","alias_value":"HPU3CUSO","created_at":"2026-07-05T10:47:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HPU3CUSO27A4EZIYEXQTLKKY7A","target":"record","payload":{"canonical_record":{"source":{"id":"2412.03332","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T14:03:27Z","cross_cats_sorted":["cs.CC","cs.CG","cs.LG"],"title_canon_sha256":"f49777f124dc786abba126ff4fa34399669d3f9127aa6f1461c5deef219187ca","abstract_canon_sha256":"6176a940795613141090d0e8e9136a133aa282adf1d742fd7a3299a8a46df709"},"schema_version":"1.0"},"canonical_sha256":"3be9b1524ed7c1c2651825e135a958f81432d0dcd5def549134412647451d16c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:34.261103Z","signature_b64":"2rRF8tldbd+cgHsdwJ5mrMQiKQDWilQrg2GxpPVxgnJv9mZwNWPlQYfHlJNE7l55Vet79V9oIH5UrJHqj6xGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3be9b1524ed7c1c2651825e135a958f81432d0dcd5def549134412647451d16c","last_reissued_at":"2026-07-05T10:47:34.260622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:34.260622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.03332","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-05T10:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIA2Ou63SdjJFxthmDtA0JO5yjS4YMjonrwKu8hwTC3sUmVVZZ3oJANH8K8RMJ2npJawVZUVLIw75EI+VgfiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:01:19.988531Z"},"content_sha256":"2aa27522754b6b3e025dad4893cb7d7b72d96b5168aeca7ba856a7b8e1262a25","schema_version":"1.0","event_id":"sha256:2aa27522754b6b3e025dad4893cb7d7b72d96b5168aeca7ba856a7b8e1262a25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HPU3CUSO27A4EZIYEXQTLKKY7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.LG"],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn, Euiwoong Lee, Karthik C. S., Samson Zhou, Yuval Rabani","submitted_at":"2024-12-04T14:03:27Z","abstract_excerpt":"The $\\ell_2^2$ min-sum $k$-clustering problem is to partition an input set into clusters $C_1,\\ldots,C_k$ to minimize $\\sum_{i=1}^k\\sum_{p,q\\in C_i}\\|p-q\\|_2^2$. Although $\\ell_2^2$ min-sum $k$-clustering is NP-hard, it is not known whether it is NP-hard to approximate $\\ell_2^2$ min-sum $k$-clustering beyond a certain factor.\n  In this paper, we give the first hardness-of-approximation result for the $\\ell_2^2$ min-sum $k$-clustering problem. We show that it is NP-hard to approximate the objective to a factor better than $1.056$ and moreover, assuming a balanced variant of the Johnson Coverag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03332","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/2412.03332/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-05T10:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tWsVqu4FP7YSjSESdVuACLYZ27aa2FNSzh36koPTAoLXa9TQ6XH7fOgkx3E2SzBvzNEkM1O/HvArHX+zXo9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:01:19.989447Z"},"content_sha256":"99d697cd44fcc0ac3920e4226a29c36ec406f39bc7cb1441c296b5f18e02b477","schema_version":"1.0","event_id":"sha256:99d697cd44fcc0ac3920e4226a29c36ec406f39bc7cb1441c296b5f18e02b477"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPU3CUSO27A4EZIYEXQTLKKY7A/bundle.json","state_url":"https://pith.science/pith/HPU3CUSO27A4EZIYEXQTLKKY7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPU3CUSO27A4EZIYEXQTLKKY7A/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-08-08T21:01:19Z","links":{"resolver":"https://pith.science/pith/HPU3CUSO27A4EZIYEXQTLKKY7A","bundle":"https://pith.science/pith/HPU3CUSO27A4EZIYEXQTLKKY7A/bundle.json","state":"https://pith.science/pith/HPU3CUSO27A4EZIYEXQTLKKY7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPU3CUSO27A4EZIYEXQTLKKY7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HPU3CUSO27A4EZIYEXQTLKKY7A","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":"6176a940795613141090d0e8e9136a133aa282adf1d742fd7a3299a8a46df709","cross_cats_sorted":["cs.CC","cs.CG","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T14:03:27Z","title_canon_sha256":"f49777f124dc786abba126ff4fa34399669d3f9127aa6f1461c5deef219187ca"},"schema_version":"1.0","source":{"id":"2412.03332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03332","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03332v2","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03332","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"HPU3CUSO27A4","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_16","alias_value":"HPU3CUSO27A4EZIY","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_8","alias_value":"HPU3CUSO","created_at":"2026-07-05T10:47:34Z"}],"graph_snapshots":[{"event_id":"sha256:99d697cd44fcc0ac3920e4226a29c36ec406f39bc7cb1441c296b5f18e02b477","target":"graph","created_at":"2026-07-05T10:47:34Z","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/2412.03332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $\\ell_2^2$ min-sum $k$-clustering problem is to partition an input set into clusters $C_1,\\ldots,C_k$ to minimize $\\sum_{i=1}^k\\sum_{p,q\\in C_i}\\|p-q\\|_2^2$. Although $\\ell_2^2$ min-sum $k$-clustering is NP-hard, it is not known whether it is NP-hard to approximate $\\ell_2^2$ min-sum $k$-clustering beyond a certain factor.\n  In this paper, we give the first hardness-of-approximation result for the $\\ell_2^2$ min-sum $k$-clustering problem. We show that it is NP-hard to approximate the objective to a factor better than $1.056$ and moreover, assuming a balanced variant of the Johnson Coverag","authors_text":"Chris Schwiegelshohn, Euiwoong Lee, Karthik C. S., Samson Zhou, Yuval Rabani","cross_cats":["cs.CC","cs.CG","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T14:03:27Z","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03332","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:2aa27522754b6b3e025dad4893cb7d7b72d96b5168aeca7ba856a7b8e1262a25","target":"record","created_at":"2026-07-05T10:47:34Z","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":"6176a940795613141090d0e8e9136a133aa282adf1d742fd7a3299a8a46df709","cross_cats_sorted":["cs.CC","cs.CG","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T14:03:27Z","title_canon_sha256":"f49777f124dc786abba126ff4fa34399669d3f9127aa6f1461c5deef219187ca"},"schema_version":"1.0","source":{"id":"2412.03332","kind":"arxiv","version":2}},"canonical_sha256":"3be9b1524ed7c1c2651825e135a958f81432d0dcd5def549134412647451d16c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3be9b1524ed7c1c2651825e135a958f81432d0dcd5def549134412647451d16c","first_computed_at":"2026-07-05T10:47:34.260622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:34.260622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rRF8tldbd+cgHsdwJ5mrMQiKQDWilQrg2GxpPVxgnJv9mZwNWPlQYfHlJNE7l55Vet79V9oIH5UrJHqj6xGCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:34.261103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aa27522754b6b3e025dad4893cb7d7b72d96b5168aeca7ba856a7b8e1262a25","sha256:99d697cd44fcc0ac3920e4226a29c36ec406f39bc7cb1441c296b5f18e02b477"],"state_sha256":"92858caec59da7e9917613e7bd2968dabf152b02644019e4e34d36577c6ad9b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9djX8p/0+iPcHCNnePgbctFTG0RGOKoskSdaCJXy+Hzi76WGnP9xXR+UpzKcyF6o8WHTc9/jfpy2SR9nlu/NBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:01:19.998245Z","bundle_sha256":"39f53ba2b6c3589e42554e91f4b1725b6e14019a4ac8092312496c2e9190409f"}}