{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I7SXVFE5SUM6QOR76LINUHF7S5","short_pith_number":"pith:I7SXVFE5","schema_version":"1.0","canonical_sha256":"47e57a949d9519e83a3ff2d0da1cbf9768ea5d8a73ca4fedca5caf4352d8ee64","source":{"kind":"arxiv","id":"1906.12330","version":1},"attestation_state":"computed","paper":{"title":"Graph Star Net for Generalized Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SI","authors_text":"Guo Xiuyan, Lu Haonan, Seth H. Huang, Tian Ye","submitted_at":"2019-06-21T03:05:17Z","abstract_excerpt":"In this work, we present graph star net (GraphStar), a novel and unified graph neural net architecture which utilizes message-passing relay and attention mechanism for multiple prediction tasks - node classification, graph classification and link prediction. GraphStar addresses many earlier challenges facing graph neural nets and achieves non-local representation without increasing the model depth or bearing heavy computational costs. We also propose a new method to tackle topic-specific sentiment analysis based on node classification and text classification as graph classification. Our work s"},"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":"1906.12330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-06-21T03:05:17Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"f6e744ce56ce8f327b8d5aaff45ff0244c7888ea87b4dc32ec9003ed02acddf4","abstract_canon_sha256":"3d35c2230d48cb7e9768a8908ef10bca0b89624a31b319c0e5fc318e5ad8af53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:58.584188Z","signature_b64":"buSAjnApikqpKZnKlcdE98FxFGLY3toRG4OHZHZeUX7IIa/4vT8DBu+QHDqAnW46qNim+KYiWE+GOg66/zv1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47e57a949d9519e83a3ff2d0da1cbf9768ea5d8a73ca4fedca5caf4352d8ee64","last_reissued_at":"2026-05-17T23:41:58.583637Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:58.583637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Star Net for Generalized Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SI","authors_text":"Guo Xiuyan, Lu Haonan, Seth H. Huang, Tian Ye","submitted_at":"2019-06-21T03:05:17Z","abstract_excerpt":"In this work, we present graph star net (GraphStar), a novel and unified graph neural net architecture which utilizes message-passing relay and attention mechanism for multiple prediction tasks - node classification, graph classification and link prediction. GraphStar addresses many earlier challenges facing graph neural nets and achieves non-local representation without increasing the model depth or bearing heavy computational costs. We also propose a new method to tackle topic-specific sentiment analysis based on node classification and text classification as graph classification. Our work s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12330","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":"1906.12330","created_at":"2026-05-17T23:41:58.583724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.12330v1","created_at":"2026-05-17T23:41:58.583724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12330","created_at":"2026-05-17T23:41:58.583724+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7SXVFE5SUM6","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7SXVFE5SUM6QOR7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7SXVFE5","created_at":"2026-05-18T12:33:18.533446+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/I7SXVFE5SUM6QOR76LINUHF7S5","json":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5.json","graph_json":"https://pith.science/api/pith-number/I7SXVFE5SUM6QOR76LINUHF7S5/graph.json","events_json":"https://pith.science/api/pith-number/I7SXVFE5SUM6QOR76LINUHF7S5/events.json","paper":"https://pith.science/paper/I7SXVFE5"},"agent_actions":{"view_html":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5","download_json":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5.json","view_paper":"https://pith.science/paper/I7SXVFE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.12330&json=true","fetch_graph":"https://pith.science/api/pith-number/I7SXVFE5SUM6QOR76LINUHF7S5/graph.json","fetch_events":"https://pith.science/api/pith-number/I7SXVFE5SUM6QOR76LINUHF7S5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5/action/storage_attestation","attest_author":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5/action/author_attestation","sign_citation":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5/action/citation_signature","submit_replication":"https://pith.science/pith/I7SXVFE5SUM6QOR76LINUHF7S5/action/replication_record"}},"created_at":"2026-05-17T23:41:58.583724+00:00","updated_at":"2026-05-17T23:41:58.583724+00:00"}