{"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/initialize","entry":"initialize","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":6,"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":15,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":6,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":15,"n_places_pointer_only":6,"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":5,"ran_fixture":1,"ran":7,"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":"2605.28589","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-28589","title":"Thinned Mean Field Langevin Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hudsonchen/thinned_mfld","path":"mfld.py","file_url":"https://github.com/hudsonchen/thinned_mfld/blob/HEAD/mfld.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, hudsonchen/thinned_mfld when it was checked","code_sha256":"e21f350ed6711088","code_sha256_prefix":"e21f350ed6711088","mcp_get_code":{"code_sha256":"e21f350ed6711088"}},{"arxiv_id":"2505.15437","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-temperature-scaling-with-conformal","title":"Adaptive Temperature Scaling with Conformal Prediction","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stat-ml/conformal_probability_calibration","path":"caliblab/calibrators/conformal_mass_threshold_calibrator.py","file_url":"https://github.com/stat-ml/conformal_probability_calibration/blob/HEAD/caliblab/calibrators/conformal_mass_threshold_calibrator.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, stat-ml/conformal_probability_calibration when it was checked","code_sha256":"d2b24a216f25f25e","code_sha256_prefix":"d2b24a216f25f25e","mcp_get_code":{"code_sha256":"d2b24a216f25f25e"}},{"arxiv_id":"2406.14017","arxiv_id_is_arxiv":true,"paper":"/paper/eager-two-stream-generative-recommender-with-1","title":"EAGER: Two-Stream Generative Recommender with Behavior-Semantic Collaboration","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzz/EAGER","path":"EAGER/lib/KmeansTree.py","file_url":"https://github.com/yewzz/EAGER/blob/HEAD/EAGER/lib/KmeansTree.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yewzz/EAGER when it was checked","code_sha256":"74f85d8cb945ff78","code_sha256_prefix":"74f85d8cb945ff78","mcp_get_code":{"code_sha256":"74f85d8cb945ff78"}},{"arxiv_id":"2404.08263","arxiv_id_is_arxiv":true,"paper":"/paper/relational-prompt-based-pre-trained-language","title":"Relational Prompt-based Pre-trained Language Models for Social Event Detection","date":"2024-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/rplm_sed","path":"RPLM-SED/train_long_tail.py","file_url":"https://github.com/ringbdstack/rplm_sed/blob/HEAD/RPLM-SED/train_long_tail.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, ringbdstack/rplm_sed when it was checked","code_sha256":"0f878351833b89e4","code_sha256_prefix":"0f878351833b89e4","mcp_get_code":{"code_sha256":"0f878351833b89e4"}},{"arxiv_id":"2403.15652","arxiv_id_is_arxiv":true,"paper":"/paper/parametric-encoding-with-attention-and","title":"Parametric Encoding with Attention and Convolution Mitigate Spectral Bias of Neural Partial Differential Equation Solvers","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bostanabad-Research-Group/pgcan","path":"utils/initialize.py","file_url":"https://github.com/Bostanabad-Research-Group/pgcan/blob/HEAD/utils/initialize.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cae7163469ee3f73","code_sha256_prefix":"cae7163469ee3f73","mcp_get_code":{"code_sha256":"cae7163469ee3f73"}},{"arxiv_id":"2308.08963","arxiv_id_is_arxiv":true,"paper":"/paper/convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xihongyang1999/convert","path":"kmeans.py","file_url":"https://github.com/xihongyang1999/convert/blob/HEAD/kmeans.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xihongyang1999/convert when it was checked","code_sha256":"6b7db7b464a07b6b","code_sha256_prefix":"6b7db7b464a07b6b","mcp_get_code":{"code_sha256":"6b7db7b464a07b6b"}},{"arxiv_id":"2308.07286","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-is-in-the-errors-leveraging-large","title":"The Devil is in the Errors: Leveraging Large Language Models for Fine-grained Machine Translation Evaluation","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuuhuang/lost_in_the_src","path":"automqm/llm_ppl.py","file_url":"https://github.com/xuuhuang/lost_in_the_src/blob/HEAD/automqm/llm_ppl.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":"5d2cdb987c833aa0","code_sha256_prefix":"5d2cdb987c833aa0","mcp_get_code":{"code_sha256":"5d2cdb987c833aa0"}},{"arxiv_id":"2307.11565","arxiv_id_is_arxiv":true,"paper":"/paper/fmt-removing-backdoor-feature-maps-via","title":"Adversarial Feature Map Pruning for Backdoor","date":"2023-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ase2023paper/fmt","path":"defense/feature.py","file_url":"https://github.com/ase2023paper/fmt/blob/HEAD/defense/feature.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ase2023paper/fmt (NOASSERTION)","code_sha256":"ee4996a2c442fcea","code_sha256_prefix":"ee4996a2c442fcea","mcp_get_code":{"code_sha256":"ee4996a2c442fcea"}},{"arxiv_id":"2207.14696","arxiv_id_is_arxiv":true,"paper":"/paper/bifeat-supercharge-gnn-training-via-graph","title":"BiFeat: Supercharge GNN Training via Graph Feature Quantization","date":"2022-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bifeat/bifeat","path":"kmeans.py","file_url":"https://github.com/bifeat/bifeat/blob/HEAD/kmeans.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":"4de6199ad1c0d772","code_sha256_prefix":"4de6199ad1c0d772","mcp_get_code":{"code_sha256":"4de6199ad1c0d772"}},{"arxiv_id":"2206.03687","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-model-for-multi-class-anomaly","title":"A Unified Model for Multi-class Anomaly Detection","date":"2022-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiyuanyou/uniad","path":"models/reconstructions/uniad.py","file_url":"https://github.com/zhiyuanyou/uniad/blob/HEAD/models/reconstructions/uniad.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":"9599fed324e3b1f2","code_sha256_prefix":"9599fed324e3b1f2","mcp_get_code":{"code_sha256":"9599fed324e3b1f2"}},{"arxiv_id":"2206.02626","arxiv_id_is_arxiv":true,"paper":"/paper/infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noveens/distill_cf","path":"distill.py","file_url":"https://github.com/noveens/distill_cf/blob/HEAD/distill.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba82c8f5022469d4","code_sha256_prefix":"ba82c8f5022469d4","mcp_get_code":{"code_sha256":"ba82c8f5022469d4"}},{"arxiv_id":"2006.05553","arxiv_id_is_arxiv":true,"paper":"/paper/neural-methods-for-point-wise-dependency","title":"Neural Methods for Point-wise Dependency Estimation","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaohungt/Pointwise_Dependency_Neural_Estimation","path":"RepreLearn_Deep/mixed_precision.py","file_url":"https://github.com/yaohungt/Pointwise_Dependency_Neural_Estimation/blob/HEAD/RepreLearn_Deep/mixed_precision.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":"68d2b5229235b340","code_sha256_prefix":"68d2b5229235b340","mcp_get_code":{"code_sha256":"68d2b5229235b340"}},{"arxiv_id":"2003.04297","arxiv_id_is_arxiv":true,"paper":"/paper/improved-baselines-with-momentum-contrastive","title":"Improved Baselines with Momentum Contrastive Learning","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavoiems/SADt","path":"src/common/initialize.py","file_url":"https://github.com/lavoiems/SADt/blob/HEAD/src/common/initialize.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":"5f912135342a1eac","code_sha256_prefix":"5f912135342a1eac","mcp_get_code":{"code_sha256":"5f912135342a1eac"}},{"arxiv_id":"1909.00025","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-with-warped-gradient-descent","title":"Meta-Learning with Warped Gradient Descent","date":"2019-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flennerhag/warpgrad","path":"src/maze_navigation/maze.py","file_url":"https://github.com/flennerhag/warpgrad/blob/HEAD/src/maze_navigation/maze.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":"96ac1c28c4f7fb11","code_sha256_prefix":"96ac1c28c4f7fb11","mcp_get_code":{"code_sha256":"96ac1c28c4f7fb11"}},{"arxiv_id":"openreview_LMrsqvShfy","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_LMrsqvShfy","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"gift-novellab/InfoGlobe","path":"InfoGlobe/utils.py","file_url":"https://github.com/gift-novellab/InfoGlobe/blob/HEAD/InfoGlobe/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":"6748dc5545b321f4","code_sha256_prefix":"6748dc5545b321f4","mcp_get_code":{"code_sha256":"6748dc5545b321f4"}}],"record_sha256":"c16a7cf57fc98410be00b4a7c62bd161de1be552f9517e3482526894f9ffbd4d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}