{"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/smooth-l1-loss","entry":"smooth_l1_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":28,"n_papers_ran":26,"n_papers_ran_no_instrument_failure":23,"n_papers_ran_instrument_only":3,"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":7,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":8,"n_places":28,"n_places_pointer_only":12,"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":0,"ran":7,"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":"2601.22576","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22576","title":"Bonnet: Ultra-Fast Whole-Body Bone Segmentation from CT Scans","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"HINTLab/Bonnet","path":"src/losses/bbox_loss.py","file_url":"https://github.com/HINTLab/Bonnet/blob/HEAD/src/losses/bbox_loss.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":"2d8d6b5c58e10cfc","code_sha256_prefix":"2d8d6b5c58e10cfc","mcp_get_code":{"code_sha256":"2d8d6b5c58e10cfc"}},{"arxiv_id":"2412.01506","arxiv_id_is_arxiv":true,"paper":"/paper/structured-3d-latents-for-scalable-and","title":"Structured 3D Latents for Scalable and Versatile 3D Generation","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/TRELLIS","path":"trellis/utils/loss_utils.py","file_url":"https://github.com/Microsoft/TRELLIS/blob/HEAD/trellis/utils/loss_utils.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":"c6ce2d5852baecaa","code_sha256_prefix":"c6ce2d5852baecaa","mcp_get_code":{"code_sha256":"c6ce2d5852baecaa"}},{"arxiv_id":"2411.01505","arxiv_id_is_arxiv":true,"paper":"/paper/object-segmentation-from-common-fate-motion","title":"Object segmentation from common fate: Motion energy processing enables human-like zero-shot generalization to random dot stimuli","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtangemann/motion_energy_segmentation","path":"motion_energy_segmentation/flow_former_plus_plus/_extern/core/loss.py","file_url":"https://github.com/mtangemann/motion_energy_segmentation/blob/HEAD/motion_energy_segmentation/flow_former_plus_plus/_extern/core/loss.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, mtangemann/motion_energy_segmentation when it was checked","code_sha256":"5464e22d6859392a","code_sha256_prefix":"5464e22d6859392a","mcp_get_code":{"code_sha256":"5464e22d6859392a"}},{"arxiv_id":"2407.11499","arxiv_id_is_arxiv":true,"paper":"/paper/bridge-past-and-future-overcoming-information","title":"Bridge Past and Future: Overcoming Information Asymmetry in Incremental Object Detection","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isee-laboratory/bpf","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/isee-laboratory/bpf/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2405.14497","arxiv_id_is_arxiv":true,"paper":"/paper/improving-single-domain-generalized-object","title":"Improving Single Domain-Generalized Object Detection: A Focus on Diversification and Alignment","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msohaildanish/DivAlign","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/msohaildanish/DivAlign/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2404.03159","arxiv_id_is_arxiv":true,"paper":"/paper/handdiff-3d-hand-pose-estimation-with","title":"HandDiff: 3D Hand Pose Estimation with Diffusion on Image-Point Cloud","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cwc1260/HandDiff","path":"network_handdiff.py","file_url":"https://github.com/cwc1260/HandDiff/blob/HEAD/network_handdiff.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":"f68d8fc37ba13577","code_sha256_prefix":"f68d8fc37ba13577","mcp_get_code":{"code_sha256":"f68d8fc37ba13577"}},{"arxiv_id":"2401.09786","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-self-training-framework-for-fine","title":"Adaptive Self-training Framework for Fine-grained Scene Graph Generation","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlqja1107/torch-ST-SGG","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/rlqja1107/torch-ST-SGG/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.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, rlqja1107/torch-ST-SGG when it was checked","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2308.08182","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptive-detection-with","title":"Unsupervised Domain Adaptive Detection with Network Stability Analysis","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiankongzhang/nsa","path":"detection/layers/losses.py","file_url":"https://github.com/tiankongzhang/nsa/blob/HEAD/detection/layers/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, tiankongzhang/nsa when it was checked","code_sha256":"aadb076657e5223e","code_sha256_prefix":"aadb076657e5223e","mcp_get_code":{"code_sha256":"aadb076657e5223e"}},{"arxiv_id":"2205.09363","arxiv_id_is_arxiv":true,"paper":"/paper/plane-geometry-diagram-parsing","title":"Plane Geometry Diagram Parsing","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingliangzhang2018/PGDP","path":"geo_parse/layers/smooth_l1_loss.py","file_url":"https://github.com/mingliangzhang2018/PGDP/blob/HEAD/geo_parse/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2111.12698","arxiv_id_is_arxiv":true,"paper":"/paper/open-vocabulary-instance-segmentation-via","title":"Open-Vocabulary Instance Segmentation via Robust Cross-Modal Pseudo-Labeling","date":"2021-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hbdat/cvpr22_cross_modal_pseudo_labeling","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/hbdat/cvpr22_cross_modal_pseudo_labeling/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, hbdat/cvpr22_cross_modal_pseudo_labeling, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2110.14191","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-supervised-object-detection-by","title":"Mixed Supervised Object Detection by Transferring Mask Prior and Semantic Similarity","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bcmi/tramas-weak-shot-object-detection","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/bcmi/tramas-weak-shot-object-detection/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, bcmi/tramas-weak-shot-object-detection, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2107.12664","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-boundary-proposal-network-for","title":"Adaptive Boundary Proposal Network for Arbitrary Shape Text Detection","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GXYM/TextBPN","path":"network/Reg_loss.py","file_url":"https://github.com/GXYM/TextBPN/blob/HEAD/network/Reg_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":"be7c75a837a110ff","code_sha256_prefix":"be7c75a837a110ff","mcp_get_code":{"code_sha256":"be7c75a837a110ff"}},{"arxiv_id":"2103.15365","arxiv_id_is_arxiv":true,"paper":"/paper/visual-distant-supervision-for-scene-graph","title":"Visual Distant Supervision for Scene Graph Generation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/VisualDS","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/thunlp/VisualDS/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2008.11714","arxiv_id_is_arxiv":true,"paper":"/paper/drg-dual-relation-graph-for-human-object","title":"DRG: Dual Relation Graph for Human-Object Interaction Detection","date":"2020-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vt-vl-lab/DRG","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/vt-vl-lab/DRG/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, vt-vl-lab/DRG, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2007.10787","arxiv_id_is_arxiv":true,"paper":"/paper/deep-semi-supervised-knowledge-distillation","title":"Deep Semi-supervised Knowledge Distillation for Overlapping Cervical Cell Instance Segmentation","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SIAAAAAA/MMT-PSM","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/SIAAAAAA/MMT-PSM/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, SIAAAAAA/MMT-PSM, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"33cbd9d01ff4d69e","code_sha256_prefix":"33cbd9d01ff4d69e","mcp_get_code":{"code_sha256":"33cbd9d01ff4d69e"}},{"arxiv_id":"2007.10323","arxiv_id_is_arxiv":true,"paper":"/paper/pillar-based-object-detection-for-autonomous","title":"Pillar-based Object Detection for Autonomous Driving","date":"2020-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangYueFt/pillar-od","path":"loss.py","file_url":"https://github.com/WangYueFt/pillar-od/blob/HEAD/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":"cf26f601b7f98582","code_sha256_prefix":"cf26f601b7f98582","mcp_get_code":{"code_sha256":"cf26f601b7f98582"}},{"arxiv_id":"2007.07986","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-weakly-supervised-object-detection","title":"Boosting Weakly Supervised Object Detection with Progressive Knowledge Transfer","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikuhatsune/wsod_transfer","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/mikuhatsune/wsod_transfer/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, mikuhatsune/wsod_transfer, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2004.06002","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-r-cnn-towards-high-quality-object","title":"Dynamic R-CNN: Towards High Quality Object Detection via Dynamic Training","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkzhang95/DynamicRCNN","path":"dynamic_rcnn/det_opr/loss.py","file_url":"https://github.com/hkzhang95/DynamicRCNN/blob/HEAD/dynamic_rcnn/det_opr/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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2004.00900","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-segment-the-tail","title":"Learning to Segment the Tail","date":"2020-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoyHuYY1412/LST_LVIS","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/JoyHuYY1412/LST_LVIS/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, JoyHuYY1412/LST_LVIS, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"2003.09163","arxiv_id_is_arxiv":true,"paper":"/paper/detection-in-crowded-scenes-one-proposal","title":"Detection in Crowded Scenes: One Proposal, Multiple Predictions","date":"2020-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Purkialo/CrowdDet","path":"lib/det_oprs/loss_opr.py","file_url":"https://github.com/Purkialo/CrowdDet/blob/HEAD/lib/det_oprs/loss_opr.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":"80e2e1c046be957c","code_sha256_prefix":"80e2e1c046be957c","mcp_get_code":{"code_sha256":"80e2e1c046be957c"}},{"arxiv_id":"2001.03398","arxiv_id_is_arxiv":true,"paper":"/paper/dsgn-deep-stereo-geometry-network-for-3d","title":"DSGN: Deep Stereo Geometry Network for 3D Object Detection","date":"2020-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyilun95/DSGN","path":"dsgn/layers/smooth_l1_loss.py","file_url":"https://github.com/chenyilun95/DSGN/blob/HEAD/dsgn/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"1912.02252","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-anchor-learning-for-visual-object","title":"Multiple Anchor Learning for Visual Object Detection","date":"2019-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeLightCMU/MAL","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/DeLightCMU/MAL/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"1909.02466","arxiv_id_is_arxiv":true,"paper":"/paper/freeanchor-learning-to-match-anchors-for","title":"FreeAnchor: Learning to Match Anchors for Visual Object Detection","date":"2019-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxiaosong18/FreeAnchor","path":"maskrcnn_benchmark/modeling/rpn/free_anchor_loss.py","file_url":"https://github.com/zhangxiaosong18/FreeAnchor/blob/HEAD/maskrcnn_benchmark/modeling/rpn/free_anchor_loss.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":"13099e0dd83850a8","code_sha256_prefix":"13099e0dd83850a8","mcp_get_code":{"code_sha256":"13099e0dd83850a8"}},{"arxiv_id":"1904.01355","arxiv_id_is_arxiv":true,"paper":"/paper/fcos-fully-convolutional-one-stage-object","title":"FCOS: Fully Convolutional One-Stage Object Detection","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BIYTC/mobilenet_maskrcnn","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/BIYTC/mobilenet_maskrcnn/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, BIYTC/mobilenet_maskrcnn, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"1904.01169","arxiv_id_is_arxiv":true,"paper":"/paper/res2net-a-new-multi-scale-backbone","title":"Res2Net: A New Multi-scale Backbone Architecture","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Res2Net/Res2Net-maskrcnn","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/Res2Net/Res2Net-maskrcnn/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, Res2Net/Res2Net-maskrcnn, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"1903.01864","arxiv_id_is_arxiv":true,"paper":"/paper/frustum-convnet-sliding-frustums-to-aggregate","title":"Frustum ConvNet: Sliding Frustums to Aggregate Local Point-Wise Features for Amodal 3D Object Detection","date":"2019-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixinwang/frustum-convnet","path":"models/model_util.py","file_url":"https://github.com/zhixinwang/frustum-convnet/blob/HEAD/models/model_util.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":"ce156beb68c9daa3","code_sha256_prefix":"ce156beb68c9daa3","mcp_get_code":{"code_sha256":"ce156beb68c9daa3"}},{"arxiv_id":"1903.00241","arxiv_id_is_arxiv":true,"paper":"/paper/mask-scoring-r-cnn","title":"Mask Scoring R-CNN","date":"2019-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjhuang22/maskscoring_rcnn","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/zjhuang22/maskscoring_rcnn/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_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":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}},{"arxiv_id":"1703.06870","arxiv_id_is_arxiv":true,"paper":"/paper/mask-r-cnn","title":"Mask R-CNN","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/maskrcnn-benchmark","path":"maskrcnn_benchmark/layers/smooth_l1_loss.py","file_url":"https://github.com/facebookresearch/maskrcnn-benchmark/blob/HEAD/maskrcnn_benchmark/layers/smooth_l1_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/maskrcnn-benchmark, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e261fa29066b37e5","code_sha256_prefix":"e261fa29066b37e5","mcp_get_code":{"code_sha256":"e261fa29066b37e5"}}],"record_sha256":"affac2328d06742609716a4af9f4ff7c9f0a1ef7db20eac6c4fc24c03c4fcf76","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}