{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O77O22SY3DZVAVGIQTXFX3QSXT","short_pith_number":"pith:O77O22SY","schema_version":"1.0","canonical_sha256":"77feed6a58d8f35054c884ee5bee12bcd67353c81510bf165a236e62a8bbc244","source":{"kind":"arxiv","id":"1507.03372","version":2},"attestation_state":"computed","paper":{"title":"Ordered Decompositional DAG Kernels Enhancements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alessandro Sperduti, Giovanni Da San Martino, Nicol\\`o Navarin","submitted_at":"2015-07-13T09:50:41Z","abstract_excerpt":"In this paper, we show how the Ordered Decomposition DAGs (ODD) kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Here we consider a fast graph kernel based on the Subtree kernel (ST), and we propose various enhancements to increase its expressiveness. The proposed DAG kernel has the same worst-case complexity as the one based on ST, but an improved expressivity due to an augmented set of features. Moreover, we propose a novel weighting scheme for the features, which can be applied to other k"},"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":"1507.03372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-13T09:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"3143cbab0593d075555ae2db6aa9cfe6e95259177e77e58a7e352bde6a90af29","abstract_canon_sha256":"c2b875dd36f52b3c3e06f580ae24a57b68d49e0fb93ea50290e948274675dd12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.943368Z","signature_b64":"pdFbKijzOFb5Wt8EIMce4IOtOLEzgSwwoy6HL+Ie+j17kWhsoBuF7oPzR9vakESCtCwdYEBEyVj4ZmlsOhMTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77feed6a58d8f35054c884ee5bee12bcd67353c81510bf165a236e62a8bbc244","last_reissued_at":"2026-05-18T01:10:45.942946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.942946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered Decompositional DAG Kernels Enhancements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alessandro Sperduti, Giovanni Da San Martino, Nicol\\`o Navarin","submitted_at":"2015-07-13T09:50:41Z","abstract_excerpt":"In this paper, we show how the Ordered Decomposition DAGs (ODD) kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Here we consider a fast graph kernel based on the Subtree kernel (ST), and we propose various enhancements to increase its expressiveness. The proposed DAG kernel has the same worst-case complexity as the one based on ST, but an improved expressivity due to an augmented set of features. Moreover, we propose a novel weighting scheme for the features, which can be applied to other k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03372","kind":"arxiv","version":2},"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":"1507.03372","created_at":"2026-05-18T01:10:45.943012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03372v2","created_at":"2026-05-18T01:10:45.943012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03372","created_at":"2026-05-18T01:10:45.943012+00:00"},{"alias_kind":"pith_short_12","alias_value":"O77O22SY3DZV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O77O22SY3DZVAVGI","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O77O22SY","created_at":"2026-05-18T12:29:34.919912+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/O77O22SY3DZVAVGIQTXFX3QSXT","json":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT.json","graph_json":"https://pith.science/api/pith-number/O77O22SY3DZVAVGIQTXFX3QSXT/graph.json","events_json":"https://pith.science/api/pith-number/O77O22SY3DZVAVGIQTXFX3QSXT/events.json","paper":"https://pith.science/paper/O77O22SY"},"agent_actions":{"view_html":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT","download_json":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT.json","view_paper":"https://pith.science/paper/O77O22SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03372&json=true","fetch_graph":"https://pith.science/api/pith-number/O77O22SY3DZVAVGIQTXFX3QSXT/graph.json","fetch_events":"https://pith.science/api/pith-number/O77O22SY3DZVAVGIQTXFX3QSXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT/action/storage_attestation","attest_author":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT/action/author_attestation","sign_citation":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT/action/citation_signature","submit_replication":"https://pith.science/pith/O77O22SY3DZVAVGIQTXFX3QSXT/action/replication_record"}},"created_at":"2026-05-18T01:10:45.943012+00:00","updated_at":"2026-05-18T01:10:45.943012+00:00"}