{"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/get-activation-layer","entry":"get_activation_layer","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"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":5,"ran_fixture":0,"ran":3,"unverified":0},"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":"2412.03603","arxiv_id_is_arxiv":true,"paper":"/paper/hunyuanvideo-a-systematic-framework-for-large","title":"HunyuanVideo: A Systematic Framework For Large Video Generative Models","date":"2024-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencent/hunyuanvideo","path":"hyvideo/modules/models.py","file_url":"https://github.com/tencent/hunyuanvideo/blob/HEAD/hyvideo/modules/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, tencent/hunyuanvideo (NOASSERTION)","code_sha256":"3522a7226855625c","code_sha256_prefix":"3522a7226855625c","mcp_get_code":{"code_sha256":"3522a7226855625c"}},{"arxiv_id":"2405.15020","arxiv_id_is_arxiv":true,"paper":"/paper/adjointdeis-efficient-gradients-for-diffusion","title":"AdjointDEIS: Efficient Gradients for Diffusion Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdbtrs/ElasticFace","path":"backbones/activation.py","file_url":"https://github.com/fdbtrs/ElasticFace/blob/HEAD/backbones/activation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, fdbtrs/ElasticFace when it was checked","code_sha256":"4c9000726845f1ba","code_sha256_prefix":"4c9000726845f1ba","mcp_get_code":{"code_sha256":"4c9000726845f1ba"}},{"arxiv_id":"2308.04995","arxiv_id_is_arxiv":true,"paper":"/paper/idiff-face-synthetic-based-face-recognition","title":"IDiff-Face: Synthetic-based Face Recognition through Fizzy Identity-Conditioned Diffusion Models","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdbtrs/IDiff-Face","path":"face_recognition_training/backbones/activation.py","file_url":"https://github.com/fdbtrs/IDiff-Face/blob/HEAD/face_recognition_training/backbones/activation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, fdbtrs/IDiff-Face when it was checked","code_sha256":"4c9000726845f1ba","code_sha256_prefix":"4c9000726845f1ba","mcp_get_code":{"code_sha256":"4c9000726845f1ba"}},{"arxiv_id":"2307.15700","arxiv_id_is_arxiv":true,"paper":"/paper/memotr-long-term-memory-augmented-transformer","title":"MeMOTR: Long-Term Memory-Augmented Transformer for Multi-Object Tracking","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MCG-NJU/MeMOTR","path":"models/memotr.py","file_url":"https://github.com/MCG-NJU/MeMOTR/blob/HEAD/models/memotr.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d58a53879397eff0","code_sha256_prefix":"d58a53879397eff0","mcp_get_code":{"code_sha256":"d58a53879397eff0"}},{"arxiv_id":"2206.00272","arxiv_id_is_arxiv":true,"paper":"/paper/vision-gnn-an-image-is-worth-graph-of-nodes","title":"Vision GNN: An Image is Worth Graph of Nodes","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lccol/vig-eo","path":"models/utils.py","file_url":"https://github.com/lccol/vig-eo/blob/HEAD/models/utils.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":"32a549c7e940abbb","code_sha256_prefix":"32a549c7e940abbb","mcp_get_code":{"code_sha256":"32a549c7e940abbb"}},{"arxiv_id":"2103.14021","arxiv_id_is_arxiv":true,"paper":"/paper/orthogonal-projection-loss","title":"Orthogonal Projection Loss","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kahnchana/opl","path":"classification/cifar/models/common.py","file_url":"https://github.com/kahnchana/opl/blob/HEAD/classification/cifar/models/common.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":"0df92bd15ff63da7","code_sha256_prefix":"0df92bd15ff63da7","mcp_get_code":{"code_sha256":"0df92bd15ff63da7"}},{"arxiv_id":"2008.00623","arxiv_id_is_arxiv":true,"paper":"/paper/delight-very-deep-and-light-weight","title":"DeLighT: Deep and Light-weight Transformer","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sacmehta/delight","path":"fairseq/delight_modules/activation_layers.py","file_url":"https://github.com/sacmehta/delight/blob/HEAD/fairseq/delight_modules/activation_layers.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":"f24e9760137749a2","code_sha256_prefix":"f24e9760137749a2","mcp_get_code":{"code_sha256":"f24e9760137749a2"}},{"arxiv_id":"1506.02640","arxiv_id_is_arxiv":true,"paper":"/paper/you-only-look-once-unified-real-time-object","title":"You Only Look Once: Unified, Real-Time Object Detection","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DavianYang/yolo.ai","path":"yolo/models/arch/yolov1.py","file_url":"https://github.com/DavianYang/yolo.ai/blob/HEAD/yolo/models/arch/yolov1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ddd214dfdd86aa1","code_sha256_prefix":"3ddd214dfdd86aa1","mcp_get_code":{"code_sha256":"3ddd214dfdd86aa1"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johschmidt42/pytorch-2d-3d-unet-tutorial","path":"unet.py","file_url":"https://github.com/johschmidt42/pytorch-2d-3d-unet-tutorial/blob/HEAD/unet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7078f7b56991251","code_sha256_prefix":"b7078f7b56991251","mcp_get_code":{"code_sha256":"b7078f7b56991251"}}],"record_sha256":"114b024a17e5d01f2ead34a2e17cbf6ae83ae8d80253d9e2e6be8ac1eba75931","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}