{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SZODTX3NKXS3PWNCSUMT7MI7OH","short_pith_number":"pith:SZODTX3N","schema_version":"1.0","canonical_sha256":"965c39df6d55e5b7d9a295193fb11f71d8817df11370344ec6ca7ff077ad9b01","source":{"kind":"arxiv","id":"1406.2602","version":1},"attestation_state":"computed","paper":{"title":"Graph Approximation and Clustering on a Budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ethan Fetaya, Ohad Shamir, Shimon Ullman","submitted_at":"2014-06-10T15:49:05Z","abstract_excerpt":"We consider the problem of learning from a similarity matrix (such as spectral clustering and lowd imensional embedding), when computing pairwise similarities are costly, and only a limited number of entries can be observed. We provide a theoretical analysis using standard notions of graph approximation, significantly generalizing previous results (which focused on spectral clustering with two clusters). We also propose a new algorithmic approach based on adaptive sampling, which experimentally matches or improves on previous methods, while being considerably more general and computationally c"},"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":"1406.2602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-10T15:49:05Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"title_canon_sha256":"81b7d98cd7c4c35e2a91c69f7ebd2d94703df2b8c4cb4380421045d8d79755f1","abstract_canon_sha256":"1cbedf5bb85bb4c89febe44d7f6dac0ebb84685cc4b72e1017b181f13b65fa52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.368450Z","signature_b64":"oKsyQc13kKdZo5lT4jqBcFlNs5zNY4jdLa71bDkcAXohp4+WUWQvjQTyQm/2/IPDWLQpBhDfELcrUibFHk29Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"965c39df6d55e5b7d9a295193fb11f71d8817df11370344ec6ca7ff077ad9b01","last_reissued_at":"2026-05-18T02:50:01.367963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.367963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Approximation and Clustering on a Budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ethan Fetaya, Ohad Shamir, Shimon Ullman","submitted_at":"2014-06-10T15:49:05Z","abstract_excerpt":"We consider the problem of learning from a similarity matrix (such as spectral clustering and lowd imensional embedding), when computing pairwise similarities are costly, and only a limited number of entries can be observed. We provide a theoretical analysis using standard notions of graph approximation, significantly generalizing previous results (which focused on spectral clustering with two clusters). We also propose a new algorithmic approach based on adaptive sampling, which experimentally matches or improves on previous methods, while being considerably more general and computationally c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2602","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":"1406.2602","created_at":"2026-05-18T02:50:01.368030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2602v1","created_at":"2026-05-18T02:50:01.368030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2602","created_at":"2026-05-18T02:50:01.368030+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZODTX3NKXS3","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZODTX3NKXS3PWNC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZODTX3N","created_at":"2026-05-18T12:28:49.207871+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/SZODTX3NKXS3PWNCSUMT7MI7OH","json":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH.json","graph_json":"https://pith.science/api/pith-number/SZODTX3NKXS3PWNCSUMT7MI7OH/graph.json","events_json":"https://pith.science/api/pith-number/SZODTX3NKXS3PWNCSUMT7MI7OH/events.json","paper":"https://pith.science/paper/SZODTX3N"},"agent_actions":{"view_html":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH","download_json":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH.json","view_paper":"https://pith.science/paper/SZODTX3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2602&json=true","fetch_graph":"https://pith.science/api/pith-number/SZODTX3NKXS3PWNCSUMT7MI7OH/graph.json","fetch_events":"https://pith.science/api/pith-number/SZODTX3NKXS3PWNCSUMT7MI7OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH/action/storage_attestation","attest_author":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH/action/author_attestation","sign_citation":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH/action/citation_signature","submit_replication":"https://pith.science/pith/SZODTX3NKXS3PWNCSUMT7MI7OH/action/replication_record"}},"created_at":"2026-05-18T02:50:01.368030+00:00","updated_at":"2026-05-18T02:50:01.368030+00:00"}