{"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/pca","entry":"pca","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":16,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":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":13,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":5,"n_places":16,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":0,"ran":9,"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":"2503.19369","arxiv_id_is_arxiv":true,"paper":"/paper/efficientmt-efficient-temporal-adaptation-for","title":"EfficientMT: Efficient Temporal Adaptation for Motion Transfer in Text-to-Video Diffusion Models","date":"2025-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrototypeNx/EfficientMT","path":"animatediff/src/guidance_utils.py","file_url":"https://github.com/PrototypeNx/EfficientMT/blob/HEAD/animatediff/src/guidance_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":"80bb21230cf08bf9","code_sha256_prefix":"80bb21230cf08bf9","mcp_get_code":{"code_sha256":"80bb21230cf08bf9"}},{"arxiv_id":"2409.19293","arxiv_id_is_arxiv":true,"paper":"/paper/vlad-buff-burst-aware-fast-feature","title":"VLAD-BuFF: Burst-aware Fast Feature Aggregation for Visual Place Recognition","date":"2024-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmedest61/vlad-buff","path":"add_pca.py","file_url":"https://github.com/ahmedest61/vlad-buff/blob/HEAD/add_pca.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ahmedest61/vlad-buff, is not in the permissive set Syntology serves inline","code_sha256":"91cb29e9b0c3ad52","code_sha256_prefix":"91cb29e9b0c3ad52","mcp_get_code":{"code_sha256":"91cb29e9b0c3ad52"}},{"arxiv_id":"2409.12728","arxiv_id_is_arxiv":true,"paper":"/paper/praga-prototype-aware-graph-adaptive","title":"PRAGA: Prototype-aware Graph Adaptive Aggregation for Spatial Multi-modal Omics Analysis","date":"2024-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xubin-s-lab/praga","path":"PRAGA/preprocess.py","file_url":"https://github.com/xubin-s-lab/praga/blob/HEAD/PRAGA/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, xubin-s-lab/praga, is not in the permissive set Syntology serves inline","code_sha256":"434c64e6c74854b9","code_sha256_prefix":"434c64e6c74854b9","mcp_get_code":{"code_sha256":"434c64e6c74854b9"}},{"arxiv_id":"2406.11608","arxiv_id_is_arxiv":true,"paper":"/paper/learning-hierarchical-semantic-classification","title":"Visually Consistent Hierarchical Image Classification","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pseulki/hcast","path":"cast_models/utils.py","file_url":"https://github.com/pseulki/hcast/blob/HEAD/cast_models/utils.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, pseulki/hcast when it was checked","code_sha256":"1bff6d0d888ca2c3","code_sha256_prefix":"1bff6d0d888ca2c3","mcp_get_code":{"code_sha256":"1bff6d0d888ca2c3"}},{"arxiv_id":"2406.02550","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-grok-emergence-of-in-context","title":"Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic tasks","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ablghtianyi/ICL_Modular_Arithmetic","path":"interpretability/attn_map.py","file_url":"https://github.com/ablghtianyi/ICL_Modular_Arithmetic/blob/HEAD/interpretability/attn_map.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":"210f105fe6762eeb","code_sha256_prefix":"210f105fe6762eeb","mcp_get_code":{"code_sha256":"210f105fe6762eeb"}},{"arxiv_id":"2310.00542","arxiv_id_is_arxiv":true,"paper":"/paper/horizontal-class-backdoor-to-deep-learning","title":"Watch Out! Simple Horizontal Class Backdoor Can Trivially Evade Defense","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TDteach/Demon-in-the-Variant","path":"tsne.py","file_url":"https://github.com/TDteach/Demon-in-the-Variant/blob/HEAD/tsne.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":"f60cb3cead55f81b","code_sha256_prefix":"f60cb3cead55f81b","mcp_get_code":{"code_sha256":"f60cb3cead55f81b"}},{"arxiv_id":"2210.00314","arxiv_id_is_arxiv":true,"paper":"/paper/concurrent-recognition-and-segmentation-with","title":"Learning Hierarchical Image Segmentation For Recognition and By Recognition","date":"2022-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twke18/CAST","path":"cast_models/utils.py","file_url":"https://github.com/twke18/CAST/blob/HEAD/cast_models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from pseulki/hcast, and GitHub detected no licence in that repository when it was checked","code_sha256":"1bff6d0d888ca2c3","code_sha256_prefix":"1bff6d0d888ca2c3","mcp_get_code":{"code_sha256":"1bff6d0d888ca2c3"}},{"arxiv_id":"2206.12314","arxiv_id_is_arxiv":true,"paper":"/paper/learning-sparse-features-can-lead-to","title":"Learning sparse features can lead to overfitting in neural networks","date":"2022-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pcsl-epfl/regressionsphere","path":"dataset/utils.py","file_url":"https://github.com/pcsl-epfl/regressionsphere/blob/HEAD/dataset/utils.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":"b580ad0adf4a4d17","code_sha256_prefix":"b580ad0adf4a4d17","mcp_get_code":{"code_sha256":"b580ad0adf4a4d17"}},{"arxiv_id":"2205.05740","arxiv_id_is_arxiv":true,"paper":"/paper/surface-representation-for-point-clouds","title":"Surface Representation for Point Clouds","date":"2022-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hancyran/RepSurf","path":"classification/modules/recons_utils.py","file_url":"https://github.com/hancyran/RepSurf/blob/HEAD/classification/modules/recons_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":"43f6d0436aebc666","code_sha256_prefix":"43f6d0436aebc666","mcp_get_code":{"code_sha256":"43f6d0436aebc666"}},{"arxiv_id":"2203.14932","arxiv_id_is_arxiv":true,"paper":"/paper/attributable-visual-similarity-learning","title":"Attributable Visual Similarity Learning","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbr17/AVSL","path":"src/avsl/misc/pca.py","file_url":"https://github.com/zbr17/AVSL/blob/HEAD/src/avsl/misc/pca.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":"a58a12d77c9db51e","code_sha256_prefix":"a58a12d77c9db51e","mcp_get_code":{"code_sha256":"a58a12d77c9db51e"}},{"arxiv_id":"2106.07198","arxiv_id_is_arxiv":true,"paper":"/paper/classical-and-quantum-algorithms-for-1","title":"Classical and Quantum Algorithms for Orthogonal Neural Networks","date":null,"month_inferred_from_arxiv_id":"2021-06","title_source":"archive","repo":"qdevpsi3/quantum-orthogonal-nn","path":"examples/mnist_classifier.py","file_url":"https://github.com/qdevpsi3/quantum-orthogonal-nn/blob/HEAD/examples/mnist_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, qdevpsi3/quantum-orthogonal-nn, is not in the permissive set Syntology serves inline","code_sha256":"a791aaee56dadf66","code_sha256_prefix":"a791aaee56dadf66","mcp_get_code":{"code_sha256":"a791aaee56dadf66"}},{"arxiv_id":"2005.01912","arxiv_id_is_arxiv":true,"paper":"/paper/renormalized-mutual-information-for","title":"Renormalized Mutual Information for Artificial Scientific Discovery","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsarra/rmi","path":"rmi/features.py","file_url":"https://github.com/lsarra/rmi/blob/HEAD/rmi/features.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":"38cc857ed961f001","code_sha256_prefix":"38cc857ed961f001","mcp_get_code":{"code_sha256":"38cc857ed961f001"}},{"arxiv_id":"1908.00686","arxiv_id_is_arxiv":true,"paper":"/paper/demon-in-the-variant-statistical-analysis-of","title":"Demon in the Variant: Statistical Analysis of DNNs for Robust Backdoor Contamination Detection","date":null,"month_inferred_from_arxiv_id":"2019-08","title_source":"archive","repo":"TDteach/backdoor","path":"tsne.py","file_url":"https://github.com/TDteach/backdoor/blob/HEAD/tsne.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":"f60cb3cead55f81b","code_sha256_prefix":"f60cb3cead55f81b","mcp_get_code":{"code_sha256":"f60cb3cead55f81b"}},{"arxiv_id":"1907.04809","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoders-and-nonlinear-ica-a","title":"Variational Autoencoders and Nonlinear ICA: A Unifying Framework","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilkhem/ivae","path":"models/tcl/tcl_preprocessing.py","file_url":"https://github.com/ilkhem/ivae/blob/HEAD/models/tcl/tcl_preprocessing.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":"eec3f2b6914d703b","code_sha256_prefix":"eec3f2b6914d703b","mcp_get_code":{"code_sha256":"eec3f2b6914d703b"}},{"arxiv_id":"1606.02185","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-neural-statistician","title":"Towards a Neural Statistician","date":"2016-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cravingoxygen/neuralstat","path":"tsne.py","file_url":"https://github.com/cravingoxygen/neuralstat/blob/HEAD/tsne.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":"f60cb3cead55f81b","code_sha256_prefix":"f60cb3cead55f81b","mcp_get_code":{"code_sha256":"f60cb3cead55f81b"}},{"arxiv_id":"1604.00126","arxiv_id_is_arxiv":true,"paper":"/paper/nonparametric-spherical-topic-modeling-with","title":"Nonparametric Spherical Topic Modeling with Word Embeddings","date":"2016-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ardavans/sHDP","path":"core/util/plot.py","file_url":"https://github.com/Ardavans/sHDP/blob/HEAD/core/util/plot.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":"8d5689b68e58c3b6","code_sha256_prefix":"8d5689b68e58c3b6","mcp_get_code":{"code_sha256":"8d5689b68e58c3b6"}}],"record_sha256":"5e64f7af61db0061438eee90f193fa65e6871562d269e4a9808a3fcde2257024","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}