{"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/cal-loss","entry":"cal_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":20,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":14,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":20,"n_places_pointer_only":5,"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":3,"ran_fixture":3,"ran":4,"unverified":2},"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":"2605.14252","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14252","title":"Not All Timesteps Matter Equally: Selective Alignment Knowledge Distillation for Spiking Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","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":"f823c61767cb0e17","code_sha256_prefix":"f823c61767cb0e17","mcp_get_code":{"code_sha256":"f823c61767cb0e17"}},{"arxiv_id":"2503.12793","arxiv_id_is_arxiv":true,"paper":"/paper/improving-generalization-of-universal","title":"Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimization","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yechao-zhang/dm-uap","path":"attack_min_x_theta_adam.py","file_url":"https://github.com/yechao-zhang/dm-uap/blob/HEAD/attack_min_x_theta_adam.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":"5976d753d29a1de7","code_sha256_prefix":"5976d753d29a1de7","mcp_get_code":{"code_sha256":"5976d753d29a1de7"}},{"arxiv_id":"2501.15925","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-distillation-of-deep-spiking-neural","title":"Efficient Logit-based Knowledge Distillation of Deep Spiking Neural Networks for Full-Range Timestep Deployment","date":"2025-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelli-chip-lab/snn_temporal_decoupling_distillation","path":"model/layer.py","file_url":"https://github.com/intelli-chip-lab/snn_temporal_decoupling_distillation/blob/HEAD/model/layer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, intelli-chip-lab/snn_temporal_decoupling_distillation when it was checked","code_sha256":"f823c61767cb0e17","code_sha256_prefix":"f823c61767cb0e17","mcp_get_code":{"code_sha256":"f823c61767cb0e17"}},{"arxiv_id":"2411.06448","arxiv_id_is_arxiv":true,"paper":"/paper/over-parameterized-student-model-via-tensor","title":"Over-parameterized Student Model via Tensor Decomposition Boosted Knowledge Distillation","date":"2024-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intell-sci-comput/OPDF","path":"LGTM/utils_glue.py","file_url":"https://github.com/intell-sci-comput/OPDF/blob/HEAD/LGTM/utils_glue.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"940dcf82641060b8","code_sha256_prefix":"940dcf82641060b8","mcp_get_code":{"code_sha256":"940dcf82641060b8"}},{"arxiv_id":"2405.06116","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-efficient-and-effective-point","title":"Rethinking Efficient and Effective Point-based Networks for Event Camera Classification and Regression: EventMamba","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhwxmx/eventmamba","path":"train_classification.py","file_url":"https://github.com/rhwxmx/eventmamba/blob/HEAD/train_classification.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":"ca8b05abe9056f68","code_sha256_prefix":"ca8b05abe9056f68","mcp_get_code":{"code_sha256":"ca8b05abe9056f68"}},{"arxiv_id":"2403.05247","arxiv_id_is_arxiv":true,"paper":"/paper/hide-in-thicket-generating-imperceptible-and","title":"Hide in Thicket: Generating Imperceptible and Rational Adversarial Perturbations on 3D Point Clouds","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TRLou/HiT-ADV","path":"model/pct_utils.py","file_url":"https://github.com/TRLou/HiT-ADV/blob/HEAD/model/pct_utils.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, TRLou/HiT-ADV when it was checked","code_sha256":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"2401.03748","arxiv_id_is_arxiv":true,"paper":"/paper/towards-efficient-communication-federated","title":"Towards Efficient Communication and Secure Federated Recommendation System via Low-rank Training","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnhieu/colr-fedrec","path":"rec/evaluate.py","file_url":"https://github.com/nnhieu/colr-fedrec/blob/HEAD/rec/evaluate.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, nnhieu/colr-fedrec when it was checked","code_sha256":"fee086990f3343e2","code_sha256_prefix":"fee086990f3343e2","mcp_get_code":{"code_sha256":"fee086990f3343e2"}},{"arxiv_id":"2309.10431","arxiv_id_is_arxiv":true,"paper":"/paper/sample-adaptive-augmentation-for-point-cloud","title":"Sample-adaptive Augmentation for Point Cloud Recognition Against Real-world Corruptions","date":"2023-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roywangj/adaptpoint","path":"openpoints/function_adaptpoint/ganloss_cls.py","file_url":"https://github.com/roywangj/adaptpoint/blob/HEAD/openpoints/function_adaptpoint/ganloss_cls.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":"3b189aa530881663","code_sha256_prefix":"3b189aa530881663","mcp_get_code":{"code_sha256":"3b189aa530881663"}},{"arxiv_id":"2305.09651","arxiv_id_is_arxiv":true,"paper":"/paper/tailoring-instructions-to-student-s-learning","title":"Tailoring Instructions to Student's Learning Levels Boosts Knowledge Distillation","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twinkle0331/lgtm","path":"utils_glue.py","file_url":"https://github.com/twinkle0331/lgtm/blob/HEAD/utils_glue.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"940dcf82641060b8","code_sha256_prefix":"940dcf82641060b8","mcp_get_code":{"code_sha256":"940dcf82641060b8"}},{"arxiv_id":"2211.14456","arxiv_id_is_arxiv":true,"paper":"/paper/tetrasphere-a-neural-descriptor-for-o-3","title":"TetraSphere: A Neural Descriptor for O(3)-Invariant Point Cloud Analysis","date":"2022-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pavlo-melnyk/tetrasphere","path":"tetrasphere/utils.py","file_url":"https://github.com/pavlo-melnyk/tetrasphere/blob/HEAD/tetrasphere/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"2211.11682","arxiv_id_is_arxiv":true,"paper":"/paper/pointclip-v2-adapting-clip-for-powerful-3d","title":"PointCLIP V2: Prompting CLIP and GPT for Powerful 3D Open-world Learning","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyangyang127/pointclip_v2","path":"zeroshot_seg/util.py","file_url":"https://github.com/yangyangyang127/pointclip_v2/blob/HEAD/zeroshot_seg/util.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":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"2210.10138","arxiv_id_is_arxiv":true,"paper":"/paper/class-level-confidence-based-3d-semi","title":"Class-Level Confidence Based 3D Semi-Supervised Learning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AutoAILab/Confid-SSL","path":"util.py","file_url":"https://github.com/AutoAILab/Confid-SSL/blob/HEAD/util.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":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"2203.04041","arxiv_id_is_arxiv":true,"paper":"/paper/shape-invariant-3d-adversarial-point-clouds","title":"Shape-invariant 3D Adversarial Point Clouds","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shikiw/SI-Adv","path":"model_utils/pct_util.py","file_url":"https://github.com/shikiw/SI-Adv/blob/HEAD/model_utils/pct_util.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":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"2201.12296","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-robustness-of-3d-point-cloud","title":"Benchmarking Robustness of 3D Point Cloud Recognition Against Common Corruptions","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiachens/ModelNet40-C","path":"pointMLP/classification_ModelNet40/helper.py","file_url":"https://github.com/jiachens/ModelNet40-C/blob/HEAD/pointMLP/classification_ModelNet40/helper.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"2112.01036","arxiv_id_is_arxiv":true,"paper":"/paper/ganseg-learning-to-segment-by-unsupervised","title":"GANSeg: Learning to Segment by Unsupervised Hierarchical Image Generation","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingzhehe/ganseg","path":"train_seg.py","file_url":"https://github.com/xingzhehe/ganseg/blob/HEAD/train_seg.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, xingzhehe/ganseg when it was checked","code_sha256":"4bae234fe244fb49","code_sha256_prefix":"4bae234fe244fb49","mcp_get_code":{"code_sha256":"4bae234fe244fb49"}},{"arxiv_id":"2101.01461","arxiv_id_is_arxiv":true,"paper":"/paper/pointcutmix-regularization-strategy-for-point","title":"PointCutMix: Regularization Strategy for Point Cloud Classification","date":"2021-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuge1995/PointCutMix","path":"train_pointcutmix_k.py","file_url":"https://github.com/cuge1995/PointCutMix/blob/HEAD/train_pointcutmix_k.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":"c6c2758c0c2fa756","code_sha256_prefix":"c6c2758c0c2fa756","mcp_get_code":{"code_sha256":"c6c2758c0c2fa756"}},{"arxiv_id":"1911.00195","arxiv_id_is_arxiv":true,"paper":"/paper/rotation-invariant-point-cloud-classification","title":"Rotation Invariant Point Cloud Classification: Where Local Geometry Meets Global Topology","date":"2019-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sailor-z/LGR-Net","path":"Network.py","file_url":"https://github.com/sailor-z/LGR-Net/blob/HEAD/Network.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":"8d5da11417260382","code_sha256_prefix":"8d5da11417260382","mcp_get_code":{"code_sha256":"8d5da11417260382"}},{"arxiv_id":"1511.02680","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-segnet-model-uncertainty-in-deep","title":"Bayesian SegNet: Model Uncertainty in Deep Convolutional Encoder-Decoder Architectures for Scene Understanding","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hosshonarvar/Image-Segmentation","path":"others_code/evaluation_object.py","file_url":"https://github.com/hosshonarvar/Image-Segmentation/blob/HEAD/others_code/evaluation_object.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":"00a137eeb688bbf2","code_sha256_prefix":"00a137eeb688bbf2","mcp_get_code":{"code_sha256":"00a137eeb688bbf2"}},{"arxiv_id":"2025.naacl-long.61","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.naacl-long.61","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"vonfeng/DPLink","path":"codes/utils.py","file_url":"https://github.com/vonfeng/DPLink/blob/HEAD/codes/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":"64a028b2d831b7b1","code_sha256_prefix":"64a028b2d831b7b1","mcp_get_code":{"code_sha256":"64a028b2d831b7b1"}},{"arxiv_id":"136630375","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136630375 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mmmmimic/diffConvNet","path":"misc.py","file_url":"https://github.com/mmmmimic/diffConvNet/blob/HEAD/misc.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":"a0892f39f9c7e229","code_sha256_prefix":"a0892f39f9c7e229","mcp_get_code":{"code_sha256":"a0892f39f9c7e229"}}],"record_sha256":"404138230405508ab41a2e239568a1ce928f6d3623a8de83392af7c37a07a14d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}