{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:M32ZY2NULRCNZMCPNFGYTRLMHD","short_pith_number":"pith:M32ZY2NU","canonical_record":{"source":{"id":"2403.02971","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-03-05T13:49:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"27f01b88b4460c4599b4376ac69561948684b6764218f245db2a4fab93d187ae","abstract_canon_sha256":"4324b405f9a910b610c070ccd8ac3cd54a25b9709f4d65eff7238a84fe6c52fb"},"schema_version":"1.0"},"canonical_sha256":"66f59c69b45c44dcb04f694d89c56c38f663d8823cad4995a979a00d44b6405b","source":{"kind":"arxiv","id":"2403.02971","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02971","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02971v3","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02971","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"M32ZY2NULRCN","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"pith_short_16","alias_value":"M32ZY2NULRCNZMCP","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"pith_short_8","alias_value":"M32ZY2NU","created_at":"2026-07-05T10:31:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:M32ZY2NULRCNZMCPNFGYTRLMHD","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02971","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-03-05T13:49:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"27f01b88b4460c4599b4376ac69561948684b6764218f245db2a4fab93d187ae","abstract_canon_sha256":"4324b405f9a910b610c070ccd8ac3cd54a25b9709f4d65eff7238a84fe6c52fb"},"schema_version":"1.0"},"canonical_sha256":"66f59c69b45c44dcb04f694d89c56c38f663d8823cad4995a979a00d44b6405b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:41.845205Z","signature_b64":"paptnlaEsSAh5Pk98LAvvWQUe2wK1jjs4CrT9DZ6O1LvmXzc3HqYGJq7QUPE32EpMCNuq/n6fF0PKyT8o9PpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f59c69b45c44dcb04f694d89c56c38f663d8823cad4995a979a00d44b6405b","last_reissued_at":"2026-07-05T10:31:41.844660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:41.844660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02971","source_version":3,"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:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EL7FOp89fldHyCy6vjxIHN+bwkd/IV0FEJVmW4He/t/exgpIqj2qc9osUfQ+7RCpznLcNy0znAQgpm6vHD6DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:04:18.803568Z"},"content_sha256":"9965d1be9f8a68ee5a5b1500d233c69dc0a7e6f7943e9857802f9b73a27d0ea4","schema_version":"1.0","event_id":"sha256:9965d1be9f8a68ee5a5b1500d233c69dc0a7e6f7943e9857802f9b73a27d0ea4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:M32ZY2NULRCNZMCPNFGYTRLMHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Complexity of Euclidean Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Lingxiao Huang, Xiaoyi Zhu, Yuxiang Tian, Zengfeng Huang","submitted_at":"2024-03-05T13:49:32Z","abstract_excerpt":"The $(k, z)$-Clustering problem in Euclidean space $\\mathbb{R}^d$ has been extensively studied. Given the scale of data involved, compression methods for the Euclidean $(k, z)$-Clustering problem, such as data compression and dimension reduction, have received significant attention in the literature. However, the space complexity of the clustering problem, specifically, the number of bits required to compress the cost function within a multiplicative error $\\varepsilon$, remains unclear in existing literature. This paper initiates the study of space complexity for Euclidean $(k, z)$-Clustering"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02971","kind":"arxiv","version":3},"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/2403.02971/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:31:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxwWI7+SXuCdlA+iIcmMAsohf7OQvlf0oZu2tdVd+rgMYb9ohYTHiE8EeSe5Dt73PQQ+NtU1Omjs5cimsLRDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:04:18.804105Z"},"content_sha256":"e7f07571f5ce935dc2b11b1ba4d9376fbc0614138b5fc5d362ad50e32fcfd3de","schema_version":"1.0","event_id":"sha256:e7f07571f5ce935dc2b11b1ba4d9376fbc0614138b5fc5d362ad50e32fcfd3de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M32ZY2NULRCNZMCPNFGYTRLMHD/bundle.json","state_url":"https://pith.science/pith/M32ZY2NULRCNZMCPNFGYTRLMHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M32ZY2NULRCNZMCPNFGYTRLMHD/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-18T16:04:18Z","links":{"resolver":"https://pith.science/pith/M32ZY2NULRCNZMCPNFGYTRLMHD","bundle":"https://pith.science/pith/M32ZY2NULRCNZMCPNFGYTRLMHD/bundle.json","state":"https://pith.science/pith/M32ZY2NULRCNZMCPNFGYTRLMHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M32ZY2NULRCNZMCPNFGYTRLMHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:M32ZY2NULRCNZMCPNFGYTRLMHD","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":"4324b405f9a910b610c070ccd8ac3cd54a25b9709f4d65eff7238a84fe6c52fb","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-03-05T13:49:32Z","title_canon_sha256":"27f01b88b4460c4599b4376ac69561948684b6764218f245db2a4fab93d187ae"},"schema_version":"1.0","source":{"id":"2403.02971","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02971","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02971v3","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02971","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"pith_short_12","alias_value":"M32ZY2NULRCN","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"pith_short_16","alias_value":"M32ZY2NULRCNZMCP","created_at":"2026-07-05T10:31:41Z"},{"alias_kind":"pith_short_8","alias_value":"M32ZY2NU","created_at":"2026-07-05T10:31:41Z"}],"graph_snapshots":[{"event_id":"sha256:e7f07571f5ce935dc2b11b1ba4d9376fbc0614138b5fc5d362ad50e32fcfd3de","target":"graph","created_at":"2026-07-05T10:31:41Z","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/2403.02971/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $(k, z)$-Clustering problem in Euclidean space $\\mathbb{R}^d$ has been extensively studied. Given the scale of data involved, compression methods for the Euclidean $(k, z)$-Clustering problem, such as data compression and dimension reduction, have received significant attention in the literature. However, the space complexity of the clustering problem, specifically, the number of bits required to compress the cost function within a multiplicative error $\\varepsilon$, remains unclear in existing literature. This paper initiates the study of space complexity for Euclidean $(k, z)$-Clustering","authors_text":"Lingxiao Huang, Xiaoyi Zhu, Yuxiang Tian, Zengfeng Huang","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-03-05T13:49:32Z","title":"Space Complexity of Euclidean Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02971","kind":"arxiv","version":3},"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:9965d1be9f8a68ee5a5b1500d233c69dc0a7e6f7943e9857802f9b73a27d0ea4","target":"record","created_at":"2026-07-05T10:31:41Z","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":"4324b405f9a910b610c070ccd8ac3cd54a25b9709f4d65eff7238a84fe6c52fb","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-03-05T13:49:32Z","title_canon_sha256":"27f01b88b4460c4599b4376ac69561948684b6764218f245db2a4fab93d187ae"},"schema_version":"1.0","source":{"id":"2403.02971","kind":"arxiv","version":3}},"canonical_sha256":"66f59c69b45c44dcb04f694d89c56c38f663d8823cad4995a979a00d44b6405b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66f59c69b45c44dcb04f694d89c56c38f663d8823cad4995a979a00d44b6405b","first_computed_at":"2026-07-05T10:31:41.844660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:31:41.844660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"paptnlaEsSAh5Pk98LAvvWQUe2wK1jjs4CrT9DZ6O1LvmXzc3HqYGJq7QUPE32EpMCNuq/n6fF0PKyT8o9PpDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:31:41.845205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02971","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9965d1be9f8a68ee5a5b1500d233c69dc0a7e6f7943e9857802f9b73a27d0ea4","sha256:e7f07571f5ce935dc2b11b1ba4d9376fbc0614138b5fc5d362ad50e32fcfd3de"],"state_sha256":"95a6816f7504b0b77f7cc953236ac8726184f0040827602f3be2ce6002c3890d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QCcx8mLasx5kYYF2pJj4Tz3ps/HDu9QQNKK9WDu0Kdp1r+Wqaew8jyvls0qboQ24U6yesMBnCQXvQodslOhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:04:18.808927Z","bundle_sha256":"dc4093b244c33b36c0524dd16a711e1d5fbf0c2c2cfa8fd8d5820be53782d757"}}