{"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/load-object","entry":"load_object","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":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":5,"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":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":3,"unverified":3},"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":"2609.11977","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-11977","title":"ccamy-1.0: Open Pareto-frontier 35B Intelligence for Co-work","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Accio-Lab/Dressage","path":"dressage/paddock/factory.py","file_url":"https://github.com/Accio-Lab/Dressage/blob/HEAD/dressage/paddock/factory.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"06395c3e4873ebd4","code_sha256_prefix":"06395c3e4873ebd4","mcp_get_code":{"code_sha256":"06395c3e4873ebd4"}},{"arxiv_id":"2410.24197","arxiv_id_is_arxiv":true,"paper":"/paper/generative-modelling-for-mass-mapping-with","title":"Generative modelling for mass-mapping with fast uncertainty quantification","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"astro-informatics/rcGAN","path":"scripts/mass_map/validate.py","file_url":"https://github.com/astro-informatics/rcGAN/blob/HEAD/scripts/mass_map/validate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, astro-informatics/rcGAN when it was checked","code_sha256":"da99be241b17ee82","code_sha256_prefix":"da99be241b17ee82","mcp_get_code":{"code_sha256":"da99be241b17ee82"}},{"arxiv_id":"2404.03539","arxiv_id_is_arxiv":true,"paper":"/paper/is-clip-the-main-roadblock-for-fine-grained","title":"Is CLIP the main roadblock for fine-grained open-world perception?","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"46323f57e9610d8e","code_sha256_prefix":"46323f57e9610d8e","mcp_get_code":{"code_sha256":"46323f57e9610d8e"}},{"arxiv_id":"2404.03539","arxiv_id_is_arxiv":true,"paper":"/paper/is-clip-the-main-roadblock-for-fine-grained","title":"Is CLIP the main roadblock for fine-grained open-world perception?","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorebianchi98/fg-clip","path":"src/utilities.py","file_url":"https://github.com/lorebianchi98/fg-clip/blob/HEAD/src/utilities.py","status":"unverified","verification_level":0,"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, lorebianchi98/fg-clip when it was checked","code_sha256":"811f554b6375d712","code_sha256_prefix":"811f554b6375d712","mcp_get_code":{"code_sha256":"811f554b6375d712"}},{"arxiv_id":"2311.17518","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-is-in-the-fine-grained-details","title":"The devil is in the fine-grained details: Evaluating open-vocabulary object detectors for fine-grained understanding","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorebianchi98/fg-ovd","path":"NoctOWL/eval/fg-ovd/evaluate_map.py","file_url":"https://github.com/lorebianchi98/fg-ovd/blob/HEAD/NoctOWL/eval/fg-ovd/evaluate_map.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lorebianchi98/fg-ovd when it was checked","code_sha256":"46323f57e9610d8e","code_sha256_prefix":"46323f57e9610d8e","mcp_get_code":{"code_sha256":"46323f57e9610d8e"}},{"arxiv_id":"2304.11943","arxiv_id_is_arxiv":true,"paper":"/paper/constructing-tree-based-index-for-efficient","title":"Constructing Tree-based Index for Efficient and Effective Dense Retrieval","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cshaitao/jtr","path":"construct_tree.py","file_url":"https://github.com/cshaitao/jtr/blob/HEAD/construct_tree.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27b57b4a7c14532c","code_sha256_prefix":"27b57b4a7c14532c","mcp_get_code":{"code_sha256":"27b57b4a7c14532c"}},{"arxiv_id":"2209.14371","arxiv_id_is_arxiv":true,"paper":"/paper/pyerrors-a-python-framework-for-error","title":"pyerrors: a python framework for error analysis of Monte Carlo data","date":null,"month_inferred_from_arxiv_id":"2022-09","title_source":"archive","repo":"fjosw/pyerrors","path":"pyerrors/misc.py","file_url":"https://github.com/fjosw/pyerrors/blob/HEAD/pyerrors/misc.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":"727eb2f2721011b5","code_sha256_prefix":"727eb2f2721011b5","mcp_get_code":{"code_sha256":"727eb2f2721011b5"}},{"arxiv_id":"2106.15535","arxiv_id_is_arxiv":true,"paper":"/paper/subgroup-generalization-and-fairness-of-graph","title":"Subgroup Generalization and Fairness of Graph Neural Networks","date":"2021-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theaperdeng/gnn-generalization-fairness","path":"ogb-experiments/ogb-arxiv/agg_subgroup.py","file_url":"https://github.com/theaperdeng/gnn-generalization-fairness/blob/HEAD/ogb-experiments/ogb-arxiv/agg_subgroup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, theaperdeng/gnn-generalization-fairness when it was checked","code_sha256":"f829139c58c468df","code_sha256_prefix":"f829139c58c468df","mcp_get_code":{"code_sha256":"f829139c58c468df"}},{"arxiv_id":"2005.14165","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VachanVY/gpt.jax","path":"model/model.py","file_url":"https://github.com/VachanVY/gpt.jax/blob/HEAD/model/model.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":"2ee40684ab58dcb9","code_sha256_prefix":"2ee40684ab58dcb9","mcp_get_code":{"code_sha256":"2ee40684ab58dcb9"}},{"arxiv_id":"1910.00698","arxiv_id_is_arxiv":true,"paper":"/paper/re-balancing-variational-autoencoder-loss-for","title":"Re-balancing Variational Autoencoder Loss for Molecule Sequence Generation","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoyan1037/Re-balanced-VAE","path":"bo/print_result.py","file_url":"https://github.com/chaoyan1037/Re-balanced-VAE/blob/HEAD/bo/print_result.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":"efe304eb2d1e874e","code_sha256_prefix":"efe304eb2d1e874e","mcp_get_code":{"code_sha256":"efe304eb2d1e874e"}},{"arxiv_id":"1910.00698","arxiv_id_is_arxiv":true,"paper":"/paper/re-balancing-variational-autoencoder-loss-for","title":"Re-balancing Variational Autoencoder Loss for Molecule Sequence Generation","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoyan1037/Re-balanced-VAE","path":"bo/run_bo.py","file_url":"https://github.com/chaoyan1037/Re-balanced-VAE/blob/HEAD/bo/run_bo.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":"0a5b664a833db116","code_sha256_prefix":"0a5b664a833db116","mcp_get_code":{"code_sha256":"0a5b664a833db116"}},{"arxiv_id":"1904.11088","arxiv_id_is_arxiv":true,"paper":"/paper/d-vae-a-variational-autoencoder-for-directed","title":"D-VAE: A Variational Autoencoder for Directed Acyclic Graphs","date":"2019-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/D-VAE","path":"util.py","file_url":"https://github.com/muhanzhang/D-VAE/blob/HEAD/util.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":"efe304eb2d1e874e","code_sha256_prefix":"efe304eb2d1e874e","mcp_get_code":{"code_sha256":"efe304eb2d1e874e"}},{"arxiv_id":"1402.4102","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-gradient-hamiltonian-monte-carlo","title":"Stochastic Gradient Hamiltonian Monte Carlo","date":"2014-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JavierAntoran/Bayesian-Neural-Networks","path":"src/utils.py","file_url":"https://github.com/JavierAntoran/Bayesian-Neural-Networks/blob/HEAD/src/utils.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":"8bf151fd95debad7","code_sha256_prefix":"8bf151fd95debad7","mcp_get_code":{"code_sha256":"8bf151fd95debad7"}}],"record_sha256":"7b01cd6258eec98d87a5454ae7c3033779b39c348c824d502118ff92e2dac725","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}