{"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/cutoff","entry":"cutoff","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":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":0,"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":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":0},"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":"2605.27374","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-27374","title":"ICG: Improving Cover Image Generation via MLLM-based Prompting and Personalized Preference Alignment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"westlake-repl/PixelRec","path":"code/REC/evaluator/utils.py","file_url":"https://github.com/westlake-repl/PixelRec/blob/HEAD/code/REC/evaluator/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"613c33a07699d085","code_sha256_prefix":"613c33a07699d085","mcp_get_code":{"code_sha256":"613c33a07699d085"}},{"arxiv_id":"2505.10940","arxiv_id_is_arxiv":true,"paper":"/paper/2505-10940","title":"Who You Are Matters: Bridging Topics and Social Roles via LLM-Enhanced Logical Recommendation","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Code2Q/TagCF","path":"recbole/evaluator/utils.py","file_url":"https://github.com/Code2Q/TagCF/blob/HEAD/recbole/evaluator/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"613c33a07699d085","code_sha256_prefix":"613c33a07699d085","mcp_get_code":{"code_sha256":"613c33a07699d085"}},{"arxiv_id":"2309.06789","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-dataset-for-benchmarking-recommender","title":"An Image Dataset for Benchmarking Recommender Systems with Raw Pixels","date":"2023-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"westlake-repl/pixelrec","path":"code/REC/evaluator/utils.py","file_url":"https://github.com/westlake-repl/pixelrec/blob/HEAD/code/REC/evaluator/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"613c33a07699d085","code_sha256_prefix":"613c33a07699d085","mcp_get_code":{"code_sha256":"613c33a07699d085"}},{"arxiv_id":"2204.11046","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-side-information-fusion-for","title":"Decoupled Side Information Fusion for Sequential Recommendation","date":"2022-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIM-SE/DIF-SR","path":"recbole/evaluator/utils.py","file_url":"https://github.com/AIM-SE/DIF-SR/blob/HEAD/recbole/evaluator/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"613c33a07699d085","code_sha256_prefix":"613c33a07699d085","mcp_get_code":{"code_sha256":"613c33a07699d085"}},{"arxiv_id":"2007.04154","arxiv_id_is_arxiv":true,"paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"src/adapted_mtgl/mtgl_test/mtgl.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/src/adapted_mtgl/mtgl_test/mtgl.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":"c947aad279b8d2ae","code_sha256_prefix":"c947aad279b8d2ae","mcp_get_code":{"code_sha256":"c947aad279b8d2ae"}},{"arxiv_id":"1711.02281","arxiv_id_is_arxiv":true,"paper":"/paper/non-autoregressive-neural-machine-translation-1","title":"Non-Autoregressive Neural Machine Translation","date":"2017-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/nonauto-nmt","path":"decode.py","file_url":"https://github.com/salesforce/nonauto-nmt/blob/HEAD/decode.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"143671444bc0de03","code_sha256_prefix":"143671444bc0de03","mcp_get_code":{"code_sha256":"143671444bc0de03"}}],"record_sha256":"96ceaeb16f30a793fa9b1b80f9df092872e74fd50806d702c68316f66f46e81c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}