{"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/normalize-features","entry":"normalize_features","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":20,"n_papers_ran":20,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":10,"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":15,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":20,"n_places_pointer_only":9,"n_places_pointer_only_link_open":3,"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":3,"ran_fixture":3,"ran":9,"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":"2606.09601","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-09601","title":"Assessing Sample Quality in Conditional Generation under Compositional Shift","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"berkerdemirel/faithful-cond-gen","path":"src/faithful_cond_gen/eval/trust_eval/scoring_core.py","file_url":"https://github.com/berkerdemirel/faithful-cond-gen/blob/HEAD/src/faithful_cond_gen/eval/trust_eval/scoring_core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, berkerdemirel/faithful-cond-gen when it was checked","code_sha256":"d668caea3552cf9c","code_sha256_prefix":"d668caea3552cf9c","mcp_get_code":{"code_sha256":"d668caea3552cf9c"}},{"arxiv_id":"2509.26404","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-26404","title":"SeedPrints: Fingerprints Can Even Tell Which Seed Your Large Language Model Was Trained From","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"YnezT0311/SeedPrints","path":"seedprint.py","file_url":"https://github.com/YnezT0311/SeedPrints/blob/HEAD/seedprint.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, YnezT0311/SeedPrints when it was checked","code_sha256":"4caeaca5a2027fa2","code_sha256_prefix":"4caeaca5a2027fa2","mcp_get_code":{"code_sha256":"4caeaca5a2027fa2"}},{"arxiv_id":"2502.19670","arxiv_id_is_arxiv":true,"paper":"/paper/training-robust-graph-neural-networks-by","title":"Training Robust Graph Neural Networks by Modeling Noise Dependencies","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WtaoZhao/GraphGLOW","path":"src/core/model_handler.py","file_url":"https://github.com/WtaoZhao/GraphGLOW/blob/HEAD/src/core/model_handler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, WtaoZhao/GraphGLOW when it was checked","code_sha256":"39cba20da9f36113","code_sha256_prefix":"39cba20da9f36113","mcp_get_code":{"code_sha256":"39cba20da9f36113"}},{"arxiv_id":"2411.02372","arxiv_id_is_arxiv":true,"paper":"/paper/learning-general-purpose-biomedical-volume","title":"Learning General-Purpose Biomedical Volume Representations using Randomized Synthesis","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neel-dey/anatomix","path":"anatomix/registration/registration_infrastructure/features.py","file_url":"https://github.com/neel-dey/anatomix/blob/HEAD/anatomix/registration/registration_infrastructure/features.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab04d4ab57907df5","code_sha256_prefix":"ab04d4ab57907df5","mcp_get_code":{"code_sha256":"ab04d4ab57907df5"}},{"arxiv_id":"2409.14500","arxiv_id_is_arxiv":true,"paper":"/paper/tabgraphs-a-benchmark-and-strong-baselines","title":"TabGraphs: A Benchmark and Strong Baselines for Learning on Graphs with Tabular Node Features","date":"2024-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/tabgraphs","path":"source/ebbs/Base.py","file_url":"https://github.com/yandex-research/tabgraphs/blob/HEAD/source/ebbs/Base.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":"2f4b2024843055fd","code_sha256_prefix":"2f4b2024843055fd","mcp_get_code":{"code_sha256":"2f4b2024843055fd"}},{"arxiv_id":"2409.09867","arxiv_id_is_arxiv":true,"paper":"/paper/towards-kinetic-manipulation-of-the-latent","title":"Towards Kinetic Manipulation of the Latent Space","date":"2024-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PDillis/stylegan3-fun","path":"network_features.py","file_url":"https://github.com/PDillis/stylegan3-fun/blob/HEAD/network_features.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, PDillis/stylegan3-fun (NOASSERTION)","code_sha256":"50b389807d1aa840","code_sha256_prefix":"50b389807d1aa840","mcp_get_code":{"code_sha256":"50b389807d1aa840"}},{"arxiv_id":"2403.15520","arxiv_id_is_arxiv":true,"paper":"/paper/gtc-gnn-transformer-co-contrastive-learning","title":"GTC: GNN-Transformer Co-contrastive Learning for Self-supervised Heterogeneous Graph Representation","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phd-lanyu/gtc","path":"code/self_tools/adj_utils.py","file_url":"https://github.com/phd-lanyu/gtc/blob/HEAD/code/self_tools/adj_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, phd-lanyu/gtc when it was checked","code_sha256":"39cba20da9f36113","code_sha256_prefix":"39cba20da9f36113","mcp_get_code":{"code_sha256":"39cba20da9f36113"}},{"arxiv_id":"2209.00891","arxiv_id_is_arxiv":true,"paper":"/paper/multi-modal-contrastive-representation","title":"Multi-modal Contrastive Representation Learning for Entity Alignment","date":"2022-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzxlin/mclea","path":"src/utils.py","file_url":"https://github.com/lzxlin/mclea/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 WtaoZhao/GraphGLOW, and GitHub detected no licence in that repository when it was checked","code_sha256":"39cba20da9f36113","code_sha256_prefix":"39cba20da9f36113","mcp_get_code":{"code_sha256":"39cba20da9f36113"}},{"arxiv_id":"2112.14438","arxiv_id_is_arxiv":true,"paper":"/paper/deformable-graph-convolutional-networks","title":"Deformable Graph Convolutional Networks","date":"2021-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/DeformableGCN","path":"utils.py","file_url":"https://github.com/mlvlab/DeformableGCN/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 WtaoZhao/GraphGLOW, and GitHub detected no licence in that repository when it was checked","code_sha256":"39cba20da9f36113","code_sha256_prefix":"39cba20da9f36113","mcp_get_code":{"code_sha256":"39cba20da9f36113"}},{"arxiv_id":"2112.13414","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-with-dynamic-convex","title":"Reinforcement Learning with Dynamic Convex Risk Measures","date":"2021-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acoache/rl-dynamicconvexrisk","path":"StatArbitrage/models.py","file_url":"https://github.com/acoache/rl-dynamicconvexrisk/blob/HEAD/StatArbitrage/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, acoache/rl-dynamicconvexrisk when it was checked","code_sha256":"1e29d8be0861ded5","code_sha256_prefix":"1e29d8be0861ded5","mcp_get_code":{"code_sha256":"1e29d8be0861ded5"}},{"arxiv_id":"2105.02216","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-multi-frame-monocular-scene","title":"Self-Supervised Multi-Frame Monocular Scene Flow","date":"2021-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/multi-mono-sf","path":"models/modules_sceneflow.py","file_url":"https://github.com/visinf/multi-mono-sf/blob/HEAD/models/modules_sceneflow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9926e17e3fdfd75d","code_sha256_prefix":"9926e17e3fdfd75d","mcp_get_code":{"code_sha256":"9926e17e3fdfd75d"}},{"arxiv_id":"2009.13603","arxiv_id_is_arxiv":true,"paper":"/paper/visual-pivoting-for-unsupervised-entity","title":"Visual Pivoting for (Unsupervised) Entity Alignment","date":"2020-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/eva","path":"src/utils.py","file_url":"https://github.com/cambridgeltl/eva/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 WtaoZhao/GraphGLOW, and GitHub detected no licence in that repository when it was checked","code_sha256":"39cba20da9f36113","code_sha256_prefix":"39cba20da9f36113","mcp_get_code":{"code_sha256":"39cba20da9f36113"}},{"arxiv_id":"2006.04902","arxiv_id_is_arxiv":true,"paper":"/paper/what-matters-in-unsupervised-optical-flow","title":"What Matters in Unsupervised Optical Flow","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junbongjang/contour-tracking","path":"src/contour_flow_model.py","file_url":"https://github.com/junbongjang/contour-tracking/blob/HEAD/src/contour_flow_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d0f7630cddfa3a3a","code_sha256_prefix":"d0f7630cddfa3a3a","mcp_get_code":{"code_sha256":"d0f7630cddfa3a3a"}},{"arxiv_id":"2002.06757","arxiv_id_is_arxiv":true,"paper":"/paper/entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/IGMC","path":"preprocessing.py","file_url":"https://github.com/muhanzhang/IGMC/blob/HEAD/preprocessing.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":"1e9e875e5b3efe21","code_sha256_prefix":"1e9e875e5b3efe21","mcp_get_code":{"code_sha256":"1e9e875e5b3efe21"}},{"arxiv_id":"2002.06755","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"achalagarwal/gcn-lpa","path":"src/data_loader.py","file_url":"https://github.com/achalagarwal/gcn-lpa/blob/HEAD/src/data_loader.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":"33746814a1d4ff92","code_sha256_prefix":"33746814a1d4ff92","mcp_get_code":{"code_sha256":"33746814a1d4ff92"}},{"arxiv_id":"1911.07249","arxiv_id_is_arxiv":true,"paper":"/paper/the-proper-care-and-feeding-of-camels-how","title":"The Proper Care and Feeding of CAMELS: How Limited Training Data Affects Streamflow Prediction","date":"2019-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gauchm/ealstm_regional_modeling","path":"papercode/datautils.py","file_url":"https://github.com/gauchm/ealstm_regional_modeling/blob/HEAD/papercode/datautils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c37a05f06f05d465","code_sha256_prefix":"c37a05f06f05d465","mcp_get_code":{"code_sha256":"c37a05f06f05d465"}},{"arxiv_id":"1907.08456","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-a-catchment-aware-long-short","title":"Towards Learning Universal, Regional, and Local Hydrological Behaviors via Machine-Learning Applied to Large-Sample Datasets","date":"2019-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kratzert/ealstm_regional_modeling","path":"papercode/datautils.py","file_url":"https://github.com/kratzert/ealstm_regional_modeling/blob/HEAD/papercode/datautils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c37a05f06f05d465","code_sha256_prefix":"c37a05f06f05d465","mcp_get_code":{"code_sha256":"c37a05f06f05d465"}},{"arxiv_id":"1404.5609","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-the-false-discovery-rate-via","title":"Controlling the false discovery rate via knockoffs","date":null,"month_inferred_from_arxiv_id":"2014-04","title_source":"archive","repo":"jrazi/KnockoffOrigins","path":"knockofforigins/gram_matrix.py","file_url":"https://github.com/jrazi/KnockoffOrigins/blob/HEAD/knockofforigins/gram_matrix.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aef36a8aca14b59f","code_sha256_prefix":"aef36a8aca14b59f","mcp_get_code":{"code_sha256":"aef36a8aca14b59f"}},{"arxiv_id":"ijcai2023_0234","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2023_0234","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KellyGong/SparseGAD","path":"utils.py","file_url":"https://github.com/KellyGong/SparseGAD/blob/HEAD/utils.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":"c24e11d91a6e8f6a","code_sha256_prefix":"c24e11d91a6e8f6a","mcp_get_code":{"code_sha256":"c24e11d91a6e8f6a"}},{"arxiv_id":"aaai_25934","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25934","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"arghosh/DiFA","path":"src/models/data_utils.py","file_url":"https://github.com/arghosh/DiFA/blob/HEAD/src/models/data_utils.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":"7260787959e04dee","code_sha256_prefix":"7260787959e04dee","mcp_get_code":{"code_sha256":"7260787959e04dee"}}],"record_sha256":"8353b05ceb2d849d5e1564b9ee19ca1b0bf769522be24b8c6c2b1270ac194ecb","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}