{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LIMIEEGNUFBUJO4SXWC4TO4LRZ","short_pith_number":"pith:LIMIEEGN","canonical_record":{"source":{"id":"1807.00558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-02T09:29:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6cd3477f8a3e96a1639ddb0fa8aa415c4581a86db15f9f3c431f23c4cae4399","abstract_canon_sha256":"36bf8badabf4d94a98e045cf8017f468c801590a66863ee4a3fecfe0a6444d32"},"schema_version":"1.0"},"canonical_sha256":"5a188210cda14344bb92bd85c9bb8b8e58050a3c823a89c82ed00f18b2969a5a","source":{"kind":"arxiv","id":"1807.00558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00558","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00558v1","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00558","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"LIMIEEGNUFBU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIMIEEGNUFBUJO4S","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIMIEEGN","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LIMIEEGNUFBUJO4SXWC4TO4LRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-02T09:29:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6cd3477f8a3e96a1639ddb0fa8aa415c4581a86db15f9f3c431f23c4cae4399","abstract_canon_sha256":"36bf8badabf4d94a98e045cf8017f468c801590a66863ee4a3fecfe0a6444d32"},"schema_version":"1.0"},"canonical_sha256":"5a188210cda14344bb92bd85c9bb8b8e58050a3c823a89c82ed00f18b2969a5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:52.200442Z","signature_b64":"vcmelGGUzCavE9/wyrVX84mN262O3X6LQwQoaMVHt397BHJFXiqKli+z05RKn5gk25QN7PEVz3ejzbRXVLj5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a188210cda14344bb92bd85c9bb8b8e58050a3c823a89c82ed00f18b2969a5a","last_reissued_at":"2026-05-18T00:11:52.199780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:52.199780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00558","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-18T00:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdK3Yhkho1tyvMtLMfwuWraS4PAcMEx/pynUeKd2PgQH8omhX9hI0WcKFjgByBxww+PYxL2coaUEjutMtPmpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:18:10.143774Z"},"content_sha256":"73dc81ca9a1822230f8617708b47e8d94ee1502143464a328a4d1eb4a2025786","schema_version":"1.0","event_id":"sha256:73dc81ca9a1822230f8617708b47e8d94ee1502143464a328a4d1eb4a2025786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LIMIEEGNUFBUJO4SXWC4TO4LRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Constraints for Metric Learning on Relational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hoel Le Capitaine, Jiajun Pan, Philippe Leray","submitted_at":"2018-07-02T09:29:06Z","abstract_excerpt":"Most of metric learning approaches are dedicated to be applied on data described by feature vectors, with some notable exceptions such as times series, trees or graphs. The objective of this paper is to propose a metric learning algorithm that specifically considers relational data. The proposed approach can take benefit from both the topological structure of the data and supervised labels. For selecting relative constraints representing the relational information, we introduce a link-strength function that measures the strength of relationship links between entities by the side-information of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00558","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-18T00:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zzL2NZWj4M+XWy00zr6eRQ9tg+WzT14S1ZAYYTGtMkQzG2KTxtJ2nDDBOKKSm9oRGdsBSxZ5+kjrNmyzuS+jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:18:10.144132Z"},"content_sha256":"66777f23caf3e193a7f7fbda2117dea85e231743c70a14475b4fc8c7474a6fa7","schema_version":"1.0","event_id":"sha256:66777f23caf3e193a7f7fbda2117dea85e231743c70a14475b4fc8c7474a6fa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ/bundle.json","state_url":"https://pith.science/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ/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-06-02T01:18:10Z","links":{"resolver":"https://pith.science/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ","bundle":"https://pith.science/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ/bundle.json","state":"https://pith.science/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIMIEEGNUFBUJO4SXWC4TO4LRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LIMIEEGNUFBUJO4SXWC4TO4LRZ","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":"36bf8badabf4d94a98e045cf8017f468c801590a66863ee4a3fecfe0a6444d32","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-02T09:29:06Z","title_canon_sha256":"d6cd3477f8a3e96a1639ddb0fa8aa415c4581a86db15f9f3c431f23c4cae4399"},"schema_version":"1.0","source":{"id":"1807.00558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00558","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00558v1","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00558","created_at":"2026-05-18T00:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"LIMIEEGNUFBU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIMIEEGNUFBUJO4S","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIMIEEGN","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:66777f23caf3e193a7f7fbda2117dea85e231743c70a14475b4fc8c7474a6fa7","target":"graph","created_at":"2026-05-18T00:11:52Z","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":"Most of metric learning approaches are dedicated to be applied on data described by feature vectors, with some notable exceptions such as times series, trees or graphs. The objective of this paper is to propose a metric learning algorithm that specifically considers relational data. The proposed approach can take benefit from both the topological structure of the data and supervised labels. For selecting relative constraints representing the relational information, we introduce a link-strength function that measures the strength of relationship links between entities by the side-information of","authors_text":"Hoel Le Capitaine, Jiajun Pan, Philippe Leray","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-02T09:29:06Z","title":"Relational Constraints for Metric Learning on Relational Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00558","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:73dc81ca9a1822230f8617708b47e8d94ee1502143464a328a4d1eb4a2025786","target":"record","created_at":"2026-05-18T00:11:52Z","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":"36bf8badabf4d94a98e045cf8017f468c801590a66863ee4a3fecfe0a6444d32","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-02T09:29:06Z","title_canon_sha256":"d6cd3477f8a3e96a1639ddb0fa8aa415c4581a86db15f9f3c431f23c4cae4399"},"schema_version":"1.0","source":{"id":"1807.00558","kind":"arxiv","version":1}},"canonical_sha256":"5a188210cda14344bb92bd85c9bb8b8e58050a3c823a89c82ed00f18b2969a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a188210cda14344bb92bd85c9bb8b8e58050a3c823a89c82ed00f18b2969a5a","first_computed_at":"2026-05-18T00:11:52.199780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:52.199780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vcmelGGUzCavE9/wyrVX84mN262O3X6LQwQoaMVHt397BHJFXiqKli+z05RKn5gk25QN7PEVz3ejzbRXVLj5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:52.200442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73dc81ca9a1822230f8617708b47e8d94ee1502143464a328a4d1eb4a2025786","sha256:66777f23caf3e193a7f7fbda2117dea85e231743c70a14475b4fc8c7474a6fa7"],"state_sha256":"72195d92eed4514ca70e8c86bd831540216b39269052652a508f222c5e459938"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdTLaYon3BcYTD7QwVwYpehbREWVSyE15K7PSrLH12tF+EXrDZwPiyJs91Nnf+qSmMxg0kiKzFHpwvJrCYkoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:18:10.146291Z","bundle_sha256":"ad007fb9cf2828375cae62ba977272f41f4c43bb919f9bb0f215f2600dc87735"}}