{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OQVW4AJDRA7EH7ZU74RKQWFMND","short_pith_number":"pith:OQVW4AJD","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"},"canonical_sha256":"742b6e0123883e43ff34ff22a858ac68d4fdf07708c643d25000fd6f80fc8515","source":{"kind":"arxiv","id":"1201.6462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6462","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6462v1","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6462","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"OQVW4AJDRA7E","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OQVW4AJDRA7EH7ZU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OQVW4AJD","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OQVW4AJDRA7EH7ZU74RKQWFMND","target":"record","payload":{"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"},"canonical_sha256":"742b6e0123883e43ff34ff22a858ac68d4fdf07708c643d25000fd6f80fc8515","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"},"source_kind":"arxiv","source_id":"1201.6462","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-18T04:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJ9RPDbiwv5uxYgHUQErMAmGuiOV2oKGURdNWEXyEjJXsnGW2dox1uvhG20we2KCpHmquYw33UEcX8ImjHZ2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:54:10.322077Z"},"content_sha256":"3acccab75e808da7900df047039ae3401254e095da4587b417e02bd566efb286","schema_version":"1.0","event_id":"sha256:3acccab75e808da7900df047039ae3401254e095da4587b417e02bd566efb286"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OQVW4AJDRA7EH7ZU74RKQWFMND","target":"graph","payload":{"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"},"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-18T04:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTfT2D2+tfY+e/xEE9eAmX1ZQy8kGeaox0UrTYBMZB1f87DzHPwQkstrLsCEAU8nhrrZIb/xlsxEu5apwMBPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:54:10.322442Z"},"content_sha256":"ed516bf1d5e5d93e80ab068bd971e2d54b875778c2b79b02c1af3a226b4af9a6","schema_version":"1.0","event_id":"sha256:ed516bf1d5e5d93e80ab068bd971e2d54b875778c2b79b02c1af3a226b4af9a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/bundle.json","state_url":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/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-02T04:54:10Z","links":{"resolver":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND","bundle":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/bundle.json","state":"https://pith.science/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQVW4AJDRA7EH7ZU74RKQWFMND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OQVW4AJDRA7EH7ZU74RKQWFMND","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":"cd9179b967c17988db39909a0b8c4fc75fe961f52cd9dbf68ff05ea66571158f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-31T07:46:08Z","title_canon_sha256":"bebcdeeb76499aebb915e1101f9066900ecd8da539e0d0852ac8387d0207e2ae"},"schema_version":"1.0","source":{"id":"1201.6462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6462","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6462v1","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6462","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"OQVW4AJDRA7E","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OQVW4AJDRA7EH7ZU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OQVW4AJD","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ed516bf1d5e5d93e80ab068bd971e2d54b875778c2b79b02c1af3a226b4af9a6","target":"graph","created_at":"2026-05-18T04:03:31Z","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":"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","authors_text":"Nir Ailon, Ron Begleiter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-31T07:46:08Z","title":"Active Learning of Custering with Side Information Using $\\eps$-Smooth Relative Regret Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6462","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:3acccab75e808da7900df047039ae3401254e095da4587b417e02bd566efb286","target":"record","created_at":"2026-05-18T04:03:31Z","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":"cd9179b967c17988db39909a0b8c4fc75fe961f52cd9dbf68ff05ea66571158f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-01-31T07:46:08Z","title_canon_sha256":"bebcdeeb76499aebb915e1101f9066900ecd8da539e0d0852ac8387d0207e2ae"},"schema_version":"1.0","source":{"id":"1201.6462","kind":"arxiv","version":1}},"canonical_sha256":"742b6e0123883e43ff34ff22a858ac68d4fdf07708c643d25000fd6f80fc8515","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"742b6e0123883e43ff34ff22a858ac68d4fdf07708c643d25000fd6f80fc8515","first_computed_at":"2026-05-18T04:03:31.445830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:31.445830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bZEixUG8CJA4AF8AVTVHWDmUyeyOkHBYME3chPaokQbYleuRIFdtNW7DaHSFh9CcCkm39vIgOaOIurJZLvSQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:31.446571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3acccab75e808da7900df047039ae3401254e095da4587b417e02bd566efb286","sha256:ed516bf1d5e5d93e80ab068bd971e2d54b875778c2b79b02c1af3a226b4af9a6"],"state_sha256":"85eedd839bbf6f92963dc5fe43d46c7fc70de93dd5f2ab1c23203da47669dc94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXBrDgQPYhRNuG/1mZI610aDqN2hq0TYN2R9ifhbRqrM8OllHLhQFIhe6ur8RlTKJjWeyKec/ZKCSDaQXkbtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:54:10.324484Z","bundle_sha256":"a69494a4cdf1dcc1b6cfa203dc0995de9b660ec953949cb72eed46cd523ecdf2"}}