{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5DQBPTSB6OARWXXZAXZZ3AJJY4","short_pith_number":"pith:5DQBPTSB","schema_version":"1.0","canonical_sha256":"e8e017ce41f3811b5ef905f39d8129c732d5d29af5af73acf121450911bc4778","source":{"kind":"arxiv","id":"1806.05009","version":3},"attestation_state":"computed","paper":{"title":"Tree Edit Distance Learning via Adaptive Symbol Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessio Micheli, Barbara Hammer, Benjamin Paa{\\ss}en, Claudio Gallicchio","submitted_at":"2018-06-13T13:08:16Z","abstract_excerpt":"Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as molecular structures, abstract syntax trees of computer programs, or syntax trees of natural language, by learning the cost function of an edit distance, i.e. the costs of replacing, deleting, or inserting nodes in a tree. However, learning such costs directly may yield an edit di"},"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":"1806.05009","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-06-13T13:08:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3553320ad5789a42739c2efdee623abbab40c5655e837142c198d0647f63a4ee","abstract_canon_sha256":"63206baca02ef88d260ae76f29360f48f2ad1581cd43fa3b084fa17353bfb9de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.396780Z","signature_b64":"qEY9egeLIHC5ayapSOj/GidJT+RSedyukDIoruIVKQFr6RIudnyrZPsNWztU5/UVjBtMdBGwOQabeqU6QrPnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8e017ce41f3811b5ef905f39d8129c732d5d29af5af73acf121450911bc4778","last_reissued_at":"2026-05-18T00:10:44.396237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.396237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Edit Distance Learning via Adaptive Symbol Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessio Micheli, Barbara Hammer, Benjamin Paa{\\ss}en, Claudio Gallicchio","submitted_at":"2018-06-13T13:08:16Z","abstract_excerpt":"Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as molecular structures, abstract syntax trees of computer programs, or syntax trees of natural language, by learning the cost function of an edit distance, i.e. the costs of replacing, deleting, or inserting nodes in a tree. However, learning such costs directly may yield an edit di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05009","kind":"arxiv","version":3},"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":"1806.05009","created_at":"2026-05-18T00:10:44.396302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05009v3","created_at":"2026-05-18T00:10:44.396302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05009","created_at":"2026-05-18T00:10:44.396302+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DQBPTSB6OAR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DQBPTSB6OARWXXZ","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DQBPTSB","created_at":"2026-05-18T12:32:08.215937+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/5DQBPTSB6OARWXXZAXZZ3AJJY4","json":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4.json","graph_json":"https://pith.science/api/pith-number/5DQBPTSB6OARWXXZAXZZ3AJJY4/graph.json","events_json":"https://pith.science/api/pith-number/5DQBPTSB6OARWXXZAXZZ3AJJY4/events.json","paper":"https://pith.science/paper/5DQBPTSB"},"agent_actions":{"view_html":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4","download_json":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4.json","view_paper":"https://pith.science/paper/5DQBPTSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05009&json=true","fetch_graph":"https://pith.science/api/pith-number/5DQBPTSB6OARWXXZAXZZ3AJJY4/graph.json","fetch_events":"https://pith.science/api/pith-number/5DQBPTSB6OARWXXZAXZZ3AJJY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4/action/storage_attestation","attest_author":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4/action/author_attestation","sign_citation":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4/action/citation_signature","submit_replication":"https://pith.science/pith/5DQBPTSB6OARWXXZAXZZ3AJJY4/action/replication_record"}},"created_at":"2026-05-18T00:10:44.396302+00:00","updated_at":"2026-05-18T00:10:44.396302+00:00"}