{"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-adj","entry":"get_adj","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":4,"n_places_pointer_only_link_open":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_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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2410.19192","arxiv_id_is_arxiv":true,"paper":"/paper/team-topological-evolution-aware-framework","title":"TEAM: Topological Evolution-aware Framework for Traffic Forecasting--Extended Version","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvmduc/TEAM-topo-evo-traffic-forecasting","path":"src/model/detect.py","file_url":"https://github.com/kvmduc/TEAM-topo-evo-traffic-forecasting/blob/HEAD/src/model/detect.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, kvmduc/TEAM-topo-evo-traffic-forecasting when it was checked","code_sha256":"7aef83de3a3ae14b","code_sha256_prefix":"7aef83de3a3ae14b","mcp_get_code":{"code_sha256":"7aef83de3a3ae14b"}},{"arxiv_id":"2405.16869","arxiv_id_is_arxiv":true,"paper":"/paper/mixture-of-modality-knowledge-experts-for","title":"Multiple Heads are Better than One: Mixture of Modality Knowledge Experts for Entity Representation Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/MoMoK","path":"utils/data_util.py","file_url":"https://github.com/zjukg/MoMoK/blob/HEAD/utils/data_util.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, zjukg/MoMoK when it was checked","code_sha256":"fd2799667992935b","code_sha256_prefix":"fd2799667992935b","mcp_get_code":{"code_sha256":"fd2799667992935b"}},{"arxiv_id":"2308.04808","arxiv_id_is_arxiv":true,"paper":"/paper/joint-relation-transformer-for-multi-person","title":"Joint-Relation Transformer for Multi-Person Motion Prediction","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/jrtransformer","path":"utils/util.py","file_url":"https://github.com/mediabrain-sjtu/jrtransformer/blob/HEAD/utils/util.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, mediabrain-sjtu/jrtransformer when it was checked","code_sha256":"e53e8ce70a48a8ed","code_sha256_prefix":"e53e8ce70a48a8ed","mcp_get_code":{"code_sha256":"e53e8ce70a48a8ed"}},{"arxiv_id":"2303.10816","arxiv_id_is_arxiv":true,"paper":"/paper/imf-interactive-multimodal-fusion-model-for","title":"IMF: Interactive Multimodal Fusion Model for Link Prediction","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hestiasky/imf-pytorch","path":"utils/data_util.py","file_url":"https://github.com/hestiasky/imf-pytorch/blob/HEAD/utils/data_util.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 zjukg/MoMoK, and GitHub detected no licence in that repository when it was checked","code_sha256":"fd2799667992935b","code_sha256_prefix":"fd2799667992935b","mcp_get_code":{"code_sha256":"fd2799667992935b"}},{"arxiv_id":"Keetha_AirObject_A_Temporally_Evolving_Graph_Embedding_for_Object_Identification_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Keetha_AirObject_A_Temporally_Evolving_Graph_Embedding_for_Object_Identification_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Nik-V9/AirObject","path":"eval_seq.py","file_url":"https://github.com/Nik-V9/AirObject/blob/HEAD/eval_seq.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6600a1130fb3878c","code_sha256_prefix":"6600a1130fb3878c","mcp_get_code":{"code_sha256":"6600a1130fb3878c"}}],"record_sha256":"0ed7b0dc2dec7bf5c945b8e39a1c37c1942a43c328cdd817caec7098e7731c0f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}