{"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/predictor","entry":"Predictor","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":24,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":15,"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":25,"n_samples_ran":16,"n_samples_constructed":12,"n_samples_ran_checked":16,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":8,"n_places":25,"n_places_pointer_only":15,"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":16,"unverified":9},"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.11860","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-11860","title":"REPAIR: Predictive Self-Supervised Representation Learning in Chess","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Artificial-Chrisi/RePAIR","path":"networks.py","file_url":"https://github.com/Artificial-Chrisi/RePAIR/blob/HEAD/networks.py","status":"unverified","verification_level":0,"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, Artificial-Chrisi/RePAIR when it was checked","code_sha256":"f327faa9a36504b0","code_sha256_prefix":"f327faa9a36504b0","mcp_get_code":{"code_sha256":"f327faa9a36504b0"}},{"arxiv_id":"2603.22323","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-22323","title":"A Multi-Task Targeted Learning Framework for Lithium-Ion Battery State-of-Health and Remaining Useful Life","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"wang-fujin/PINN4SOH","path":"Model/Model.py","file_url":"https://github.com/wang-fujin/PINN4SOH/blob/HEAD/Model/Model.py","status":"ran","verification_level":1,"contract_check":null,"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, wang-fujin/PINN4SOH when it was checked","code_sha256":"df4e443278e1c115","code_sha256_prefix":"df4e443278e1c115","mcp_get_code":{"code_sha256":"df4e443278e1c115"}},{"arxiv_id":"2603.01748","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01748","title":"Discrete World Models via Regularization","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"dbizzaro/DWMR","path":"architecture.py","file_url":"https://github.com/dbizzaro/DWMR/blob/HEAD/architecture.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, dbizzaro/DWMR when it was checked","code_sha256":"d66fe076df46a83d","code_sha256_prefix":"d66fe076df46a83d","mcp_get_code":{"code_sha256":"d66fe076df46a83d"}},{"arxiv_id":"2601.16220","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16220","title":"Towards Latent Diffusion Suitable For Text","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Nesta-gitU/discrete_diffusion","path":"src/models/ndm/ndm.py","file_url":"https://github.com/Nesta-gitU/discrete_diffusion/blob/HEAD/src/models/ndm/ndm.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, Nesta-gitU/discrete_diffusion when it was checked","code_sha256":"5b233230aa3b77a0","code_sha256_prefix":"5b233230aa3b77a0","mcp_get_code":{"code_sha256":"5b233230aa3b77a0"}},{"arxiv_id":"2503.13147","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-predictor-critic-code-decoding-for","title":"Iterative Predictor-Critic Code Decoding for Real-World Image Dehazing","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jiayi-Fu/IPC-Dehaze","path":"basicsr/archs/dehazeToken_arch.py","file_url":"https://github.com/Jiayi-Fu/IPC-Dehaze/blob/HEAD/basicsr/archs/dehazeToken_arch.py","status":"unverified","verification_level":0,"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, Jiayi-Fu/IPC-Dehaze (NOASSERTION)","code_sha256":"c800eb76e72597d7","code_sha256_prefix":"c800eb76e72597d7","mcp_get_code":{"code_sha256":"c800eb76e72597d7"}},{"arxiv_id":"2405.03342","arxiv_id_is_arxiv":true,"paper":"/paper/doubly-robust-causal-effect-estimation-under","title":"Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learning","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeilinChen507/targeted_interference","path":"src/targetedModel_DoubleBSpline.py","file_url":"https://github.com/WeilinChen507/targeted_interference/blob/HEAD/src/targetedModel_DoubleBSpline.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, WeilinChen507/targeted_interference when it was checked","code_sha256":"80dd0a4d4192cf9f","code_sha256_prefix":"80dd0a4d4192cf9f","mcp_get_code":{"code_sha256":"80dd0a4d4192cf9f"}},{"arxiv_id":"2404.17099","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-fractional","title":"Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zknus/torchfde","path":"torchfde/explicit_solver.py","file_url":"https://github.com/zknus/torchfde/blob/HEAD/torchfde/explicit_solver.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, zknus/torchfde when it was checked","code_sha256":"ae5d259ba0676d48","code_sha256_prefix":"ae5d259ba0676d48","mcp_get_code":{"code_sha256":"ae5d259ba0676d48"}},{"arxiv_id":"2310.16686","arxiv_id_is_arxiv":true,"paper":"/paper/dynamics-generalisation-in-reinforcement-1","title":"Dynamics Generalisation in Reinforcement Learning via Adaptive Context-Aware Policies","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tidiane-camaret/contextual_rl_zero_shot","path":"meta_rl/iida/predictor.py","file_url":"https://github.com/tidiane-camaret/contextual_rl_zero_shot/blob/HEAD/meta_rl/iida/predictor.py","status":"ran","verification_level":1,"contract_check":null,"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, tidiane-camaret/contextual_rl_zero_shot when it was checked","code_sha256":"0c6f6a28d742e40a","code_sha256_prefix":"0c6f6a28d742e40a","mcp_get_code":{"code_sha256":"0c6f6a28d742e40a"}},{"arxiv_id":"2302.10326","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-out-of-distribution-detection-1","title":"Unsupervised Out-of-Distribution Detection with Diffusion Inpainting","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenzhel/lift_map_detect","path":"recon.py","file_url":"https://github.com/zhenzhel/lift_map_detect/blob/HEAD/recon.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":"60424db455a86fdc","code_sha256_prefix":"60424db455a86fdc","mcp_get_code":{"code_sha256":"60424db455a86fdc"}},{"arxiv_id":"2211.00164","arxiv_id_is_arxiv":true,"paper":"/paper/agent-controller-representations-principled","title":"Agent-Controller Representations: Principled Offline RL with Rich Exogenous Information","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manantomar/agent-centric-representations","path":"acro.py","file_url":"https://github.com/manantomar/agent-centric-representations/blob/HEAD/acro.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, manantomar/agent-centric-representations when it was checked","code_sha256":"fc8294e383461c9c","code_sha256_prefix":"fc8294e383461c9c","mcp_get_code":{"code_sha256":"fc8294e383461c9c"}},{"arxiv_id":"2209.10677","arxiv_id_is_arxiv":true,"paper":"/paper/nashae-disentangling-representations-through","title":"NashAE: Disentangling Representations through Adversarial Covariance Minimization","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericyeats/nashae-beamsynthesis","path":"ae_utils_exp.py","file_url":"https://github.com/ericyeats/nashae-beamsynthesis/blob/HEAD/ae_utils_exp.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":"1c51a254f598a830","code_sha256_prefix":"1c51a254f598a830","mcp_get_code":{"code_sha256":"1c51a254f598a830"}},{"arxiv_id":"2207.08080","arxiv_id_is_arxiv":true,"paper":"/paper/neural-color-operators-for-sequential-image","title":"Neural Color Operators for Sequential Image Retouching","date":"2022-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amberwangyili/neurop","path":"codes_pytorch/models/networks.py","file_url":"https://github.com/amberwangyili/neurop/blob/HEAD/codes_pytorch/models/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d43d40d4af68cd54","code_sha256_prefix":"d43d40d4af68cd54","mcp_get_code":{"code_sha256":"d43d40d4af68cd54"}},{"arxiv_id":"2207.02196","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-score-based-generative-models-1","title":"Accelerating Score-based Generative Models with Preconditioned Diffusion Sampling","date":"2022-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fudan-zvg/pds","path":"sampling.py","file_url":"https://github.com/fudan-zvg/pds/blob/HEAD/sampling.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":"ccb989dac7906e74","code_sha256_prefix":"ccb989dac7906e74","mcp_get_code":{"code_sha256":"ccb989dac7906e74"}},{"arxiv_id":"2111.15512","arxiv_id_is_arxiv":true,"paper":"/paper/what-do-you-see-in-this-patient-behavioral","title":"What Do You See in this Patient? Behavioral Testing of Clinical NLP Models","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bvanaken/clinical-behavioral-testing","path":"behavioral_testing.py","file_url":"https://github.com/bvanaken/clinical-behavioral-testing/blob/HEAD/behavioral_testing.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":"544fe7e37e9ec233","code_sha256_prefix":"544fe7e37e9ec233","mcp_get_code":{"code_sha256":"544fe7e37e9ec233"}},{"arxiv_id":"2111.03602","arxiv_id_is_arxiv":true,"paper":"/paper/nas-bench-x11-and-the-power-of-learning","title":"NAS-Bench-x11 and the Power of Learning Curves","date":"2021-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/nas-bench-x11","path":"naslib/predictors/lce/lce.py","file_url":"https://github.com/automl/nas-bench-x11/blob/HEAD/naslib/predictors/lce/lce.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":"962e3193f835c354","code_sha256_prefix":"962e3193f835c354","mcp_get_code":{"code_sha256":"962e3193f835c354"}},{"arxiv_id":"2106.02749","arxiv_id_is_arxiv":true,"paper":"/paper/predify-augmenting-deep-neural-networks-with","title":"Predify: Augmenting deep neural networks with brain-inspired predictive coding dynamics","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miladmozafari/predify","path":"predify/modules/base.py","file_url":"https://github.com/miladmozafari/predify/blob/HEAD/predify/modules/base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, miladmozafari/predify, is not in the permissive set Syntology serves inline","code_sha256":"66572ffdc4e887c1","code_sha256_prefix":"66572ffdc4e887c1","mcp_get_code":{"code_sha256":"66572ffdc4e887c1"}},{"arxiv_id":"2106.02034","arxiv_id_is_arxiv":true,"paper":"/paper/dynamicvit-efficient-vision-transformers-with","title":"DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vision-sjtu/quadmamba","path":"classification/models/csms6s.py","file_url":"https://github.com/vision-sjtu/quadmamba/blob/HEAD/classification/models/csms6s.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":"c2f59e9256846dc1","code_sha256_prefix":"c2f59e9256846dc1","mcp_get_code":{"code_sha256":"c2f59e9256846dc1"}},{"arxiv_id":"2104.08078","arxiv_id_is_arxiv":true,"paper":"/paper/to-share-or-not-to-share-predicting-sets-of","title":"To Share or not to Share: Predicting Sets of Sources for Model Transfer Learning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/predicting_sets_of_sources","path":"src/predictors.py","file_url":"https://github.com/boschresearch/predicting_sets_of_sources/blob/HEAD/src/predictors.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/predicting_sets_of_sources, is not in the permissive set Syntology serves inline","code_sha256":"52437fee2644b775","code_sha256_prefix":"52437fee2644b775","mcp_get_code":{"code_sha256":"52437fee2644b775"}},{"arxiv_id":"2101.06351","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-hierarchical-models-for","title":"Weakly-Supervised Hierarchical Models for Predicting Persuasive Strategies in Good-faith Textual Requests","date":"2021-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-SALT/Persuasion_Strategy_WVAE","path":"code/bertVAE.py","file_url":"https://github.com/GT-SALT/Persuasion_Strategy_WVAE/blob/HEAD/code/bertVAE.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, GT-SALT/Persuasion_Strategy_WVAE when it was checked","code_sha256":"edce68a8401e0f6a","code_sha256_prefix":"edce68a8401e0f6a","mcp_get_code":{"code_sha256":"edce68a8401e0f6a"}},{"arxiv_id":"2011.13456","arxiv_id_is_arxiv":true,"paper":"/paper/score-based-generative-modeling-through-1","title":"Score-Based Generative Modeling through Stochastic Differential Equations","date":"2020-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yang-song/score_sde","path":"sampling.py","file_url":"https://github.com/yang-song/score_sde/blob/HEAD/sampling.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":"fdabca225111e3dc","code_sha256_prefix":"fdabca225111e3dc","mcp_get_code":{"code_sha256":"fdabca225111e3dc"}},{"arxiv_id":"2011.03856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-model-and-ignore-dataset-bias","title":"Learning to Model and Ignore Dataset Bias with Mixed Capacity Ensembles","date":"2020-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrisc36/autobias","path":"autobias/modules/classifier_ensembles.py","file_url":"https://github.com/chrisc36/autobias/blob/HEAD/autobias/modules/classifier_ensembles.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":"8b2698ce36b58c25","code_sha256_prefix":"8b2698ce36b58c25","mcp_get_code":{"code_sha256":"8b2698ce36b58c25"}},{"arxiv_id":"2006.07733","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaox12/BYOL-PyTorch","path":"model/byol_model.py","file_url":"https://github.com/yaox12/BYOL-PyTorch/blob/HEAD/model/byol_model.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":"03e75d5f5306b451","code_sha256_prefix":"03e75d5f5306b451","mcp_get_code":{"code_sha256":"03e75d5f5306b451"}},{"arxiv_id":"2006.07733","arxiv_id_is_arxiv":true,"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talipucar/PyFlow_BYOL","path":"utils/model_utils.py","file_url":"https://github.com/talipucar/PyFlow_BYOL/blob/HEAD/utils/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, talipucar/PyFlow_BYOL when it was checked","code_sha256":"7641e6d697e6dffa","code_sha256_prefix":"7641e6d697e6dffa","mcp_get_code":{"code_sha256":"7641e6d697e6dffa"}},{"arxiv_id":"2002.01196","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-knowledge-routing-network-for-target","title":"Dynamic Knowledge Routing Network For Target-Guided Open-Domain Conversation","date":"2020-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"James-Yip/TGODC-DKRN","path":"model/neural_dkr.py","file_url":"https://github.com/James-Yip/TGODC-DKRN/blob/HEAD/model/neural_dkr.py","status":"unverified","verification_level":0,"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, James-Yip/TGODC-DKRN when it was checked","code_sha256":"20fcec5a07337ddc","code_sha256_prefix":"20fcec5a07337ddc","mcp_get_code":{"code_sha256":"20fcec5a07337ddc"}},{"arxiv_id":"1807.03748","arxiv_id_is_arxiv":true,"paper":"/paper/representation-learning-with-contrastive","title":"Representation Learning with Contrastive Predictive Coding","date":"2018-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theolepage/ssl-for-slr","path":"sslforslr/models/cpc/CPC.py","file_url":"https://github.com/theolepage/ssl-for-slr/blob/HEAD/sslforslr/models/cpc/CPC.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, theolepage/ssl-for-slr when it was checked","code_sha256":"61e69ae0f2b2b9d6","code_sha256_prefix":"61e69ae0f2b2b9d6","mcp_get_code":{"code_sha256":"61e69ae0f2b2b9d6"}}],"record_sha256":"8c9739a5a091dc150e2f7d22e03e8088192ff4b0b90171870a1ee3ee2273b2c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}