{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ZX2UZR3O7X4DLGCI4JBQQUAZWF","short_pith_number":"pith:ZX2UZR3O","schema_version":"1.0","canonical_sha256":"cdf54cc76efdf8359848e243085019b16f916b900abbf40badffe6aacc2befc1","source":{"kind":"arxiv","id":"0910.1800","version":1},"attestation_state":"computed","paper":{"title":"Scaling Analysis of Affinity Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.AI","authors_text":"Cyril FURTLEHNER, Michele Sebag, Xiangliang Zhang","submitted_at":"2009-10-09T17:43:35Z","abstract_excerpt":"We analyze and exploit some scaling properties of the Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007). First we observe that a divide and conquer strategy, used on a large data set hierarchically reduces the complexity ${\\cal O}(N^2)$ to ${\\cal O}(N^{(h+2)/(h+1)})$, for a data-set of size $N$ and a depth $h$ of the hierarchical strategy. For a data-set embedded in a $d$-dimensional space, we show that this is obtained without notably damaging the precision except in dimension $d=2$. In fact, for $d$ larger than 2 the relative loss in precision scales like $N^{("},"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":"0910.1800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-09T17:43:35Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"6d031361f70671f1f4995a5686b0296c9fb80b69502c0c4556136add4bd06c2f","abstract_canon_sha256":"6dc4b8c9482c3f02877016fe87407f188c3abbffc4f3643d64f771d4e1aacc79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:57.363283Z","signature_b64":"IyxJnuNOoRziPs7Zx379EEFtwDk20rjQJXyMjgiInwDmlSX2hBV0YHv5ftmus3rbCPwK1o6MQkux27BnwI1ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf54cc76efdf8359848e243085019b16f916b900abbf40badffe6aacc2befc1","last_reissued_at":"2026-05-18T03:23:57.362617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:57.362617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Analysis of Affinity Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.AI","authors_text":"Cyril FURTLEHNER, Michele Sebag, Xiangliang Zhang","submitted_at":"2009-10-09T17:43:35Z","abstract_excerpt":"We analyze and exploit some scaling properties of the Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007). First we observe that a divide and conquer strategy, used on a large data set hierarchically reduces the complexity ${\\cal O}(N^2)$ to ${\\cal O}(N^{(h+2)/(h+1)})$, for a data-set of size $N$ and a depth $h$ of the hierarchical strategy. For a data-set embedded in a $d$-dimensional space, we show that this is obtained without notably damaging the precision except in dimension $d=2$. In fact, for $d$ larger than 2 the relative loss in precision scales like $N^{("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1800","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":"0910.1800","created_at":"2026-05-18T03:23:57.362730+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1800v1","created_at":"2026-05-18T03:23:57.362730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1800","created_at":"2026-05-18T03:23:57.362730+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZX2UZR3O7X4D","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZX2UZR3O7X4DLGCI","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZX2UZR3O","created_at":"2026-05-18T12:26:03.138858+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/ZX2UZR3O7X4DLGCI4JBQQUAZWF","json":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF.json","graph_json":"https://pith.science/api/pith-number/ZX2UZR3O7X4DLGCI4JBQQUAZWF/graph.json","events_json":"https://pith.science/api/pith-number/ZX2UZR3O7X4DLGCI4JBQQUAZWF/events.json","paper":"https://pith.science/paper/ZX2UZR3O"},"agent_actions":{"view_html":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF","download_json":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF.json","view_paper":"https://pith.science/paper/ZX2UZR3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1800&json=true","fetch_graph":"https://pith.science/api/pith-number/ZX2UZR3O7X4DLGCI4JBQQUAZWF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZX2UZR3O7X4DLGCI4JBQQUAZWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF/action/storage_attestation","attest_author":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF/action/author_attestation","sign_citation":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF/action/citation_signature","submit_replication":"https://pith.science/pith/ZX2UZR3O7X4DLGCI4JBQQUAZWF/action/replication_record"}},"created_at":"2026-05-18T03:23:57.362730+00:00","updated_at":"2026-05-18T03:23:57.362730+00:00"}