{"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/pickle-load","entry":"pickle_load","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":21,"n_papers_ran":4,"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":20,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":22,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":16},"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.23016","paper":"/paper/arxiv-2603-23016","title":"A Sobering Look at Tabular Data Generation via Probabilistic Circuits","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"april-tools/tabpc","path":"src/util.py","file_url":"https://github.com/april-tools/tabpc/blob/HEAD/src/util.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":"c09fb22594aefb61","mcp_get_code":{"code_sha256":"c09fb22594aefb61"}},{"arxiv_id":"2602.07063","paper":"/paper/arxiv-2602-07063","title":"Video-based Music Generation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"serkansulun/trailer-genre-classification","path":"utils.py","file_url":"https://github.com/serkansulun/trailer-genre-classification/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"55c31b5b64373d2a","mcp_get_code":{"code_sha256":"55c31b5b64373d2a"}},{"arxiv_id":"2502.20750","paper":"/paper/mitigating-hallucinations-in-large-vision-4","title":"Mitigating Hallucinations in Large Vision-Language Models by Adaptively Constraining Information Flow","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaqi5598/adavib","path":"utils.py","file_url":"https://github.com/jiaqi5598/adavib/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84b847bd3c5f6032","mcp_get_code":{"code_sha256":"84b847bd3c5f6032"}},{"arxiv_id":"2410.13230","paper":"/paper/starbucks-improved-training-for-2d-matryoshka","title":"Starbucks: Improved Training for 2D Matryoshka Embeddings","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ielab/starbucks","path":"retrieval/search.py","file_url":"https://github.com/ielab/starbucks/blob/HEAD/retrieval/search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f097c396bbd9036b","mcp_get_code":{"code_sha256":"f097c396bbd9036b"}},{"arxiv_id":"2406.15657","paper":"/paper/first-faster-improved-listwise-reranking-with","title":"FIRST: Faster Improved Listwise Reranking with Single Token Decoding","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gangiswag/llm-reranker","path":"tevatron/src/tevatron/faiss_retriever/__main__.py","file_url":"https://github.com/gangiswag/llm-reranker/blob/HEAD/tevatron/src/tevatron/faiss_retriever/__main__.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4d0f740bd3b8e05f","mcp_get_code":{"code_sha256":"4d0f740bd3b8e05f"}},{"arxiv_id":"2406.14408","paper":"/paper/fvel-interactive-formal-verification","title":"FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Proving","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fveler/fvel","path":"src/data_preprocess/parse_c_function_names.py","file_url":"https://github.com/fveler/fvel/blob/HEAD/src/data_preprocess/parse_c_function_names.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"998c11de12f26b51","mcp_get_code":{"code_sha256":"998c11de12f26b51"}},{"arxiv_id":"2404.18424","paper":"/paper/promptreps-prompting-large-language-models-to","title":"PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document Retrieval","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ielab/promptreps","path":"search.py","file_url":"https://github.com/ielab/promptreps/blob/HEAD/search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d2d5d62b9c53b6d4","mcp_get_code":{"code_sha256":"d2d5d62b9c53b6d4"}},{"arxiv_id":"2404.17283","paper":"/paper/reinforcement-retrieval-leveraging-fine","title":"Reinforcement Retrieval Leveraging Fine-grained Feedback for Fact Checking News Claims with Black-Box LLM","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jadecurl/ffrr","path":"chat_ffrr.py","file_url":"https://github.com/jadecurl/ffrr/blob/HEAD/chat_ffrr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de29b3b8b466ec50","mcp_get_code":{"code_sha256":"de29b3b8b466ec50"}},{"arxiv_id":"2404.17283","paper":"/paper/reinforcement-retrieval-leveraging-fine","title":"Reinforcement Retrieval Leveraging Fine-grained Feedback for Fact Checking News Claims with Black-Box LLM","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jadecurl/ffrr","path":"ffrr_train.py","file_url":"https://github.com/jadecurl/ffrr/blob/HEAD/ffrr_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9d7ec56446e51f13","mcp_get_code":{"code_sha256":"9d7ec56446e51f13"}},{"arxiv_id":"2306.16680","paper":"/paper/exploring-the-representation-power-of-splade","title":"Exploring the Representation Power of SPLADE Models","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ielab/understanding-splade","path":"tevatron/src/tevatron/faiss_retriever/__main__.py","file_url":"https://github.com/ielab/understanding-splade/blob/HEAD/tevatron/src/tevatron/faiss_retriever/__main__.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":"d5944ba894d22f55","mcp_get_code":{"code_sha256":"d5944ba894d22f55"}},{"arxiv_id":"2209.15458","paper":"/paper/towards-general-purpose-representation","title":"Towards General-Purpose Representation Learning of Polygonal Geometries","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gengchenmai/polygon_encoder","path":"polygoncode/polygonembed/data_util.py","file_url":"https://github.com/gengchenmai/polygon_encoder/blob/HEAD/polygoncode/polygonembed/data_util.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":"1ff50601c49c8240","mcp_get_code":{"code_sha256":"1ff50601c49c8240"}},{"arxiv_id":"2209.14458","paper":"/paper/the-chamber-ensemble-generator-limitless-high","title":"The Chamber Ensemble Generator: Limitless High-Quality MIR Data via Generative Modeling","date":"2022-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukewys/chamber-ensemble-generator","path":"utils/file_utils.py","file_url":"https://github.com/lukewys/chamber-ensemble-generator/blob/HEAD/utils/file_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e8b1c08cfe12d960","mcp_get_code":{"code_sha256":"e8b1c08cfe12d960"}},{"arxiv_id":"2209.08212","paper":"/paper/compose-embellish-well-structured-piano","title":"Compose & Embellish: Well-Structured Piano Performance Generation via A Two-Stage Approach","date":"2022-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slseanwu/compose_and_embellish","path":"stage01_compose/utils.py","file_url":"https://github.com/slseanwu/compose_and_embellish/blob/HEAD/stage01_compose/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a452b37f41bd83f1","mcp_get_code":{"code_sha256":"a452b37f41bd83f1"}},{"arxiv_id":"2204.09371","paper":"/paper/is-bert-robust-to-label-noise-a-study-on","title":"Is BERT Robust to Label Noise? A Study on Learning with Noisy Labels in Text Classification","date":"2022-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uds-lsv/bert-lnl","path":"utils.py","file_url":"https://github.com/uds-lsv/bert-lnl/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"482640d1ff940aad","mcp_get_code":{"code_sha256":"482640d1ff940aad"}},{"arxiv_id":"2105.06022","paper":"/paper/principled-exploration-via-optimistic","title":"Principled Exploration via Optimistic Bootstrapping and Backward Induction","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rrmenon10/Bootstrapped-DQN","path":"baselines/common/misc_util.py","file_url":"https://github.com/rrmenon10/Bootstrapped-DQN/blob/HEAD/baselines/common/misc_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"131bfcd55d2d25cc","mcp_get_code":{"code_sha256":"131bfcd55d2d25cc"}},{"arxiv_id":"2010.07916","paper":"/paper/multi-agent-trust-region-policy-optimization","title":"Multi-Agent Trust Region Policy Optimization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hepengli/matrpo","path":"matrpo/common/misc_util.py","file_url":"https://github.com/hepengli/matrpo/blob/HEAD/matrpo/common/misc_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"131bfcd55d2d25cc","mcp_get_code":{"code_sha256":"131bfcd55d2d25cc"}},{"arxiv_id":"1908.06954","paper":"/paper/attention-on-attention-for-image-captioning","title":"Attention on Attention for Image Captioning","date":"2019-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lieberk/Paddle-AoA-Captioning","path":"misc/utils.py","file_url":"https://github.com/Lieberk/Paddle-AoA-Captioning/blob/HEAD/misc/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"05a5570decb65f28","mcp_get_code":{"code_sha256":"05a5570decb65f28"}},{"arxiv_id":"1810.11654","paper":"/paper/3d-mri-brain-tumor-segmentation-using","title":"3D MRI brain tumor segmentation using autoencoder regularization","date":"2018-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trungnhanuchiha/VAE_BRATS2018","path":"utils/utils.py","file_url":"https://github.com/trungnhanuchiha/VAE_BRATS2018/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"80392812b9251abe","mcp_get_code":{"code_sha256":"80392812b9251abe"}},{"arxiv_id":"1805.00907","paper":"/paper/glow-graph-lowering-compiler-techniques-for","title":"Glow: Graph Lowering Compiler Techniques for Neural Networks","date":null,"month_inferred_from_arxiv_id":"2018-05","title_source":"archive","repo":"pytorch/glow","path":"utils/download_datasets_and_models.py","file_url":"https://github.com/pytorch/glow/blob/HEAD/utils/download_datasets_and_models.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":"0b1b9afe65c79f72","mcp_get_code":{"code_sha256":"0b1b9afe65c79f72"}},{"arxiv_id":"1802.05957","paper":"/paper/spectral-normalization-for-generative","title":"Spectral Normalization for Generative Adversarial Networks","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xiaoming-Yu/SingleGAN","path":"util/util.py","file_url":"https://github.com/Xiaoming-Yu/SingleGAN/blob/HEAD/util/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c4b9e0cb79abdf65","mcp_get_code":{"code_sha256":"c4b9e0cb79abdf65"}},{"arxiv_id":"1710.00814","paper":"/paper/detecting-adversarial-attacks-on-neural","title":"Detecting Adversarial Attacks on Neural Network Policies with Visual Foresight","date":"2017-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yenchenlin/rl-attack-detection","path":"baselines/common/misc_util.py","file_url":"https://github.com/yenchenlin/rl-attack-detection/blob/HEAD/baselines/common/misc_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"131bfcd55d2d25cc","mcp_get_code":{"code_sha256":"131bfcd55d2d25cc"}},{"arxiv_id":"1502.03044","paper":"/paper/show-attend-and-tell-neural-image-caption","title":"Show, Attend and Tell: Neural Image Caption Generation with Visual Attention","date":"2015-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaox192/NeuralGuidance","path":"analysis/utils.py","file_url":"https://github.com/shaox192/NeuralGuidance/blob/HEAD/analysis/utils.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":"198d90979fd0346e","mcp_get_code":{"code_sha256":"198d90979fd0346e"}}]}