{"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":"/code/get-ranking","entry":"get_ranking","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"n_places_pointer_only_link_open":5,"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_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":0},"key_notes":{"n_samples_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_samples_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2403.12033","arxiv_id_is_arxiv":true,"paper":"/paper/hiker-sgg-hierarchical-knowledge-enhanced","title":"HiKER-SGG: Hierarchical Knowledge Enhanced Robust Scene Graph Generation","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangce01/HiKER-SGG","path":"lib/pytorch_misc.py","file_url":"https://github.com/zhangce01/HiKER-SGG/blob/HEAD/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"60d3ab1140ad4eaf","code_sha256_prefix":"60d3ab1140ad4eaf","mcp_get_code":{"code_sha256":"60d3ab1140ad4eaf"}},{"arxiv_id":"2310.20159","arxiv_id_is_arxiv":true,"paper":"/paper/language-guided-visual-question-answering","title":"Language Guided Visual Question Answering: Elevate Your Multimodal Language Model Using Knowledge-Enriched Prompts","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/lg-vqa","path":"guidance/RelTR/lib/pytorch_misc.py","file_url":"https://github.com/declare-lab/lg-vqa/blob/HEAD/guidance/RelTR/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, declare-lab/lg-vqa when it was checked","code_sha256":"a1e587129dd2dfaf","code_sha256_prefix":"a1e587129dd2dfaf","mcp_get_code":{"code_sha256":"a1e587129dd2dfaf"}},{"arxiv_id":"2208.03523","arxiv_id_is_arxiv":true,"paper":"/paper/graph-pooling-with-maximum-weight-k","title":"Generalizing Downsampling from Regular Data to Graphs","date":"2022-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flandolfi/k-mis-pool","path":"kmis/orderings.py","file_url":"https://github.com/flandolfi/k-mis-pool/blob/HEAD/kmis/orderings.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e57d11b933518c88","code_sha256_prefix":"e57d11b933518c88","mcp_get_code":{"code_sha256":"e57d11b933518c88"}},{"arxiv_id":"2110.07483","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-pitfalls-of-analyzing-individual-1","title":"On the Pitfalls of Analyzing Individual Neurons in Language Models","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"technion-cs-nlp/individual-neurons-pitfalls","path":"Gaussian.py","file_url":"https://github.com/technion-cs-nlp/individual-neurons-pitfalls/blob/HEAD/Gaussian.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"30a2855a46bb3a24","code_sha256_prefix":"30a2855a46bb3a24","mcp_get_code":{"code_sha256":"30a2855a46bb3a24"}},{"arxiv_id":"2110.07483","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-pitfalls-of-analyzing-individual-1","title":"On the Pitfalls of Analyzing Individual Neurons in Language Models","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omerant/individual-neurons","path":"LinearSubset.py","file_url":"https://github.com/omerant/individual-neurons/blob/HEAD/LinearSubset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22a5483fe0653ba5","code_sha256_prefix":"22a5483fe0653ba5","mcp_get_code":{"code_sha256":"22a5483fe0653ba5"}},{"arxiv_id":"2107.12309","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-temporal-transformer-for-dynamic","title":"Spatial-Temporal Transformer for Dynamic Scene Graph Generation","date":"2021-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yrcong/STTran","path":"lib/pytorch_misc.py","file_url":"https://github.com/yrcong/STTran/blob/HEAD/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 declare-lab/lg-vqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"a1e587129dd2dfaf","code_sha256_prefix":"a1e587129dd2dfaf","mcp_get_code":{"code_sha256":"a1e587129dd2dfaf"}},{"arxiv_id":"2010.00309","arxiv_id_is_arxiv":true,"paper":"/paper/colake-contextualized-language-and-knowledge","title":"CoLAKE: Contextualized Language and Knowledge Embedding","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"txsun1997/CoLAKE","path":"lama/evaluation_metrics.py","file_url":"https://github.com/txsun1997/CoLAKE/blob/HEAD/lama/evaluation_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c992a67a3fe6661d","code_sha256_prefix":"c992a67a3fe6661d","mcp_get_code":{"code_sha256":"c992a67a3fe6661d"}},{"arxiv_id":"2006.09623","arxiv_id_is_arxiv":true,"paper":"/paper/learning-visual-commonsense-for-robust-scene","title":"Learning Visual Commonsense for Robust Scene Graph Generation","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhecanJamesWang/GLAT_SGG","path":"lib/pytorch_misc.py","file_url":"https://github.com/ZhecanJamesWang/GLAT_SGG/blob/HEAD/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 declare-lab/lg-vqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"a1e587129dd2dfaf","code_sha256_prefix":"a1e587129dd2dfaf","mcp_get_code":{"code_sha256":"a1e587129dd2dfaf"}},{"arxiv_id":"2003.12962","arxiv_id_is_arxiv":true,"paper":"/paper/gps-net-graph-property-sensing-network-for","title":"GPS-Net: Graph Property Sensing Network for Scene Graph Generation","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taksau/GPS-Net","path":"lib/pytorch_misc.py","file_url":"https://github.com/taksau/GPS-Net/blob/HEAD/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 declare-lab/lg-vqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"a1e587129dd2dfaf","code_sha256_prefix":"a1e587129dd2dfaf","mcp_get_code":{"code_sha256":"a1e587129dd2dfaf"}},{"arxiv_id":"1911.03070","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-refinement-of-cross-lingual-word","title":"Interactive Refinement of Cross-Lingual Word Embeddings","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forest-snow/clime-ui","path":"rank_words.py","file_url":"https://github.com/forest-snow/clime-ui/blob/HEAD/rank_words.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bc87aa2db34e64a","code_sha256_prefix":"6bc87aa2db34e64a","mcp_get_code":{"code_sha256":"6bc87aa2db34e64a"}},{"arxiv_id":"1903.03326","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-embedded-routing-network-for-scene","title":"Knowledge-Embedded Routing Network for Scene Graph Generation","date":"2019-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuweihao/KERN","path":"lib/pytorch_misc.py","file_url":"https://github.com/yuweihao/KERN/blob/HEAD/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 declare-lab/lg-vqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"a1e587129dd2dfaf","code_sha256_prefix":"a1e587129dd2dfaf","mcp_get_code":{"code_sha256":"a1e587129dd2dfaf"}},{"arxiv_id":"1812.01880","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-compose-dynamic-tree-structures","title":"Learning to Compose Dynamic Tree Structures for Visual Contexts","date":"2018-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaihuaTang/VCTree-Scene-Graph-Generation","path":"lib/pytorch_misc.py","file_url":"https://github.com/KaihuaTang/VCTree-Scene-Graph-Generation/blob/HEAD/lib/pytorch_misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 declare-lab/lg-vqa, and GitHub detected no licence in that repository when it was checked","code_sha256":"a1e587129dd2dfaf","code_sha256_prefix":"a1e587129dd2dfaf","mcp_get_code":{"code_sha256":"a1e587129dd2dfaf"}}],"record_sha256":"d53601c4f4969089ec6bd50cb1a6163d807339b4eadcbe93fa163af406edfa8c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}