{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RKBNPXKSJMX35S5UI7WXFM5TX5","short_pith_number":"pith:RKBNPXKS","schema_version":"1.0","canonical_sha256":"8a82d7dd524b2fbecbb447ed72b3b3bf6ae1cbe27d11c92c0657bdf85f5b269e","source":{"kind":"arxiv","id":"1904.08049","version":1},"attestation_state":"computed","paper":{"title":"Neural Message Passing for Multi-Label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arshdeep Sekhon, Jack Lanchantin, Yanjun Qi","submitted_at":"2019-04-17T01:58:17Z","abstract_excerpt":"Multi-label classification (MLC) is the task of assigning a set of target labels for a given sample. Modeling the combinatorial label interactions in MLC has been a long-haul challenge. We propose Label Message Passing (LaMP) Neural Networks to efficiently model the joint prediction of multiple labels. LaMP treats labels as nodes on a label-interaction graph and computes the hidden representation of each label node conditioned on the input using attention-based neural message passing. Attention enables LaMP to assign different importance to neighbor nodes per label, learning how labels interac"},"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":"1904.08049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T01:58:17Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"2bba57f272694b50902ec0e1a17e4b8341c1739f00030296e3db40a11cd35f6c","abstract_canon_sha256":"0c893f14b461108b516144e0acf8b0e206b97925e01f99cbf1ec824bd6062b10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:18.929777Z","signature_b64":"063LXWmZ1Hen7u6hS8nJZzpyqEJIf3Ly/QVftxk2msSFNqbUqlvQO10kyDEOatUIN6uY8ARgnLH4wgOm0lsiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a82d7dd524b2fbecbb447ed72b3b3bf6ae1cbe27d11c92c0657bdf85f5b269e","last_reissued_at":"2026-05-17T23:48:18.929264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:18.929264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Message Passing for Multi-Label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arshdeep Sekhon, Jack Lanchantin, Yanjun Qi","submitted_at":"2019-04-17T01:58:17Z","abstract_excerpt":"Multi-label classification (MLC) is the task of assigning a set of target labels for a given sample. Modeling the combinatorial label interactions in MLC has been a long-haul challenge. We propose Label Message Passing (LaMP) Neural Networks to efficiently model the joint prediction of multiple labels. LaMP treats labels as nodes on a label-interaction graph and computes the hidden representation of each label node conditioned on the input using attention-based neural message passing. Attention enables LaMP to assign different importance to neighbor nodes per label, learning how labels interac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08049","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":""},"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":"1904.08049","created_at":"2026-05-17T23:48:18.929354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08049v1","created_at":"2026-05-17T23:48:18.929354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08049","created_at":"2026-05-17T23:48:18.929354+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKBNPXKSJMX3","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKBNPXKSJMX35S5U","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKBNPXKS","created_at":"2026-05-18T12:33:27.125529+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/RKBNPXKSJMX35S5UI7WXFM5TX5","json":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5.json","graph_json":"https://pith.science/api/pith-number/RKBNPXKSJMX35S5UI7WXFM5TX5/graph.json","events_json":"https://pith.science/api/pith-number/RKBNPXKSJMX35S5UI7WXFM5TX5/events.json","paper":"https://pith.science/paper/RKBNPXKS"},"agent_actions":{"view_html":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5","download_json":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5.json","view_paper":"https://pith.science/paper/RKBNPXKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08049&json=true","fetch_graph":"https://pith.science/api/pith-number/RKBNPXKSJMX35S5UI7WXFM5TX5/graph.json","fetch_events":"https://pith.science/api/pith-number/RKBNPXKSJMX35S5UI7WXFM5TX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5/action/storage_attestation","attest_author":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5/action/author_attestation","sign_citation":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5/action/citation_signature","submit_replication":"https://pith.science/pith/RKBNPXKSJMX35S5UI7WXFM5TX5/action/replication_record"}},"created_at":"2026-05-17T23:48:18.929354+00:00","updated_at":"2026-05-17T23:48:18.929354+00:00"}