{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DLQJNT7QC3CBBKGUHYFHMLI3MB","short_pith_number":"pith:DLQJNT7Q","schema_version":"1.0","canonical_sha256":"1ae096cff016c410a8d43e0a762d1b6050e409afa4a3133013710460985139d1","source":{"kind":"arxiv","id":"2110.02554","version":2},"attestation_state":"computed","paper":{"title":"A Regularized Wasserstein Framework for Graph Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Asiri Wijesinghe, Qing Wang, Stephen Gould","submitted_at":"2021-10-06T07:54:04Z","abstract_excerpt":"We propose a learning framework for graph kernels, which is theoretically grounded on regularizing optimal transport. This framework provides a novel optimal transport distance metric, namely Regularized Wasserstein (RW) discrepancy, which can preserve both features and structure of graphs via Wasserstein distances on features and their local variations, local barycenters and global connectivity. Two strongly convex regularization terms are introduced to improve the learning ability. One is to relax an optimal alignment between graphs to be a cluster-to-cluster mapping between their locally co"},"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":"2110.02554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-06T07:54:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e2b13aa5fa6150b43607e665d1eac16c5d79a4defbdd658755415585a4ae042f","abstract_canon_sha256":"efd5c9c08bb921b07e9fcd4ea4978322a0fea7052a75b1066a9e27cfda0a3cc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:57.600069Z","signature_b64":"I1Ge2pTx/sXL30ro7PaNwqbP9Fr3BZAX4qSgncNysjyU8bpPxUn9c8zNAspFB8VrNHKpDSMNVXOiNIqZQ8wZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ae096cff016c410a8d43e0a762d1b6050e409afa4a3133013710460985139d1","last_reissued_at":"2026-07-05T03:20:57.599578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:57.599578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Regularized Wasserstein Framework for Graph Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Asiri Wijesinghe, Qing Wang, Stephen Gould","submitted_at":"2021-10-06T07:54:04Z","abstract_excerpt":"We propose a learning framework for graph kernels, which is theoretically grounded on regularizing optimal transport. This framework provides a novel optimal transport distance metric, namely Regularized Wasserstein (RW) discrepancy, which can preserve both features and structure of graphs via Wasserstein distances on features and their local variations, local barycenters and global connectivity. Two strongly convex regularization terms are introduced to improve the learning ability. One is to relax an optimal alignment between graphs to be a cluster-to-cluster mapping between their locally co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02554","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.02554/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":"2110.02554","created_at":"2026-07-05T03:20:57.599640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.02554v2","created_at":"2026-07-05T03:20:57.599640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02554","created_at":"2026-07-05T03:20:57.599640+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLQJNT7QC3CB","created_at":"2026-07-05T03:20:57.599640+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLQJNT7QC3CBBKGU","created_at":"2026-07-05T03:20:57.599640+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLQJNT7Q","created_at":"2026-07-05T03:20:57.599640+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/DLQJNT7QC3CBBKGUHYFHMLI3MB","json":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB.json","graph_json":"https://pith.science/api/pith-number/DLQJNT7QC3CBBKGUHYFHMLI3MB/graph.json","events_json":"https://pith.science/api/pith-number/DLQJNT7QC3CBBKGUHYFHMLI3MB/events.json","paper":"https://pith.science/paper/DLQJNT7Q"},"agent_actions":{"view_html":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB","download_json":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB.json","view_paper":"https://pith.science/paper/DLQJNT7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.02554&json=true","fetch_graph":"https://pith.science/api/pith-number/DLQJNT7QC3CBBKGUHYFHMLI3MB/graph.json","fetch_events":"https://pith.science/api/pith-number/DLQJNT7QC3CBBKGUHYFHMLI3MB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB/action/storage_attestation","attest_author":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB/action/author_attestation","sign_citation":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB/action/citation_signature","submit_replication":"https://pith.science/pith/DLQJNT7QC3CBBKGUHYFHMLI3MB/action/replication_record"}},"created_at":"2026-07-05T03:20:57.599640+00:00","updated_at":"2026-07-05T03:20:57.599640+00:00"}