{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QK7IGQALL6NJOA2KTSMCUXCEU7","short_pith_number":"pith:QK7IGQAL","schema_version":"1.0","canonical_sha256":"82be83400b5f9a97034a9c982a5c44a7ea566d1e5dc6ce7e6cd4a7cf53c7b095","source":{"kind":"arxiv","id":"2003.03960","version":1},"attestation_state":"computed","paper":{"title":"Metric Learning for Ordered Labeled Trees with pq-grams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akihiro Yamamoto, Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi","submitted_at":"2020-03-09T08:04:47Z","abstract_excerpt":"Computing the similarity between two data points plays a vital role in many machine learning algorithms. Metric learning has the aim of learning a good metric automatically from data. Most existing studies on metric learning for tree-structured data have adopted the approach of learning the tree edit distance. However, the edit distance is not amenable for big data analysis because it incurs high computation cost. In this paper, we propose a new metric learning approach for tree-structured data with pq-grams. The pq-gram distance is a distance for ordered labeled trees, and has much lower comp"},"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":"2003.03960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-09T08:04:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"89cf85db58de5e1a8c92c4649b86766c235199bb477f4841975b62b15e87ec59","abstract_canon_sha256":"7967126cf4ddb3d7c89d5e629f23be12740606d01f4ab9b3685bebe8de77c70e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:38.048389Z","signature_b64":"Acxcy1bufQekP78qXL0LnmNr5uMTC2fdaXBcSJOpErcM6qtsSDg/XeVk9k3hj0A6nFxUGqtzY2gPcc/UR22sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82be83400b5f9a97034a9c982a5c44a7ea566d1e5dc6ce7e6cd4a7cf53c7b095","last_reissued_at":"2026-07-05T00:46:38.047972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:38.047972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Learning for Ordered Labeled Trees with pq-grams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akihiro Yamamoto, Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi","submitted_at":"2020-03-09T08:04:47Z","abstract_excerpt":"Computing the similarity between two data points plays a vital role in many machine learning algorithms. Metric learning has the aim of learning a good metric automatically from data. Most existing studies on metric learning for tree-structured data have adopted the approach of learning the tree edit distance. However, the edit distance is not amenable for big data analysis because it incurs high computation cost. In this paper, we propose a new metric learning approach for tree-structured data with pq-grams. The pq-gram distance is a distance for ordered labeled trees, and has much lower comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.03960","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/2003.03960/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.03960","created_at":"2026-07-05T00:46:38.048031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.03960v1","created_at":"2026-07-05T00:46:38.048031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.03960","created_at":"2026-07-05T00:46:38.048031+00:00"},{"alias_kind":"pith_short_12","alias_value":"QK7IGQALL6NJ","created_at":"2026-07-05T00:46:38.048031+00:00"},{"alias_kind":"pith_short_16","alias_value":"QK7IGQALL6NJOA2K","created_at":"2026-07-05T00:46:38.048031+00:00"},{"alias_kind":"pith_short_8","alias_value":"QK7IGQAL","created_at":"2026-07-05T00:46:38.048031+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/QK7IGQALL6NJOA2KTSMCUXCEU7","json":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7.json","graph_json":"https://pith.science/api/pith-number/QK7IGQALL6NJOA2KTSMCUXCEU7/graph.json","events_json":"https://pith.science/api/pith-number/QK7IGQALL6NJOA2KTSMCUXCEU7/events.json","paper":"https://pith.science/paper/QK7IGQAL"},"agent_actions":{"view_html":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7","download_json":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7.json","view_paper":"https://pith.science/paper/QK7IGQAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.03960&json=true","fetch_graph":"https://pith.science/api/pith-number/QK7IGQALL6NJOA2KTSMCUXCEU7/graph.json","fetch_events":"https://pith.science/api/pith-number/QK7IGQALL6NJOA2KTSMCUXCEU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7/action/storage_attestation","attest_author":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7/action/author_attestation","sign_citation":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7/action/citation_signature","submit_replication":"https://pith.science/pith/QK7IGQALL6NJOA2KTSMCUXCEU7/action/replication_record"}},"created_at":"2026-07-05T00:46:38.048031+00:00","updated_at":"2026-07-05T00:46:38.048031+00:00"}