{"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-log","entry":"get_log","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":1,"unverified":2},"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":"2408.03220","arxiv_id_is_arxiv":true,"paper":"/paper/2408-03220","title":"Masked Random Noise for Communication Efficient Federated Learning","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leopold1423/fedmrn-mm24","path":"utils/logger.py","file_url":"https://github.com/Leopold1423/fedmrn-mm24/blob/HEAD/utils/logger.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, Leopold1423/fedmrn-mm24 when it was checked","code_sha256":"f235ae9d22982450","code_sha256_prefix":"f235ae9d22982450","mcp_get_code":{"code_sha256":"f235ae9d22982450"}},{"arxiv_id":"2402.00205","arxiv_id_is_arxiv":true,"paper":"/paper/decentralised-collaborative-and-privacy","title":"Decentralised, Collaborative, and Privacy-preserving Machine Learning for Multi-Hospital Data","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cleverhans-lab/decaph","path":"utils.py","file_url":"https://github.com/cleverhans-lab/decaph/blob/HEAD/utils.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, cleverhans-lab/decaph when it was checked","code_sha256":"b9310565eacff215","code_sha256_prefix":"b9310565eacff215","mcp_get_code":{"code_sha256":"b9310565eacff215"}},{"arxiv_id":"2312.12585","arxiv_id_is_arxiv":true,"paper":"/paper/badrl-sparse-targeted-backdoor-attack-against","title":"BadRL: Sparse Targeted Backdoor Attack Against Reinforcement Learning","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"7777777cc/code","path":"adbackdoor_MI.py","file_url":"https://github.com/7777777cc/code/blob/HEAD/adbackdoor_MI.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, 7777777cc/code when it was checked","code_sha256":"c34a667e5f615237","code_sha256_prefix":"c34a667e5f615237","mcp_get_code":{"code_sha256":"c34a667e5f615237"}},{"arxiv_id":"2311.00389","arxiv_id_is_arxiv":true,"paper":"/paper/neuralgf-unsupervised-point-normal-estimation-1","title":"NeuralGF: Unsupervised Point Normal Estimation by Learning Neural Gradient Function","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeoQLi/NeuralGF","path":"misc.py","file_url":"https://github.com/LeoQLi/NeuralGF/blob/HEAD/misc.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":"f64e4b1dcf82aa79","code_sha256_prefix":"f64e4b1dcf82aa79","mcp_get_code":{"code_sha256":"f64e4b1dcf82aa79"}},{"arxiv_id":"2310.11523","arxiv_id_is_arxiv":true,"paper":"/paper/group-preference-optimization-few-shot","title":"Group Preference Optimization: Few-Shot Alignment of Large Language Models","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamqd/Group-Preference-Optimization","path":"utils/log.py","file_url":"https://github.com/jamqd/Group-Preference-Optimization/blob/HEAD/utils/log.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":"7a2b06d83e018340","code_sha256_prefix":"7a2b06d83e018340","mcp_get_code":{"code_sha256":"7a2b06d83e018340"}},{"arxiv_id":"Shan_Geminio_Language-Guided_Gradient_Inversion_Attacks_in_Federated_Learning_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Shan_Geminio_Language-Guided_Gradient_Inversion_Attacks_in_Federated_Learning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HKU-TASR/Geminio","path":"breaching/utils.py","file_url":"https://github.com/HKU-TASR/Geminio/blob/HEAD/breaching/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":"01e0d2e3e7ecba69","code_sha256_prefix":"01e0d2e3e7ecba69","mcp_get_code":{"code_sha256":"01e0d2e3e7ecba69"}}],"record_sha256":"7e36f4b58b2b1b2dc9396c61a63ea9091449640bd764797eed1c5d2c2fb2f75e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}