{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4TC3TXQ4VBQFFPZNLA4SMYIKCD","short_pith_number":"pith:4TC3TXQ4","canonical_record":{"source":{"id":"1804.00293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T13:01:24Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1ecfe811ffa649be1acca12b4578059abcfcaa1405088bf11875ac5aba3d4515","abstract_canon_sha256":"e829d6cb3d3b1238446fe359b32d8b8ee4bca710bd1c073b2644c955acbe4df9"},"schema_version":"1.0"},"canonical_sha256":"e4c5b9de1ca86052bf2d583926610a10c871a7947a26be457ef355ead0acee8f","source":{"kind":"arxiv","id":"1804.00293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00293","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00293v2","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00293","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"4TC3TXQ4VBQF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TC3TXQ4VBQFFPZN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TC3TXQ4","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4TC3TXQ4VBQFFPZNLA4SMYIKCD","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T13:01:24Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1ecfe811ffa649be1acca12b4578059abcfcaa1405088bf11875ac5aba3d4515","abstract_canon_sha256":"e829d6cb3d3b1238446fe359b32d8b8ee4bca710bd1c073b2644c955acbe4df9"},"schema_version":"1.0"},"canonical_sha256":"e4c5b9de1ca86052bf2d583926610a10c871a7947a26be457ef355ead0acee8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.486938Z","signature_b64":"dQon+3MHaxcDsfs8NAmh8j/woIWMIrFO2L+Olv31vEiG3KhtyPbr2o5Vg9W6VjZhSLd1NTRbWtu3W409e6elDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c5b9de1ca86052bf2d583926610a10c871a7947a26be457ef355ead0acee8f","last_reissued_at":"2026-05-18T00:18:45.486437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.486437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00293","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTa104BHvkIQj5taWoasJTlq5c64U5lcPtXlzVCa5Pn0K7WVgMBhOPScWtgyHnimxZ+nD0Um74d0/s6ZPvj8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T23:25:10.292062Z"},"content_sha256":"e1841579c02f4cd1a062c4c3693dee00c31f64ab50d3bac109c8d4008db99888","schema_version":"1.0","event_id":"sha256:e1841579c02f4cd1a062c4c3693dee00c31f64ab50d3bac109c8d4008db99888"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4TC3TXQ4VBQFFPZNLA4SMYIKCD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attentional Multilabel Learning over Graphs: A Message Passing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kien Do, Svetha Venkatesh, Thin Nguyen, Truyen Tran","submitted_at":"2018-04-01T13:01:24Z","abstract_excerpt":"We address a largely open problem of multilabel classification over graphs. Unlike traditional vector input, a graph has rich variable-size substructures which are related to the labels in some ways. We believe that uncovering these relations might hold the key to classification performance and explainability. We introduce GAML (Graph Attentional Multi-Label learning), a novel graph neural network that can handle this problem effectively. GAML regards labels as auxiliary nodes and models them in conjunction with the input graph. By applying message passing and attention mechanisms to both the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00293","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XkkUEZnPseV223GXn12LIlV7349KsrffzOcI5iMp4qI8lMRZSDysoPnhZPq/QqDa9wJXdfk/lKbniVuzAtoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T23:25:10.292485Z"},"content_sha256":"7739ad315cbf7cda2772c046dbcdb8c1d132b86d1060eed2c49f3cf9cfdf7339","schema_version":"1.0","event_id":"sha256:7739ad315cbf7cda2772c046dbcdb8c1d132b86d1060eed2c49f3cf9cfdf7339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD/bundle.json","state_url":"https://pith.science/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T23:25:10Z","links":{"resolver":"https://pith.science/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD","bundle":"https://pith.science/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD/bundle.json","state":"https://pith.science/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TC3TXQ4VBQFFPZNLA4SMYIKCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4TC3TXQ4VBQFFPZNLA4SMYIKCD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e829d6cb3d3b1238446fe359b32d8b8ee4bca710bd1c073b2644c955acbe4df9","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T13:01:24Z","title_canon_sha256":"1ecfe811ffa649be1acca12b4578059abcfcaa1405088bf11875ac5aba3d4515"},"schema_version":"1.0","source":{"id":"1804.00293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00293","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00293v2","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00293","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"4TC3TXQ4VBQF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TC3TXQ4VBQFFPZN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TC3TXQ4","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:7739ad315cbf7cda2772c046dbcdb8c1d132b86d1060eed2c49f3cf9cfdf7339","target":"graph","created_at":"2026-05-18T00:18:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We address a largely open problem of multilabel classification over graphs. Unlike traditional vector input, a graph has rich variable-size substructures which are related to the labels in some ways. We believe that uncovering these relations might hold the key to classification performance and explainability. We introduce GAML (Graph Attentional Multi-Label learning), a novel graph neural network that can handle this problem effectively. GAML regards labels as auxiliary nodes and models them in conjunction with the input graph. By applying message passing and attention mechanisms to both the ","authors_text":"Kien Do, Svetha Venkatesh, Thin Nguyen, Truyen Tran","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T13:01:24Z","title":"Attentional Multilabel Learning over Graphs: A Message Passing Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00293","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e1841579c02f4cd1a062c4c3693dee00c31f64ab50d3bac109c8d4008db99888","target":"record","created_at":"2026-05-18T00:18:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e829d6cb3d3b1238446fe359b32d8b8ee4bca710bd1c073b2644c955acbe4df9","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T13:01:24Z","title_canon_sha256":"1ecfe811ffa649be1acca12b4578059abcfcaa1405088bf11875ac5aba3d4515"},"schema_version":"1.0","source":{"id":"1804.00293","kind":"arxiv","version":2}},"canonical_sha256":"e4c5b9de1ca86052bf2d583926610a10c871a7947a26be457ef355ead0acee8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c5b9de1ca86052bf2d583926610a10c871a7947a26be457ef355ead0acee8f","first_computed_at":"2026-05-18T00:18:45.486437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.486437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dQon+3MHaxcDsfs8NAmh8j/woIWMIrFO2L+Olv31vEiG3KhtyPbr2o5Vg9W6VjZhSLd1NTRbWtu3W409e6elDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.486938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1841579c02f4cd1a062c4c3693dee00c31f64ab50d3bac109c8d4008db99888","sha256:7739ad315cbf7cda2772c046dbcdb8c1d132b86d1060eed2c49f3cf9cfdf7339"],"state_sha256":"7de1130d683a3be99fff3a1b67f71c4f1286b9b530a3ac504d8201f7d0612e49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVq36IDJ0VaDCbndSrSvKjYNUyjpR9NLWSu1tmFubP/cjre+1lcV3E5CJ3qTfN0109TblpjvGTmJ2AQfGJ9wAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T23:25:10.296387Z","bundle_sha256":"fe25662f34d4c028a91b9b08602b5d5764fd7dda72e165f22fa3616ffa0eb623"}}