{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VHFQMPCVDUMM7Y7GC57LNCOBL6","short_pith_number":"pith:VHFQMPCV","schema_version":"1.0","canonical_sha256":"a9cb063c551d18cfe3e6177eb689c15f8885432a0bdd9b7d718ccae23466d6fc","source":{"kind":"arxiv","id":"1506.03072","version":1},"attestation_state":"computed","paper":{"title":"Clustering by transitive propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Levy, Vijay Kumar","submitted_at":"2015-06-09T20:00:26Z","abstract_excerpt":"We present a global optimization algorithm for clustering data given the ratio of likelihoods that each pair of data points is in the same cluster or in different clusters. To define a clustering solution in terms of pairwise relationships, a necessary and sufficient condition is that belonging to the same cluster satisfies transitivity. We define a global objective function based on pairwise likelihood ratios and a transitivity constraint over all triples, assigning an equal prior probability to all clustering solutions. We maximize the objective function by implementing max-sum message passi"},"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":"1506.03072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-09T20:00:26Z","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"title_canon_sha256":"3a407656ab61829b69634844093b4454c69f4140bc3eb1b263922425ce982873","abstract_canon_sha256":"8cf99139937e754525a7a401091a93e9a58e0a4eef2a4ed82b1e7b8c1475b4fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:31.568435Z","signature_b64":"uCqeEQDO2pqojfPEiw6YQ+eZZD6tJqHJxLhoWfGp/J4JCdBZ5XZWIKBSZy9TD6WyqZEbbADMRMvG2A0oiPoSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9cb063c551d18cfe3e6177eb689c15f8885432a0bdd9b7d718ccae23466d6fc","last_reissued_at":"2026-05-18T01:55:31.567905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:31.567905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering by transitive propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Levy, Vijay Kumar","submitted_at":"2015-06-09T20:00:26Z","abstract_excerpt":"We present a global optimization algorithm for clustering data given the ratio of likelihoods that each pair of data points is in the same cluster or in different clusters. To define a clustering solution in terms of pairwise relationships, a necessary and sufficient condition is that belonging to the same cluster satisfies transitivity. We define a global objective function based on pairwise likelihood ratios and a transitivity constraint over all triples, assigning an equal prior probability to all clustering solutions. We maximize the objective function by implementing max-sum message passi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03072","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":"1506.03072","created_at":"2026-05-18T01:55:31.567983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03072v1","created_at":"2026-05-18T01:55:31.567983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03072","created_at":"2026-05-18T01:55:31.567983+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHFQMPCVDUMM","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHFQMPCVDUMM7Y7G","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHFQMPCV","created_at":"2026-05-18T12:29:44.643036+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/VHFQMPCVDUMM7Y7GC57LNCOBL6","json":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6.json","graph_json":"https://pith.science/api/pith-number/VHFQMPCVDUMM7Y7GC57LNCOBL6/graph.json","events_json":"https://pith.science/api/pith-number/VHFQMPCVDUMM7Y7GC57LNCOBL6/events.json","paper":"https://pith.science/paper/VHFQMPCV"},"agent_actions":{"view_html":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6","download_json":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6.json","view_paper":"https://pith.science/paper/VHFQMPCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03072&json=true","fetch_graph":"https://pith.science/api/pith-number/VHFQMPCVDUMM7Y7GC57LNCOBL6/graph.json","fetch_events":"https://pith.science/api/pith-number/VHFQMPCVDUMM7Y7GC57LNCOBL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/action/storage_attestation","attest_author":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/action/author_attestation","sign_citation":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/action/citation_signature","submit_replication":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/action/replication_record"}},"created_at":"2026-05-18T01:55:31.567983+00:00","updated_at":"2026-05-18T01:55:31.567983+00:00"}