{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6WTFNVV6BLIXUR7PGJWTMJX2ZZ","short_pith_number":"pith:6WTFNVV6","schema_version":"1.0","canonical_sha256":"f5a656d6be0ad17a47ef326d3626face6998db3796a734287b19075e995263d4","source":{"kind":"arxiv","id":"1204.6509","version":1},"attestation_state":"computed","paper":{"title":"Dissimilarity Clustering by Hierarchical Multi-Level Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brieuc Conan-Guez (LITA), Fabrice Rossi (SAMM)","submitted_at":"2012-04-29T19:31:15Z","abstract_excerpt":"We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves better quantization errors than the"},"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":"1204.6509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-29T19:31:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"73098ff55c8671685e5dc8f301421a050428b5b3fad708b493c36fd13fb9820f","abstract_canon_sha256":"5c23352da23e37981022de48ddb01277d864550a886df872ede48bae156f84c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:36.041923Z","signature_b64":"W7gQaZNHMseqKHgkrkPMNzAHadN+ddf3Z8crentEBvZKxcns/yy4o0lmyrCPL6KuXZebtF6y7J9RvCs48FVBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5a656d6be0ad17a47ef326d3626face6998db3796a734287b19075e995263d4","last_reissued_at":"2026-05-18T03:56:36.041228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:36.041228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dissimilarity Clustering by Hierarchical Multi-Level Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brieuc Conan-Guez (LITA), Fabrice Rossi (SAMM)","submitted_at":"2012-04-29T19:31:15Z","abstract_excerpt":"We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves better quantization errors than the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6509","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":"1204.6509","created_at":"2026-05-18T03:56:36.041352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6509v1","created_at":"2026-05-18T03:56:36.041352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6509","created_at":"2026-05-18T03:56:36.041352+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WTFNVV6BLIX","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WTFNVV6BLIXUR7P","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WTFNVV6","created_at":"2026-05-18T12:26:56.085431+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/6WTFNVV6BLIXUR7PGJWTMJX2ZZ","json":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ.json","graph_json":"https://pith.science/api/pith-number/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/graph.json","events_json":"https://pith.science/api/pith-number/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/events.json","paper":"https://pith.science/paper/6WTFNVV6"},"agent_actions":{"view_html":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ","download_json":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ.json","view_paper":"https://pith.science/paper/6WTFNVV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6509&json=true","fetch_graph":"https://pith.science/api/pith-number/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/action/storage_attestation","attest_author":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/action/author_attestation","sign_citation":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/action/citation_signature","submit_replication":"https://pith.science/pith/6WTFNVV6BLIXUR7PGJWTMJX2ZZ/action/replication_record"}},"created_at":"2026-05-18T03:56:36.041352+00:00","updated_at":"2026-05-18T03:56:36.041352+00:00"}