{"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/scaling","entry":"scaling","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":15,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":7,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":16,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":1},"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.05768","arxiv_id_is_arxiv":true,"paper":"/paper/aanet-virtual-screening-under-structural","title":"AANet: Virtual Screening under Structural Uncertainty via Alignment and Aggregation","date":"2025-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CAODH/EquiScore","path":"utils/equiscore_utils.py","file_url":"https://github.com/CAODH/EquiScore/blob/HEAD/utils/equiscore_utils.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":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2505.04163","arxiv_id_is_arxiv":true,"paper":"/paper/retrieval-augmented-time-series-forecasting-1","title":"Retrieval Augmented Time Series Forecasting","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"archon159/RAFT","path":"utils/augmentation.py","file_url":"https://github.com/archon159/RAFT/blob/HEAD/utils/augmentation.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":"570f35b7d04be7f7","code_sha256_prefix":"570f35b7d04be7f7","mcp_get_code":{"code_sha256":"570f35b7d04be7f7"}},{"arxiv_id":"2405.18378","arxiv_id_is_arxiv":true,"paper":"/paper/a-canonization-perspective-on-invariant-and","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgemlp/canonicalization","path":"layers/graphit_gt_layer.py","file_url":"https://github.com/georgemlp/canonicalization/blob/HEAD/layers/graphit_gt_layer.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":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2310.18716","arxiv_id_is_arxiv":true,"paper":"/paper/laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgemlp/laplacian-canonization","path":"layers/graphit_gt_layer.py","file_url":"https://github.com/georgemlp/laplacian-canonization/blob/HEAD/layers/graphit_gt_layer.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":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2308.09517","arxiv_id_is_arxiv":true,"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nslab-cuk/unified-graph-transformer","path":"Graph_classification/layers/graph_transformer_edge_layer.py","file_url":"https://github.com/nslab-cuk/unified-graph-transformer/blob/HEAD/Graph_classification/layers/graph_transformer_edge_layer.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":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2308.08173","arxiv_id_is_arxiv":true,"paper":"/paper/expressivity-of-graph-neural-networks-through","title":"Expressivity of Graph Neural Networks Through the Lens of Adversarial Robustness","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francesco-campi/rob-subgraphs","path":"src/SAN/graph_transformer_layer.py","file_url":"https://github.com/francesco-campi/rob-subgraphs/blob/HEAD/src/SAN/graph_transformer_layer.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, francesco-campi/rob-subgraphs when it was checked","code_sha256":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2303.11257","arxiv_id_is_arxiv":true,"paper":"/paper/unit-scaling-out-of-the-box-low-precision","title":"Unit Scaling: Out-of-the-Box Low-Precision Training","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphcore-research/unit-scaling-demo","path":"scmm/uscale/ops.py","file_url":"https://github.com/graphcore-research/unit-scaling-demo/blob/HEAD/scmm/uscale/ops.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":"55834bdb013ab248","code_sha256_prefix":"55834bdb013ab248","mcp_get_code":{"code_sha256":"55834bdb013ab248"}},{"arxiv_id":"2302.03133","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-for-time-series-under","title":"Domain Adaptation for Time Series Under Feature and Label Shifts","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/Raincoat","path":"models/augmentations.py","file_url":"https://github.com/mims-harvard/Raincoat/blob/HEAD/models/augmentations.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":"62ae42ac3fdc85c6","code_sha256_prefix":"62ae42ac3fdc85c6","mcp_get_code":{"code_sha256":"62ae42ac3fdc85c6"}},{"arxiv_id":"2201.09332","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-expressiveness-of-transformer","title":"How Expressive are Transformers in Spectral Domain for Graphs?","date":"2022-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ansonb/FeTA_TMLR","path":"LPE/layers/GT_layer_bkp.py","file_url":"https://github.com/ansonb/FeTA_TMLR/blob/HEAD/LPE/layers/GT_layer_bkp.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":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2110.07875","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vijaydwivedi75/gnn-lspe","path":"layers/graphit_gt_lspe_layer.py","file_url":"https://github.com/vijaydwivedi75/gnn-lspe/blob/HEAD/layers/graphit_gt_lspe_layer.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":"a3fb87a259b15eae","code_sha256_prefix":"a3fb87a259b15eae","mcp_get_code":{"code_sha256":"a3fb87a259b15eae"}},{"arxiv_id":"2009.11551","arxiv_id_is_arxiv":true,"paper":"/paper/residual-feature-distillation-network-for","title":"Residual Feature Distillation Network for Lightweight Image Super-Resolution","date":"2020-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuvovan/RFDNet-ImageSuperResolution","path":"utils.py","file_url":"https://github.com/tuvovan/RFDNet-ImageSuperResolution/blob/HEAD/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":"7944e373e6303444","code_sha256_prefix":"7944e373e6303444","mcp_get_code":{"code_sha256":"7944e373e6303444"}},{"arxiv_id":"2007.15951","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-survey-of-data-augmentation-for","title":"An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uchidalab/time_series_augmentation","path":"utils/augmentation.py","file_url":"https://github.com/uchidalab/time_series_augmentation/blob/HEAD/utils/augmentation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"570f35b7d04be7f7","code_sha256_prefix":"570f35b7d04be7f7","mcp_get_code":{"code_sha256":"570f35b7d04be7f7"}},{"arxiv_id":"1904.09406","arxiv_id_is_arxiv":true,"paper":"/paper/190409406","title":"DeepMoD: Deep learning for Model Discovery in noisy data","date":"2019-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhIMaL/DeePyMoD_torch","path":"src/deepymod_torch/sparsity.py","file_url":"https://github.com/PhIMaL/DeePyMoD_torch/blob/HEAD/src/deepymod_torch/sparsity.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":"35cc33cab5241f05","code_sha256_prefix":"35cc33cab5241f05","mcp_get_code":{"code_sha256":"35cc33cab5241f05"}},{"arxiv_id":"1806.07421","arxiv_id_is_arxiv":true,"paper":"/paper/rise-randomized-input-sampling-for","title":"RISE: Randomized Input Sampling for Explanation of Black-box Models","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openvinotoolkit/openvino_xai","path":"openvino_xai/common/utils.py","file_url":"https://github.com/openvinotoolkit/openvino_xai/blob/HEAD/openvino_xai/common/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, openvinotoolkit/openvino_xai, 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":"161696665a9b902a","code_sha256_prefix":"161696665a9b902a","mcp_get_code":{"code_sha256":"161696665a9b902a"}},{"arxiv_id":"1611.02200","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-cross-domain-image-generation","title":"Unsupervised Cross-Domain Image Generation","date":"2016-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepakprabakar96/DTN","path":"face/facenet/model.py","file_url":"https://github.com/deepakprabakar96/DTN/blob/HEAD/face/facenet/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 sebastiaopamplona/msc-thesis-deepfsim, and GitHub detected no licence in that repository when it was checked","code_sha256":"3587611134f2fad7","code_sha256_prefix":"3587611134f2fad7","mcp_get_code":{"code_sha256":"3587611134f2fad7"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sebastiaopamplona/msc-thesis-deepfsim","path":"utils/models/facenet.py","file_url":"https://github.com/sebastiaopamplona/msc-thesis-deepfsim/blob/HEAD/utils/models/facenet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sebastiaopamplona/msc-thesis-deepfsim when it was checked","code_sha256":"3587611134f2fad7","code_sha256_prefix":"3587611134f2fad7","mcp_get_code":{"code_sha256":"3587611134f2fad7"}}],"record_sha256":"7e2fbdc89ba49d72f0bcd73bf5a719b2bfd274b7d0b73dfd573a6b13692f3233","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}