{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6NHCMG4YNXDSYI33FHQ25VUPF7","short_pith_number":"pith:6NHCMG4Y","schema_version":"1.0","canonical_sha256":"f34e261b986dc72c237b29e1aed68f2fe762bf6266bee6b8f0e5885d65dc4300","source":{"kind":"arxiv","id":"1108.0017","version":1},"attestation_state":"computed","paper":{"title":"Generating a Diverse Set of High-Quality Clusterings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Jeff M. Phillips, Parasaran Raman, Suresh Venkatasubramanian","submitted_at":"2011-07-29T21:07:51Z","abstract_excerpt":"We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating many high-quality partitions, and then grouping these partitions to obtain k representatives. The decomposition makes the approach extremely modular and allows us to optimize various criteria that control the choice of representative partitions."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.0017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-29T21:07:51Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"703eaea06211335589e36514b646e8c85a373658874d9ba7deb12db92edbb361","abstract_canon_sha256":"90ece24ebcbc52aaa96e2413c1e723a0b96b119f5cdbbc39bfb36ed1bb59818f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:31.818162Z","signature_b64":"j1crqI7b4iCdcZvigWjZpoNpidpF04kjNQhCpQQoTOWdJXn+qBJ+wW5+c4Ed63hSplgnrUR8BXms6CUUj3/2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f34e261b986dc72c237b29e1aed68f2fe762bf6266bee6b8f0e5885d65dc4300","last_reissued_at":"2026-05-18T04:16:31.817748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:31.817748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating a Diverse Set of High-Quality Clusterings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Jeff M. Phillips, Parasaran Raman, Suresh Venkatasubramanian","submitted_at":"2011-07-29T21:07:51Z","abstract_excerpt":"We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating many high-quality partitions, and then grouping these partitions to obtain k representatives. The decomposition makes the approach extremely modular and allows us to optimize various criteria that control the choice of representative partitions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0017","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.0017","created_at":"2026-05-18T04:16:31.817805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0017v1","created_at":"2026-05-18T04:16:31.817805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0017","created_at":"2026-05-18T04:16:31.817805+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NHCMG4YNXDS","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NHCMG4YNXDSYI33","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NHCMG4Y","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7","json":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7.json","graph_json":"https://pith.science/api/pith-number/6NHCMG4YNXDSYI33FHQ25VUPF7/graph.json","events_json":"https://pith.science/api/pith-number/6NHCMG4YNXDSYI33FHQ25VUPF7/events.json","paper":"https://pith.science/paper/6NHCMG4Y"},"agent_actions":{"view_html":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7","download_json":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7.json","view_paper":"https://pith.science/paper/6NHCMG4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0017&json=true","fetch_graph":"https://pith.science/api/pith-number/6NHCMG4YNXDSYI33FHQ25VUPF7/graph.json","fetch_events":"https://pith.science/api/pith-number/6NHCMG4YNXDSYI33FHQ25VUPF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7/action/storage_attestation","attest_author":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7/action/author_attestation","sign_citation":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7/action/citation_signature","submit_replication":"https://pith.science/pith/6NHCMG4YNXDSYI33FHQ25VUPF7/action/replication_record"}},"created_at":"2026-05-18T04:16:31.817805+00:00","updated_at":"2026-05-18T04:16:31.817805+00:00"}