{"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/calc-auc","entry":"calc_auc","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":5,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"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":2,"ran":3,"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":"2410.02604","arxiv_id_is_arxiv":true,"paper":"/paper/long-sequence-recommendation-models-need","title":"Long-Sequence Recommendation Models Need Decoupled Embeddings","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/DARE","path":"utils.py","file_url":"https://github.com/thuml/DARE/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, thuml/DARE when it was checked","code_sha256":"7873f0e1fa137cda","code_sha256_prefix":"7873f0e1fa137cda","mcp_get_code":{"code_sha256":"7873f0e1fa137cda"}},{"arxiv_id":"2308.08487","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-interest-network-for-click-through","title":"Temporal Interest Network for User Response Prediction","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouxy1003/tin","path":"model/bert4rec/train_bert4rec.py","file_url":"https://github.com/zhouxy1003/tin/blob/HEAD/model/bert4rec/train_bert4rec.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, zhouxy1003/tin when it was checked","code_sha256":"2b8f6d1bfbb4bc60","code_sha256_prefix":"2b8f6d1bfbb4bc60","mcp_get_code":{"code_sha256":"2b8f6d1bfbb4bc60"}},{"arxiv_id":"2203.08586","arxiv_id_is_arxiv":true,"paper":"/paper/deep-vanishing-point-detection-geometric","title":"Deep vanishing point detection: Geometric priors make dataset variations vanish","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanconglin/vanishingpoint_houghtransform_gaussiansphere","path":"cluster_nyu.py","file_url":"https://github.com/yanconglin/vanishingpoint_houghtransform_gaussiansphere/blob/HEAD/cluster_nyu.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":"52bdb37b8c80883e","code_sha256_prefix":"52bdb37b8c80883e","mcp_get_code":{"code_sha256":"52bdb37b8c80883e"}},{"arxiv_id":"2007.05201","arxiv_id_is_arxiv":true,"paper":"/paper/rose-a-retinal-oct-angiography-vessel","title":"ROSE: A Retinal OCT-Angiography Vessel Segmentation Dataset and New Model","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iMED-Lab/OCTA-Net-OCTA-Vessel-Segmentation-Network","path":"code/OCTA-Net/evaluation.py","file_url":"https://github.com/iMED-Lab/OCTA-Net-OCTA-Vessel-Segmentation-Network/blob/HEAD/code/OCTA-Net/evaluation.py","status":"ran","verification_level":1,"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":"f1a1dc397cac1ca3","code_sha256_prefix":"f1a1dc397cac1ca3","mcp_get_code":{"code_sha256":"f1a1dc397cac1ca3"}},{"arxiv_id":"2006.06979","arxiv_id_is_arxiv":true,"paper":"/paper/non-negative-bregman-divergence-minimization","title":"Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimation","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MasaKat0/D3RE","path":"CovariateShift/covariate_shift_combinatorial.py","file_url":"https://github.com/MasaKat0/D3RE/blob/HEAD/CovariateShift/covariate_shift_combinatorial.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b8cf683e0270415a","code_sha256_prefix":"b8cf683e0270415a","mcp_get_code":{"code_sha256":"b8cf683e0270415a"}}],"record_sha256":"c6b7fefc6a9cc7b0b273f79f55c8bb6d43e049ea5c2d925590f277196a49aacd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}