{"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/temporal-relational-ranking-for-stock","title":"Temporal Relational Ranking for Stock Prediction","arxiv_id":"1809.09441","date":"2018-09-25","proceeding":null,"authors":["Fuli Feng","Xiangnan He","Xiang Wang","Cheng Luo","Yiqun Liu","Tat-Seng Chua"],"abstract":"Stock prediction aims to predict the future trends of a stock in order to\nhelp investors to make good investment decisions. Traditional solutions for\nstock prediction are based on time-series models. With the recent success of\ndeep neural networks in modeling sequential data, deep learning has become a\npromising choice for stock prediction.\n  However, most existing deep learning solutions are not optimized towards the\ntarget of investment, i.e., selecting the best stock with the highest expected\nrevenue. Specifically, they typically formulate stock prediction as a\nclassification (to predict stock trend) or a regression problem (to predict\nstock price). More importantly, they largely treat the stocks as independent of\neach other. The valuable signal in the rich relations between stocks (or\ncompanies), such as two stocks are in the same sector and two companies have a\nsupplier-customer relation, is not considered.\n  In this work, we contribute a new deep learning solution, named Relational\nStock Ranking (RSR), for stock prediction. Our RSR method advances existing\nsolutions in two major aspects: 1) tailoring the deep learning models for stock\nranking, and 2) capturing the stock relations in a time-sensitive manner. The\nkey novelty of our work is the proposal of a new component in neural network\nmodeling, named Temporal Graph Convolution, which jointly models the temporal\nevolution and relation network of stocks. To validate our method, we perform\nback-testing on the historical data of two stock markets, NYSE and NASDAQ.\nExtensive experiments demonstrate the superiority of our RSR method. It\noutperforms state-of-the-art stock prediction solutions achieving an average\nreturn ratio of 98% and 71% on NYSE and NASDAQ, respectively.","url_abs":"http://arxiv.org/abs/1809.09441v1","url_pdf":"http://arxiv.org/pdf/1809.09441v1.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":"temporal-relational-ranking-for-stock","repo_url":"https://github.com/hennande/Temporal_Relational_Stock_Ranking","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"AGPL-3.0"}},{"paper_slug":"temporal-relational-ranking-for-stock","repo_url":"https://github.com/HFrost0/TGC_torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"temporal-relational-ranking-for-stock","repo_url":"https://github.com/fulifeng/Temporal_Relational_Stock_Ranking","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"AGPL-3.0"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"relation-network","task_name":"Relation Network"},{"task_slug":"stock-market-prediction","task_name":"Stock Market Prediction"},{"task_slug":"stock-prediction","task_name":"Stock Prediction"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.09441","atlas_url":"https://app.syntology.ai/?focus=1809.09441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.09441"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1809.09441"},"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":"1809.09441"},"call":"get_harvested_code_for_paper(arxiv_id=\"1809.09441\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1809.09441"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.09441\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.09441"},"call":"get_concepts_for_paper(arxiv_id=\"1809.09441\")"}],"by_repo":[{"repo":"hennande/Temporal_Relational_Stock_Ranking","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"HFrost0/TGC_torch","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"fulifeng/Temporal_Relational_Stock_Ranking","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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/1809.09441.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/1809.09441.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/HFrost0/TGC_torch","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/fulifeng/Temporal_Relational_Stock_Ranking","reach":{"status":"ok","spdx":"AGPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hennande/Temporal_Relational_Stock_Ranking","reach":{"status":"ok","spdx":"AGPL-3.0"}}],"summary":{"unverified":1},"n_samples":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"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":{"listed":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"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"},"official_not_harvested":{"repositories":["hennande/Temporal_Relational_Stock_Ranking"],"harvested_for_other_papers":[0],"samples_from_other_repositories":1,"other_repositories":1,"samples_unlocated":0},"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":0,"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","census_is":"Syntology's function-name census ran implementations with this entry name on one shared input per bucket (the positional rank, kind and dtype of each array argument) and counted the distinct output digests (sha256 of the output rounded to 6 decimals). implementations and papers count the compared samples; distinct_outputs counts digests across all buckets; n_buckets is how many shared inputs were used. It is not a statement that any two samples compute one thing, and the name is a string, not an identity.","samples":[{"code_sha256":"f7536769a1ebc8d0","code_sha256_prefix":"f7536769a1ebc8d0","entry":"get_loss","repo":"HFrost0/TGC_torch","repo_kind":"listed","path":"model.py","file_url":"https://github.com/HFrost0/TGC_torch/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-loss","census":{"url":"/census/get-loss","implementations":5,"papers":5,"distinct_outputs":5,"n_buckets":4,"bucket_key":null,"bucket_index":null,"bucket_label":null},"census_bucket_fragment":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HFrost0/TGC_torch when it was checked","mcp_get_code":{"code_sha256":"f7536769a1ebc8d0"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"71e5cd24ab23115a12ab8695aaf3b1bbf7556595530ffd75f209d805e9d68fee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}