{"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/get-df","entry":"get_df","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":8,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":3,"unverified":3},"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":"2410.13098","arxiv_id_is_arxiv":true,"paper":"/paper/a-little-human-data-goes-a-long-way","title":"A Little Human Data Goes A Long Way","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhananjayashok/littlehumandata","path":"llm-utils/predict.py","file_url":"https://github.com/dhananjayashok/littlehumandata/blob/HEAD/llm-utils/predict.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4bde9e27f99624d","code_sha256_prefix":"c4bde9e27f99624d","mcp_get_code":{"code_sha256":"c4bde9e27f99624d"}},{"arxiv_id":"2402.15235","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-collaboration-framework-for","title":"MACRec: a Multi-Agent Collaboration Framework for Recommendation","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzf2000/macrec","path":"macrec/dataset/amazon.py","file_url":"https://github.com/wzf2000/macrec/blob/HEAD/macrec/dataset/amazon.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, wzf2000/macrec when it was checked","code_sha256":"54f2d0461a3cbe0f","code_sha256_prefix":"54f2d0461a3cbe0f","mcp_get_code":{"code_sha256":"54f2d0461a3cbe0f"}},{"arxiv_id":"2311.05795","arxiv_id_is_arxiv":true,"paper":"/paper/improvements-on-uncertainty-quantification","title":"Improvements on Uncertainty Quantification for Node Classification via Distance-Based Regularization","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neoques/graph-posterior-network","path":"generate_all_figs.py","file_url":"https://github.com/neoques/graph-posterior-network/blob/HEAD/generate_all_figs.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":"9d29290e613909a7","code_sha256_prefix":"9d29290e613909a7","mcp_get_code":{"code_sha256":"9d29290e613909a7"}},{"arxiv_id":"2310.17369","arxiv_id_is_arxiv":true,"paper":"/paper/language-and-mental-health-measures-of","title":"Language and Mental Health: Measures of Emotion Dynamics from Text as Linguistic Biosocial Markers","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Priya22/EmotionDynamics","path":"code/uedLib/lib/pre_process.py","file_url":"https://github.com/Priya22/EmotionDynamics/blob/HEAD/code/uedLib/lib/pre_process.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":"ab066d27ea29c686","code_sha256_prefix":"ab066d27ea29c686","mcp_get_code":{"code_sha256":"ab066d27ea29c686"}},{"arxiv_id":"2202.05826","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-algorithm-synthesis-with-recurrent","title":"End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking","date":"2022-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aks2203/deep-thinking","path":"deepthinking/data_analysis/make_table.py","file_url":"https://github.com/aks2203/deep-thinking/blob/HEAD/deepthinking/data_analysis/make_table.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":"04c48fd8b7c02d03","code_sha256_prefix":"04c48fd8b7c02d03","mcp_get_code":{"code_sha256":"04c48fd8b7c02d03"}},{"arxiv_id":"2010.05351","arxiv_id_is_arxiv":true,"paper":"/paper/identifying-melanoma-images-using","title":"Identifying Melanoma Images using EfficientNet Ensemble: Winning Solution to the SIIM-ISIC Melanoma Classification Challenge","date":"2020-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haqishen/SIIM-ISIC-Melanoma-Classification-1st-Place-Solution","path":"dataset.py","file_url":"https://github.com/haqishen/SIIM-ISIC-Melanoma-Classification-1st-Place-Solution/blob/HEAD/dataset.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":"c68e629f4dc92766","code_sha256_prefix":"c68e629f4dc92766","mcp_get_code":{"code_sha256":"c68e629f4dc92766"}},{"arxiv_id":"2008.07528","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-the-spanwise-averaged-navier","title":"Deep learning the spanwise-averaged Navier--Stokes equations","date":null,"month_inferred_from_arxiv_id":"2020-08","title_source":"archive","repo":"b-fg/SANSpy","path":"sanspy/utils.py","file_url":"https://github.com/b-fg/SANSpy/blob/HEAD/sanspy/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":"4f5b653fe64de32d","code_sha256_prefix":"4f5b653fe64de32d","mcp_get_code":{"code_sha256":"4f5b653fe64de32d"}},{"arxiv_id":"1610.00291","arxiv_id_is_arxiv":true,"paper":"/paper/deep-feature-consistent-variational","title":"Deep Feature Consistent Variational Autoencoder","date":"2016-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ku2482/vae.pytorch","path":"utils/anno.py","file_url":"https://github.com/ku2482/vae.pytorch/blob/HEAD/utils/anno.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":"b2870cfaccbe1020","code_sha256_prefix":"b2870cfaccbe1020","mcp_get_code":{"code_sha256":"b2870cfaccbe1020"}}],"record_sha256":"e736f49e781d71dd1b4718a92081be6d3db24cec5a272c44783871f5cd2ac5be","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}