{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3G55JDERLMUNWOWTOF62KWNJ52","short_pith_number":"pith:3G55JDER","schema_version":"1.0","canonical_sha256":"d9bbd48c915b28db3ad3717da559a9ee8c62a58dc56ea41c6346d4baac7f166a","source":{"kind":"arxiv","id":"1310.1034","version":1},"attestation_state":"computed","paper":{"title":"Computing Exact Clustering Posteriors with Subset Convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Jukka Corander, Jukka Kohonen","submitted_at":"2013-10-03T17:01:34Z","abstract_excerpt":"An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters, and pairwise co-occurrence. The method is based on subset convolution, and yields the posterior distribution for the number of clusters in O(n * 3^n) operations, or O(n^3 * 2^n) using fast subset convolution. Pairwise co-occurrence probabilities are then obtained in O(n^3 * 2^n) operations. This is considerably faster than exhaustive enumeration of all partitions."},"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":"1310.1034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-10-03T17:01:34Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"22ec8b7aa87f0bbfc4043448cfd788e3cce05e289cd09108cc6ebfad81c5f56f","abstract_canon_sha256":"5f20f740f30f3642b13e98bec4860a4196521ff49491e21fd94e5e87d384a255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:24.689554Z","signature_b64":"bYQ0Bb54lYOBoqrj+1klIbjkVD+1ky/OuWh/vlkUYvo7d7RQ2rTgBEhkUn1v6gah4lOgY6VggLnN3nHsjcs3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bbd48c915b28db3ad3717da559a9ee8c62a58dc56ea41c6346d4baac7f166a","last_reissued_at":"2026-05-18T03:11:24.689007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:24.689007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Exact Clustering Posteriors with Subset Convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Jukka Corander, Jukka Kohonen","submitted_at":"2013-10-03T17:01:34Z","abstract_excerpt":"An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters, and pairwise co-occurrence. The method is based on subset convolution, and yields the posterior distribution for the number of clusters in O(n * 3^n) operations, or O(n^3 * 2^n) using fast subset convolution. Pairwise co-occurrence probabilities are then obtained in O(n^3 * 2^n) operations. This is considerably faster than exhaustive enumeration of all partitions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1034","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":"1310.1034","created_at":"2026-05-18T03:11:24.689092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1034v1","created_at":"2026-05-18T03:11:24.689092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1034","created_at":"2026-05-18T03:11:24.689092+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G55JDERLMUN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G55JDERLMUNWOWT","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G55JDER","created_at":"2026-05-18T12:27:32.513160+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/3G55JDERLMUNWOWTOF62KWNJ52","json":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52.json","graph_json":"https://pith.science/api/pith-number/3G55JDERLMUNWOWTOF62KWNJ52/graph.json","events_json":"https://pith.science/api/pith-number/3G55JDERLMUNWOWTOF62KWNJ52/events.json","paper":"https://pith.science/paper/3G55JDER"},"agent_actions":{"view_html":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52","download_json":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52.json","view_paper":"https://pith.science/paper/3G55JDER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1034&json=true","fetch_graph":"https://pith.science/api/pith-number/3G55JDERLMUNWOWTOF62KWNJ52/graph.json","fetch_events":"https://pith.science/api/pith-number/3G55JDERLMUNWOWTOF62KWNJ52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52/action/storage_attestation","attest_author":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52/action/author_attestation","sign_citation":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52/action/citation_signature","submit_replication":"https://pith.science/pith/3G55JDERLMUNWOWTOF62KWNJ52/action/replication_record"}},"created_at":"2026-05-18T03:11:24.689092+00:00","updated_at":"2026-05-18T03:11:24.689092+00:00"}