{"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/normalize-data","entry":"normalize_data","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":32,"n_papers_ran":30,"n_papers_ran_no_instrument_failure":20,"n_papers_ran_instrument_only":10,"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":27,"n_samples_ran":25,"n_samples_constructed":0,"n_samples_ran_checked":20,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":16,"n_places":32,"n_places_pointer_only":16,"n_places_pointer_only_link_open":5,"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":6,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":4,"ran":13,"unverified":2},"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":"2607.07735","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-07735","title":"The Regularization Parameter: Sparse Precision Matrix Estimation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"aefty/aquic","path":"_util.py","file_url":"https://github.com/aefty/aquic/blob/HEAD/_util.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, aefty/aquic when it was checked","code_sha256":"b00bd69541196375","code_sha256_prefix":"b00bd69541196375","mcp_get_code":{"code_sha256":"b00bd69541196375"}},{"arxiv_id":"2605.15488","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15488","title":"SurvivalPFN: Amortizing Survival Prediction via In-Context Bayesian Inference","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"rgklab/SurvivalPFN","path":"survivalpfn/models/icl_model.py","file_url":"https://github.com/rgklab/SurvivalPFN/blob/HEAD/survivalpfn/models/icl_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cbf1a6ddc69b5d1b","code_sha256_prefix":"cbf1a6ddc69b5d1b","mcp_get_code":{"code_sha256":"cbf1a6ddc69b5d1b"}},{"arxiv_id":"2605.15133","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15133","title":"Causal Foundation Models with Continuous Treatments","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"layer6ai-labs/CCPFN-inference","path":"src/ccpfn/models/continuous_icl_model.py","file_url":"https://github.com/layer6ai-labs/CCPFN-inference/blob/HEAD/src/ccpfn/models/continuous_icl_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bfe4bda00433fd59","code_sha256_prefix":"bfe4bda00433fd59","mcp_get_code":{"code_sha256":"bfe4bda00433fd59"}},{"arxiv_id":"2601.03805","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03805","title":"Detecting Semantic Backdoors in a Mystery Shopping Scenario","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"szegedai/SemanticBackdoorDetection","path":"visualize_layer.py","file_url":"https://github.com/szegedai/SemanticBackdoorDetection/blob/HEAD/visualize_layer.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, szegedai/SemanticBackdoorDetection when it was checked","code_sha256":"a753873103fc3d1a","code_sha256_prefix":"a753873103fc3d1a","mcp_get_code":{"code_sha256":"a753873103fc3d1a"}},{"arxiv_id":"2410.10393","arxiv_id_is_arxiv":true,"paper":"/paper/gift-eval-a-benchmark-for-general-time-series","title":"GIFT-Eval: A Benchmark For General Time Series Forecasting Model Evaluation","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforceairesearch/gift-eval","path":"src/gift_eval/analysis/utils.py","file_url":"https://github.com/salesforceairesearch/gift-eval/blob/HEAD/src/gift_eval/analysis/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"700ebf316498a2e8","code_sha256_prefix":"700ebf316498a2e8","mcp_get_code":{"code_sha256":"700ebf316498a2e8"}},{"arxiv_id":"2409.16756","arxiv_id_is_arxiv":true,"paper":"/paper/navigating-the-maze-of-explainable-ai-a","title":"Navigating the Maze of Explainable AI: A Systematic Approach to Evaluating Methods and Metrics","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IML-DKFZ/latec","path":"src/main/main_rank.py","file_url":"https://github.com/IML-DKFZ/latec/blob/HEAD/src/main/main_rank.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61272ae2b64a89b2","code_sha256_prefix":"61272ae2b64a89b2","mcp_get_code":{"code_sha256":"61272ae2b64a89b2"}},{"arxiv_id":"2406.14673","arxiv_id_is_arxiv":true,"paper":"/paper/insights-into-llm-long-context-failures-when","title":"Insights into LLM Long-Context Failures: When Transformers Know but Don't Tell","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TaiMingLu/know-dont-tell","path":"code/probe/probe.py","file_url":"https://github.com/TaiMingLu/know-dont-tell/blob/HEAD/code/probe/probe.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TaiMingLu/know-dont-tell when it was checked","code_sha256":"0d3e0263ee22bb14","code_sha256_prefix":"0d3e0263ee22bb14","mcp_get_code":{"code_sha256":"0d3e0263ee22bb14"}},{"arxiv_id":"2401.03043","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multimodal-volumetric-features-for","title":"Learning Multimodal Volumetric Features for Large-Scale Neuron Tracing","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Levishery/Flywire-Neuron-Tracing","path":"Pointnet/provider.py","file_url":"https://github.com/Levishery/Flywire-Neuron-Tracing/blob/HEAD/Pointnet/provider.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, Levishery/Flywire-Neuron-Tracing when it was checked","code_sha256":"59e9008f0a3743f1","code_sha256_prefix":"59e9008f0a3743f1","mcp_get_code":{"code_sha256":"59e9008f0a3743f1"}},{"arxiv_id":"2311.12472","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-deconfounding-against-spatio","title":"Seeing the Unseen: Learning Basis Confounder Representations for Robust Traffic Prediction","date":"2023-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigscity/steve_code","path":"STEVE/lib/dataloader.py","file_url":"https://github.com/bigscity/steve_code/blob/HEAD/STEVE/lib/dataloader.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":"d2bc1793bf4954c7","code_sha256_prefix":"d2bc1793bf4954c7","mcp_get_code":{"code_sha256":"d2bc1793bf4954c7"}},{"arxiv_id":"2310.18511","arxiv_id_is_arxiv":true,"paper":"/paper/3dcompat-an-improved-large-scale-3d-vision","title":"3DCoMPaT$^{++}$: An improved Large-scale 3D Vision Dataset for Compositional Recognition","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cattalyya/3dcompat-challenge","path":"models/3D/provider.py","file_url":"https://github.com/cattalyya/3dcompat-challenge/blob/HEAD/models/3D/provider.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c642057e222b0f1","code_sha256_prefix":"4c642057e222b0f1","mcp_get_code":{"code_sha256":"4c642057e222b0f1"}},{"arxiv_id":"2310.11046","arxiv_id_is_arxiv":true,"paper":"/paper/fast-graph-condensation-with-structure-based","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanglin0126/gcsntk","path":"GCSNTK/LoadData.py","file_url":"https://github.com/wanglin0126/gcsntk/blob/HEAD/GCSNTK/LoadData.py","status":"ran","verification_level":1,"contract_check":null,"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, wanglin0126/gcsntk when it was checked","code_sha256":"011117f9260effb7","code_sha256_prefix":"011117f9260effb7","mcp_get_code":{"code_sha256":"011117f9260effb7"}},{"arxiv_id":"2308.04142","arxiv_id_is_arxiv":true,"paper":"/paper/class-level-structural-relation-modelling-and","title":"Class-level Structural Relation Modelling and Smoothing for Visual Representation Learning","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czt117/csrms","path":"utils.py","file_url":"https://github.com/czt117/csrms/blob/HEAD/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, czt117/csrms when it was checked","code_sha256":"f8d2d7cbe9b95c1c","code_sha256_prefix":"f8d2d7cbe9b95c1c","mcp_get_code":{"code_sha256":"f8d2d7cbe9b95c1c"}},{"arxiv_id":"2307.08192","arxiv_id_is_arxiv":true,"paper":"/paper/hope-high-order-polynomial-expansion-of-black","title":"HOPE: High-order Polynomial Expansion of Black-box Neural Networks","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harrypotterxtx/hope","path":"utils/Samplers.py","file_url":"https://github.com/harrypotterxtx/hope/blob/HEAD/utils/Samplers.py","status":"ran","verification_level":1,"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, harrypotterxtx/hope when it was checked","code_sha256":"42bca2074e6a5608","code_sha256_prefix":"42bca2074e6a5608","mcp_get_code":{"code_sha256":"42bca2074e6a5608"}},{"arxiv_id":"2306.10168","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-geometry-comparing-the-temporal","title":"Beyond Geometry: Comparing the Temporal Structure of Computation in Neural Circuits with Dynamical Similarity Analysis","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitchellostrow/dsa","path":"DSA/preprocessing.py","file_url":"https://github.com/mitchellostrow/dsa/blob/HEAD/DSA/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":"f56b12d183adacab","code_sha256_prefix":"f56b12d183adacab","mcp_get_code":{"code_sha256":"f56b12d183adacab"}},{"arxiv_id":"2305.18577","arxiv_id_is_arxiv":true,"paper":"/paper/towards-constituting-mathematical-structures","title":"Towards Constituting Mathematical Structures for Learning to Optimize","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xhchrn/MS4L2O","path":"optimizees/logistic_real_data.py","file_url":"https://github.com/xhchrn/MS4L2O/blob/HEAD/optimizees/logistic_real_data.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":"fc1dc877fddc1718","code_sha256_prefix":"fc1dc877fddc1718","mcp_get_code":{"code_sha256":"fc1dc877fddc1718"}},{"arxiv_id":"2304.04183","arxiv_id_is_arxiv":true,"paper":"/paper/nearest-neighbor-sampling-based-conditional","title":"Nearest-Neighbor Sampling Based Conditional Independence Testing","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanfeng-yang-0316/cdcit","path":"nnlscit.py","file_url":"https://github.com/yanfeng-yang-0316/cdcit/blob/HEAD/nnlscit.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, yanfeng-yang-0316/cdcit when it was checked","code_sha256":"c6a3311cea14cc5a","code_sha256_prefix":"c6a3311cea14cc5a","mcp_get_code":{"code_sha256":"c6a3311cea14cc5a"}},{"arxiv_id":"2303.02401","arxiv_id_is_arxiv":true,"paper":"/paper/open-vocabulary-affordance-detection-in-3d","title":"Open-Vocabulary Affordance Detection in 3D Point Clouds","date":"2023-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Fsoft-AIC/Open-Vocabulary-Affordance-Detection-in-3D-Point-Clouds","path":"utils/provider.py","file_url":"https://github.com/Fsoft-AIC/Open-Vocabulary-Affordance-Detection-in-3D-Point-Clouds/blob/HEAD/utils/provider.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 Levishery/Flywire-Neuron-Tracing, and GitHub detected no licence in that repository when it was checked","code_sha256":"59e9008f0a3743f1","code_sha256_prefix":"59e9008f0a3743f1","mcp_get_code":{"code_sha256":"59e9008f0a3743f1"}},{"arxiv_id":"2202.13268","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-the-functional-renormalization","title":"Deep Learning the Functional Renormalization Group","date":null,"month_inferred_from_arxiv_id":"2022-02","title_source":"archive","repo":"bitmapdds/neuralfrg","path":"neuralfrg/utils.py","file_url":"https://github.com/bitmapdds/neuralfrg/blob/HEAD/neuralfrg/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":"67829ad8abe2f8db","code_sha256_prefix":"67829ad8abe2f8db","mcp_get_code":{"code_sha256":"67829ad8abe2f8db"}},{"arxiv_id":"2201.03644","arxiv_id_is_arxiv":true,"paper":"/paper/3d-segmentation-with-fully-trainable-gabor","title":"3D Segmentation with Fully Trainable Gabor Kernels and Pearson's Correlation Coefficient","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/multimodal-3d-image-segmentation","path":"experiments/utils.py","file_url":"https://github.com/ibm/multimodal-3d-image-segmentation/blob/HEAD/experiments/utils.py","status":"unverified","verification_level":0,"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":"75b9413017c2330b","code_sha256_prefix":"75b9413017c2330b","mcp_get_code":{"code_sha256":"75b9413017c2330b"}},{"arxiv_id":"2111.03249","arxiv_id_is_arxiv":true,"paper":"/paper/deep-radio-interferometric-imaging-with","title":"Deep Radio Interferometric Imaging with POLISH: DSA-2000 and weak lensing","date":null,"month_inferred_from_arxiv_id":"2021-11","title_source":"archive","repo":"liamconnor/polish-pub","path":"make_img_pairs.py","file_url":"https://github.com/liamconnor/polish-pub/blob/HEAD/make_img_pairs.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liamconnor/polish-pub when it was checked","code_sha256":"0e3399db2f57ef71","code_sha256_prefix":"0e3399db2f57ef71","mcp_get_code":{"code_sha256":"0e3399db2f57ef71"}},{"arxiv_id":"2109.09521","arxiv_id_is_arxiv":true,"paper":"/paper/ribseg-dataset-and-strong-point-cloud","title":"RibSeg Dataset and Strong Point Cloud Baselines for Rib Segmentation from CT Scans","date":"2021-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m3dv/ribseg","path":"data_utils/data_aug.py","file_url":"https://github.com/m3dv/ribseg/blob/HEAD/data_utils/data_aug.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Levishery/Flywire-Neuron-Tracing, and GitHub detected no licence in that repository when it was checked","code_sha256":"59e9008f0a3743f1","code_sha256_prefix":"59e9008f0a3743f1","mcp_get_code":{"code_sha256":"59e9008f0a3743f1"}},{"arxiv_id":"2103.16397","arxiv_id_is_arxiv":true,"paper":"/paper/3d-affordancenet-a-benchmark-for-visual","title":"3D AffordanceNet: A Benchmark for Visual Object Affordance Understanding","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/AffordanceNet","path":"utils/provider.py","file_url":"https://github.com/Gorilla-Lab-SCUT/AffordanceNet/blob/HEAD/utils/provider.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 Levishery/Flywire-Neuron-Tracing, and GitHub detected no licence in that repository when it was checked","code_sha256":"59e9008f0a3743f1","code_sha256_prefix":"59e9008f0a3743f1","mcp_get_code":{"code_sha256":"59e9008f0a3743f1"}},{"arxiv_id":"2012.06664","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-subgrid-scale-modeling-of-forced","title":"Data-driven subgrid-scale modeling of forced Burgers turbulence using deep learning with generalization to higher Reynolds numbers via transfer learning","date":null,"month_inferred_from_arxiv_id":"2020-12","title_source":"archive","repo":"envfluids/Burgers_DDP_and_TL","path":"ddp_train_and_test.py","file_url":"https://github.com/envfluids/Burgers_DDP_and_TL/blob/HEAD/ddp_train_and_test.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, envfluids/Burgers_DDP_and_TL when it was checked","code_sha256":"a20b19608381fbe3","code_sha256_prefix":"a20b19608381fbe3","mcp_get_code":{"code_sha256":"a20b19608381fbe3"}},{"arxiv_id":"2009.02040","arxiv_id_is_arxiv":true,"paper":"/paper/multivariate-time-series-anomaly-detection","title":"Multivariate Time-series Anomaly Detection via Graph Attention Network","date":"2020-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ML4ITS/mtad-gat-pytorch","path":"utils.py","file_url":"https://github.com/ML4ITS/mtad-gat-pytorch/blob/HEAD/utils.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":"9725dabb7ae0f789","code_sha256_prefix":"9725dabb7ae0f789","mcp_get_code":{"code_sha256":"9725dabb7ae0f789"}},{"arxiv_id":"1811.07246","arxiv_id_is_arxiv":true,"paper":"/paper/pointconv-deep-convolutional-networks-on-3d","title":"PointConv: Deep Convolutional Networks on 3D Point Clouds","date":"2018-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DylanWusee/pointconv_pytorch","path":"provider.py","file_url":"https://github.com/DylanWusee/pointconv_pytorch/blob/HEAD/provider.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 Levishery/Flywire-Neuron-Tracing, and GitHub detected no licence in that repository when it was checked","code_sha256":"59e9008f0a3743f1","code_sha256_prefix":"59e9008f0a3743f1","mcp_get_code":{"code_sha256":"59e9008f0a3743f1"}},{"arxiv_id":"1807.11176","arxiv_id_is_arxiv":true,"paper":"/paper/human-motion-analysis-with-deep-metric","title":"Human Motion Analysis with Deep Metric Learning","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhesenkamp/attentive-lstm","path":"preprocessing.py","file_url":"https://github.com/dhesenkamp/attentive-lstm/blob/HEAD/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":"f05297cf22e98849","code_sha256_prefix":"f05297cf22e98849","mcp_get_code":{"code_sha256":"f05297cf22e98849"}},{"arxiv_id":"1805.10966","arxiv_id_is_arxiv":true,"paper":"/paper/lifelong-learning-of-spatiotemporal","title":"Lifelong Learning of Spatiotemporal Representations with Dual-Memory Recurrent Self-Organization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giparisi/GDM","path":"gtls.py","file_url":"https://github.com/giparisi/GDM/blob/HEAD/gtls.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, giparisi/GDM when it was checked","code_sha256":"0aa9023de3483559","code_sha256_prefix":"0aa9023de3483559","mcp_get_code":{"code_sha256":"0aa9023de3483559"}},{"arxiv_id":"1804.00586","arxiv_id_is_arxiv":true,"paper":"/paper/learning-descriptor-networks-for-3d-shape","title":"Learning Descriptor Networks for 3D Shape Synthesis and Analysis","date":"2018-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianwen-xie/3DDescriptorNet","path":"util/data_io.py","file_url":"https://github.com/jianwen-xie/3DDescriptorNet/blob/HEAD/util/data_io.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":"2846143ec7d8a4bb","code_sha256_prefix":"2846143ec7d8a4bb","mcp_get_code":{"code_sha256":"2846143ec7d8a4bb"}},{"arxiv_id":"1612.09106","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-point-learning-with-neural","title":"Sequence-to-point learning with neural networks for nonintrusive load monitoring","date":"2016-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"redefik/ConvNILM","path":"data_preprocessing.py","file_url":"https://github.com/redefik/ConvNILM/blob/HEAD/data_preprocessing.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":"a53d60ecd9334fa2","code_sha256_prefix":"a53d60ecd9334fa2","mcp_get_code":{"code_sha256":"a53d60ecd9334fa2"}},{"arxiv_id":"aaai_27944","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_27944","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"FengZicai/Interpretable3D","path":"PointNet2/provider.py","file_url":"https://github.com/FengZicai/Interpretable3D/blob/HEAD/PointNet2/provider.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 Levishery/Flywire-Neuron-Tracing, and GitHub detected no licence in that repository when it was checked","code_sha256":"59e9008f0a3743f1","code_sha256_prefix":"59e9008f0a3743f1","mcp_get_code":{"code_sha256":"59e9008f0a3743f1"}},{"arxiv_id":"Yang_TINC_Tree-Structured_Implicit_Neural_Compression_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yang_TINC_Tree-Structured_Implicit_Neural_Compression_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RichealYoung/TINC","path":"utils/OctTree.py","file_url":"https://github.com/RichealYoung/TINC/blob/HEAD/utils/OctTree.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":"d25dac8ffbda7279","code_sha256_prefix":"d25dac8ffbda7279","mcp_get_code":{"code_sha256":"d25dac8ffbda7279"}},{"arxiv_id":"2025.emnlp-main.688","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.688","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yueen-ma/Astra","path":"model/diffusion/utils.py","file_url":"https://github.com/yueen-ma/Astra/blob/HEAD/model/diffusion/utils.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":"2c14d479564c0880","code_sha256_prefix":"2c14d479564c0880","mcp_get_code":{"code_sha256":"2c14d479564c0880"}}],"record_sha256":"b73860c68c2b72984b3d0706906ea40c803936df939888fa2f8b9d7f88a94650","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}