{"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/div","entry":"div","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":13,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":14,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":5,"n_places":14,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":6},"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":"2608.00271","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-00271","title":"A reproducible and extensible framework for benchmarking competing risks survival models","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"BBolosSierra/CompRisksBenchmark","path":"python/class_DeepHit.py","file_url":"https://github.com/BBolosSierra/CompRisksBenchmark/blob/HEAD/python/class_DeepHit.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, BBolosSierra/CompRisksBenchmark when it was checked","code_sha256":"3c4f496c3ef095d8","code_sha256_prefix":"3c4f496c3ef095d8","mcp_get_code":{"code_sha256":"3c4f496c3ef095d8"}},{"arxiv_id":"2410.11042","arxiv_id_is_arxiv":true,"paper":"/paper/persistent-topological-features-in-large","title":"Persistent Topological Features in Large Language Models","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RitAreaSciencePark/ZigZagLLMs","path":"src/benchmark/post_process.py","file_url":"https://github.com/RitAreaSciencePark/ZigZagLLMs/blob/HEAD/src/benchmark/post_process.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":"d1af30de1d59a5a9","code_sha256_prefix":"d1af30de1d59a5a9","mcp_get_code":{"code_sha256":"d1af30de1d59a5a9"}},{"arxiv_id":"2401.17077","arxiv_id_is_arxiv":true,"paper":"/paper/dynamical-survival-analysis-with-controlled","title":"Dynamical Survival Analysis with Controlled Latent States","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linusbleistein/signature_survival","path":"competing_methods/Dynamic_DeepHit/class_DeepLongitudinal.py","file_url":"https://github.com/linusbleistein/signature_survival/blob/HEAD/competing_methods/Dynamic_DeepHit/class_DeepLongitudinal.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, linusbleistein/signature_survival when it was checked","code_sha256":"f612aa615ba6f44d","code_sha256_prefix":"f612aa615ba6f44d","mcp_get_code":{"code_sha256":"f612aa615ba6f44d"}},{"arxiv_id":"2401.17077","arxiv_id_is_arxiv":true,"paper":"/paper/dynamical-survival-analysis-with-controlled","title":"Dynamical Survival Analysis with Controlled Latent States","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linusbleistein/signature_survival","path":"competing_methods/Dynamic_DeepHit/get_main_CF.py","file_url":"https://github.com/linusbleistein/signature_survival/blob/HEAD/competing_methods/Dynamic_DeepHit/get_main_CF.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, linusbleistein/signature_survival when it was checked","code_sha256":"4e83c88decd2d5ae","code_sha256_prefix":"4e83c88decd2d5ae","mcp_get_code":{"code_sha256":"4e83c88decd2d5ae"}},{"arxiv_id":"2312.03612","arxiv_id_is_arxiv":true,"paper":"/paper/physical-symbolic-optimization","title":"Physical Symbolic Optimization","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cavalab/srbench","path":"experiment/symbolic_utils.py","file_url":"https://github.com/cavalab/srbench/blob/HEAD/experiment/symbolic_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, cavalab/srbench, is not in the permissive set Syntology serves inline","code_sha256":"33377c565dd777d5","code_sha256_prefix":"33377c565dd777d5","mcp_get_code":{"code_sha256":"33377c565dd777d5"}},{"arxiv_id":"2305.17190","arxiv_id_is_arxiv":true,"paper":"/paper/multiplication-free-transformer-training-via-1","title":"Multiplication-Free Transformer Training via Piecewise Affine Operations","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/piecewise-affine-multiplication","path":"pam/pam_ops.py","file_url":"https://github.com/epfml/piecewise-affine-multiplication/blob/HEAD/pam/pam_ops.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":"ab41ea0c2bcafe1e","code_sha256_prefix":"ab41ea0c2bcafe1e","mcp_get_code":{"code_sha256":"ab41ea0c2bcafe1e"}},{"arxiv_id":"2209.06257","arxiv_id_is_arxiv":true,"paper":"/paper/scimed-a-computational-framework-for-physics","title":"A computational framework for physics-informed symbolic regression with straightforward integration of domain knowledge","date":"2022-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lironsimon/scimed","path":"algo/ebs/eq_functions.py","file_url":"https://github.com/lironsimon/scimed/blob/HEAD/algo/ebs/eq_functions.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":"1deef6aba037a1dc","code_sha256_prefix":"1deef6aba037a1dc","mcp_get_code":{"code_sha256":"1deef6aba037a1dc"}},{"arxiv_id":"2205.02593","arxiv_id_is_arxiv":true,"paper":"/paper/metgen-a-module-based-entailment-tree","title":"METGEN: A Module-Based Entailment Tree Generation Framework for Answer Explanation","date":"2022-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencent-ailab/metalogic","path":"code/evaluate_metric.py","file_url":"https://github.com/tencent-ailab/metalogic/blob/HEAD/code/evaluate_metric.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":"afa489d8ecd9a6b0","code_sha256_prefix":"afa489d8ecd9a6b0","mcp_get_code":{"code_sha256":"afa489d8ecd9a6b0"}},{"arxiv_id":"2204.10377","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-test-time-adaptation","title":"Contrastive Test-Time Adaptation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DianCh/AdaContrast","path":"target.py","file_url":"https://github.com/DianCh/AdaContrast/blob/HEAD/target.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, DianCh/AdaContrast when it was checked","code_sha256":"2bb0642fa17353c2","code_sha256_prefix":"2bb0642fa17353c2","mcp_get_code":{"code_sha256":"2bb0642fa17353c2"}},{"arxiv_id":"2108.00146","arxiv_id_is_arxiv":true,"paper":"/paper/t-k-ml-ap-adversarial-attacks-to-top-k-multi","title":"T$_k$ML-AP: Adversarial Attacks to Top-$k$ Multi-Label Learning","date":"2021-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"discovershu/TKML-AP","path":"attack.py","file_url":"https://github.com/discovershu/TKML-AP/blob/HEAD/attack.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, discovershu/TKML-AP when it was checked","code_sha256":"23d1e077e7b5b49f","code_sha256_prefix":"23d1e077e7b5b49f","mcp_get_code":{"code_sha256":"23d1e077e7b5b49f"}},{"arxiv_id":"2102.07818","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-to-programmable","title":"Certified Robustness to Programmable Transformations in LSTMs","date":"2021-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foreverzyh/certified_lstms","path":"src/ibp.py","file_url":"https://github.com/foreverzyh/certified_lstms/blob/HEAD/src/ibp.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":"a566b05974471967","code_sha256_prefix":"a566b05974471967","mcp_get_code":{"code_sha256":"a566b05974471967"}},{"arxiv_id":"1909.00986","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-to-adversarial-word","title":"Certified Robustness to Adversarial Word Substitutions","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robinjia/certified-word-sub","path":"src/ibp.py","file_url":"https://github.com/robinjia/certified-word-sub/blob/HEAD/src/ibp.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":"e17b7f13732b4b61","code_sha256_prefix":"e17b7f13732b4b61","mcp_get_code":{"code_sha256":"e17b7f13732b4b61"}},{"arxiv_id":"Rao_Multi-modal_Contrastive_Learning_with_Negative_Sampling_Calibration_for_Phenotypic_Drug_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Rao_Multi-modal_Contrastive_Learning_with_Negative_Sampling_Calibration_for_Phenotypic_Drug_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"biomed-AI/MINER","path":"model/MINER.py","file_url":"https://github.com/biomed-AI/MINER/blob/HEAD/model/MINER.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":"6c98ecf9c1628512","code_sha256_prefix":"6c98ecf9c1628512","mcp_get_code":{"code_sha256":"6c98ecf9c1628512"}},{"arxiv_id":"2023.findings-acl.42","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.42","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JHL-HUST/EIBC-IBP","path":"src/ibp.py","file_url":"https://github.com/JHL-HUST/EIBC-IBP/blob/HEAD/src/ibp.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":"8e07968104c91192","code_sha256_prefix":"8e07968104c91192","mcp_get_code":{"code_sha256":"8e07968104c91192"}}],"record_sha256":"1491617aa78ab92cd7b3f2be89a882044d8a9f691608a86bfda67cf6611fe24f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}