{"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/to-one-hot","entry":"to_one_hot","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":44,"n_papers_ran":40,"n_papers_ran_no_instrument_failure":27,"n_papers_ran_instrument_only":13,"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":35,"n_samples_ran":31,"n_samples_constructed":0,"n_samples_ran_checked":22,"n_samples_instrument":9,"n_samples_unverified":4,"n_samples_fingerprinted":4,"n_places":45,"n_places_pointer_only":9,"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":1,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":2,"ran":21,"unverified":4},"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":"2606.18209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18209","title":"Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Jiacheng8/FADRM","path":"models/util.py","file_url":"https://github.com/Jiacheng8/FADRM/blob/HEAD/models/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f312e21745a6f61","code_sha256_prefix":"4f312e21745a6f61","mcp_get_code":{"code_sha256":"4f312e21745a6f61"}},{"arxiv_id":"2605.30188","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30188","title":"CalArena: A Large-Scale Post-Hoc Calibration Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"probkit/probmetrics","path":"probmetrics/calibrators/base.py","file_url":"https://github.com/probkit/probmetrics/blob/HEAD/probmetrics/calibrators/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3836d7ad343a7f8b","code_sha256_prefix":"3836d7ad343a7f8b","mcp_get_code":{"code_sha256":"3836d7ad343a7f8b"}},{"arxiv_id":"2602.24230","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-24230","title":"A Variational Estimator for L p Calibration Errors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"dholzmueller/probmetrics","path":"probmetrics/distributions.py","file_url":"https://github.com/dholzmueller/probmetrics/blob/HEAD/probmetrics/distributions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3836d7ad343a7f8b","code_sha256_prefix":"3836d7ad343a7f8b","mcp_get_code":{"code_sha256":"3836d7ad343a7f8b"}},{"arxiv_id":"2506.24125","arxiv_id_is_arxiv":true,"paper":"/paper/fadrm-fast-and-accurate-data-residual","title":"FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/fadrm","path":"models/util.py","file_url":"https://github.com/jiacheng8/fadrm/blob/HEAD/models/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f312e21745a6f61","code_sha256_prefix":"4f312e21745a6f61","mcp_get_code":{"code_sha256":"4f312e21745a6f61"}},{"arxiv_id":"2407.09790","arxiv_id_is_arxiv":true,"paper":"/paper/team-up-gbdts-and-dnns-advancing-efficient","title":"Team up GBDTs and DNNs: Advancing Efficient and Effective Tabular Prediction with Tree-hybrid MLPs","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyansir/tmlp","path":"models/node/nn_utils.py","file_url":"https://github.com/jyansir/tmlp/blob/HEAD/models/node/nn_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c169a4c49b79cc3e","code_sha256_prefix":"c169a4c49b79cc3e","mcp_get_code":{"code_sha256":"c169a4c49b79cc3e"}},{"arxiv_id":"2406.18062","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-barrier-enhanced-utility-and","title":"Breaking the Barrier: Enhanced Utility and Robustness in Smoothed DRL Agents","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustworthy-ml-lab/robust_highutil_smoothed_drl","path":"SDQN/attacks.py","file_url":"https://github.com/trustworthy-ml-lab/robust_highutil_smoothed_drl/blob/HEAD/SDQN/attacks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trustworthy-ml-lab/robust_highutil_smoothed_drl when it was checked","code_sha256":"488e5c100aa0a20b","code_sha256_prefix":"488e5c100aa0a20b","mcp_get_code":{"code_sha256":"488e5c100aa0a20b"}},{"arxiv_id":"2402.12238","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-gaussian-flow-for-diverse-trajectory","title":"MGF: Mixed Gaussian Flow for Diverse Trajectory Prediction","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mulplue/MGF","path":"src/models/TP/model_utils.py","file_url":"https://github.com/mulplue/MGF/blob/HEAD/src/models/TP/model_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":"8f0b65c232680906","code_sha256_prefix":"8f0b65c232680906","mcp_get_code":{"code_sha256":"8f0b65c232680906"}},{"arxiv_id":"2312.02464","arxiv_id_is_arxiv":true,"paper":"/paper/sam-assisted-remote-sensing-imagery-semantic","title":"SAM-Assisted Remote Sensing Imagery Semantic Segmentation with Object and Boundary Constraints","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctrlovefly/df4lcz","path":"data_loader_single.py","file_url":"https://github.com/ctrlovefly/df4lcz/blob/HEAD/data_loader_single.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":"6736ce9253a49a0d","code_sha256_prefix":"6736ce9253a49a0d","mcp_get_code":{"code_sha256":"6736ce9253a49a0d"}},{"arxiv_id":"2311.18341","arxiv_id_is_arxiv":true,"paper":"/paper/learning-robust-precipitation-forecaster-by","title":"Learning Robust Precipitation Forecaster by Temporal Frame Interpolation","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"secilia-cxy/unettfi","path":"utils/evaluate.py","file_url":"https://github.com/secilia-cxy/unettfi/blob/HEAD/utils/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"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, secilia-cxy/unettfi (NOASSERTION)","code_sha256":"a8dc89123a203aff","code_sha256_prefix":"a8dc89123a203aff","mcp_get_code":{"code_sha256":"a8dc89123a203aff"}},{"arxiv_id":"2310.06077","arxiv_id_is_arxiv":true,"paper":"/paper/performative-time-series-forecasting","title":"Performative Time-Series Forecasting","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/pets","path":"run_covid.py","file_url":"https://github.com/adityalab/pets/blob/HEAD/run_covid.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, adityalab/pets when it was checked","code_sha256":"63522329e89eacb1","code_sha256_prefix":"63522329e89eacb1","mcp_get_code":{"code_sha256":"63522329e89eacb1"}},{"arxiv_id":"2309.12253","arxiv_id_is_arxiv":true,"paper":"/paper/salsa-clrs-a-sparse-and-scalable-benchmark","title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkminder/salsa-clrs","path":"baselines/core/metrics.py","file_url":"https://github.com/jkminder/salsa-clrs/blob/HEAD/baselines/core/metrics.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":"3657a50f2af74956","code_sha256_prefix":"3657a50f2af74956","mcp_get_code":{"code_sha256":"3657a50f2af74956"}},{"arxiv_id":"2305.00673","arxiv_id_is_arxiv":true,"paper":"/paper/bidirectional-copy-paste-for-semi-supervised","title":"Bidirectional Copy-Paste for Semi-Supervised Medical Image Segmentation","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepMed-Lab-ECNU/BCP","path":"code/utils/BCP_utils.py","file_url":"https://github.com/DeepMed-Lab-ECNU/BCP/blob/HEAD/code/utils/BCP_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae8cca7f206aff6e","code_sha256_prefix":"ae8cca7f206aff6e","mcp_get_code":{"code_sha256":"ae8cca7f206aff6e"}},{"arxiv_id":"2207.08548","arxiv_id_is_arxiv":true,"paper":"/paper/gate-gated-additive-tree-ensemble-for-tabular","title":"GANDALF: Gated Adaptive Network for Deep Automated Learning of Features","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manujosephv/GATE","path":"gate/utils.py","file_url":"https://github.com/manujosephv/GATE/blob/HEAD/gate/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c169a4c49b79cc3e","code_sha256_prefix":"c169a4c49b79cc3e","mcp_get_code":{"code_sha256":"c169a4c49b79cc3e"}},{"arxiv_id":"2207.08548","arxiv_id_is_arxiv":true,"paper":"/paper/gate-gated-additive-tree-ensemble-for-tabular","title":"GANDALF: Gated Adaptive Network for Deep Automated Learning of Features","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manujosephv/pytorch_tabular","path":"src/pytorch_tabular/utils/nn_utils.py","file_url":"https://github.com/manujosephv/pytorch_tabular/blob/HEAD/src/pytorch_tabular/utils/nn_utils.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":"6edad99ec591a849","code_sha256_prefix":"6edad99ec591a849","mcp_get_code":{"code_sha256":"6edad99ec591a849"}},{"arxiv_id":"2205.10772","arxiv_id_is_arxiv":true,"paper":"/paper/fast-instrument-learning-with-faster-rates","title":"Fast Instrument Learning with Faster Rates","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meta-inf/fil","path":"hllt_data/mnist.py","file_url":"https://github.com/meta-inf/fil/blob/HEAD/hllt_data/mnist.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":"e725fda2b58f394d","code_sha256_prefix":"e725fda2b58f394d","mcp_get_code":{"code_sha256":"e725fda2b58f394d"}},{"arxiv_id":"2205.04790","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-throw-it-away-the-utility-of-unlabeled","title":"Don't Throw it Away! The Utility of Unlabeled Data in Fair Decision Making","date":"2022-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayanmaj92/fairall","path":"lipstd/utils.py","file_url":"https://github.com/ayanmaj92/fairall/blob/HEAD/lipstd/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":"f3c2af6e657912cd","code_sha256_prefix":"f3c2af6e657912cd","mcp_get_code":{"code_sha256":"f3c2af6e657912cd"}},{"arxiv_id":"2204.12511","arxiv_id_is_arxiv":true,"paper":"/paper/polyloss-a-polynomial-expansion-perspective-1","title":"PolyLoss: A Polynomial Expansion Perspective of Classification Loss Functions","date":"2022-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiyixuxu/polyloss-pytorch","path":"PolyLoss.py","file_url":"https://github.com/yiyixuxu/polyloss-pytorch/blob/HEAD/PolyLoss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yiyixuxu/polyloss-pytorch when it was checked","code_sha256":"6806c813ec675aab","code_sha256_prefix":"6806c813ec675aab","mcp_get_code":{"code_sha256":"6806c813ec675aab"}},{"arxiv_id":"2203.13573","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-temporal","title":"Unsupervised Learning of Temporal Abstractions with Slot-based Transformers","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agopal42/slottar","path":"baselines_utils.py","file_url":"https://github.com/agopal42/slottar/blob/HEAD/baselines_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":"8d63f384045362b9","code_sha256_prefix":"8d63f384045362b9","mcp_get_code":{"code_sha256":"8d63f384045362b9"}},{"arxiv_id":"2202.02471","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-learning-as-cluster-induced-voronoi","title":"Few-shot Learning as Cluster-induced Voronoi Diagrams: A Geometric Approach","date":"2022-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"horsepurve/deepvoro","path":"wrn_mixup_model.py","file_url":"https://github.com/horsepurve/deepvoro/blob/HEAD/wrn_mixup_model.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":"61ea85418a6324dc","code_sha256_prefix":"61ea85418a6324dc","mcp_get_code":{"code_sha256":"61ea85418a6324dc"}},{"arxiv_id":"2202.01402","arxiv_id_is_arxiv":true,"paper":"/paper/galaxy-graph-based-active-learning-at-the","title":"GALAXY: Graph-based Active Learning at the Extreme","date":"2022-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jifanz/GALAXY","path":"src/utils.py","file_url":"https://github.com/jifanz/GALAXY/blob/HEAD/src/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":"66cbf99986b3da82","code_sha256_prefix":"66cbf99986b3da82","mcp_get_code":{"code_sha256":"66cbf99986b3da82"}},{"arxiv_id":"2109.00077","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-machine-comprehension-with-1","title":"Interactive Machine Comprehension with Dynamic Knowledge Graphs","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingdi-eric-yuan/imrc_graph_public","path":"layers.py","file_url":"https://github.com/xingdi-eric-yuan/imrc_graph_public/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, xingdi-eric-yuan/imrc_graph_public, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a22dcfef9da055e4","code_sha256_prefix":"a22dcfef9da055e4","mcp_get_code":{"code_sha256":"a22dcfef9da055e4"}},{"arxiv_id":"2108.13679","arxiv_id_is_arxiv":true,"paper":"/paper/task-oriented-dialogue-system-as-natural","title":"Task-Oriented Dialogue System as Natural Language Generation","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victorwz/tod_as_nlg","path":"Convlab/convlab/lib/math_util.py","file_url":"https://github.com/victorwz/tod_as_nlg/blob/HEAD/Convlab/convlab/lib/math_util.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":"bd93e2a982e7fb52","code_sha256_prefix":"bd93e2a982e7fb52","mcp_get_code":{"code_sha256":"bd93e2a982e7fb52"}},{"arxiv_id":"2108.03852","arxiv_id_is_arxiv":true,"paper":"/paper/complementary-patch-for-weakly-supervised","title":"Complementary Patch for Weakly Supervised Semantic Segmentation","date":"2021-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ferenas/CPN","path":"misc/pyutils.py","file_url":"https://github.com/Ferenas/CPN/blob/HEAD/misc/pyutils.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":"fa36a8f1f0a5a428","code_sha256_prefix":"fa36a8f1f0a5a428","mcp_get_code":{"code_sha256":"fa36a8f1f0a5a428"}},{"arxiv_id":"2104.05514","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-with-weak-supervision","title":"Self-Training with Weak Supervision","date":"2021-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ASTRA","path":"astra/RuleAttentionNetwork.py","file_url":"https://github.com/microsoft/ASTRA/blob/HEAD/astra/RuleAttentionNetwork.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9b299e92b4afc95","code_sha256_prefix":"a9b299e92b4afc95","mcp_get_code":{"code_sha256":"a9b299e92b4afc95"}},{"arxiv_id":"2102.06605","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-power-of-contrastive-self","title":"Unleashing the Power of Contrastive Self-Supervised Visual Models via Contrast-Regularized Fine-Tuning","date":"2021-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanint/core-tuning","path":"Core-tuning.py","file_url":"https://github.com/vanint/core-tuning/blob/HEAD/Core-tuning.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, vanint/core-tuning when it was checked","code_sha256":"a1632d5996c13565","code_sha256_prefix":"a1632d5996c13565","mcp_get_code":{"code_sha256":"a1632d5996c13565"}},{"arxiv_id":"2010.08153","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-exact-computation-of-linear-frequency","title":"On the exact computation of linear frequency principle dynamics and its generalization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuzhiqin1990/LFP","path":"BasicFunc.py","file_url":"https://github.com/xuzhiqin1990/LFP/blob/HEAD/BasicFunc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xuzhiqin1990/LFP when it was checked","code_sha256":"dd87064db326e501","code_sha256_prefix":"dd87064db326e501","mcp_get_code":{"code_sha256":"dd87064db326e501"}},{"arxiv_id":"2006.15426","arxiv_id_is_arxiv":true,"paper":"/paper/molecule-edit-graph-attention-network","title":"Molecule Edit Graph Attention Network: Modeling Chemical Reactions as Sequences of Graph Edits","date":"2020-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molecule-one/megan","path":"src/model/megan.py","file_url":"https://github.com/molecule-one/megan/blob/HEAD/src/model/megan.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":"e5bfe5eefc935780","code_sha256_prefix":"e5bfe5eefc935780","mcp_get_code":{"code_sha256":"e5bfe5eefc935780"}},{"arxiv_id":"2006.12101","arxiv_id_is_arxiv":true,"paper":"/paper/p3gm-private-high-dimensional-data-release","title":"P3GM: Private High-Dimensional Data Release via Privacy Preserving Phased Generative Model","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsubasat/P3GM","path":"ml_task/exp_ml.py","file_url":"https://github.com/tsubasat/P3GM/blob/HEAD/ml_task/exp_ml.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":"b884282977ee4610","code_sha256_prefix":"b884282977ee4610","mcp_get_code":{"code_sha256":"b884282977ee4610"}},{"arxiv_id":"2006.07794","arxiv_id_is_arxiv":true,"paper":"/paper/patchup-a-regularization-technique-for","title":"PatchUp: A Feature-Space Block-Level Regularization Technique for Convolutional Neural Networks","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/PatchUp","path":"utility/utils.py","file_url":"https://github.com/chandar-lab/PatchUp/blob/HEAD/utility/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":"b7759e06a641aece","code_sha256_prefix":"b7759e06a641aece","mcp_get_code":{"code_sha256":"b7759e06a641aece"}},{"arxiv_id":"2004.09805","arxiv_id_is_arxiv":true,"paper":"/paper/amc-loss-angular-margin-contrastive-loss-for","title":"AMC-Loss: Angular Margin Contrastive Loss for Improved Explainability in Image Classification","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hchoi71/AMC-Loss","path":"dataset.py","file_url":"https://github.com/hchoi71/AMC-Loss/blob/HEAD/dataset.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":"7e3dbd1d8ec95770","code_sha256_prefix":"7e3dbd1d8ec95770","mcp_get_code":{"code_sha256":"7e3dbd1d8ec95770"}},{"arxiv_id":"2004.00345","arxiv_id_is_arxiv":true,"paper":"/paper/editable-neural-networks-1","title":"Editable Neural Networks","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"editable-ICLR2020/editable","path":"lib/utils/basic.py","file_url":"https://github.com/editable-ICLR2020/editable/blob/HEAD/lib/utils/basic.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, editable-ICLR2020/editable when it was checked","code_sha256":"c169a4c49b79cc3e","code_sha256_prefix":"c169a4c49b79cc3e","mcp_get_code":{"code_sha256":"c169a4c49b79cc3e"}},{"arxiv_id":"2001.03093","arxiv_id_is_arxiv":true,"paper":"/paper/trajectron-multi-agent-generative-trajectory","title":"Trajectron++: Dynamically-Feasible Trajectory Forecasting With Heterogeneous Data","date":"2020-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StanfordASL/Trajectron-plus-plus","path":"trajectron/model/model_utils.py","file_url":"https://github.com/StanfordASL/Trajectron-plus-plus/blob/HEAD/trajectron/model/model_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":"8f0b65c232680906","code_sha256_prefix":"8f0b65c232680906","mcp_get_code":{"code_sha256":"8f0b65c232680906"}},{"arxiv_id":"1909.11895","arxiv_id_is_arxiv":true,"paper":"/paper/joint-task-self-supervised-learning-for","title":"Joint-task Self-supervised Learning for Temporal Correspondence","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liusifei/UVC","path":"libs/track_utils.py","file_url":"https://github.com/Liusifei/UVC/blob/HEAD/libs/track_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":"64adabd58edb62ca","code_sha256_prefix":"64adabd58edb62ca","mcp_get_code":{"code_sha256":"64adabd58edb62ca"}},{"arxiv_id":"1909.06312","arxiv_id_is_arxiv":true,"paper":"/paper/neural-oblivious-decision-ensembles-for-deep","title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","date":"2019-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qwicen/node","path":"lib/nn_utils.py","file_url":"https://github.com/Qwicen/node/blob/HEAD/lib/nn_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c169a4c49b79cc3e","code_sha256_prefix":"c169a4c49b79cc3e","mcp_get_code":{"code_sha256":"c169a4c49b79cc3e"}},{"arxiv_id":"1908.10449","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-machine-comprehension-with","title":"Interactive Machine Comprehension with Information Seeking Agents","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingdi-eric-yuan/imrc_public","path":"layers.py","file_url":"https://github.com/xingdi-eric-yuan/imrc_public/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, xingdi-eric-yuan/imrc_public, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a22dcfef9da055e4","code_sha256_prefix":"a22dcfef9da055e4","mcp_get_code":{"code_sha256":"a22dcfef9da055e4"}},{"arxiv_id":"1904.05044","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-learning-of-instance","title":"Weakly Supervised Learning of Instance Segmentation with Inter-pixel Relations","date":"2019-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwoon-ahn/irn","path":"misc/pyutils.py","file_url":"https://github.com/jiwoon-ahn/irn/blob/HEAD/misc/pyutils.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":"fa36a8f1f0a5a428","code_sha256_prefix":"fa36a8f1f0a5a428","mcp_get_code":{"code_sha256":"fa36a8f1f0a5a428"}},{"arxiv_id":"1812.01483","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-imitation-learning-explaining","title":"CompILE: Compositional Imitation Learning and Execution","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/compile","path":"utils.py","file_url":"https://github.com/tkipf/compile/blob/HEAD/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":"28109ef020a3ac20","code_sha256_prefix":"28109ef020a3ac20","mcp_get_code":{"code_sha256":"28109ef020a3ac20"}},{"arxiv_id":"1809.10486","arxiv_id_is_arxiv":true,"paper":"/paper/nnu-net-self-adapting-framework-for-u-net","title":"nnU-Net: Self-adapting Framework for U-Net-Based Medical Image Segmentation","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justld/nnunet_paddle","path":"nnunet_tools/nnunet_fold_val.py","file_url":"https://github.com/justld/nnunet_paddle/blob/HEAD/nnunet_tools/nnunet_fold_val.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":"14526317bd565411","code_sha256_prefix":"14526317bd565411","mcp_get_code":{"code_sha256":"14526317bd565411"}},{"arxiv_id":"1806.04326","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-compositional-kernel-learning","title":"Differentiable Compositional Kernel Learning for Gaussian Processes","date":"2018-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thjashin/spectral-stein-grad","path":"utils/dataset.py","file_url":"https://github.com/thjashin/spectral-stein-grad/blob/HEAD/utils/dataset.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":"c28e0523d961eb32","code_sha256_prefix":"c28e0523d961eb32","mcp_get_code":{"code_sha256":"c28e0523d961eb32"}},{"arxiv_id":"1806.03198","arxiv_id_is_arxiv":true,"paper":"/paper/spreading-vectors-for-similarity-search","title":"Spreading vectors for similarity search","date":"2018-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsyhprum/brewess","path":"lib/nn_utils.py","file_url":"https://github.com/lsyhprum/brewess/blob/HEAD/lib/nn_utils.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":"b26e044dc568ced8","code_sha256_prefix":"b26e044dc568ced8","mcp_get_code":{"code_sha256":"b26e044dc568ced8"}},{"arxiv_id":"1802.08960","arxiv_id_is_arxiv":true,"paper":"/paper/bonnet-an-open-source-training-and-deployment","title":"Bonnet: An Open-Source Training and Deployment Framework for Semantic Segmentation in Robotics using CNNs","date":"2018-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PRBonn/bonnetal","path":"train/common/onehot.py","file_url":"https://github.com/PRBonn/bonnetal/blob/HEAD/train/common/onehot.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":"96fb76c9f118b2ec","code_sha256_prefix":"96fb76c9f118b2ec","mcp_get_code":{"code_sha256":"96fb76c9f118b2ec"}},{"arxiv_id":"1609.03499","arxiv_id_is_arxiv":true,"paper":"/paper/wavenet-a-generative-model-for-raw-audio","title":"WaveNet: A Generative Model for Raw Audio","date":"2016-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swasun/VQ-VAE-Speech","path":"src/wavenet_vocoder/wavenet.py","file_url":"https://github.com/swasun/VQ-VAE-Speech/blob/HEAD/src/wavenet_vocoder/wavenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09179961802765aa","code_sha256_prefix":"09179961802765aa","mcp_get_code":{"code_sha256":"09179961802765aa"}},{"arxiv_id":"aaai_20108","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20108","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jieqin-ai/AMR","path":"misc/pyutils.py","file_url":"https://github.com/jieqin-ai/AMR/blob/HEAD/misc/pyutils.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":"fa36a8f1f0a5a428","code_sha256_prefix":"fa36a8f1f0a5a428","mcp_get_code":{"code_sha256":"fa36a8f1f0a5a428"}},{"arxiv_id":"Lazarou_Iterative_Label_Cleaning_for_Transductive_and_Semi-Supervised_Few-Shot_Learning_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lazarou_Iterative_Label_Cleaning_for_Transductive_and_Semi-Supervised_Few-Shot_Learning_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MichalisLazarou/iLPC","path":"wrn_mixup_model.py","file_url":"https://github.com/MichalisLazarou/iLPC/blob/HEAD/wrn_mixup_model.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":"61ea85418a6324dc","code_sha256_prefix":"61ea85418a6324dc","mcp_get_code":{"code_sha256":"61ea85418a6324dc"}},{"arxiv_id":"Huang_PrimitiveNet_Primitive_Instance_Segmentation_With_Local_Primitive_Embedding_Under_Adversarial_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_PrimitiveNet_Primitive_Instance_Segmentation_With_Local_Primitive_Embedding_Under_Adversarial_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hjwdzh/PrimitiveNet","path":"src/eval_iou.py","file_url":"https://github.com/hjwdzh/PrimitiveNet/blob/HEAD/src/eval_iou.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":"6e720851aee71b1e","code_sha256_prefix":"6e720851aee71b1e","mcp_get_code":{"code_sha256":"6e720851aee71b1e"}}],"record_sha256":"9bbb913746b3838ef56527757055c44b70ce6f13f87ff3bde24315a54c2ae85b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}