{"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/compute-weights","entry":"compute_weights","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"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":1,"ran_draft_wrong":4,"ran_fixture":1,"ran":3,"unverified":1},"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":"2605.26849","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26849","title":"Uncertainty-Aware Budget Allocation for Adaptive Test-Time Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"manhitv/UAB","path":"src/utils.py","file_url":"https://github.com/manhitv/UAB/blob/HEAD/src/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, manhitv/UAB when it was checked","code_sha256":"545a1ee00e59c770","code_sha256_prefix":"545a1ee00e59c770","mcp_get_code":{"code_sha256":"545a1ee00e59c770"}},{"arxiv_id":"2604.04287","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04287","title":"Entropy, Disagreement, and the Limits of Foundation Models in Genomics","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"lbcb-sci/GFMs","path":"discriminator/inference.py","file_url":"https://github.com/lbcb-sci/GFMs/blob/HEAD/discriminator/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e84398d63ab4ce8b","code_sha256_prefix":"e84398d63ab4ce8b","mcp_get_code":{"code_sha256":"e84398d63ab4ce8b"}},{"arxiv_id":"2510.04714","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-04714","title":"Object-Centric Representation Learning for Enhanced 3D Semantic Scene Graph Prediction","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"VisualScienceLab-KHU/OCRL-3DSSG-Codes","path":"data_processing/compute_weight_occurrences.py","file_url":"https://github.com/VisualScienceLab-KHU/OCRL-3DSSG-Codes/blob/HEAD/data_processing/compute_weight_occurrences.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, VisualScienceLab-KHU/OCRL-3DSSG-Codes when it was checked","code_sha256":"81efbab1f77a0b49","code_sha256_prefix":"81efbab1f77a0b49","mcp_get_code":{"code_sha256":"81efbab1f77a0b49"}},{"arxiv_id":"2506.04624","arxiv_id_is_arxiv":true,"paper":"/paper/static-word-embeddings-for-sentence-semantic","title":"Static Word Embeddings for Sentence Semantic Representation","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MinishLab/model2vec","path":"model2vec/distill/inference.py","file_url":"https://github.com/MinishLab/model2vec/blob/HEAD/model2vec/distill/inference.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":"c0e21d259c6de207","code_sha256_prefix":"c0e21d259c6de207","mcp_get_code":{"code_sha256":"c0e21d259c6de207"}},{"arxiv_id":"2412.06699","arxiv_id_is_arxiv":true,"paper":"/paper/you-see-it-you-got-it-learning-3d-creation-on","title":"You See it, You Got it: Learning 3D Creation on Pose-Free Videos at Scale","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baaivision/See3D","path":"pipeline_mvd_warp_mix_classifier.py","file_url":"https://github.com/baaivision/See3D/blob/HEAD/pipeline_mvd_warp_mix_classifier.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, baaivision/See3D when it was checked","code_sha256":"3fb59f94f820e2cf","code_sha256_prefix":"3fb59f94f820e2cf","mcp_get_code":{"code_sha256":"3fb59f94f820e2cf"}},{"arxiv_id":"2410.14949","arxiv_id_is_arxiv":true,"paper":"/paper/straightness-of-rectified-flow-a-theoretical","title":"On the Wasserstein Convergence and Straightness of Rectified Flow","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bansal-vansh/rectified-flow","path":"simulated-data/gaussian.py","file_url":"https://github.com/bansal-vansh/rectified-flow/blob/HEAD/simulated-data/gaussian.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, bansal-vansh/rectified-flow when it was checked","code_sha256":"5c14fa88c2b691fa","code_sha256_prefix":"5c14fa88c2b691fa","mcp_get_code":{"code_sha256":"5c14fa88c2b691fa"}},{"arxiv_id":"2407.06315","arxiv_id_is_arxiv":true,"paper":"/paper/shedding-more-light-on-robust-classifiers","title":"Shedding More Light on Robust Classifiers under the lens of Energy-based Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OmnAI-Lab/Robust-Classifiers-under-the-lens-of-EBM","path":"Adversarial ML/WEAT_loss.py","file_url":"https://github.com/OmnAI-Lab/Robust-Classifiers-under-the-lens-of-EBM/blob/HEAD/Adversarial%20ML/WEAT_loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f2e90ad69c40bd2a","code_sha256_prefix":"f2e90ad69c40bd2a","mcp_get_code":{"code_sha256":"f2e90ad69c40bd2a"}},{"arxiv_id":"2106.12112","arxiv_id_is_arxiv":true,"paper":"/paper/bregman-gradient-policy-optimization","title":"Bregman Gradient Policy Optimization","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaosh/bgpo","path":"Algorithms/BGPO.py","file_url":"https://github.com/gaosh/bgpo/blob/HEAD/Algorithms/BGPO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gaosh/bgpo when it was checked","code_sha256":"7ff1e86fbdd99c43","code_sha256_prefix":"7ff1e86fbdd99c43","mcp_get_code":{"code_sha256":"7ff1e86fbdd99c43"}},{"arxiv_id":"2006.14422","arxiv_id_is_arxiv":true,"paper":"/paper/incremental-training-of-graph-neural-networks","title":"Lifelong Learning of Graph Neural Networks for Open-World Node Classification","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lgalke/lifelong-learning","path":"run_experiment.py","file_url":"https://github.com/lgalke/lifelong-learning/blob/HEAD/run_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lgalke/lifelong-learning when it was checked","code_sha256":"35d54d75bfd87097","code_sha256_prefix":"35d54d75bfd87097","mcp_get_code":{"code_sha256":"35d54d75bfd87097"}},{"arxiv_id":"1511.07247","arxiv_id_is_arxiv":true,"paper":"/paper/netvlad-cnn-architecture-for-weakly","title":"NetVLAD: CNN architecture for weakly supervised place recognition","date":"2015-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChienYiChi/kaggle-panda-challenge","path":"src/generate_weights.py","file_url":"https://github.com/ChienYiChi/kaggle-panda-challenge/blob/HEAD/src/generate_weights.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d40e6d73305e43d0","code_sha256_prefix":"d40e6d73305e43d0","mcp_get_code":{"code_sha256":"d40e6d73305e43d0"}}],"record_sha256":"d98324c2e726a06fd21419ad55c49d07fcb9996466728dd627fec172eda3f6ab","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}