{"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/info-nce-logits","entry":"info_nce_logits","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":11,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":7,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":3},"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":"2512.16202","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-16202","title":"Open Ad-hoc Categorization with Contextualized Feature Learning","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Wayne2Wang/OAK","path":"src/engine/losses.py","file_url":"https://github.com/Wayne2Wang/OAK/blob/HEAD/src/engine/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":"57fdc34a54514350","code_sha256_prefix":"57fdc34a54514350","mcp_get_code":{"code_sha256":"57fdc34a54514350"}},{"arxiv_id":"2504.03755","arxiv_id_is_arxiv":true,"paper":"/paper/protogcd-unified-and-unbiased-prototype","title":"ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discovery","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mashijie1028/protogcd","path":"models/loss.py","file_url":"https://github.com/mashijie1028/protogcd/blob/HEAD/models/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c2e94d4887d26b","code_sha256_prefix":"b3c2e94d4887d26b","mcp_get_code":{"code_sha256":"b3c2e94d4887d26b"}},{"arxiv_id":"2410.06535","arxiv_id_is_arxiv":true,"paper":"/paper/happy-a-debiased-learning-framework-for","title":"Happy: A Debiased Learning Framework for Continual Generalized Category Discovery","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mashijie1028/Happy-CGCD","path":"models/utils_gcd.py","file_url":"https://github.com/mashijie1028/Happy-CGCD/blob/HEAD/models/utils_gcd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c2e94d4887d26b","code_sha256_prefix":"b3c2e94d4887d26b","mcp_get_code":{"code_sha256":"b3c2e94d4887d26b"}},{"arxiv_id":"2408.14371","arxiv_id_is_arxiv":true,"paper":"/paper/selex-self-expertise-in-fine-grained","title":"SelEx: Self-Expertise in Fine-Grained Generalized Category Discovery","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sarahrastegar/selex","path":"methods/contrastive_training/contrastive_training.py","file_url":"https://github.com/sarahrastegar/selex/blob/HEAD/methods/contrastive_training/contrastive_training.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":"40f5a2f8b0143f94","code_sha256_prefix":"40f5a2f8b0143f94","mcp_get_code":{"code_sha256":"40f5a2f8b0143f94"}},{"arxiv_id":"2403.09974","arxiv_id_is_arxiv":true,"paper":"/paper/get-unlocking-the-multi-modal-potential-of","title":"Unlocking the Multi-modal Potential of CLIP for Generalized Category Discovery","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enguangw/get","path":"model.py","file_url":"https://github.com/enguangw/get/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c2e94d4887d26b","code_sha256_prefix":"b3c2e94d4887d26b","mcp_get_code":{"code_sha256":"b3c2e94d4887d26b"}},{"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":"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":"85ee1355feee1220","code_sha256_prefix":"85ee1355feee1220","mcp_get_code":{"code_sha256":"85ee1355feee1220"}},{"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_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":"dc61c49b216cea13","code_sha256_prefix":"dc61c49b216cea13","mcp_get_code":{"code_sha256":"dc61c49b216cea13"}},{"arxiv_id":"2308.12112","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-continual-category-discovery","title":"Category Adaptation Meets Projected Distillation in Generalized Continual Category Discovery","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grypesc/camp","path":"utils/losses.py","file_url":"https://github.com/grypesc/camp/blob/HEAD/utils/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, grypesc/camp when it was checked","code_sha256":"c2cb4004f0d0ce2a","code_sha256_prefix":"c2cb4004f0d0ce2a","mcp_get_code":{"code_sha256":"c2cb4004f0d0ce2a"}},{"arxiv_id":"2308.11063","arxiv_id_is_arxiv":true,"paper":"/paper/metagcd-learning-to-continually-learn-in","title":"MetaGCD: Learning to Continually Learn in Generalized Category Discovery","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ynanwu/metagcd","path":"models/utils.py","file_url":"https://github.com/ynanwu/metagcd/blob/HEAD/models/utils.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, ynanwu/metagcd when it was checked","code_sha256":"8334bb1bcb28d820","code_sha256_prefix":"8334bb1bcb28d820","mcp_get_code":{"code_sha256":"8334bb1bcb28d820"}},{"arxiv_id":"2305.06144","arxiv_id_is_arxiv":true,"paper":"/paper/learning-semi-supervised-gaussian-mixture","title":"Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discovery","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DTennant/GPC","path":"project_utils/loss_utils.py","file_url":"https://github.com/DTennant/GPC/blob/HEAD/project_utils/loss_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":"261eee9d69c08e44","code_sha256_prefix":"261eee9d69c08e44","mcp_get_code":{"code_sha256":"261eee9d69c08e44"}},{"arxiv_id":"2211.11727","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-parametric-classification-baseline","title":"Parametric Classification for Generalized Category Discovery: A Baseline Study","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvmi-lab/simgcd","path":"model.py","file_url":"https://github.com/cvmi-lab/simgcd/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c2e94d4887d26b","code_sha256_prefix":"b3c2e94d4887d26b","mcp_get_code":{"code_sha256":"b3c2e94d4887d26b"}},{"arxiv_id":"2201.02609","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-category-discovery","title":"Generalized Category Discovery","date":"2022-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sgvaze/generalized-category-discovery","path":"methods/contrastive_training/contrastive_training.py","file_url":"https://github.com/sgvaze/generalized-category-discovery/blob/HEAD/methods/contrastive_training/contrastive_training.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":"77f9f4c0ee87724e","code_sha256_prefix":"77f9f4c0ee87724e","mcp_get_code":{"code_sha256":"77f9f4c0ee87724e"}},{"arxiv_id":"openreview_YA3AvVx2Ze","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_YA3AvVx2Ze","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lytang63/CoGe-GCD","path":"methods/contrastive_training/contrastive_training.py","file_url":"https://github.com/lytang63/CoGe-GCD/blob/HEAD/methods/contrastive_training/contrastive_training.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":"40f5a2f8b0143f94","code_sha256_prefix":"40f5a2f8b0143f94","mcp_get_code":{"code_sha256":"40f5a2f8b0143f94"}},{"arxiv_id":"Wang_GET_Unlocking_the_Multi-modal_Potential_of_CLIP_for_Generalized_Category_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_GET_Unlocking_the_Multi-modal_Potential_of_CLIP_for_Generalized_Category_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"enguangW/GET","path":"model.py","file_url":"https://github.com/enguangW/GET/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c2e94d4887d26b","code_sha256_prefix":"b3c2e94d4887d26b","mcp_get_code":{"code_sha256":"b3c2e94d4887d26b"}},{"arxiv_id":"Huang_AnomalyNCD_Towards_Novel_Anomaly_Class_Discovery_in_Industrial_Scenarios_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_AnomalyNCD_Towards_Novel_Anomaly_Class_Discovery_in_Industrial_Scenarios_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HUST-SLOW/AnomalyNCD","path":"models/loss/_contrastive_loss.py","file_url":"https://github.com/HUST-SLOW/AnomalyNCD/blob/HEAD/models/loss/_contrastive_loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3c2e94d4887d26b","code_sha256_prefix":"b3c2e94d4887d26b","mcp_get_code":{"code_sha256":"b3c2e94d4887d26b"}}],"record_sha256":"dd2ffdc8d6234daf87310184569c1220cb08a59ef0b6a1e51359ac6921963007","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}