{"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/supconloss","entry":"SupConLoss","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":21,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":21,"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":24,"n_samples_constructed":5,"n_samples_ran_checked":24,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":9,"n_places":25,"n_places_pointer_only":10,"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":24,"unverified":1},"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":"2602.03390","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03390","title":"From Vicious to Virtuous Cycles: Synergistic Representation Learning for Unsupervised Video Object-Centric Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"hynnsk/SRL","path":"srl/losses.py","file_url":"https://github.com/hynnsk/SRL/blob/HEAD/srl/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81aee15db4dfebcb","code_sha256_prefix":"81aee15db4dfebcb","mcp_get_code":{"code_sha256":"81aee15db4dfebcb"}},{"arxiv_id":"2405.12775","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-multimodal-clustering-for","title":"Unsupervised Multimodal Clustering for Semantics Discovery in Multimodal Utterances","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuiar/UMC","path":"methods/unsupervised/UMC/manager.py","file_url":"https://github.com/thuiar/UMC/blob/HEAD/methods/unsupervised/UMC/manager.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, thuiar/UMC when it was checked","code_sha256":"e0fe559747014274","code_sha256_prefix":"e0fe559747014274","mcp_get_code":{"code_sha256":"e0fe559747014274"}},{"arxiv_id":"2405.01022","arxiv_id_is_arxiv":true,"paper":"/paper/unigen-universal-domain-generalization-for","title":"UniGen: Universal Domain Generalization for Sentiment Classification via Zero-shot Dataset Generation","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"c-juhwan/unigen","path":"task/classification/train_sungen.py","file_url":"https://github.com/c-juhwan/unigen/blob/HEAD/task/classification/train_sungen.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, c-juhwan/unigen when it was checked","code_sha256":"e94017f69584a14a","code_sha256_prefix":"e94017f69584a14a","mcp_get_code":{"code_sha256":"e94017f69584a14a"}},{"arxiv_id":"2403.18550","arxiv_id_is_arxiv":true,"paper":"/paper/orco-towards-better-generalization-via","title":"OrCo: Towards Better Generalization via Orthogonality and Contrast for Few-Shot Class-Incremental Learning","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noorahmedds/orco","path":"models/orco/Network.py","file_url":"https://github.com/noorahmedds/orco/blob/HEAD/models/orco/Network.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, noorahmedds/orco when it was checked","code_sha256":"ab68005a9f848926","code_sha256_prefix":"ab68005a9f848926","mcp_get_code":{"code_sha256":"ab68005a9f848926"}},{"arxiv_id":"2403.04272","arxiv_id_is_arxiv":true,"paper":"/paper/active-generalized-category-discovery","title":"Active Generalized Category Discovery","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mashijie1028/activegcd","path":"utils_al/train_recipes_ema.py","file_url":"https://github.com/mashijie1028/activegcd/blob/HEAD/utils_al/train_recipes_ema.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":"300b0f6e28f50218","code_sha256_prefix":"300b0f6e28f50218","mcp_get_code":{"code_sha256":"300b0f6e28f50218"}},{"arxiv_id":"2310.19776","arxiv_id_is_arxiv":true,"paper":"/paper/learn-to-categorize-or-categorize-to-learn-1","title":"Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discovery","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sarahrastegar/infosieve","path":"methods/contrastive_training/contrastive_training.py","file_url":"https://github.com/sarahrastegar/infosieve/blob/HEAD/methods/contrastive_training/contrastive_training.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":"9f9e36b6ddd2244e","code_sha256_prefix":"9f9e36b6ddd2244e","mcp_get_code":{"code_sha256":"9f9e36b6ddd2244e"}},{"arxiv_id":"2310.01376","arxiv_id_is_arxiv":true,"paper":"/paper/towards-distribution-agnostic-generalized-1","title":"Towards Distribution-Agnostic Generalized Category Discovery","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianhongbai/bacon","path":"model/bacon.py","file_url":"https://github.com/jianhongbai/bacon/blob/HEAD/model/bacon.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":"12b38c6451969326","code_sha256_prefix":"12b38c6451969326","mcp_get_code":{"code_sha256":"12b38c6451969326"}},{"arxiv_id":"2309.12742","arxiv_id_is_arxiv":true,"paper":"/paper/make-the-u-in-uda-matter-invariant-1","title":"Make the U in UDA Matter: Invariant Consistency Learning for Unsupervised Domain Adaptation","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yue-zhongqi/icon","path":"icon/eqinv.py","file_url":"https://github.com/yue-zhongqi/icon/blob/HEAD/icon/eqinv.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":"9e503ad659734ce5","code_sha256_prefix":"9e503ad659734ce5","mcp_get_code":{"code_sha256":"9e503ad659734ce5"}},{"arxiv_id":"2303.17480","arxiv_id_is_arxiv":true,"paper":"/paper/seeing-what-you-said-talking-face-generation","title":"Seeing What You Said: Talking Face Generation Guided by a Lip Reading Expert","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sxjdwang/talklip","path":"models/learn_sync.py","file_url":"https://github.com/sxjdwang/talklip/blob/HEAD/models/learn_sync.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, sxjdwang/talklip when it was checked","code_sha256":"6e70ca31524ad6fc","code_sha256_prefix":"6e70ca31524ad6fc","mcp_get_code":{"code_sha256":"6e70ca31524ad6fc"}},{"arxiv_id":"2211.02291","arxiv_id_is_arxiv":true,"paper":"/paper/selecmix-debiased-learning-by-contradicting","title":"SelecMix: Debiased Learning by Contradicting-pair Sampling","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iwhwang/SelecMix","path":"module/loss.py","file_url":"https://github.com/iwhwang/SelecMix/blob/HEAD/module/loss.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":"25ed84e39a91b560","code_sha256_prefix":"25ed84e39a91b560","mcp_get_code":{"code_sha256":"25ed84e39a91b560"}},{"arxiv_id":"2203.16533","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-pre-training-for-person-re","title":"Large-Scale Pre-training for Person Re-identification with Noisy Labels","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DengpanFu/LUPerson","path":"lup_moco/libs/losses.py","file_url":"https://github.com/DengpanFu/LUPerson/blob/HEAD/lup_moco/libs/losses.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, DengpanFu/LUPerson when it was checked","code_sha256":"e853d56ab2fb4cee","code_sha256_prefix":"e853d56ab2fb4cee","mcp_get_code":{"code_sha256":"e853d56ab2fb4cee"}},{"arxiv_id":"2203.03282","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-part-whole-hierarchies-and","title":"Interpretable part-whole hierarchies and conceptual-semantic relationships in neural networks","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mmlab-cv/Agglomerator","path":"src/models.py","file_url":"https://github.com/mmlab-cv/Agglomerator/blob/HEAD/src/models.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":"299961c9af1dd5a2","code_sha256_prefix":"299961c9af1dd5a2","mcp_get_code":{"code_sha256":"299961c9af1dd5a2"}},{"arxiv_id":"2202.06670","arxiv_id_is_arxiv":true,"paper":"/paper/learning-weakly-supervised-contrastive-1","title":"Learning Weakly-Supervised Contrastive Representations","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crazy-jack/cl-infonce","path":"clinfonce/losses.py","file_url":"https://github.com/crazy-jack/cl-infonce/blob/HEAD/clinfonce/losses.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":"69b3e18c36d2a734","code_sha256_prefix":"69b3e18c36d2a734","mcp_get_code":{"code_sha256":"69b3e18c36d2a734"}},{"arxiv_id":"2201.00057","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-representations-for-covariate-shift-1","title":"Optimal Representations for Covariate Shift","date":"2021-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryoungj/optdom","path":"DomainBed/domainbed/bottlenecks.py","file_url":"https://github.com/ryoungj/optdom/blob/HEAD/DomainBed/domainbed/bottlenecks.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":"222beedb5ae19428","code_sha256_prefix":"222beedb5ae19428","mcp_get_code":{"code_sha256":"222beedb5ae19428"}},{"arxiv_id":"2109.06349","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-intent-detection-via-contrastive-pre","title":"Few-Shot Intent Detection via Contrastive Pre-Training and Fine-Tuning","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZIZUN/CPFT","path":"finetune/util/model/Classifier_Contrastive.py","file_url":"https://github.com/ZIZUN/CPFT/blob/HEAD/finetune/util/model/Classifier_Contrastive.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, ZIZUN/CPFT when it was checked","code_sha256":"68a436d2a91f07aa","code_sha256_prefix":"68a436d2a91f07aa","mcp_get_code":{"code_sha256":"68a436d2a91f07aa"}},{"arxiv_id":"2106.14413","arxiv_id_is_arxiv":true,"paper":"/paper/co-2-l-contrastive-continual-learning","title":"Co$^2$L: Contrastive Continual Learning","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaht01/Co2L","path":"losses_negative_only.py","file_url":"https://github.com/chaht01/Co2L/blob/HEAD/losses_negative_only.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, chaht01/Co2L when it was checked","code_sha256":"c43142360bf64ef4","code_sha256_prefix":"c43142360bf64ef4","mcp_get_code":{"code_sha256":"c43142360bf64ef4"}},{"arxiv_id":"2103.05950","arxiv_id_is_arxiv":true,"paper":"/paper/fsce-few-shot-object-detection-via","title":"FSCE: Few-Shot Object Detection via Contrastive Proposal Encoding","date":"2021-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MegviiDetection/FSCE","path":"fsdet/modeling/contrastive_loss.py","file_url":"https://github.com/MegviiDetection/FSCE/blob/HEAD/fsdet/modeling/contrastive_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a99e005b92d2d1b4","code_sha256_prefix":"a99e005b92d2d1b4","mcp_get_code":{"code_sha256":"a99e005b92d2d1b4"}},{"arxiv_id":"2011.02690","arxiv_id_is_arxiv":true,"paper":"/paper/entity-linking-in-100-languages","title":"Entity Linking in 100 Languages","date":"2020-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/tabi","path":"tabi/models/biencoder.py","file_url":"https://github.com/hazyresearch/tabi/blob/HEAD/tabi/models/biencoder.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":"808229e9aa41a103","code_sha256_prefix":"808229e9aa41a103","mcp_get_code":{"code_sha256":"808229e9aa41a103"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"delyan-boychev/grad-cache-con-learning","path":"src/grad_cache_con_learning/losses.py","file_url":"https://github.com/delyan-boychev/grad-cache-con-learning/blob/HEAD/src/grad_cache_con_learning/losses.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":"19bb24ecb5d473db","code_sha256_prefix":"19bb24ecb5d473db","mcp_get_code":{"code_sha256":"19bb24ecb5d473db"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannaiiyanggit/unicon","path":"losses.py","file_url":"https://github.com/hannaiiyanggit/unicon/blob/HEAD/losses.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":"a5dbd9a427e2bec3","code_sha256_prefix":"a5dbd9a427e2bec3","mcp_get_code":{"code_sha256":"a5dbd9a427e2bec3"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liut2016/ecg-supcontrast","path":"losses.py","file_url":"https://github.com/Liut2016/ecg-supcontrast/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d8d1dd0aafb92f18","code_sha256_prefix":"d8d1dd0aafb92f18","mcp_get_code":{"code_sha256":"d8d1dd0aafb92f18"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajatkoner08/oodformer","path":"losses.py","file_url":"https://github.com/rajatkoner08/oodformer/blob/HEAD/losses.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, rajatkoner08/oodformer when it was checked","code_sha256":"1d1a1df3f3426c17","code_sha256_prefix":"1d1a1df3f3426c17","mcp_get_code":{"code_sha256":"1d1a1df3f3426c17"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jwcalder/GraphLearningLayer","path":"losses.py","file_url":"https://github.com/jwcalder/GraphLearningLayer/blob/HEAD/losses.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":"0e2efd6b67f01d69","code_sha256_prefix":"0e2efd6b67f01d69","mcp_get_code":{"code_sha256":"0e2efd6b67f01d69"}},{"arxiv_id":"1906.08237","arxiv_id_is_arxiv":true,"paper":"/paper/xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chesterdu/contrastive_summary","path":"src/model.py","file_url":"https://github.com/chesterdu/contrastive_summary/blob/HEAD/src/model.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, chesterdu/contrastive_summary when it was checked","code_sha256":"624bba127433de69","code_sha256_prefix":"624bba127433de69","mcp_get_code":{"code_sha256":"624bba127433de69"}},{"arxiv_id":"2024.findings-acl.859","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.859","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"1emonx/Amanda","path":"models/amanda_model.py","file_url":"https://github.com/1emonx/Amanda/blob/HEAD/models/amanda_model.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, 1emonx/Amanda when it was checked","code_sha256":"90f10d50525407a6","code_sha256_prefix":"90f10d50525407a6","mcp_get_code":{"code_sha256":"90f10d50525407a6"}}],"record_sha256":"ca6db597789c4a12b297974154a05cb0476bfa7ab74ee0d8cdf77b9e447f5713","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}