{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XI2PPOT7P4S5CYN3RLV7OKDP5C","short_pith_number":"pith:XI2PPOT7","canonical_record":{"source":{"id":"1807.05241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T18:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"f78737c7df18098e3cb37400ca924008fdb24ba762ec1aab4154c22bbf06c742","abstract_canon_sha256":"a9280c4101e6b80e998566aebe7e184e7784dc30c0ab264f13b2230a7b5d0a91"},"schema_version":"1.0"},"canonical_sha256":"ba34f7ba7f7f25d161bb8aebf7286fe8ad3366c7d595c39aae2d8fd837469af6","source":{"kind":"arxiv","id":"1807.05241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05241","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05241v1","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05241","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"XI2PPOT7P4S5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XI2PPOT7P4S5CYN3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XI2PPOT7","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XI2PPOT7P4S5CYN3RLV7OKDP5C","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T18:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"f78737c7df18098e3cb37400ca924008fdb24ba762ec1aab4154c22bbf06c742","abstract_canon_sha256":"a9280c4101e6b80e998566aebe7e184e7784dc30c0ab264f13b2230a7b5d0a91"},"schema_version":"1.0"},"canonical_sha256":"ba34f7ba7f7f25d161bb8aebf7286fe8ad3366c7d595c39aae2d8fd837469af6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.037768Z","signature_b64":"BSO4tA604RW3WzQz8F4nE70Tww/GNudjCLvPDmqP/wJRQ8rCJvCKl91HwYBeHc2LdDk14RNgIboyOm9Hk26/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba34f7ba7f7f25d161bb8aebf7286fe8ad3366c7d595c39aae2d8fd837469af6","last_reissued_at":"2026-05-18T00:10:44.037296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.037296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05241","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:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykQKrJEO5/VrZZZQIGga9ZtF7zFCSZBjy76o3hIMVnZkOYp16WBsi8ciMKyicQkDlucbz4+xmrO66EibXiONDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:12:41.721042Z"},"content_sha256":"c44315f779e341ce75d428ed7b1a5d624d9bbfbbf3aa42eb8a598c9a770484fb","schema_version":"1.0","event_id":"sha256:c44315f779e341ce75d428ed7b1a5d624d9bbfbbf3aa42eb8a598c9a770484fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XI2PPOT7P4S5CYN3RLV7OKDP5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Clustering via Weighted Impurity Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduardo Laber, Ferdinando Cicalese","submitted_at":"2018-07-13T18:14:11Z","abstract_excerpt":"An impurity measures $I:{R}^k \\to {R}^+$ maps a $k$-dimensional vector ${\\bf v}$ to a non-negative value $I({\\bf v})$ so that the more homogeneous ${\\bf v}$, the larger its impurity. We study clustering based on impurity measures: given a collection $V$ of $n$ many $k$-dimensional vectors and an impurity measure $I$, the goal is to find a partition ${\\cal P}$ of $V$ into $L$ groups $V_1,\\ldots,V_L$ that minimizes the total impurities of the groups in ${\\cal P}$, i.e., $I({\\cal P})= \\sum_{m=1}^{L} I(\\sum_{{\\bf v} \\in V_m}{\\bf v}).$\n  Impurity minimization is widely used as quality assessment me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05241","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:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFlskCipAjAFAQ4BMki95Uons9j9mdeGc+SjlJ4BFLDINA4JNLANTt4FtXXfjB7IAmUq2mejKHnMXt4uyWLKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:12:41.721410Z"},"content_sha256":"243111d74f0bb73e561b5f84a7116d638fa9872b00c0d2cd3c5373548853833a","schema_version":"1.0","event_id":"sha256:243111d74f0bb73e561b5f84a7116d638fa9872b00c0d2cd3c5373548853833a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C/bundle.json","state_url":"https://pith.science/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C/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-03T01:12:41Z","links":{"resolver":"https://pith.science/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C","bundle":"https://pith.science/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C/bundle.json","state":"https://pith.science/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XI2PPOT7P4S5CYN3RLV7OKDP5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XI2PPOT7P4S5CYN3RLV7OKDP5C","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":"a9280c4101e6b80e998566aebe7e184e7784dc30c0ab264f13b2230a7b5d0a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T18:14:11Z","title_canon_sha256":"f78737c7df18098e3cb37400ca924008fdb24ba762ec1aab4154c22bbf06c742"},"schema_version":"1.0","source":{"id":"1807.05241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05241","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05241v1","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05241","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"XI2PPOT7P4S5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XI2PPOT7P4S5CYN3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XI2PPOT7","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:243111d74f0bb73e561b5f84a7116d638fa9872b00c0d2cd3c5373548853833a","target":"graph","created_at":"2026-05-18T00:10:44Z","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":"An impurity measures $I:{R}^k \\to {R}^+$ maps a $k$-dimensional vector ${\\bf v}$ to a non-negative value $I({\\bf v})$ so that the more homogeneous ${\\bf v}$, the larger its impurity. We study clustering based on impurity measures: given a collection $V$ of $n$ many $k$-dimensional vectors and an impurity measure $I$, the goal is to find a partition ${\\cal P}$ of $V$ into $L$ groups $V_1,\\ldots,V_L$ that minimizes the total impurities of the groups in ${\\cal P}$, i.e., $I({\\cal P})= \\sum_{m=1}^{L} I(\\sum_{{\\bf v} \\in V_m}{\\bf v}).$\n  Impurity minimization is widely used as quality assessment me","authors_text":"Eduardo Laber, Ferdinando Cicalese","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T18:14:11Z","title":"Approximation Algorithms for Clustering via Weighted Impurity Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05241","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:c44315f779e341ce75d428ed7b1a5d624d9bbfbbf3aa42eb8a598c9a770484fb","target":"record","created_at":"2026-05-18T00:10:44Z","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":"a9280c4101e6b80e998566aebe7e184e7784dc30c0ab264f13b2230a7b5d0a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T18:14:11Z","title_canon_sha256":"f78737c7df18098e3cb37400ca924008fdb24ba762ec1aab4154c22bbf06c742"},"schema_version":"1.0","source":{"id":"1807.05241","kind":"arxiv","version":1}},"canonical_sha256":"ba34f7ba7f7f25d161bb8aebf7286fe8ad3366c7d595c39aae2d8fd837469af6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba34f7ba7f7f25d161bb8aebf7286fe8ad3366c7d595c39aae2d8fd837469af6","first_computed_at":"2026-05-18T00:10:44.037296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.037296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSO4tA604RW3WzQz8F4nE70Tww/GNudjCLvPDmqP/wJRQ8rCJvCKl91HwYBeHc2LdDk14RNgIboyOm9Hk26/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.037768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c44315f779e341ce75d428ed7b1a5d624d9bbfbbf3aa42eb8a598c9a770484fb","sha256:243111d74f0bb73e561b5f84a7116d638fa9872b00c0d2cd3c5373548853833a"],"state_sha256":"7b124c89bfd6eb8ceef2e1f4ff4be3bd6830820ddaf0f11b6263901dfda9086b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZ1YvlYESt25aCBUX3wlDBTZ+S4MdhbarIYnd7LFkZ65aZEKOVHAJ0h19O/rGIBoWiOWgE7FThEGJgngiJaaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:12:41.723377Z","bundle_sha256":"9f23d8a658930c553783fb714732badf47f27960e385f1bf47a39c49058ac7a6"}}