{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ZX2UZR3O7X4DLGCI4JBQQUAZWF","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":"6dc4b8c9482c3f02877016fe87407f188c3abbffc4f3643d64f771d4e1aacc79","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-09T17:43:35Z","title_canon_sha256":"6d031361f70671f1f4995a5686b0296c9fb80b69502c0c4556136add4bd06c2f"},"schema_version":"1.0","source":{"id":"0910.1800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.1800","created_at":"2026-05-18T03:23:57Z"},{"alias_kind":"arxiv_version","alias_value":"0910.1800v1","created_at":"2026-05-18T03:23:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1800","created_at":"2026-05-18T03:23:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZX2UZR3O7X4D","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"ZX2UZR3O7X4DLGCI","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"ZX2UZR3O","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:7d7c0b4bf0f840afcb726adb0045a9b307fa09c61645a2fbf5fb7af7e8a21b0b","target":"graph","created_at":"2026-05-18T03:23:57Z","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":"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^{(","authors_text":"Cyril FURTLEHNER, Michele Sebag, Xiangliang Zhang","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-09T17:43:35Z","title":"Scaling Analysis of Affinity Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1800","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:cdc500a140036d2ee4f0cfebfdfaf92a1b5cd9fd687ffd3a1907a723fe0c3074","target":"record","created_at":"2026-05-18T03:23:57Z","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":"6dc4b8c9482c3f02877016fe87407f188c3abbffc4f3643d64f771d4e1aacc79","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2009-10-09T17:43:35Z","title_canon_sha256":"6d031361f70671f1f4995a5686b0296c9fb80b69502c0c4556136add4bd06c2f"},"schema_version":"1.0","source":{"id":"0910.1800","kind":"arxiv","version":1}},"canonical_sha256":"cdf54cc76efdf8359848e243085019b16f916b900abbf40badffe6aacc2befc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdf54cc76efdf8359848e243085019b16f916b900abbf40badffe6aacc2befc1","first_computed_at":"2026-05-18T03:23:57.362617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:23:57.362617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IyxJnuNOoRziPs7Zx379EEFtwDk20rjQJXyMjgiInwDmlSX2hBV0YHv5ftmus3rbCPwK1o6MQkux27BnwI1ZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:23:57.363283Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.1800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdc500a140036d2ee4f0cfebfdfaf92a1b5cd9fd687ffd3a1907a723fe0c3074","sha256:7d7c0b4bf0f840afcb726adb0045a9b307fa09c61645a2fbf5fb7af7e8a21b0b"],"state_sha256":"21a5c287a0fbe9ec69d0a482126b73a59ee584066ff4eb823885b305963186bc"}