{"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/linearblock","entry":"LinearBlock","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":9,"n_samples_ran":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2506.13064","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.13064","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"KaiTang-eng/CoIFNet","path":"model/CoIFNet.py","file_url":"https://github.com/KaiTang-eng/CoIFNet/blob/HEAD/model/CoIFNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e4bb7820385f852","code_sha256_prefix":"0e4bb7820385f852","mcp_get_code":{"code_sha256":"0e4bb7820385f852"}},{"arxiv_id":"2503.10091","arxiv_id_is_arxiv":true,"paper":"/paper/g-2-sf-miad-geometry-guided-score-fusion-for","title":"G$^{2}$SF-MIAD: Geometry-Guided Score Fusion for Multimodal Industrial Anomaly Detection","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctaoaa/G2SF","path":"G2SF_GITHUB/Fusion/fusion_engine_v2.py","file_url":"https://github.com/ctaoaa/G2SF/blob/HEAD/G2SF_GITHUB/Fusion/fusion_engine_v2.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":"49e18d07c7924b81","code_sha256_prefix":"49e18d07c7924b81","mcp_get_code":{"code_sha256":"49e18d07c7924b81"}},{"arxiv_id":"2404.06443","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-dynamic-and-hierarchical","title":"Multi-scale Dynamic and Hierarchical Relationship Modeling for Facial Action Units Recognition","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVI-SZU/MDHR","path":"model/model_BP4D.py","file_url":"https://github.com/CVI-SZU/MDHR/blob/HEAD/model/model_BP4D.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c315197e49c553ef","code_sha256_prefix":"c315197e49c553ef","mcp_get_code":{"code_sha256":"c315197e49c553ef"}},{"arxiv_id":"2307.08122","arxiv_id_is_arxiv":true,"paper":"/paper/tangent-transformers-for-composition-privacy","title":"Tangent Transformers for Composition, Privacy and Removal","date":"2023-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyu139/tangent-model-composition","path":"models/linear_attention_layers.py","file_url":"https://github.com/tianyu139/tangent-model-composition/blob/HEAD/models/linear_attention_layers.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":"74db42c33268e884","code_sha256_prefix":"74db42c33268e884","mcp_get_code":{"code_sha256":"74db42c33268e884"}},{"arxiv_id":"2305.16114","arxiv_id_is_arxiv":true,"paper":"/paper/fascinating-supervisory-signals-and-where-to","title":"Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale Learning","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/scale-learning","path":"algorithms/slad.py","file_url":"https://github.com/xuhongzuo/scale-learning/blob/HEAD/algorithms/slad.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"83c96bc91ba0d0c2","code_sha256_prefix":"83c96bc91ba0d0c2","mcp_get_code":{"code_sha256":"83c96bc91ba0d0c2"}},{"arxiv_id":"2305.16114","arxiv_id_is_arxiv":true,"paper":"/paper/fascinating-supervisory-signals-and-where-to","title":"Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale Learning","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/DeepOD","path":"deepod/models/tabular/slad.py","file_url":"https://github.com/xuhongzuo/DeepOD/blob/HEAD/deepod/models/tabular/slad.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ef15d66df3e979e","code_sha256_prefix":"9ef15d66df3e979e","mcp_get_code":{"code_sha256":"9ef15d66df3e979e"}},{"arxiv_id":"2209.02686","arxiv_id_is_arxiv":true,"paper":"/paper/unpaired-image-translation-via-vector","title":"Unpaired Image Translation via Vector Symbolic Architectures","date":"2022-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/vsait","path":"models/iit.py","file_url":"https://github.com/facebookresearch/vsait/blob/HEAD/models/iit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, facebookresearch/vsait (NOASSERTION)","code_sha256":"719f0d505e7f2c91","code_sha256_prefix":"719f0d505e7f2c91","mcp_get_code":{"code_sha256":"719f0d505e7f2c91"}},{"arxiv_id":"2205.01782","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multi-dimensional-edge-feature-based","title":"Learning Multi-dimensional Edge Feature-based AU Relation Graph for Facial Action Unit Recognition","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomas-gajarsky/facetorch","path":"model_defs/au_model.py","file_url":"https://github.com/tomas-gajarsky/facetorch/blob/HEAD/model_defs/au_model.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":"12681ff944eff063","code_sha256_prefix":"12681ff944eff063","mcp_get_code":{"code_sha256":"12681ff944eff063"}},{"arxiv_id":"2002.04114","arxiv_id_is_arxiv":true,"paper":"/paper/cross-modality-paired-images-generation-for","title":"Cross-Modality Paired-Images Generation for RGB-Infrared Person Re-Identification","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangguanan/JSIA-ReID","path":"core/networks.py","file_url":"https://github.com/wangguanan/JSIA-ReID/blob/HEAD/core/networks.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, wangguanan/JSIA-ReID when it was checked","code_sha256":"d02575a245bfcefa","code_sha256_prefix":"d02575a245bfcefa","mcp_get_code":{"code_sha256":"d02575a245bfcefa"}}],"record_sha256":"62f8a65613e76ce2d44d168fdea8ba44859c0637ebdaf9707a410904fec3bc7d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}