{"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/js-divergence","entry":"js_divergence","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":8,"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":11,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":10,"n_places":12,"n_places_pointer_only":4,"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":3,"ran_fixture":0,"ran":8,"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":"2606.25821","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-25821","title":"SARA: Unlocking Multilingual Knowledge in Mixture-of-Experts via Semantically Anchored Routing Alignment","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"iMoriton/sara","path":"modeling_qwen3_moe_with_js.py","file_url":"https://github.com/iMoriton/sara/blob/HEAD/modeling_qwen3_moe_with_js.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, iMoriton/sara when it was checked","code_sha256":"1e4f524bdfca804d","code_sha256_prefix":"1e4f524bdfca804d","mcp_get_code":{"code_sha256":"1e4f524bdfca804d"}},{"arxiv_id":"2603.07898","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07898","title":"Revisiting Unknowns: Towards Effective and Efficient Open-Set Active Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"chenchenzong/E2OAL","path":"query_strategies.py","file_url":"https://github.com/chenchenzong/E2OAL/blob/HEAD/query_strategies.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, chenchenzong/E2OAL when it was checked","code_sha256":"18c396e48f1f9827","code_sha256_prefix":"18c396e48f1f9827","mcp_get_code":{"code_sha256":"18c396e48f1f9827"}},{"arxiv_id":"2602.08638","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08638","title":"LEFT: Learnable Fusion of Tri-view Tokens for Unsupervised Time Series Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DezhengWang/Left","path":"models/Left/LEFT.py","file_url":"https://github.com/DezhengWang/Left/blob/HEAD/models/Left/LEFT.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, DezhengWang/Left when it was checked","code_sha256":"ab2f7ac61691ad9a","code_sha256_prefix":"ab2f7ac61691ad9a","mcp_get_code":{"code_sha256":"ab2f7ac61691ad9a"}},{"arxiv_id":"2602.00407","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00407","title":"Fed-Listing: Federated Label Distribution Inference in Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suprimnakarmi/Fed-Listing","path":"source_code/Fed-listing/attack_model.py","file_url":"https://github.com/suprimnakarmi/Fed-Listing/blob/HEAD/source_code/Fed-listing/attack_model.py","status":"ran","verification_level":1,"contract_check":null,"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, suprimnakarmi/Fed-Listing when it was checked","code_sha256":"08468507b9dd3580","code_sha256_prefix":"08468507b9dd3580","mcp_get_code":{"code_sha256":"08468507b9dd3580"}},{"arxiv_id":"2505.06904","arxiv_id_is_arxiv":true,"paper":"/paper/ecolang-efficient-and-effective-agent","title":"EcoLANG: Efficient and Effective Agent Communication Language Induction for Social Simulation","date":"2025-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xymou/EcoLANG","path":"code/evaluation_prl.py","file_url":"https://github.com/xymou/EcoLANG/blob/HEAD/code/evaluation_prl.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":"864dbfa40d6e6bdb","code_sha256_prefix":"864dbfa40d6e6bdb","mcp_get_code":{"code_sha256":"864dbfa40d6e6bdb"}},{"arxiv_id":"2404.13696","arxiv_id_is_arxiv":true,"paper":"/paper/clio-real-time-task-driven-open-set-3d-scene","title":"Clio: Real-time Task-Driven Open-Set 3D Scene Graphs","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"mit-spark/clio","path":"clio_batch/information_metrics.py","file_url":"https://github.com/mit-spark/clio/blob/HEAD/clio_batch/information_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81689c2e5f8bb283","code_sha256_prefix":"81689c2e5f8bb283","mcp_get_code":{"code_sha256":"81689c2e5f8bb283"}},{"arxiv_id":"2312.03203","arxiv_id_is_arxiv":true,"paper":"/paper/feature-3dgs-supercharging-3d-gaussian","title":"Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keloee/maskfield","path":"models/losses.py","file_url":"https://github.com/keloee/maskfield/blob/HEAD/models/losses.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":"8814888ea31454d6","code_sha256_prefix":"8814888ea31454d6","mcp_get_code":{"code_sha256":"8814888ea31454d6"}},{"arxiv_id":"2206.07259","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-of-image-scale-and","title":"Self-Supervised Learning of Image Scale and Orientation","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bluedream1121/self-sca-ori","path":"model/loss.py","file_url":"https://github.com/bluedream1121/self-sca-ori/blob/HEAD/model/loss.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":"03e760ff39505b2f","code_sha256_prefix":"03e760ff39505b2f","mcp_get_code":{"code_sha256":"03e760ff39505b2f"}},{"arxiv_id":"2112.09343","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-on-point-clouds-via","title":"Domain Adaptation on Point Clouds via Geometry-Aware Implicits","date":"2021-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhonve/implicitpcda","path":"measurement/calculate_distances.py","file_url":"https://github.com/jhonve/implicitpcda/blob/HEAD/measurement/calculate_distances.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":"6cd4ea67bd085b10","code_sha256_prefix":"6cd4ea67bd085b10","mcp_get_code":{"code_sha256":"6cd4ea67bd085b10"}},{"arxiv_id":"2008.03312","arxiv_id_is_arxiv":true,"paper":"/paper/complete-parameter-inference-for-gw150914","title":"Complete parameter inference for GW150914 using deep learning","date":"2020-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-HPC-Research-Team/GW","path":"evaluate_PCL_test_sh.py","file_url":"https://github.com/AI-HPC-Research-Team/GW/blob/HEAD/evaluate_PCL_test_sh.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":"60396e43cb79e282","code_sha256_prefix":"60396e43cb79e282","mcp_get_code":{"code_sha256":"60396e43cb79e282"}},{"arxiv_id":"2007.11412","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-graining-molecular-dynamics-with-graph","title":"Coarse Graining Molecular Dynamics with Graph Neural Networks","date":"2020-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coarse-graining/cgnet","path":"cgnet/feature/statistics.py","file_url":"https://github.com/coarse-graining/cgnet/blob/HEAD/cgnet/feature/statistics.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":"e0cd62f8f22f0c3e","code_sha256_prefix":"e0cd62f8f22f0c3e","mcp_get_code":{"code_sha256":"e0cd62f8f22f0c3e"}},{"arxiv_id":"aaai_28598","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28598","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zzzzzzzzjy/MMNCD-main","path":"utils/pseudo_label_generation.py","file_url":"https://github.com/zzzzzzzzjy/MMNCD-main/blob/HEAD/utils/pseudo_label_generation.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":"7f4d404544fbb734","code_sha256_prefix":"7f4d404544fbb734","mcp_get_code":{"code_sha256":"7f4d404544fbb734"}}],"record_sha256":"fe095efd38d028b51817286c44deebad35f067963ead08902a9e67454c490bb8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}