{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/prepare","entry":"prepare","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":17,"n_papers_ran":7,"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":18,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":8,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"unverified":12},"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":"2410.12288","paper":"/paper/a-prompt-based-knowledge-graph-foundation","title":"A Prompt-Based Knowledge Graph Foundation Model for Universal In-Context Reasoning","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/KG-ICL","path":"src/pretrain.py","file_url":"https://github.com/nju-websoft/KG-ICL/blob/HEAD/src/pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"689e4c87fd830409","mcp_get_code":{"code_sha256":"689e4c87fd830409"}},{"arxiv_id":"2410.12288","paper":"/paper/a-prompt-based-knowledge-graph-foundation","title":"A Prompt-Based Knowledge Graph Foundation Model for Universal In-Context Reasoning","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/KG-ICL","path":"src/evaluation.py","file_url":"https://github.com/nju-websoft/KG-ICL/blob/HEAD/src/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"2d01fea38435b564","mcp_get_code":{"code_sha256":"2d01fea38435b564"}},{"arxiv_id":"2409.00587","paper":"/paper/flux-that-plays-music","title":"FLUX that Plays Music","date":"2024-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feizc/fluxmusic","path":"sample.py","file_url":"https://github.com/feizc/fluxmusic/blob/HEAD/sample.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"fb7ac27a448677a1","mcp_get_code":{"code_sha256":"fb7ac27a448677a1"}},{"arxiv_id":"2404.08608","paper":"/paper/hyperbolic-delaunay-geometric-alignment","title":"Hyperbolic Delaunay Geometric Alignment","date":"2024-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anissmedbouhi/hyperdga","path":"lib/miscs/pathorganizer.py","file_url":"https://github.com/anissmedbouhi/hyperdga/blob/HEAD/lib/miscs/pathorganizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"914b6c50d0afeb27","mcp_get_code":{"code_sha256":"914b6c50d0afeb27"}},{"arxiv_id":"2403.19216","paper":"/paper/are-large-language-models-good-at-utility","title":"Are Large Language Models Good at Utility Judgments?","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ict-bigdatalab/utility_judgments","path":"utils/utils.py","file_url":"https://github.com/ict-bigdatalab/utility_judgments/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7c22b5b0ce18038b","mcp_get_code":{"code_sha256":"7c22b5b0ce18038b"}},{"arxiv_id":"2402.16347","paper":"/paper/codes-towards-building-open-source-language","title":"CodeS: Towards Building Open-source Language Models for Text-to-SQL","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruckbreasoning/codes","path":"tokenize_pt_corpus.py","file_url":"https://github.com/ruckbreasoning/codes/blob/HEAD/tokenize_pt_corpus.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e459a1d6427bf16a","mcp_get_code":{"code_sha256":"e459a1d6427bf16a"}},{"arxiv_id":"2311.02401","paper":"/paper/barcodebert-transformers-for-biodiversity","title":"BarcodeBERT: Transformers for Biodiversity Analysis","date":"2023-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bioscan-ml/BarcodeBERT","path":"barcodebert/utils.py","file_url":"https://github.com/bioscan-ml/BarcodeBERT/blob/HEAD/barcodebert/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7648cdeb15ca24f3","mcp_get_code":{"code_sha256":"7648cdeb15ca24f3"}},{"arxiv_id":"2308.06405","paper":"/paper/white-box-membership-inference-attacks","title":"White-box Membership Inference Attacks against Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":"archive","repo":"py85252876/GSA","path":"Imagen/gen_l2_gradients_Imagen.py","file_url":"https://github.com/py85252876/GSA/blob/HEAD/Imagen/gen_l2_gradients_Imagen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c1e526566040ae5a","mcp_get_code":{"code_sha256":"c1e526566040ae5a"}},{"arxiv_id":"2305.17005","paper":"/paper/aggregating-capacity-in-fl-through-successive","title":"Aggregating Capacity in FL through Successive Layer Training for Computationally-Constrained Devices","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k1l1/slt","path":"run_fl.py","file_url":"https://github.com/k1l1/slt/blob/HEAD/run_fl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09027058830d7ecf","mcp_get_code":{"code_sha256":"09027058830d7ecf"}},{"arxiv_id":"2305.14343","paper":"/paper/video-prediction-models-as-rewards-for","title":"Video Prediction Models as Rewards for Reinforcement Learning","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alescontrela/viper_rl","path":"viper_rl/videogpt/data.py","file_url":"https://github.com/Alescontrela/viper_rl/blob/HEAD/viper_rl/videogpt/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d189db7683bb8237","mcp_get_code":{"code_sha256":"d189db7683bb8237"}},{"arxiv_id":"2212.01548","paper":"/paper/fedrolex-model-heterogeneous-federated","title":"FedRolex: Model-Heterogeneous Federated Learning with Rolling Sub-Model Extraction","date":"2022-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k1l1/SLT","path":"run_fl.py","file_url":"https://github.com/k1l1/SLT/blob/HEAD/run_fl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22f89a73c84ff63c","mcp_get_code":{"code_sha256":"22f89a73c84ff63c"}},{"arxiv_id":"2206.03065","paper":"/paper/universal-speech-enhancement-with-score-based","title":"Universal Speech Enhancement with Score-based Diffusion","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"line/open-universe","path":"open_universe/bin/eval_metrics.py","file_url":"https://github.com/line/open-universe/blob/HEAD/open_universe/bin/eval_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4dbbc03ec894b2c1","mcp_get_code":{"code_sha256":"4dbbc03ec894b2c1"}},{"arxiv_id":"2103.15316","paper":"/paper/whitening-sentence-representations-for-better","title":"Whitening Sentence Representations for Better Semantics and Faster Retrieval","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autoliuweijie/bert-whitening-pytorch","path":"eval_with_whitening(nli).py","file_url":"https://github.com/autoliuweijie/bert-whitening-pytorch/blob/HEAD/eval_with_whitening%28nli%29.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ca27cd7321dc94d","mcp_get_code":{"code_sha256":"9ca27cd7321dc94d"}},{"arxiv_id":"2103.15316","paper":"/paper/whitening-sentence-representations-for-better","title":"Whitening Sentence Representations for Better Semantics and Faster Retrieval","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autoliuweijie/bert-whitening-pytorch","path":"eval_with_whitening(target).py","file_url":"https://github.com/autoliuweijie/bert-whitening-pytorch/blob/HEAD/eval_with_whitening%28target%29.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41a1326c23b14192","mcp_get_code":{"code_sha256":"41a1326c23b14192"}},{"arxiv_id":"1902.08153","paper":"/paper/learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZouJiu1/LSQplus","path":"quantization/lsqquantize_V1.py","file_url":"https://github.com/ZouJiu1/LSQplus/blob/HEAD/quantization/lsqquantize_V1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"bd2c949ff15695e5","mcp_get_code":{"code_sha256":"bd2c949ff15695e5"}},{"arxiv_id":"1804.00097","paper":"/paper/adversarial-attacks-and-defences-competition","title":"Adversarial Attacks and Defences Competition","date":"2018-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/nips17-adversarial-attack","path":"fcn_models/resnet_layer.py","file_url":"https://github.com/pfnet-research/nips17-adversarial-attack/blob/HEAD/fcn_models/resnet_layer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27cda1ed035e96df","mcp_get_code":{"code_sha256":"27cda1ed035e96df"}},{"arxiv_id":"1512.08849","paper":"/paper/learning-natural-language-inference-with-lstm","title":"Learning Natural Language Inference with LSTM","date":"2015-12-30","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":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"24e697458511d16e","mcp_get_code":{"code_sha256":"24e697458511d16e"}},{"arxiv_id":"1509.06664","paper":"/paper/reasoning-about-entailment-with-neural","title":"Reasoning about Entailment with Neural Attention","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junfenglx/reasoning_attention","path":"snli_reasoning_attention.py","file_url":"https://github.com/junfenglx/reasoning_attention/blob/HEAD/snli_reasoning_attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24e697458511d16e","mcp_get_code":{"code_sha256":"24e697458511d16e"}},{"arxiv_id":"2024.naacl-long.220","paper":null,"title":"arXiv:2024.naacl-long.220","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ondovb/nCloze","path":"Wang2023/PrepareClothForT2T.py","file_url":"https://github.com/ondovb/nCloze/blob/HEAD/Wang2023/PrepareClothForT2T.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"280cd27fafef7677","mcp_get_code":{"code_sha256":"280cd27fafef7677"}}]}