{"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/calc-loss","entry":"calc_loss","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":35,"n_papers_ran":27,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":11,"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":31,"n_samples_ran":23,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":10,"n_samples_unverified":8,"n_samples_fingerprinted":6,"n_places":41,"n_places_pointer_only":13,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":5,"ran":11,"unverified":8},"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":"2410.20197","arxiv_id_is_arxiv":true,"paper":"/paper/transferable-adversarial-attacks-on-sam-and","title":"Transferable Adversarial Attacks on SAM and Its Downstream Models","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiasong0501/grat","path":"one_sample_train.py","file_url":"https://github.com/xiasong0501/grat/blob/HEAD/one_sample_train.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":"40f56fce40b517b1","code_sha256_prefix":"40f56fce40b517b1","mcp_get_code":{"code_sha256":"40f56fce40b517b1"}},{"arxiv_id":"2405.11724","arxiv_id_is_arxiv":true,"paper":"/paper/token-wise-influential-training-data","title":"Token-wise Influential Training Data Retrieval for Large Language Models","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-lin/RapidIn","path":"RapidIn/calc_inner.py","file_url":"https://github.com/huawei-lin/RapidIn/blob/HEAD/RapidIn/calc_inner.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, huawei-lin/RapidIn (NOASSERTION)","code_sha256":"3b9e99e67f054149","code_sha256_prefix":"3b9e99e67f054149","mcp_get_code":{"code_sha256":"3b9e99e67f054149"}},{"arxiv_id":"2404.06486","arxiv_id_is_arxiv":true,"paper":"/paper/go4align-group-optimization-for-multi-task","title":"GO4Align: Group Optimization for Multi-Task Alignment","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"c6155037f0a674c4","code_sha256_prefix":"c6155037f0a674c4","mcp_get_code":{"code_sha256":"c6155037f0a674c4"}},{"arxiv_id":"2403.18271","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-sam-for-medical","title":"Unleashing the Potential of SAM for Medical Adaptation via Hierarchical Decoding","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cccccczh404/h-sam","path":"trainer.py","file_url":"https://github.com/cccccczh404/h-sam/blob/HEAD/trainer.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":"ad5471db7ab93cbf","code_sha256_prefix":"ad5471db7ab93cbf","mcp_get_code":{"code_sha256":"ad5471db7ab93cbf"}},{"arxiv_id":"2402.16338","arxiv_id_is_arxiv":true,"paper":"/paper/blo-sam-bi-level-optimization-based","title":"BLO-SAM: Bi-level Optimization Based Overfitting-Preventing Finetuning of SAM","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"importzl/blo-sam","path":"trainer.py","file_url":"https://github.com/importzl/blo-sam/blob/HEAD/trainer.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, importzl/blo-sam when it was checked","code_sha256":"ad5471db7ab93cbf","code_sha256_prefix":"ad5471db7ab93cbf","mcp_get_code":{"code_sha256":"ad5471db7ab93cbf"}},{"arxiv_id":"2402.16338","arxiv_id_is_arxiv":true,"paper":"/paper/blo-sam-bi-level-optimization-based","title":"BLO-SAM: Bi-level Optimization Based Overfitting-Preventing Finetuning of SAM","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"importzl/blo-sam","path":"prompt.py","file_url":"https://github.com/importzl/blo-sam/blob/HEAD/prompt.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, importzl/blo-sam when it was checked","code_sha256":"5c939eca7a512176","code_sha256_prefix":"5c939eca7a512176","mcp_get_code":{"code_sha256":"5c939eca7a512176"}},{"arxiv_id":"2402.10208","arxiv_id_is_arxiv":true,"paper":"/paper/recovering-the-pre-fine-tuning-weights-of","title":"Recovering the Pre-Fine-Tuning Weights of Generative Models","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eliahuhorwitz/Spectral-DeTuning","path":"spectral_detuning.py","file_url":"https://github.com/eliahuhorwitz/Spectral-DeTuning/blob/HEAD/spectral_detuning.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, eliahuhorwitz/Spectral-DeTuning (NOASSERTION)","code_sha256":"69b972e54e2a148f","code_sha256_prefix":"69b972e54e2a148f","mcp_get_code":{"code_sha256":"69b972e54e2a148f"}},{"arxiv_id":"2311.02189","arxiv_id_is_arxiv":true,"paper":"/paper/fairseg-a-large-scale-medical-image","title":"FairSeg: A Large-Scale Medical Image Segmentation Dataset for Fairness Learning Using Segment Anything Model with Fair Error-Bound Scaling","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harvard-ophthalmology-ai-lab/fairseg","path":"TransUNet/trainer.py","file_url":"https://github.com/harvard-ophthalmology-ai-lab/fairseg/blob/HEAD/TransUNet/trainer.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, harvard-ophthalmology-ai-lab/fairseg when it was checked","code_sha256":"ad5471db7ab93cbf","code_sha256_prefix":"ad5471db7ab93cbf","mcp_get_code":{"code_sha256":"ad5471db7ab93cbf"}},{"arxiv_id":"2310.09336","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-abilities-emerge","title":"Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Task","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phys-ai/concept_graphs","path":"plotting.py","file_url":"https://github.com/phys-ai/concept_graphs/blob/HEAD/plotting.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, phys-ai/concept_graphs when it was checked","code_sha256":"42a12d0a4bf4d2e0","code_sha256_prefix":"42a12d0a4bf4d2e0","mcp_get_code":{"code_sha256":"42a12d0a4bf4d2e0"}},{"arxiv_id":"2310.05885","arxiv_id_is_arxiv":true,"paper":"/paper/dtpp-differentiable-joint-conditional","title":"DTPP: Differentiable Joint Conditional Prediction and Cost Evaluation for Tree Policy Planning in Autonomous Driving","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":"archive","repo":"mczhi/dtpp","path":"train_utils.py","file_url":"https://github.com/mczhi/dtpp/blob/HEAD/train_utils.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":"60ae27a9d035f0e0","code_sha256_prefix":"60ae27a9d035f0e0","mcp_get_code":{"code_sha256":"60ae27a9d035f0e0"}},{"arxiv_id":"2309.08842","arxiv_id_is_arxiv":true,"paper":"/paper/ma-sam-modality-agnostic-sam-adaptation-for","title":"MA-SAM: Modality-agnostic SAM Adaptation for 3D Medical Image Segmentation","date":"2023-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchen-cc/ma-sam","path":"MA-SAM/trainer.py","file_url":"https://github.com/cchen-cc/ma-sam/blob/HEAD/MA-SAM/trainer.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":"ad5471db7ab93cbf","code_sha256_prefix":"ad5471db7ab93cbf","mcp_get_code":{"code_sha256":"ad5471db7ab93cbf"}},{"arxiv_id":"2308.10467","arxiv_id_is_arxiv":true,"paper":"/paper/single-user-injection-for-invisible-shilling","title":"Single-User Injection for Invisible Shilling Attack against Recommender Systems","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdegroup/sui-attack","path":"models/influence/influence_function.py","file_url":"https://github.com/kdegroup/sui-attack/blob/HEAD/models/influence/influence_function.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from deeplearning-wisc/knn-ood, and GitHub detected no licence in that repository when it was checked","code_sha256":"7d9344ac520f8918","code_sha256_prefix":"7d9344ac520f8918","mcp_get_code":{"code_sha256":"7d9344ac520f8918"}},{"arxiv_id":"2307.15429","arxiv_id_is_arxiv":true,"paper":"/paper/improvable-gap-balancing-for-multi-task","title":"Improvable Gap Balancing for Multi-Task Learning","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"c6155037f0a674c4","code_sha256_prefix":"c6155037f0a674c4","mcp_get_code":{"code_sha256":"c6155037f0a674c4"}},{"arxiv_id":"2307.15043","arxiv_id_is_arxiv":true,"paper":"/paper/universal-and-transferable-adversarial","title":"Universal and Transferable Adversarial Attacks on Aligned Language Models","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sj21j/Regularized_Relaxation","path":"softprompt.py","file_url":"https://github.com/sj21j/Regularized_Relaxation/blob/HEAD/softprompt.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":"e496788013a04ab0","code_sha256_prefix":"e496788013a04ab0","mcp_get_code":{"code_sha256":"e496788013a04ab0"}},{"arxiv_id":"2307.15043","arxiv_id_is_arxiv":true,"paper":"/paper/universal-and-transferable-adversarial","title":"Universal and Transferable Adversarial Attacks on Aligned Language Models","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sj21j/Regularized_Relaxation","path":"pgd.py","file_url":"https://github.com/sj21j/Regularized_Relaxation/blob/HEAD/pgd.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":"bbec7a51e90453b0","code_sha256_prefix":"bbec7a51e90453b0","mcp_get_code":{"code_sha256":"bbec7a51e90453b0"}},{"arxiv_id":"2306.12737","arxiv_id_is_arxiv":true,"paper":"/paper/ladder-fine-tuning-approach-for-sam","title":"Ladder Fine-tuning approach for SAM integrating complementary network","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"11yxk/sam-lst","path":"trainer.py","file_url":"https://github.com/11yxk/sam-lst/blob/HEAD/trainer.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":"ad5471db7ab93cbf","code_sha256_prefix":"ad5471db7ab93cbf","mcp_get_code":{"code_sha256":"ad5471db7ab93cbf"}},{"arxiv_id":"2306.10161","arxiv_id_is_arxiv":true,"paper":"/paper/building-the-bridge-of-schrodinger-a-1","title":"Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/entropicotbenchmark","path":"benchmark/glow_train.py","file_url":"https://github.com/ngushchin/entropicotbenchmark/blob/HEAD/benchmark/glow_train.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":"5450899cdebae728","code_sha256_prefix":"5450899cdebae728","mcp_get_code":{"code_sha256":"5450899cdebae728"}},{"arxiv_id":"2306.03792","arxiv_id_is_arxiv":true,"paper":"/paper/famo-fast-adaptive-multitask-optimization-1","title":"FAMO: Fast Adaptive Multitask Optimization","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cranial-xix/famo","path":"experiments/nyuv2/trainer.py","file_url":"https://github.com/cranial-xix/famo/blob/HEAD/experiments/nyuv2/trainer.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":"c6155037f0a674c4","code_sha256_prefix":"c6155037f0a674c4","mcp_get_code":{"code_sha256":"c6155037f0a674c4"}},{"arxiv_id":"2305.18409","arxiv_id_is_arxiv":true,"paper":"/paper/direction-oriented-multi-objective-learning","title":"Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-opt-lab/sdmgrad","path":"experiments/cityscapes/trainer.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/cityscapes/trainer.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":"0a0f4c8898070a9d","code_sha256_prefix":"0a0f4c8898070a9d","mcp_get_code":{"code_sha256":"0a0f4c8898070a9d"}},{"arxiv_id":"2305.15832","arxiv_id_is_arxiv":true,"paper":"/paper/all-points-matter-entropy-regularized-1","title":"All Points Matter: Entropy-Regularized Distribution Alignment for Weakly-supervised 3D Segmentation","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiyaoTang/ERDA","path":"models/head.py","file_url":"https://github.com/LiyaoTang/ERDA/blob/HEAD/models/head.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":"87082c78c01cdcc8","code_sha256_prefix":"87082c78c01cdcc8","mcp_get_code":{"code_sha256":"87082c78c01cdcc8"}},{"arxiv_id":"2305.08296","arxiv_id_is_arxiv":true,"paper":"/paper/neural-face-rigging-for-animating-and","title":"Neural Face Rigging for Animating and Retargeting Facial Meshes in the Wild","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dafei-qin/NFR_pytorch","path":"FWH_run.py","file_url":"https://github.com/dafei-qin/NFR_pytorch/blob/HEAD/FWH_run.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":"df2d65dfef54b47d","code_sha256_prefix":"df2d65dfef54b47d","mcp_get_code":{"code_sha256":"df2d65dfef54b47d"}},{"arxiv_id":"2304.13785","arxiv_id_is_arxiv":true,"paper":"/paper/customized-segment-anything-model-for-medical","title":"Customized Segment Anything Model for Medical Image Segmentation","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitachinsk/samed","path":"SAMed_h/trainer.py","file_url":"https://github.com/hitachinsk/samed/blob/HEAD/SAMed_h/trainer.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":"ad5471db7ab93cbf","code_sha256_prefix":"ad5471db7ab93cbf","mcp_get_code":{"code_sha256":"ad5471db7ab93cbf"}},{"arxiv_id":"2210.17433","arxiv_id_is_arxiv":true,"paper":"/paper/enabling-the-discovery-of-fast-transients-a","title":"Enabling the discovery of fast transients: A kilonova science module for the Fink broker","date":null,"month_inferred_from_arxiv_id":"2022-10","title_source":"archive","repo":"b-biswas/kndetect","path":"kndetect/features.py","file_url":"https://github.com/b-biswas/kndetect/blob/HEAD/kndetect/features.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94ef65b0db65b453","code_sha256_prefix":"94ef65b0db65b453","mcp_get_code":{"code_sha256":"94ef65b0db65b453"}},{"arxiv_id":"2210.02724","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-instance-features-for-label","title":"Leveraging Instance Features for Label Aggregation in Programmatic Weak Supervision","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JieyuZ2/wrench","path":"wrench/endmodel/cosine.py","file_url":"https://github.com/JieyuZ2/wrench/blob/HEAD/wrench/endmodel/cosine.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":"ad14014186a0bf9e","code_sha256_prefix":"ad14014186a0bf9e","mcp_get_code":{"code_sha256":"ad14014186a0bf9e"}},{"arxiv_id":"2208.03812","arxiv_id_is_arxiv":true,"paper":"/paper/when-can-i-speak-predicting-initiation-points","title":"When can I Speak? Predicting initiation points for spoken dialogue agents","date":"2022-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siyan-sylvia-li/icarus_final","path":"icarus_gmm_trainer.py","file_url":"https://github.com/siyan-sylvia-li/icarus_final/blob/HEAD/icarus_gmm_trainer.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":"a563b5d8b711445b","code_sha256_prefix":"a563b5d8b711445b","mcp_get_code":{"code_sha256":"a563b5d8b711445b"}},{"arxiv_id":"2208.03812","arxiv_id_is_arxiv":true,"paper":"/paper/when-can-i-speak-predicting-initiation-points","title":"When can I Speak? Predicting initiation points for spoken dialogue agents","date":"2022-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siyan-sylvia-li/icarus_final","path":"icarus_heatmap_trainer.py","file_url":"https://github.com/siyan-sylvia-li/icarus_final/blob/HEAD/icarus_heatmap_trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28b2e0c2fab85f9c","code_sha256_prefix":"28b2e0c2fab85f9c","mcp_get_code":{"code_sha256":"28b2e0c2fab85f9c"}},{"arxiv_id":"2208.03812","arxiv_id_is_arxiv":true,"paper":"/paper/when-can-i-speak-predicting-initiation-points","title":"When can I Speak? Predicting initiation points for spoken dialogue agents","date":"2022-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siyan-sylvia-li/icarus_final","path":"icarus_min_trainer.py","file_url":"https://github.com/siyan-sylvia-li/icarus_final/blob/HEAD/icarus_min_trainer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d417aa3b42feb48","code_sha256_prefix":"4d417aa3b42feb48","mcp_get_code":{"code_sha256":"4d417aa3b42feb48"}},{"arxiv_id":"2204.06507","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-distribution-detection-with-deep","title":"Out-of-Distribution Detection with Deep Nearest Neighbors","date":"2022-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/knn-ood","path":"util/score.py","file_url":"https://github.com/deeplearning-wisc/knn-ood/blob/HEAD/util/score.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, deeplearning-wisc/knn-ood when it was checked","code_sha256":"7d9344ac520f8918","code_sha256_prefix":"7d9344ac520f8918","mcp_get_code":{"code_sha256":"7d9344ac520f8918"}},{"arxiv_id":"2203.07264","arxiv_id_is_arxiv":true,"paper":"/paper/show-me-more-details-discovering-hierarchies","title":"Show Me More Details: Discovering Hierarchies of Procedures from Semi-structured Web Data","date":"2022-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuyanzhou/wikihow_hierarchy","path":"reranking/inference.py","file_url":"https://github.com/shuyanzhou/wikihow_hierarchy/blob/HEAD/reranking/inference.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, shuyanzhou/wikihow_hierarchy when it was checked","code_sha256":"b64372507baf6d77","code_sha256_prefix":"b64372507baf6d77","mcp_get_code":{"code_sha256":"b64372507baf6d77"}},{"arxiv_id":"2203.03833","arxiv_id_is_arxiv":true,"paper":"/paper/quasi-balanced-self-training-on-noise-aware","title":"Quasi-Balanced Self-Training on Noise-Aware Synthesis of Object Point Clouds for Closing Domain Gap","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/QS3","path":"DefCls.py","file_url":"https://github.com/Gorilla-Lab-SCUT/QS3/blob/HEAD/DefCls.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":"1f8af716d9bd010b","code_sha256_prefix":"1f8af716d9bd010b","mcp_get_code":{"code_sha256":"1f8af716d9bd010b"}},{"arxiv_id":"2203.03833","arxiv_id_is_arxiv":true,"paper":"/paper/quasi-balanced-self-training-on-noise-aware","title":"Quasi-Balanced Self-Training on Noise-Aware Synthesis of Object Point Clouds for Closing Domain Gap","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/QS3","path":"PCM.py","file_url":"https://github.com/Gorilla-Lab-SCUT/QS3/blob/HEAD/PCM.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":"f3c8ecae4d1fc6b1","code_sha256_prefix":"f3c8ecae4d1fc6b1","mcp_get_code":{"code_sha256":"f3c8ecae4d1fc6b1"}},{"arxiv_id":"2203.03833","arxiv_id_is_arxiv":true,"paper":"/paper/quasi-balanced-self-training-on-noise-aware","title":"Quasi-Balanced Self-Training on Noise-Aware Synthesis of Object Point Clouds for Closing Domain Gap","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/QS3","path":"PosReg.py","file_url":"https://github.com/Gorilla-Lab-SCUT/QS3/blob/HEAD/PosReg.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":"6a987abc783d48a4","code_sha256_prefix":"6a987abc783d48a4","mcp_get_code":{"code_sha256":"6a987abc783d48a4"}},{"arxiv_id":"2111.07677","arxiv_id_is_arxiv":true,"paper":"/paper/fastflow-unsupervised-anomaly-detection-and","title":"FastFlow: Unsupervised Anomaly Detection and Localization via 2D Normalizing Flows","date":"2021-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RistoranteRist/FastFlow","path":"utils.py","file_url":"https://github.com/RistoranteRist/FastFlow/blob/HEAD/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":"a1c1c89b7d27cf53","code_sha256_prefix":"a1c1c89b7d27cf53","mcp_get_code":{"code_sha256":"a1c1c89b7d27cf53"}},{"arxiv_id":"2108.09169","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-aware-self-training-for-unsupervised","title":"Geometry-Aware Self-Training for Unsupervised Domain Adaptationon Object Point Clouds","date":"2021-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zou-longkun/gast","path":"NormReg.py","file_url":"https://github.com/zou-longkun/gast/blob/HEAD/NormReg.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, zou-longkun/gast when it was checked","code_sha256":"8109d1bb8e51e851","code_sha256_prefix":"8109d1bb8e51e851","mcp_get_code":{"code_sha256":"8109d1bb8e51e851"}},{"arxiv_id":"2106.12699","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-from-normalizing","title":"Distilling the Knowledge from Conditional Normalizing Flows","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/distill-nf","path":"waveglow/models/waveglow.py","file_url":"https://github.com/yandex-research/distill-nf/blob/HEAD/waveglow/models/waveglow.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":"4e8785b3c11abfe7","code_sha256_prefix":"4e8785b3c11abfe7","mcp_get_code":{"code_sha256":"4e8785b3c11abfe7"}},{"arxiv_id":"2106.04753","arxiv_id_is_arxiv":true,"paper":"/paper/on-sample-based-explanation-methods-for-nlp","title":"On Sample Based Explanation Methods for NLP:Efficiency, Faithfulness, and Semantic Evaluation","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/TracInF","path":"code/pif/influence_functions/hvp_grad.py","file_url":"https://github.com/IBM/TracInF/blob/HEAD/code/pif/influence_functions/hvp_grad.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":"726d0822a9e90aaf","code_sha256_prefix":"726d0822a9e90aaf","mcp_get_code":{"code_sha256":"726d0822a9e90aaf"}},{"arxiv_id":"2105.14203","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-instance-based-interpretability","title":"Understanding Instance-based Interpretability of Variational Auto-Encoders","date":"2021-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fengnima/vae-tracin-pytorch","path":"tracin.py","file_url":"https://github.com/fengnima/vae-tracin-pytorch/blob/HEAD/tracin.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5380fb72510af9a7","code_sha256_prefix":"5380fb72510af9a7","mcp_get_code":{"code_sha256":"5380fb72510af9a7"}},{"arxiv_id":"2010.08895","arxiv_id_is_arxiv":true,"paper":"/paper/fourier-neural-operator-for-parametric-1","title":"Fourier Neural Operator for Parametric Partial Differential Equations","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sala-group/autows-bench-101","path":"wrench/endmodel/cosine.py","file_url":"https://github.com/sala-group/autows-bench-101/blob/HEAD/wrench/endmodel/cosine.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":"ad14014186a0bf9e","code_sha256_prefix":"ad14014186a0bf9e","mcp_get_code":{"code_sha256":"ad14014186a0bf9e"}},{"arxiv_id":"2003.12641","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-for-domain","title":"Self-Supervised Learning for Domain Adaptation on Point-Clouds","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdanAchituve/DefRec_and_PCM","path":"DefRec_and_PCM/PCM.py","file_url":"https://github.com/IdanAchituve/DefRec_and_PCM/blob/HEAD/DefRec_and_PCM/PCM.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, IdanAchituve/DefRec_and_PCM when it was checked","code_sha256":"c74c1b9644da78ce","code_sha256_prefix":"c74c1b9644da78ce","mcp_get_code":{"code_sha256":"c74c1b9644da78ce"}},{"arxiv_id":"1810.00162","arxiv_id_is_arxiv":true,"paper":"/paper/nice-noise-injection-and-clamping-estimation","title":"NICE: Noise Injection and Clamping Estimation for Neural Network Quantization","date":"2018-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lancer555/NICE","path":"loss.py","file_url":"https://github.com/Lancer555/NICE/blob/HEAD/loss.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":"528eda19fa60bac0","code_sha256_prefix":"528eda19fa60bac0","mcp_get_code":{"code_sha256":"528eda19fa60bac0"}},{"arxiv_id":"1807.03039","arxiv_id_is_arxiv":true,"paper":"/paper/glow-generative-flow-with-invertible-1x1","title":"Glow: Generative Flow with Invertible 1x1 Convolutions","date":"2018-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eyalbetzalel/GLOW","path":"train_local_pc.py","file_url":"https://github.com/eyalbetzalel/GLOW/blob/HEAD/train_local_pc.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":"5450899cdebae728","code_sha256_prefix":"5450899cdebae728","mcp_get_code":{"code_sha256":"5450899cdebae728"}}],"record_sha256":"b6785af4a0b3478a1cbc0ec263c4a60de9594a2c3aabab0619444f70646ac811","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}