{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","arxiv_id":"1906.12330","date":"2019-06-21","proceeding":null,"authors":["Lu Haonan","Seth H. Huang","Tian Ye","Guo Xiuyan"],"abstract":"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 shows that 'star nodes' can learn effective graph-data representation and improve on current methods for the three tasks. Specifically, for graph classification and link prediction, GraphStar outperforms the current state-of-the-art models by 2-5% on several key benchmarks.","url_abs":"https://arxiv.org/abs/1906.12330v1","url_pdf":"https://arxiv.org/pdf/1906.12330v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"graph-star-net-for-generalized-multi-task-1","repo_url":"https://github.com/graph-star-team/graph_star","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"text-classification","task_name":"Text Classification"},{"task_slug":"text-classification-1","task_name":"text-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-dd","task":"Graph Classification","dataset":"D&D","model":"GraphStar","rank_in_archive_order":17,"of":53,"metrics":{"Accuracy":"79.60%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-enzymes","task":"Graph Classification","dataset":"ENZYMES","model":"GraphStar","rank_in_archive_order":20,"of":54,"metrics":{"Accuracy":"67.1%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"GraphStar","rank_in_archive_order":15,"of":74,"metrics":{"Accuracy":"91.2%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"GraphStar","rank_in_archive_order":23,"of":103,"metrics":{"Accuracy":"77.90%"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-citeseer-biased-evaluation","task":"Link Prediction","dataset":"Citeseer (biased evaluation)","model":"GraphStar (double weight on positive examples)","rank_in_archive_order":1,"of":2,"metrics":{"AP":"97.93","AUC":"97.47","Accuracy":"97.7"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-cora-biased-evaluation","task":"Link Prediction","dataset":"Cora (biased evaluation)","model":"GraphStar (double weight on positive examples)","rank_in_archive_order":1,"of":2,"metrics":{"AP":"96.15","AUC":"95.65","Accuracy":"95.9"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-pubmed-biased-evaluation","task":"Link Prediction","dataset":"Pubmed (biased evaluation)","model":"GraphStar (double weight on positive examples)","rank_in_archive_order":1,"of":2,"metrics":{"AP":"98.64","AUC":"97.67","Accuracy":"98.16"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"GraphStar","rank_in_archive_order":56,"of":71,"metrics":{"Accuracy":"71.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"GraphStar","rank_in_archive_order":56,"of":73,"metrics":{"Accuracy":"82.1%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-ppi","task":"Node Classification","dataset":"PPI","model":"GraphStar","rank_in_archive_order":7,"of":24,"metrics":{"F1":"99.4"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"GraphStar","rank_in_archive_order":60,"of":70,"metrics":{"Accuracy":"77.2%"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-imdb","task":"Sentiment Analysis","dataset":"IMDb","model":"GraphStar","rank_in_archive_order":6,"of":49,"metrics":{"Accuracy":"96.0"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-mr","task":"Sentiment Analysis","dataset":"MR","model":"GraphStar","rank_in_archive_order":15,"of":19,"metrics":{"Accuracy":"76.6"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-20news","task":"Text Classification","dataset":"20NEWS","model":"GraphStar","rank_in_archive_order":8,"of":16,"metrics":{"Accuracy":"86.9"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-ohsumed","task":"Text Classification","dataset":"Ohsumed","model":"GraphStar","rank_in_archive_order":7,"of":10,"metrics":{"Accuracy":"64.2"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-r52","task":"Text Classification","dataset":"R52","model":"GraphStar","rank_in_archive_order":2,"of":8,"metrics":{"Accuracy":"95.00"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-r8","task":"Text Classification","dataset":"R8","model":"GraphStar","rank_in_archive_order":12,"of":21,"metrics":{"Accuracy":"97.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1906.12330","atlas_url":"https://app.syntology.ai/?focus=1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.12330"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.12330"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.12330\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1906.12330"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1906.12330\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1906.12330"},"call":"get_concepts_for_paper(arxiv_id=\"1906.12330\")"}],"by_repo":[{"repo":"graph-star-team/graph_star","kind":"named_in_paper","samples":6,"ran":2,"instrument":1,"unverified":4}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1906.12330.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1906.12330.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/graph-star-team/graph_star","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":1,"ran":1,"unverified":4},"n_samples":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"named_in_paper":{"samples":6,"ran":2,"n_ran_checked":1,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"efe1a86fd9a2468e","code_sha256_prefix":"efe1a86fd9a2468e","entry":"clean_str","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"string:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"efe1a86fd9a2468e"},"code_page":"/code/clean-str","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from audqhsid/-Review-CNN-for-Sentence-Classification, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"efe1a86fd9a2468e"}},{"code_sha256":"4697b9faaabb18e9","code_sha256_prefix":"4697b9faaabb18e9","entry":"loadWord2Vec","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataset:str/0/str, use_pretrain_vec:bool/0/bool, vocab:list/1/str, emb_sz:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4697b9faaabb18e9"}},{"code_sha256":"c57e3273b8a890ec","code_sha256_prefix":"c57e3273b8a890ec","entry":"load_data","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"run_gc.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/run_gc.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load-data","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c57e3273b8a890ec"}},{"code_sha256":"a751153e928ee971","code_sha256_prefix":"a751153e928ee971","entry":"load_data","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"run_imdb.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/run_imdb.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load-data","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a751153e928ee971"}},{"code_sha256":"4add35936b25f263","code_sha256_prefix":"4add35936b25f263","entry":"load_data","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"run_lp.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/run_lp.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load-data","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4add35936b25f263"}},{"code_sha256":"378ae7e2907239c5","code_sha256_prefix":"378ae7e2907239c5","entry":"split_train_test","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/split-train-test","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"378ae7e2907239c5"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1cea10634417fce2869db0fdb0ded2005f3ad41bd9a754bdb5ffba5dede7096a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}