{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ESNSNHVGP2KKWDEDN3K6HORLTE","short_pith_number":"pith:ESNSNHVG","schema_version":"1.0","canonical_sha256":"249b269ea67e94ab0c836ed5e3ba2b991ad9599bd7eedcc5ef267aa36578459f","source":{"kind":"arxiv","id":"1109.1844","version":2},"attestation_state":"computed","paper":{"title":"Weighted Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Loker, Margareta Ackerman, Shai Ben-David, Simina Br\\^anzei","submitted_at":"2011-09-08T20:53:54Z","abstract_excerpt":"One of the most prominent challenges in clustering is \"the user's dilemma,\" which is the problem of selecting an appropriate clustering algorithm for a specific task. A formal approach for addressing this problem relies on the identification of succinct, user-friendly properties that formally capture when certain clustering methods are preferred over others.\n  Until now these properties focused on advantages of classical Linkage-Based algorithms, failing to identify when other clustering paradigms, such as popular center-based methods, are preferable. We present surprisingly simple new propert"},"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":"1109.1844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-08T20:53:54Z","cross_cats_sorted":[],"title_canon_sha256":"b9a8fda2b751f4fd57470397655d2ba182cdf619f4c2444abb122d6953a5a778","abstract_canon_sha256":"dcd6599c2a2b30c6a439d8e27f6873486e421311c248d327e9fb10bfa6914421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.689814Z","signature_b64":"FHAighbRl3osn9blPck41PsmMSxebPUk4IKVTF6LHPk0xEq+/eZ+cW3RceweRu9LIWC7s6g5ruJrDHPtAhb1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249b269ea67e94ab0c836ed5e3ba2b991ad9599bd7eedcc5ef267aa36578459f","last_reissued_at":"2026-05-18T01:03:24.689328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.689328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Loker, Margareta Ackerman, Shai Ben-David, Simina Br\\^anzei","submitted_at":"2011-09-08T20:53:54Z","abstract_excerpt":"One of the most prominent challenges in clustering is \"the user's dilemma,\" which is the problem of selecting an appropriate clustering algorithm for a specific task. A formal approach for addressing this problem relies on the identification of succinct, user-friendly properties that formally capture when certain clustering methods are preferred over others.\n  Until now these properties focused on advantages of classical Linkage-Based algorithms, failing to identify when other clustering paradigms, such as popular center-based methods, are preferable. We present surprisingly simple new propert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1844","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":""},"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":"1109.1844","created_at":"2026-05-18T01:03:24.689405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1844v2","created_at":"2026-05-18T01:03:24.689405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1844","created_at":"2026-05-18T01:03:24.689405+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESNSNHVGP2KK","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESNSNHVGP2KKWDED","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESNSNHVG","created_at":"2026-05-18T12:26:28.662955+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/ESNSNHVGP2KKWDEDN3K6HORLTE","json":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE.json","graph_json":"https://pith.science/api/pith-number/ESNSNHVGP2KKWDEDN3K6HORLTE/graph.json","events_json":"https://pith.science/api/pith-number/ESNSNHVGP2KKWDEDN3K6HORLTE/events.json","paper":"https://pith.science/paper/ESNSNHVG"},"agent_actions":{"view_html":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE","download_json":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE.json","view_paper":"https://pith.science/paper/ESNSNHVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1844&json=true","fetch_graph":"https://pith.science/api/pith-number/ESNSNHVGP2KKWDEDN3K6HORLTE/graph.json","fetch_events":"https://pith.science/api/pith-number/ESNSNHVGP2KKWDEDN3K6HORLTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE/action/storage_attestation","attest_author":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE/action/author_attestation","sign_citation":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE/action/citation_signature","submit_replication":"https://pith.science/pith/ESNSNHVGP2KKWDEDN3K6HORLTE/action/replication_record"}},"created_at":"2026-05-18T01:03:24.689405+00:00","updated_at":"2026-05-18T01:03:24.689405+00:00"}