{"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/input-fn","entry":"input_fn","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":2,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":7,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":5},"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":"2007.12865","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-for-deep-models-in","title":"Self-supervised Learning for Large-scale Item Recommendations","date":"2020-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"massquantity/LibRecommender","path":"distributed/youtube_distributed.py","file_url":"https://github.com/massquantity/LibRecommender/blob/HEAD/distributed/youtube_distributed.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":"09b79d3c5dcd6a80","code_sha256_prefix":"09b79d3c5dcd6a80","mcp_get_code":{"code_sha256":"09b79d3c5dcd6a80"}},{"arxiv_id":"2001.01828","arxiv_id_is_arxiv":true,"paper":"/paper/listwise-learning-to-rank-by-exploring-unique","title":"Listwise Learning to Rank by Exploring Unique Ratings","date":"2020-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaofengZhu/uRank_uMart","path":"src/model/reader.py","file_url":"https://github.com/XiaofengZhu/uRank_uMart/blob/HEAD/src/model/reader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37f21b0f8c4c6c2e","code_sha256_prefix":"37f21b0f8c4c6c2e","mcp_get_code":{"code_sha256":"37f21b0f8c4c6c2e"}},{"arxiv_id":"1909.03276","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-factorization-network-learning","title":"Adaptive Factorization Network: Learning Adaptive-Order Feature Interactions","date":"2019-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeiyuCheng/AFN-AAAI-20","path":"src/AFN.py","file_url":"https://github.com/WeiyuCheng/AFN-AAAI-20/blob/HEAD/src/AFN.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":"5754b1e205ce1860","code_sha256_prefix":"5754b1e205ce1860","mcp_get_code":{"code_sha256":"5754b1e205ce1860"}},{"arxiv_id":"1903.08548","arxiv_id_is_arxiv":true,"paper":"/paper/learning-convolutional-transforms-for-lossy","title":"Learning Convolutional Transforms for Lossy Point Cloud Geometry Compression","date":"2019-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mauriceqch/pcc_geo_cnn","path":"src/decompress.py","file_url":"https://github.com/mauriceqch/pcc_geo_cnn/blob/HEAD/src/decompress.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":"b3538a22f65deaa2","code_sha256_prefix":"b3538a22f65deaa2","mcp_get_code":{"code_sha256":"b3538a22f65deaa2"}},{"arxiv_id":"1901.05555","arxiv_id_is_arxiv":true,"paper":"/paper/class-balanced-loss-based-on-effective-number","title":"Class-Balanced Loss Based on Effective Number of Samples","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardaecn/class-balanced-loss","path":"tpu/models/experimental/cifar_keras/cifar_keras.py","file_url":"https://github.com/richardaecn/class-balanced-loss/blob/HEAD/tpu/models/experimental/cifar_keras/cifar_keras.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":"57184f395fe4ff8f","code_sha256_prefix":"57184f395fe4ff8f","mcp_get_code":{"code_sha256":"57184f395fe4ff8f"}},{"arxiv_id":"1811.08383","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-shift-module-for-efficient-video","title":"TSM: Temporal Shift Module for Efficient Video Understanding","date":"2018-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunutf/TSM","path":"tsm_fpga/fpga_build/model_tf_split/calib_input_split.py","file_url":"https://github.com/sunutf/TSM/blob/HEAD/tsm_fpga/fpga_build/model_tf_split/calib_input_split.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":"a866d9f9275c700a","code_sha256_prefix":"a866d9f9275c700a","mcp_get_code":{"code_sha256":"a866d9f9275c700a"}},{"arxiv_id":"1807.03039","arxiv_id_is_arxiv":true,"paper":"/paper/glow-generative-flow-with-invertible-1x1","title":"Glow: Generative Flow with Invertible 1x1 Convolutions","date":"2018-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/glow","path":"data_loaders/get_data.py","file_url":"https://github.com/openai/glow/blob/HEAD/data_loaders/get_data.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":"51ab8a3f34c08969","code_sha256_prefix":"51ab8a3f34c08969","mcp_get_code":{"code_sha256":"51ab8a3f34c08969"}}],"record_sha256":"afacf0afc835ecf04f0acf7a13cdc2e43b1c1c3c563c3216f8c41cfbd45b96d1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}