{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EXCI7EGVIJXBNALPTAWQI43JHA","short_pith_number":"pith:EXCI7EGV","schema_version":"1.0","canonical_sha256":"25c48f90d5426e16816f982d047369380f57079f8cea4f2276196b1b07419f51","source":{"kind":"arxiv","id":"1809.01833","version":2},"attestation_state":"computed","paper":{"title":"Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"James Evans, Shahab Asoodeh, Tingran Gao, Yi Huang","submitted_at":"2018-09-06T05:48:50Z","abstract_excerpt":"Inspired by recent interests of developing machine learning and data mining algorithms on hypergraphs, we investigate in this paper the semi-supervised learning algorithm of propagating \"soft labels\" (e.g. probability distributions, class membership scores) over hypergraphs, by means of optimal transportation. Borrowing insights from Wasserstein propagation on graphs [Solomon et al. 2014], we re-formulate the label propagation procedure as a message-passing algorithm, which renders itself naturally to a generalization applicable to hypergraphs through Wasserstein barycenters. Furthermore, in a"},"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":"1809.01833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-06T05:48:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a8700a6f4dcae856de2dc7044e22640ab8d088e6b753e8e04c4f3342fb80e8b8","abstract_canon_sha256":"b5739b7378887653410ca9cdc86759759d0597689c8360396a2fd1a057038b6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:29.711140Z","signature_b64":"zgfwXN8OvTh1/jHSHnVGTQtq2SyFl09i11x5vnSEcjwODWgvz1kYuMuLi1tYCubOIWJlfjLz8esg+PgyVK2ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25c48f90d5426e16816f982d047369380f57079f8cea4f2276196b1b07419f51","last_reissued_at":"2026-05-18T00:00:29.710761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:29.710761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"James Evans, Shahab Asoodeh, Tingran Gao, Yi Huang","submitted_at":"2018-09-06T05:48:50Z","abstract_excerpt":"Inspired by recent interests of developing machine learning and data mining algorithms on hypergraphs, we investigate in this paper the semi-supervised learning algorithm of propagating \"soft labels\" (e.g. probability distributions, class membership scores) over hypergraphs, by means of optimal transportation. Borrowing insights from Wasserstein propagation on graphs [Solomon et al. 2014], we re-formulate the label propagation procedure as a message-passing algorithm, which renders itself naturally to a generalization applicable to hypergraphs through Wasserstein barycenters. Furthermore, in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01833","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":"1809.01833","created_at":"2026-05-18T00:00:29.710817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01833v2","created_at":"2026-05-18T00:00:29.710817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01833","created_at":"2026-05-18T00:00:29.710817+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXCI7EGVIJXB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXCI7EGVIJXBNALP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXCI7EGV","created_at":"2026-05-18T12:32:22.470017+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/EXCI7EGVIJXBNALPTAWQI43JHA","json":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA.json","graph_json":"https://pith.science/api/pith-number/EXCI7EGVIJXBNALPTAWQI43JHA/graph.json","events_json":"https://pith.science/api/pith-number/EXCI7EGVIJXBNALPTAWQI43JHA/events.json","paper":"https://pith.science/paper/EXCI7EGV"},"agent_actions":{"view_html":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA","download_json":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA.json","view_paper":"https://pith.science/paper/EXCI7EGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01833&json=true","fetch_graph":"https://pith.science/api/pith-number/EXCI7EGVIJXBNALPTAWQI43JHA/graph.json","fetch_events":"https://pith.science/api/pith-number/EXCI7EGVIJXBNALPTAWQI43JHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA/action/storage_attestation","attest_author":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA/action/author_attestation","sign_citation":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA/action/citation_signature","submit_replication":"https://pith.science/pith/EXCI7EGVIJXBNALPTAWQI43JHA/action/replication_record"}},"created_at":"2026-05-18T00:00:29.710817+00:00","updated_at":"2026-05-18T00:00:29.710817+00:00"}