{"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/initialize-model","entry":"initialize_model","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":15,"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":17,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":17,"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":1,"ran_fixture":0,"ran":7,"unverified":9},"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":"2603.02913","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-02913","title":"Eliciting Numerical Predictive Distributions of LLMs Without Autoregression","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"kasia-kobalczyk/guess_llm","path":"src/guess_llm/datasets/get_llm_data.py","file_url":"https://github.com/kasia-kobalczyk/guess_llm/blob/HEAD/src/guess_llm/datasets/get_llm_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, kasia-kobalczyk/guess_llm (NOASSERTION)","code_sha256":"1bfbe98283f252b4","code_sha256_prefix":"1bfbe98283f252b4","mcp_get_code":{"code_sha256":"1bfbe98283f252b4"}},{"arxiv_id":"2509.26224","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-26224","title":"Type-Less yet Type-Aware Inductive Link Prediction with Pretrained Language Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"sisinflab/tyler","path":"ITLP/initialization_utils.py","file_url":"https://github.com/sisinflab/tyler/blob/HEAD/ITLP/initialization_utils.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, sisinflab/tyler when it was checked","code_sha256":"0e55727d683c37b5","code_sha256_prefix":"0e55727d683c37b5","mcp_get_code":{"code_sha256":"0e55727d683c37b5"}},{"arxiv_id":"2506.18434","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.18434","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"fruffini/PEFT_Prognosis","path":"src/utils/util_model_tab.py","file_url":"https://github.com/fruffini/PEFT_Prognosis/blob/HEAD/src/utils/util_model_tab.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, fruffini/PEFT_Prognosis when it was checked","code_sha256":"dbe660974bb7b382","code_sha256_prefix":"dbe660974bb7b382","mcp_get_code":{"code_sha256":"dbe660974bb7b382"}},{"arxiv_id":"2506.05768","arxiv_id_is_arxiv":true,"paper":"/paper/aanet-virtual-screening-under-structural","title":"AANet: Virtual Screening under Structural Uncertainty via Alignment and Aggregation","date":"2025-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CAODH/EquiScore","path":"utils/utils.py","file_url":"https://github.com/CAODH/EquiScore/blob/HEAD/utils/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":"b15cc5c53ff9d463","code_sha256_prefix":"b15cc5c53ff9d463","mcp_get_code":{"code_sha256":"b15cc5c53ff9d463"}},{"arxiv_id":"2407.01094","arxiv_id_is_arxiv":true,"paper":"/paper/evaluation-of-text-to-video-generation-models","title":"Evaluation of Text-to-Video Generation Models: A Dynamics Perspective","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingxiangl/devil","path":"metrics_utils/variance_video_net.py","file_url":"https://github.com/mingxiangl/devil/blob/HEAD/metrics_utils/variance_video_net.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, mingxiangl/devil when it was checked","code_sha256":"6a9436664797357f","code_sha256_prefix":"6a9436664797357f","mcp_get_code":{"code_sha256":"6a9436664797357f"}},{"arxiv_id":"2405.18217","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-inter-concept-relationships-in","title":"Understanding Inter-Concept Relationships in Concept-Based Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naveenr414/Concept-Learning","path":"cem/experiments/cbm_models.py","file_url":"https://github.com/naveenr414/Concept-Learning/blob/HEAD/cem/experiments/cbm_models.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, naveenr414/Concept-Learning when it was checked","code_sha256":"b18555b57615e2e7","code_sha256_prefix":"b18555b57615e2e7","mcp_get_code":{"code_sha256":"b18555b57615e2e7"}},{"arxiv_id":"2404.18905","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-critical-treatment-effect-bias-in","title":"Detecting critical treatment effect bias in small subgroups","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaabmar/kernel-test-bias","path":"src/experiment_utils.py","file_url":"https://github.com/jaabmar/kernel-test-bias/blob/HEAD/src/experiment_utils.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":"ea617f3766473da5","code_sha256_prefix":"ea617f3766473da5","mcp_get_code":{"code_sha256":"ea617f3766473da5"}},{"arxiv_id":"2401.06853","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-can-learn-temporal","title":"Large Language Models Can Learn Temporal Reasoning","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiongsiheng/tg-llm","path":"src/Inference_in_context_learning_ppl.py","file_url":"https://github.com/xiongsiheng/tg-llm/blob/HEAD/src/Inference_in_context_learning_ppl.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":"04baeed1a6087e14","code_sha256_prefix":"04baeed1a6087e14","mcp_get_code":{"code_sha256":"04baeed1a6087e14"}},{"arxiv_id":"2305.19534","arxiv_id_is_arxiv":true,"paper":"/paper/recasting-self-attention-with-holographic","title":"Recasting Self-Attention with Holographic Reduced Representations","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FutureComputing4AI/Hrrformer","path":"malware/hrrformer_mgpu.py","file_url":"https://github.com/FutureComputing4AI/Hrrformer/blob/HEAD/malware/hrrformer_mgpu.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":"a98da1a55cc51929","code_sha256_prefix":"a98da1a55cc51929","mcp_get_code":{"code_sha256":"a98da1a55cc51929"}},{"arxiv_id":"2305.19534","arxiv_id_is_arxiv":true,"paper":"/paper/recasting-self-attention-with-holographic","title":"Recasting Self-Attention with Holographic Reduced Representations","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuromorphiccomputationresearchprogram/hrrformer","path":"image/hrrformer_mgpu.py","file_url":"https://github.com/neuromorphiccomputationresearchprogram/hrrformer/blob/HEAD/image/hrrformer_mgpu.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":"4f1a5274115568d4","code_sha256_prefix":"4f1a5274115568d4","mcp_get_code":{"code_sha256":"4f1a5274115568d4"}},{"arxiv_id":"2305.19534","arxiv_id_is_arxiv":true,"paper":"/paper/recasting-self-attention-with-holographic","title":"Recasting Self-Attention with Holographic Reduced Representations","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuromorphiccomputationresearchprogram/hrrformer","path":"retrieval/hrrformer_mgpu.py","file_url":"https://github.com/neuromorphiccomputationresearchprogram/hrrformer/blob/HEAD/retrieval/hrrformer_mgpu.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":"c574416e3c30908b","code_sha256_prefix":"c574416e3c30908b","mcp_get_code":{"code_sha256":"c574416e3c30908b"}},{"arxiv_id":"2211.13319","arxiv_id_is_arxiv":true,"paper":"/paper/make-a-story-visual-memory-conditioned","title":"Make-A-Story: Visual Memory Conditioned Consistent Story Generation","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-vision/make-a-story","path":"eval_backgound_classifier.py","file_url":"https://github.com/ubc-vision/make-a-story/blob/HEAD/eval_backgound_classifier.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":"44ac3ddfe6b3c751","code_sha256_prefix":"44ac3ddfe6b3c751","mcp_get_code":{"code_sha256":"44ac3ddfe6b3c751"}},{"arxiv_id":"2202.05167","arxiv_id_is_arxiv":true,"paper":"/paper/class-distance-weighted-cross-entropy-loss","title":"Class Distance Weighted Cross-Entropy Loss for Ulcerative Colitis Severity Estimation","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GorkemP/labeled-images-for-ulcerative-colitis","path":"utils/provider.py","file_url":"https://github.com/GorkemP/labeled-images-for-ulcerative-colitis/blob/HEAD/utils/provider.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":"4bc29aa65d1053ba","code_sha256_prefix":"4bc29aa65d1053ba","mcp_get_code":{"code_sha256":"4bc29aa65d1053ba"}},{"arxiv_id":"2111.15144","arxiv_id_is_arxiv":true,"paper":"/paper/decoding-the-protein-ligand-interactions","title":"Decoding the Protein-ligand Interactions Using Parallel Graph Neural Networks","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkkchem/pf-gnn_pli","path":"GNNp/utils_gnn.py","file_url":"https://github.com/nkkchem/pf-gnn_pli/blob/HEAD/GNNp/utils_gnn.py","status":"ran","verification_level":1,"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":"f41d78d81e42b5b7","code_sha256_prefix":"f41d78d81e42b5b7","mcp_get_code":{"code_sha256":"f41d78d81e42b5b7"}},{"arxiv_id":"2105.10026","arxiv_id_is_arxiv":true,"paper":"/paper/improving-generation-and-evaluation-of-visual","title":"Improving Generation and Evaluation of Visual Stories via Semantic Consistency","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adymaharana/StoryViz","path":"train_classifier.py","file_url":"https://github.com/adymaharana/StoryViz/blob/HEAD/train_classifier.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":"d6b963ff0de4fe07","code_sha256_prefix":"d6b963ff0de4fe07","mcp_get_code":{"code_sha256":"d6b963ff0de4fe07"}},{"arxiv_id":"2010.09080","arxiv_id_is_arxiv":true,"paper":"/paper/poisoned-classifiers-are-not-only-backdoored-1","title":"Poisoned classifiers are not only backdoored, they are fundamentally broken","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/breaking-poisoned-classifier","path":"code/badnet/utils.py","file_url":"https://github.com/locuslab/breaking-poisoned-classifier/blob/HEAD/code/badnet/utils.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":"430095ea902452ea","code_sha256_prefix":"430095ea902452ea","mcp_get_code":{"code_sha256":"430095ea902452ea"}},{"arxiv_id":"1806.01531","arxiv_id_is_arxiv":true,"paper":"/paper/tafe-net-task-aware-feature-embeddings-for","title":"Deep Mixture of Experts via Shallow Embedding","date":"2018-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RyanKim17920/DeepMoE","path":"traintest.py","file_url":"https://github.com/RyanKim17920/DeepMoE/blob/HEAD/traintest.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":"a0ff1e5387c04771","code_sha256_prefix":"a0ff1e5387c04771","mcp_get_code":{"code_sha256":"a0ff1e5387c04771"}}],"record_sha256":"9d484956c6099acdc80bd4704d462bf85ae8c2096ff2ad76a8784f0348f2fe44","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}