{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/feature-extraction","entry":"feature_extraction","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":1,"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":8,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":7},"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":"2403.13870","paper":"/paper/exmap-leveraging-explainability-heatmaps-for","title":"ExMap: Leveraging Explainability Heatmaps for Unsupervised Group Robustness to Spurious Correlations","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwchakra/exmap","path":"src/exmap/lrp.py","file_url":"https://github.com/rwchakra/exmap/blob/HEAD/src/exmap/lrp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1fc9a58299731e17","mcp_get_code":{"code_sha256":"1fc9a58299731e17"}},{"arxiv_id":"2403.13268","paper":"/paper/unifews-unified-entry-wise-sparsification-for","title":"Unifews: Unified Entry-Wise Sparsification for Efficient Graph Neural Network","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gdmnl/Unifews","path":"utils/gen_cat.py","file_url":"https://github.com/gdmnl/Unifews/blob/HEAD/utils/gen_cat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a32ceb7448b55028","mcp_get_code":{"code_sha256":"a32ceb7448b55028"}},{"arxiv_id":"2203.02146","paper":"/paper/acvnet-attention-concatenation-volume-for","title":"Attention Concatenation Volume for Accurate and Efficient Stereo Matching","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gangweiX/ACVNet","path":"models/acv.py","file_url":"https://github.com/gangweiX/ACVNet/blob/HEAD/models/acv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b6c41d129f1b1e36","mcp_get_code":{"code_sha256":"b6c41d129f1b1e36"}},{"arxiv_id":"2201.02263","paper":"/paper/itsa-an-information-theoretic-approach-to","title":"ITSA: An Information-Theoretic Approach to Automatic Shortcut Avoidance and Domain Generalization in Stereo Matching Networks","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waychin-weiqin/ITSA","path":"models/CFNet/stackhourglass.py","file_url":"https://github.com/waychin-weiqin/ITSA/blob/HEAD/models/CFNet/stackhourglass.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ecbfc6e3f99073d6","mcp_get_code":{"code_sha256":"ecbfc6e3f99073d6"}},{"arxiv_id":"2101.01601","paper":"/paper/bilateral-grid-learning-for-stereo-matching","title":"Bilateral Grid Learning for Stereo Matching Networks","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"3dcvdeveloper/bgnet","path":"models/bgnet.py","file_url":"https://github.com/3dcvdeveloper/bgnet/blob/HEAD/models/bgnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"54e77f48248aae70","mcp_get_code":{"code_sha256":"54e77f48248aae70"}},{"arxiv_id":"2104.04314","paper":"/paper/cfnet-cascade-and-fused-cost-volume-for","title":"CFNet: Cascade and Fused Cost Volume for Robust Stereo Matching","date":"2021-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gallenszl/CFNet","path":"models/cfnet.py","file_url":"https://github.com/gallenszl/CFNet/blob/HEAD/models/cfnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a491de58629728ba","mcp_get_code":{"code_sha256":"a491de58629728ba"}},{"arxiv_id":"2104.04314","paper":"/paper/cfnet-cascade-and-fused-cost-volume-for","title":"CFNet: Cascade and Fused Cost Volume for Robust Stereo Matching","date":"2021-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gallenszl/pcwnet","path":"models/pwcnet.py","file_url":"https://github.com/gallenszl/pcwnet/blob/HEAD/models/pwcnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51f513f2170035a0","mcp_get_code":{"code_sha256":"51f513f2170035a0"}},{"arxiv_id":"2003.10071","paper":"/paper/aslfeat-learning-local-features-of-accurate","title":"ASLFeat: Learning Local Features of Accurate Shape and Localization","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goodproj13/DenserNet","path":"DN/evaluators.py","file_url":"https://github.com/goodproj13/DenserNet/blob/HEAD/DN/evaluators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"30ff7d86a16ec5a8","mcp_get_code":{"code_sha256":"30ff7d86a16ec5a8"}}]}