{"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/weighted-mean","entry":"weighted_mean","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":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":13,"n_places_pointer_only":3,"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":2,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":3,"unverified":2},"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":"2505.16732","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-monte-carlo-for-policy","title":"Sequential Monte Carlo for Policy Optimization in Continuous POMDPs","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sahel13/particle-pomdp","path":"ppomdp/smc/_smc.py","file_url":"https://github.com/Sahel13/particle-pomdp/blob/HEAD/ppomdp/smc/_smc.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":"a27646d734705c31","code_sha256_prefix":"a27646d734705c31","mcp_get_code":{"code_sha256":"a27646d734705c31"}},{"arxiv_id":"2412.03795","arxiv_id_is_arxiv":true,"paper":"/paper/samudra-an-ai-global-ocean-emulator-for","title":"Samudra: An AI Global Ocean Emulator for Climate","date":"2024-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m2lines/samudra","path":"src/samudra/aggregator/metrics.py","file_url":"https://github.com/m2lines/samudra/blob/HEAD/src/samudra/aggregator/metrics.py","status":"unverified","verification_level":0,"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":"563fb09148ffe522","code_sha256_prefix":"563fb09148ffe522","mcp_get_code":{"code_sha256":"563fb09148ffe522"}},{"arxiv_id":"2312.03046","arxiv_id_is_arxiv":true,"paper":"/paper/diversified-in-domain-synthesis-with","title":"Diversified in-domain synthesis with efficient fine-tuning for few-shot classification","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vturrisi/disef","path":"fine-tune/src/utils/misc.py","file_url":"https://github.com/vturrisi/disef/blob/HEAD/fine-tune/src/utils/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":"a00b191edbcbba19","code_sha256_prefix":"a00b191edbcbba19","mcp_get_code":{"code_sha256":"a00b191edbcbba19"}},{"arxiv_id":"2310.18555","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.18555","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"tsirif/uLA","path":"ula/utils/metrics.py","file_url":"https://github.com/tsirif/uLA/blob/HEAD/ula/utils/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":"a5a63a80eb3b14b4","code_sha256_prefix":"a5a63a80eb3b14b4","mcp_get_code":{"code_sha256":"a5a63a80eb3b14b4"}},{"arxiv_id":"2309.13944","arxiv_id_is_arxiv":true,"paper":"/paper/provable-training-for-graph-contrastive-1","title":"Provable Training for Graph Contrastive Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VoidHaruhi/POT-GCL","path":"ProGCL/pGRACE/model.py","file_url":"https://github.com/VoidHaruhi/POT-GCL/blob/HEAD/ProGCL/pGRACE/model.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 junxia97/ProGCL, and GitHub detected no licence in that repository when it was checked","code_sha256":"2dff6e858d437842","code_sha256_prefix":"2dff6e858d437842","mcp_get_code":{"code_sha256":"2dff6e858d437842"}},{"arxiv_id":"2303.10931","arxiv_id_is_arxiv":true,"paper":"/paper/approaching-an-unknown-communication-system","title":"Approaching an unknown communication system by latent space exploration and causal inference","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andleb/Approaching-an-unknown-communication-system","path":"dataGenAudio.py","file_url":"https://github.com/andleb/Approaching-an-unknown-communication-system/blob/HEAD/dataGenAudio.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea3936de335d401c","code_sha256_prefix":"ea3936de335d401c","mcp_get_code":{"code_sha256":"ea3936de335d401c"}},{"arxiv_id":"2206.07551","arxiv_id_is_arxiv":true,"paper":"/paper/unknown-aware-domain-adversarial-learning-for","title":"Unknown-Aware Domain Adversarial Learning for Open-Set Domain Adaptation","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joonho-jang/uadal","path":"models/model_UADAL.py","file_url":"https://github.com/joonho-jang/uadal/blob/HEAD/models/model_UADAL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, joonho-jang/uadal when it was checked","code_sha256":"3e2e36c1b10b8499","code_sha256_prefix":"3e2e36c1b10b8499","mcp_get_code":{"code_sha256":"3e2e36c1b10b8499"}},{"arxiv_id":"2110.02027","arxiv_id_is_arxiv":true,"paper":"/paper/debiased-graph-contrastive-learning","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junxia97/ProGCL","path":"pGRACE/model.py","file_url":"https://github.com/junxia97/ProGCL/blob/HEAD/pGRACE/model.py","status":"ran_draft_wrong","verification_level":2,"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, junxia97/ProGCL when it was checked","code_sha256":"2dff6e858d437842","code_sha256_prefix":"2dff6e858d437842","mcp_get_code":{"code_sha256":"2dff6e858d437842"}},{"arxiv_id":"2011.03856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-model-and-ignore-dataset-bias","title":"Learning to Model and Ignore Dataset Bias with Mixed Capacity Ensembles","date":"2020-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrisc36/autobias","path":"autobias/modules/classifier_ensembles.py","file_url":"https://github.com/chrisc36/autobias/blob/HEAD/autobias/modules/classifier_ensembles.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94de706a508f6295","code_sha256_prefix":"94de706a508f6295","mcp_get_code":{"code_sha256":"94de706a508f6295"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-larx/attack_metarl","path":"maml_rl/metalearners/maml_trpo.py","file_url":"https://github.com/nyu-larx/attack_metarl/blob/HEAD/maml_rl/metalearners/maml_trpo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e2447675de7c741","code_sha256_prefix":"9e2447675de7c741","mcp_get_code":{"code_sha256":"9e2447675de7c741"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GeorgeDUT/MetaRLSAS","path":"maml_rl/metalearners/maml_trpo.py","file_url":"https://github.com/GeorgeDUT/MetaRLSAS/blob/HEAD/maml_rl/metalearners/maml_trpo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7eb271fa323b29e","code_sha256_prefix":"f7eb271fa323b29e","mcp_get_code":{"code_sha256":"f7eb271fa323b29e"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shunzh/pytorch-maml-rl","path":"maml_rl/metalearner.py","file_url":"https://github.com/shunzh/pytorch-maml-rl/blob/HEAD/maml_rl/metalearner.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":"84d8e466a8a42e55","code_sha256_prefix":"84d8e466a8a42e55","mcp_get_code":{"code_sha256":"84d8e466a8a42e55"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dragen1860/MAML-Pytorch-RL","path":"maml_rl/metalearner.py","file_url":"https://github.com/dragen1860/MAML-Pytorch-RL/blob/HEAD/maml_rl/metalearner.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":"e1f576439c6726f0","code_sha256_prefix":"e1f576439c6726f0","mcp_get_code":{"code_sha256":"e1f576439c6726f0"}}],"record_sha256":"dc8870141f4af12c9ea6612edd54d2edb8ebfa85aa44ff29941d2cee05a25b27","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}