{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VHFQMPCVDUMM7Y7GC57LNCOBL6","short_pith_number":"pith:VHFQMPCV","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"},"canonical_sha256":"a9cb063c551d18cfe3e6177eb689c15f8885432a0bdd9b7d718ccae23466d6fc","source":{"kind":"arxiv","id":"1506.03072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03072","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03072v1","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03072","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"VHFQMPCVDUMM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHFQMPCVDUMM7Y7G","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHFQMPCV","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VHFQMPCVDUMM7Y7GC57LNCOBL6","target":"record","payload":{"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"},"canonical_sha256":"a9cb063c551d18cfe3e6177eb689c15f8885432a0bdd9b7d718ccae23466d6fc","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"},"source_kind":"arxiv","source_id":"1506.03072","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xv8igQBZdZCZ76opGuL3vs0DfvNYAogt+Ti2kpRBvn3wTCRpN9pIu9kQVwDZvzHDKnKW4Vy72ps2F1sgXCpWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:22:13.313664Z"},"content_sha256":"bed41a5ebc7b26d6f67616fcb2fcb814968dba68f3c05b3623f1b4ad53ff1b5b","schema_version":"1.0","event_id":"sha256:bed41a5ebc7b26d6f67616fcb2fcb814968dba68f3c05b3623f1b4ad53ff1b5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VHFQMPCVDUMM7Y7GC57LNCOBL6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4mHY0clWOBsBj3vGhdFydD9FGZ/otvl/0losog+j/WBEeE8RsV0C1OarLMeYlc0PDp4xvicNEdKCVBjJzD4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:22:13.314378Z"},"content_sha256":"4be6b51b6a562e96a9a1fe930b9baf0d27ab7ecb8c4deb0229880f0cf53de6ee","schema_version":"1.0","event_id":"sha256:4be6b51b6a562e96a9a1fe930b9baf0d27ab7ecb8c4deb0229880f0cf53de6ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/bundle.json","state_url":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T22:22:13Z","links":{"resolver":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6","bundle":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/bundle.json","state":"https://pith.science/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHFQMPCVDUMM7Y7GC57LNCOBL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VHFQMPCVDUMM7Y7GC57LNCOBL6","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":"8cf99139937e754525a7a401091a93e9a58e0a4eef2a4ed82b1e7b8c1475b4fb","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-09T20:00:26Z","title_canon_sha256":"3a407656ab61829b69634844093b4454c69f4140bc3eb1b263922425ce982873"},"schema_version":"1.0","source":{"id":"1506.03072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03072","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03072v1","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03072","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"VHFQMPCVDUMM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHFQMPCVDUMM7Y7G","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHFQMPCV","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:4be6b51b6a562e96a9a1fe930b9baf0d27ab7ecb8c4deb0229880f0cf53de6ee","target":"graph","created_at":"2026-05-18T01:55:31Z","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 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","authors_text":"Dan Levy, Vijay Kumar","cross_cats":["cond-mat.stat-mech","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-09T20:00:26Z","title":"Clustering by transitive propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03072","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:bed41a5ebc7b26d6f67616fcb2fcb814968dba68f3c05b3623f1b4ad53ff1b5b","target":"record","created_at":"2026-05-18T01:55:31Z","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":"8cf99139937e754525a7a401091a93e9a58e0a4eef2a4ed82b1e7b8c1475b4fb","cross_cats_sorted":["cond-mat.stat-mech","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-09T20:00:26Z","title_canon_sha256":"3a407656ab61829b69634844093b4454c69f4140bc3eb1b263922425ce982873"},"schema_version":"1.0","source":{"id":"1506.03072","kind":"arxiv","version":1}},"canonical_sha256":"a9cb063c551d18cfe3e6177eb689c15f8885432a0bdd9b7d718ccae23466d6fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9cb063c551d18cfe3e6177eb689c15f8885432a0bdd9b7d718ccae23466d6fc","first_computed_at":"2026-05-18T01:55:31.567905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:31.567905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uCqeEQDO2pqojfPEiw6YQ+eZZD6tJqHJxLhoWfGp/J4JCdBZ5XZWIKBSZy9TD6WyqZEbbADMRMvG2A0oiPoSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:31.568435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bed41a5ebc7b26d6f67616fcb2fcb814968dba68f3c05b3623f1b4ad53ff1b5b","sha256:4be6b51b6a562e96a9a1fe930b9baf0d27ab7ecb8c4deb0229880f0cf53de6ee"],"state_sha256":"a0fd8ab20d3732996743750afb84fc3e2c0c67c7bd5fc4bdbc783d5cc80e10b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGOoy3vZxzzlYC18Bz4FGqVEWjY5h61mTw+qdyLpIMME9cQA3RFdxahrq+0x8lJ3m/QcVGdffEPyctfAGRjsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:22:13.318442Z","bundle_sha256":"6d68a33441468858cd067eb9e3aecb7844fcaa5b654a5ff7350deb1bea421999"}}