{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OQVW4AJDRA7EH7ZU74RKQWFMND","short_pith_number":"pith:OQVW4AJD","schema_version":"1.0","canonical_sha256":"742b6e0123883e43ff34ff22a858ac68d4fdf07708c643d25000fd6f80fc8515","source":{"kind":"arxiv","id":"1201.6462","version":1},"attestation_state":"computed","paper":{"title":"Active Learning of Custering with Side Information Using $\\eps$-Smooth Relative Regret Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nir Ailon, Ron Begleiter","submitted_at":"2012-01-31T07:46:08Z","abstract_excerpt":"Clustering is considered a non-supervised learning setting, in which the goal is to partition a collection of data points into disjoint clusters. Often a bound $k$ on the number of clusters is given or assumed by the practitioner. Many versions of this problem have been defined, most notably $k$-means and $k$-median.\n  An underlying problem with the unsupervised nature of clustering it that of determining a similarity function. One approach for alleviating this difficulty is known as clustering with side information, alternatively, semi-supervised clustering. Here, the practitioner incorporate"},"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":"1201.6462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-31T07:46:08Z","cross_cats_sorted":[],"title_canon_sha256":"bebcdeeb76499aebb915e1101f9066900ecd8da539e0d0852ac8387d0207e2ae","abstract_canon_sha256":"cd9179b967c17988db39909a0b8c4fc75fe961f52cd9dbf68ff05ea66571158f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:31.446571Z","signature_b64":"bZEixUG8CJA4AF8AVTVHWDmUyeyOkHBYME3chPaokQbYleuRIFdtNW7DaHSFh9CcCkm39vIgOaOIurJZLvSQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"742b6e0123883e43ff34ff22a858ac68d4fdf07708c643d25000fd6f80fc8515","last_reissued_at":"2026-05-18T04:03:31.445830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:31.445830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Learning of Custering with Side Information Using $\\eps$-Smooth Relative Regret Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nir Ailon, Ron Begleiter","submitted_at":"2012-01-31T07:46:08Z","abstract_excerpt":"Clustering is considered a non-supervised learning setting, in which the goal is to partition a collection of data points into disjoint clusters. Often a bound $k$ on the number of clusters is given or assumed by the practitioner. Many versions of this problem have been defined, most notably $k$-means and $k$-median.\n  An underlying problem with the unsupervised nature of clustering it that of determining a similarity function. One approach for alleviating this difficulty is known as clustering with side information, alternatively, semi-supervised clustering. Here, the practitioner incorporate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6462","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":"1201.6462","created_at":"2026-05-18T04:03:31.445942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6462v1","created_at":"2026-05-18T04:03:31.445942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6462","created_at":"2026-05-18T04:03:31.445942+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQVW4AJDRA7E","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQVW4AJDRA7EH7ZU","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQVW4AJD","created_at":"2026-05-18T12:27:16.716162+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/OQVW4AJDRA7EH7ZU74RKQWFMND","json":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND.json","graph_json":"https://pith.science/api/pith-number/OQVW4AJDRA7EH7ZU74RKQWFMND/graph.json","events_json":"https://pith.science/api/pith-number/OQVW4AJDRA7EH7ZU74RKQWFMND/events.json","paper":"https://pith.science/paper/OQVW4AJD"},"agent_actions":{"view_html":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND","download_json":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND.json","view_paper":"https://pith.science/paper/OQVW4AJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6462&json=true","fetch_graph":"https://pith.science/api/pith-number/OQVW4AJDRA7EH7ZU74RKQWFMND/graph.json","fetch_events":"https://pith.science/api/pith-number/OQVW4AJDRA7EH7ZU74RKQWFMND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/action/storage_attestation","attest_author":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/action/author_attestation","sign_citation":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/action/citation_signature","submit_replication":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/action/replication_record"}},"created_at":"2026-05-18T04:03:31.445942+00:00","updated_at":"2026-05-18T04:03:31.445942+00:00"}