{"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/reduce-value","entry":"reduce_value","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"n_places_pointer_only_link_open":2,"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":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2308.14129","arxiv_id_is_arxiv":true,"paper":"/paper/speed-streaming-partition-and-parallel","title":"SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embedding","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenxi1228/SPEED","path":"ddp_utils.py","file_url":"https://github.com/chenxi1228/SPEED/blob/HEAD/ddp_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, chenxi1228/SPEED when it was checked","code_sha256":"996937099be3e2fa","code_sha256_prefix":"996937099be3e2fa","mcp_get_code":{"code_sha256":"996937099be3e2fa"}},{"arxiv_id":"2306.05862","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-you-may-communicate-less","title":"Lessons from Generalization Error Analysis of Federated Learning: You May Communicate Less Often!","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"romainchor/generalization_fl_icml2024","path":"Additional/distributed_utils.py","file_url":"https://github.com/romainchor/generalization_fl_icml2024/blob/HEAD/Additional/distributed_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":"e73752eb3a5d5a4b","code_sha256_prefix":"e73752eb3a5d5a4b","mcp_get_code":{"code_sha256":"e73752eb3a5d5a4b"}},{"arxiv_id":"2303.01215","arxiv_id_is_arxiv":true,"paper":"/paper/why-and-when-does-local-sgd-generalize-better","title":"Why (and When) does Local SGD Generalize Better than SGD?","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmgxr128/local-sgd","path":"train_imagenet/distributed_utils.py","file_url":"https://github.com/hmgxr128/local-sgd/blob/HEAD/train_imagenet/distributed_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":"e73752eb3a5d5a4b","code_sha256_prefix":"e73752eb3a5d5a4b","mcp_get_code":{"code_sha256":"e73752eb3a5d5a4b"}},{"arxiv_id":"2301.11259","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-language-model-as-multi-task","title":"Domain-Agnostic Molecular Generation with Chemical Feedback","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/MolGen","path":"MolGen/src/distributed_utils.py","file_url":"https://github.com/zjunlp/MolGen/blob/HEAD/MolGen/src/distributed_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from chenxi1228/SPEED, and GitHub detected no licence in that repository when it was checked","code_sha256":"996937099be3e2fa","code_sha256_prefix":"996937099be3e2fa","mcp_get_code":{"code_sha256":"996937099be3e2fa"}},{"arxiv_id":"2212.14454","arxiv_id_is_arxiv":true,"paper":"/paper/meaformer-multi-modal-entity-alignment","title":"MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid","date":"2022-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/MEAformer","path":"src/distributed_utils.py","file_url":"https://github.com/zjukg/MEAformer/blob/HEAD/src/distributed_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from chenxi1228/SPEED, and GitHub detected no licence in that repository when it was checked","code_sha256":"996937099be3e2fa","code_sha256_prefix":"996937099be3e2fa","mcp_get_code":{"code_sha256":"996937099be3e2fa"}},{"arxiv_id":"2210.11298","arxiv_id_is_arxiv":true,"paper":"/paper/tele-knowledge-pre-training-for-fault","title":"Tele-Knowledge Pre-training for Fault Analysis","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackerchenzhuo/ktelebert","path":"KTeleBERT/src/distributed_utils.py","file_url":"https://github.com/hackerchenzhuo/ktelebert/blob/HEAD/KTeleBERT/src/distributed_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":"4fe6de9a59664ee4","code_sha256_prefix":"4fe6de9a59664ee4","mcp_get_code":{"code_sha256":"4fe6de9a59664ee4"}},{"arxiv_id":"2104.11493","arxiv_id_is_arxiv":true,"paper":"/paper/stroke-based-scene-text-erasing-using","title":"Stroke-Based Scene Text Erasing Using Synthetic Data for Training","date":"2021-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tzm-tora/Stroke-Based-Scene-Text-Erasing","path":"src/utils.py","file_url":"https://github.com/tzm-tora/Stroke-Based-Scene-Text-Erasing/blob/HEAD/src/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":"7ced8bebfd8253b0","code_sha256_prefix":"7ced8bebfd8253b0","mcp_get_code":{"code_sha256":"7ced8bebfd8253b0"}}],"record_sha256":"ca16c0d97c5115e2a32687021e19475b7c538769f75fcb3114bf6aceaa81a967","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}