{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U3B467NL6O7BRTP6AU4YC6CQPX","short_pith_number":"pith:U3B467NL","canonical_record":{"source":{"id":"1808.04062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T04:35:04Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"9d8d091de4cc229ad159515ddead31ed2b6553bccb43470f4ac37df647f38c22","abstract_canon_sha256":"c08e10cedda6c1eef35c39de4f89090772c60891695613327e5e2632b81b1c8f"},"schema_version":"1.0"},"canonical_sha256":"a6c3cf7dabf3be18cdfe05398178507dc529ffeeee7151c13c7309d4d873f330","source":{"kind":"arxiv","id":"1808.04062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04062","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04062v1","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04062","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"U3B467NL6O7B","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U3B467NL6O7BRTP6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U3B467NL","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U3B467NL6O7BRTP6AU4YC6CQPX","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T04:35:04Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"9d8d091de4cc229ad159515ddead31ed2b6553bccb43470f4ac37df647f38c22","abstract_canon_sha256":"c08e10cedda6c1eef35c39de4f89090772c60891695613327e5e2632b81b1c8f"},"schema_version":"1.0"},"canonical_sha256":"a6c3cf7dabf3be18cdfe05398178507dc529ffeeee7151c13c7309d4d873f330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:18.964559Z","signature_b64":"pbs0Z7yzEcAGvYmVW972WHruj1wulehgPt3PL9Xgpf9x/jcJEJTmLEwJOLJmSrjxaCDUNu3Xzn+k7A6KK0YmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6c3cf7dabf3be18cdfe05398178507dc529ffeeee7151c13c7309d4d873f330","last_reissued_at":"2026-05-18T00:08:18.964046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:18.964046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04062","source_version":1,"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-05-18T00:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvBOq1JCBuqP54Pnm2QbrVQcl7i3PimRx1wnWrLB10lc57Lh6HS8zLumxzmj5xKMFu2DBjeNe5AZU/+Bz1bOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:21:10.243193Z"},"content_sha256":"e5fed729d90d5a47d914dd37beaf2062069ce06b3222ea4f0aa2b49c776ac6a6","schema_version":"1.0","event_id":"sha256:e5fed729d90d5a47d914dd37beaf2062069ce06b3222ea4f0aa2b49c776ac6a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U3B467NL6O7BRTP6AU4YC6CQPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding Up Constrained $k$-Means Through 2-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Bin Fu, Qilong Feng","submitted_at":"2018-08-13T04:35:04Z","abstract_excerpt":"For the constrained 2-means problem, we present a $O\\left(dn+d({1\\over\\epsilon})^{O({1\\over \\epsilon})}\\log n\\right)$ time algorithm. It generates a collection $U$ of approximate center pairs $(c_1, c_2)$ such that one of pairs in $U$ can induce a $(1+\\epsilon)$-approximation for the problem. The existing approximation scheme for the constrained 2-means problem takes $O(({1\\over\\epsilon})^{O({1\\over \\epsilon})}dn)$ time, and the existing approximation scheme for the constrained $k$-means problem takes $O(({k\\over\\epsilon})^{O({k\\over \\epsilon})}dn)$ time. Using the method developed in this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04062","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":""},"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-05-18T00:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Um3RMFNMr98W22oqCZV0d1QbLBAKqwCuHolggJad13aktUKnuIFnVLVpeMjyQnO+1rvhp6+nIV6ALr8khlXIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:21:10.243897Z"},"content_sha256":"03151015eae9337a592e36806c0bb11f891f4d8c1a7ccb8acad923a2cdba5b91","schema_version":"1.0","event_id":"sha256:03151015eae9337a592e36806c0bb11f891f4d8c1a7ccb8acad923a2cdba5b91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3B467NL6O7BRTP6AU4YC6CQPX/bundle.json","state_url":"https://pith.science/pith/U3B467NL6O7BRTP6AU4YC6CQPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3B467NL6O7BRTP6AU4YC6CQPX/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-06-08T01:21:10Z","links":{"resolver":"https://pith.science/pith/U3B467NL6O7BRTP6AU4YC6CQPX","bundle":"https://pith.science/pith/U3B467NL6O7BRTP6AU4YC6CQPX/bundle.json","state":"https://pith.science/pith/U3B467NL6O7BRTP6AU4YC6CQPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3B467NL6O7BRTP6AU4YC6CQPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U3B467NL6O7BRTP6AU4YC6CQPX","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":"c08e10cedda6c1eef35c39de4f89090772c60891695613327e5e2632b81b1c8f","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T04:35:04Z","title_canon_sha256":"9d8d091de4cc229ad159515ddead31ed2b6553bccb43470f4ac37df647f38c22"},"schema_version":"1.0","source":{"id":"1808.04062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04062","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04062v1","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04062","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"U3B467NL6O7B","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U3B467NL6O7BRTP6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U3B467NL","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:03151015eae9337a592e36806c0bb11f891f4d8c1a7ccb8acad923a2cdba5b91","target":"graph","created_at":"2026-05-18T00:08:18Z","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"},"paper":{"abstract_excerpt":"For the constrained 2-means problem, we present a $O\\left(dn+d({1\\over\\epsilon})^{O({1\\over \\epsilon})}\\log n\\right)$ time algorithm. It generates a collection $U$ of approximate center pairs $(c_1, c_2)$ such that one of pairs in $U$ can induce a $(1+\\epsilon)$-approximation for the problem. The existing approximation scheme for the constrained 2-means problem takes $O(({1\\over\\epsilon})^{O({1\\over \\epsilon})}dn)$ time, and the existing approximation scheme for the constrained $k$-means problem takes $O(({k\\over\\epsilon})^{O({k\\over \\epsilon})}dn)$ time. Using the method developed in this pap","authors_text":"Bin Fu, Qilong Feng","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T04:35:04Z","title":"Speeding Up Constrained $k$-Means Through 2-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04062","kind":"arxiv","version":1},"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:e5fed729d90d5a47d914dd37beaf2062069ce06b3222ea4f0aa2b49c776ac6a6","target":"record","created_at":"2026-05-18T00:08:18Z","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":"c08e10cedda6c1eef35c39de4f89090772c60891695613327e5e2632b81b1c8f","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-13T04:35:04Z","title_canon_sha256":"9d8d091de4cc229ad159515ddead31ed2b6553bccb43470f4ac37df647f38c22"},"schema_version":"1.0","source":{"id":"1808.04062","kind":"arxiv","version":1}},"canonical_sha256":"a6c3cf7dabf3be18cdfe05398178507dc529ffeeee7151c13c7309d4d873f330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6c3cf7dabf3be18cdfe05398178507dc529ffeeee7151c13c7309d4d873f330","first_computed_at":"2026-05-18T00:08:18.964046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:18.964046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pbs0Z7yzEcAGvYmVW972WHruj1wulehgPt3PL9Xgpf9x/jcJEJTmLEwJOLJmSrjxaCDUNu3Xzn+k7A6KK0YmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:18.964559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5fed729d90d5a47d914dd37beaf2062069ce06b3222ea4f0aa2b49c776ac6a6","sha256:03151015eae9337a592e36806c0bb11f891f4d8c1a7ccb8acad923a2cdba5b91"],"state_sha256":"52f8c04757759e65fcb05c3b9c410fdb4b8e47ab62c4e797ad18713612ee33ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWii4/bISydzmsehP9z3HWdQ5EYsDiub96nzGVCCH7pYhE9ztDZEOAezVTVz61v9QUxNzWzKx34b4k1ENZhuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:21:10.247850Z","bundle_sha256":"c095f535617930e6707b86759ec8651892a3c532bf9e5c23bfa1faa015972d0b"}}