{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KQCL7RPLJD6MXR3OG2OBFOZDKN","short_pith_number":"pith:KQCL7RPL","canonical_record":{"source":{"id":"2105.12703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-26T17:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"a5a14df8347c51afe0e01fdf6ad3195a24a33efb25c3bb4298be57135451d425","abstract_canon_sha256":"7c5de8d1cf3b80c21f5d3c62677a940146325e401bec7dff6f703da4257f9c3c"},"schema_version":"1.0"},"canonical_sha256":"5404bfc5eb48fccbc76e369c12bb23534861d90549eb542752ce1299b69e1bf2","source":{"kind":"arxiv","id":"2105.12703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12703","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12703v1","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12703","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"KQCL7RPLJD6M","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_16","alias_value":"KQCL7RPLJD6MXR3O","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_8","alias_value":"KQCL7RPL","created_at":"2026-07-05T02:43:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KQCL7RPLJD6MXR3OG2OBFOZDKN","target":"record","payload":{"canonical_record":{"source":{"id":"2105.12703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-26T17:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"a5a14df8347c51afe0e01fdf6ad3195a24a33efb25c3bb4298be57135451d425","abstract_canon_sha256":"7c5de8d1cf3b80c21f5d3c62677a940146325e401bec7dff6f703da4257f9c3c"},"schema_version":"1.0"},"canonical_sha256":"5404bfc5eb48fccbc76e369c12bb23534861d90549eb542752ce1299b69e1bf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:41.624411Z","signature_b64":"jKuMjQS62lVOiMWUc3keDQ6cHREflTB9+bSGtXmX7W0W5MWj4d+YPws2AgPzn5ej5yjo620ctps9oJnBJnjoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5404bfc5eb48fccbc76e369c12bb23534861d90549eb542752ce1299b69e1bf2","last_reissued_at":"2026-07-05T02:43:41.624003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:41.624003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.12703","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-07-05T02:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+8J+JQODj0sG+MaMGMxLpeTiClSJ94aAR6sO/TRHfenWaLQljIvZM/qmDkpN8Ux+NGUlguz7k6O861VD9/EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:30:34.063428Z"},"content_sha256":"98e5d4962be627f027951d76fa23e6f67bd73dcd28201fe8d7ef6c70bedd5786","schema_version":"1.0","event_id":"sha256:98e5d4962be627f027951d76fa23e6f67bd73dcd28201fe8d7ef6c70bedd5786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KQCL7RPLJD6MXR3OG2OBFOZDKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring dual information in distance metric learning for clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alain Hertz, Daniel Aloise, Rodrigo Randel","submitted_at":"2021-05-26T17:33:23Z","abstract_excerpt":"Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learning is typically applied with the assist of side-information provided by experts, most commonly expressed in the form of cannot-link and must-link constraints. In this setting, distance metric learning algorithms move closer pairs of data points involved in must-link constraints, while pairs of points involved in cannot-link constraints are moved away from each other. For these algorithms to be effective, it is important to use a distance me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12703","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.12703/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n01fyMyz/DPcBeEEkeDcrAxL3MY/6RPmkqD6DgEXmLT0bNGzxQ5huKg6Tlp8N6GeAE2hyWhlEE3mF554Ti+FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:30:34.063806Z"},"content_sha256":"68e9fb7dd63137c7e9d18e6caf0397c58d11befb7134f9a2f94aff4fc7de612f","schema_version":"1.0","event_id":"sha256:68e9fb7dd63137c7e9d18e6caf0397c58d11befb7134f9a2f94aff4fc7de612f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN/bundle.json","state_url":"https://pith.science/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN/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-07-09T03:30:34Z","links":{"resolver":"https://pith.science/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN","bundle":"https://pith.science/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN/bundle.json","state":"https://pith.science/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQCL7RPLJD6MXR3OG2OBFOZDKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KQCL7RPLJD6MXR3OG2OBFOZDKN","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":"7c5de8d1cf3b80c21f5d3c62677a940146325e401bec7dff6f703da4257f9c3c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-26T17:33:23Z","title_canon_sha256":"a5a14df8347c51afe0e01fdf6ad3195a24a33efb25c3bb4298be57135451d425"},"schema_version":"1.0","source":{"id":"2105.12703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12703","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12703v1","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12703","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"KQCL7RPLJD6M","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_16","alias_value":"KQCL7RPLJD6MXR3O","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_8","alias_value":"KQCL7RPL","created_at":"2026-07-05T02:43:41Z"}],"graph_snapshots":[{"event_id":"sha256:68e9fb7dd63137c7e9d18e6caf0397c58d11befb7134f9a2f94aff4fc7de612f","target":"graph","created_at":"2026-07-05T02:43:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.12703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learning is typically applied with the assist of side-information provided by experts, most commonly expressed in the form of cannot-link and must-link constraints. In this setting, distance metric learning algorithms move closer pairs of data points involved in must-link constraints, while pairs of points involved in cannot-link constraints are moved away from each other. For these algorithms to be effective, it is important to use a distance me","authors_text":"Alain Hertz, Daniel Aloise, Rodrigo Randel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-26T17:33:23Z","title":"Exploring dual information in distance metric learning for clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12703","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:98e5d4962be627f027951d76fa23e6f67bd73dcd28201fe8d7ef6c70bedd5786","target":"record","created_at":"2026-07-05T02:43:41Z","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":"7c5de8d1cf3b80c21f5d3c62677a940146325e401bec7dff6f703da4257f9c3c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-26T17:33:23Z","title_canon_sha256":"a5a14df8347c51afe0e01fdf6ad3195a24a33efb25c3bb4298be57135451d425"},"schema_version":"1.0","source":{"id":"2105.12703","kind":"arxiv","version":1}},"canonical_sha256":"5404bfc5eb48fccbc76e369c12bb23534861d90549eb542752ce1299b69e1bf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5404bfc5eb48fccbc76e369c12bb23534861d90549eb542752ce1299b69e1bf2","first_computed_at":"2026-07-05T02:43:41.624003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:41.624003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKuMjQS62lVOiMWUc3keDQ6cHREflTB9+bSGtXmX7W0W5MWj4d+YPws2AgPzn5ej5yjo620ctps9oJnBJnjoCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:41.624411Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98e5d4962be627f027951d76fa23e6f67bd73dcd28201fe8d7ef6c70bedd5786","sha256:68e9fb7dd63137c7e9d18e6caf0397c58d11befb7134f9a2f94aff4fc7de612f"],"state_sha256":"a5a937ac0d9f80f15086c0f2ae6cafc5767aa6bc9e5758f4fce20c27a5fa6b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnHgypOymHUapxMoSSzJp1XqJdTjlS2v4WCa9QVAJygt5BbPJGA93Iy03USaRf6M/sZLlUIXZ7D3DRFNXdEtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:30:34.066032Z","bundle_sha256":"1ab74e04171bb8c190a084fe3b0450d92cc08d7d15af9983c29dd3d9f71ca479"}}