{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GKG2JCDXUUBA6RUE26DXLRNQHG","short_pith_number":"pith:GKG2JCDX","schema_version":"1.0","canonical_sha256":"328da48877a5020f4684d78775c5b039a2e081833be23953f4ee2ee91692675d","source":{"kind":"arxiv","id":"1202.5598","version":4},"attestation_state":"computed","paper":{"title":"Clustering using Max-norm Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Nathan Srebro","submitted_at":"2012-02-25T02:10:20Z","abstract_excerpt":"We suggest using the max-norm as a convex surrogate constraint for clustering. We show how this yields a better exact cluster recovery guarantee than previously suggested nuclear-norm relaxation, and study the effectiveness of our method, and other related convex relaxations, compared to other clustering approaches."},"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":"1202.5598","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-25T02:10:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3fa33c94bb270924835a871d7a4aa4ace4da6079e5d01937a21b1ae129f7c462","abstract_canon_sha256":"f59fa267e05985359c5fcb80fa46ee229838c3b2ca2448b375bdecf51cf23b7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:02.847200Z","signature_b64":"+F4eTsexZilgT9T/Ck091eV64puMqi/ephw4MG3jZYooeuuqus+x7cSqOICB0QWpHZGuvHYL9GO3rSLPHEvnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"328da48877a5020f4684d78775c5b039a2e081833be23953f4ee2ee91692675d","last_reissued_at":"2026-05-18T03:58:02.846760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:02.846760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering using Max-norm Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Nathan Srebro","submitted_at":"2012-02-25T02:10:20Z","abstract_excerpt":"We suggest using the max-norm as a convex surrogate constraint for clustering. We show how this yields a better exact cluster recovery guarantee than previously suggested nuclear-norm relaxation, and study the effectiveness of our method, and other related convex relaxations, compared to other clustering approaches."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5598","kind":"arxiv","version":4},"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":"1202.5598","created_at":"2026-05-18T03:58:02.846823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5598v4","created_at":"2026-05-18T03:58:02.846823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5598","created_at":"2026-05-18T03:58:02.846823+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKG2JCDXUUBA","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKG2JCDXUUBA6RUE","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKG2JCDX","created_at":"2026-05-18T12:27:06.952714+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/GKG2JCDXUUBA6RUE26DXLRNQHG","json":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG.json","graph_json":"https://pith.science/api/pith-number/GKG2JCDXUUBA6RUE26DXLRNQHG/graph.json","events_json":"https://pith.science/api/pith-number/GKG2JCDXUUBA6RUE26DXLRNQHG/events.json","paper":"https://pith.science/paper/GKG2JCDX"},"agent_actions":{"view_html":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG","download_json":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG.json","view_paper":"https://pith.science/paper/GKG2JCDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5598&json=true","fetch_graph":"https://pith.science/api/pith-number/GKG2JCDXUUBA6RUE26DXLRNQHG/graph.json","fetch_events":"https://pith.science/api/pith-number/GKG2JCDXUUBA6RUE26DXLRNQHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG/action/storage_attestation","attest_author":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG/action/author_attestation","sign_citation":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG/action/citation_signature","submit_replication":"https://pith.science/pith/GKG2JCDXUUBA6RUE26DXLRNQHG/action/replication_record"}},"created_at":"2026-05-18T03:58:02.846823+00:00","updated_at":"2026-05-18T03:58:02.846823+00:00"}