{"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/estimate","entry":"estimate","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":14,"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":14,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":6,"n_samples_unverified":5,"n_samples_fingerprinted":3,"n_places":14,"n_places_pointer_only":5,"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":3,"ran_fixture":3,"ran":3,"unverified":5},"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":"2604.08474","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08474","title":"Quantization Impact on the Accuracy and Communication Efficiency Trade-off in Federated Learning for Aerospace Predictive Maintenance","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"therealdeadbeef/aerospace-fl-quantization","path":"fpga_estimation_zcu102.py","file_url":"https://github.com/therealdeadbeef/aerospace-fl-quantization/blob/HEAD/fpga_estimation_zcu102.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"587462de6af47444","code_sha256_prefix":"587462de6af47444","mcp_get_code":{"code_sha256":"587462de6af47444"}},{"arxiv_id":"2503.02726","arxiv_id_is_arxiv":true,"paper":"/paper/measurement-noise-scaling-laws-for-cellular","title":"Measurement noise scaling laws for cellular representation learning","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggdna/scScaling","path":"analysis/latentmi/lmi.py","file_url":"https://github.com/ggdna/scScaling/blob/HEAD/analysis/latentmi/lmi.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":"7b7ad78a9ffbfafd","code_sha256_prefix":"7b7ad78a9ffbfafd","mcp_get_code":{"code_sha256":"7b7ad78a9ffbfafd"}},{"arxiv_id":"2409.03127","arxiv_id_is_arxiv":true,"paper":"/paper/fast-algorithms-to-improve-fair-information","title":"Fast algorithms to improve fair information access in networks","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":"archive","repo":"rhythmthief/FairnessNetworks","path":"code/probability.py","file_url":"https://github.com/rhythmthief/FairnessNetworks/blob/HEAD/code/probability.py","status":"unverified","verification_level":0,"contract_check":null,"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, rhythmthief/FairnessNetworks (NOASSERTION)","code_sha256":"3dd7bd25cf6b5de6","code_sha256_prefix":"3dd7bd25cf6b5de6","mcp_get_code":{"code_sha256":"3dd7bd25cf6b5de6"}},{"arxiv_id":"2406.10914","arxiv_id_is_arxiv":true,"paper":"/paper/first-order-manifold-data-augmentation-for","title":"First-Order Manifold Data Augmentation for Regression Learning","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azencot-group/foma","path":"src/foma.py","file_url":"https://github.com/azencot-group/foma/blob/HEAD/src/foma.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b844e33b3a003151","code_sha256_prefix":"b844e33b3a003151","mcp_get_code":{"code_sha256":"b844e33b3a003151"}},{"arxiv_id":"2403.03662","arxiv_id_is_arxiv":true,"paper":"/paper/harnessing-meta-learning-for-improving-full","title":"Harnessing Meta-Learning for Improving Full-Frame Video Stabilization","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkashifali/metavideostab","path":"PWC_Module/PWC_Module.py","file_url":"https://github.com/mkashifali/metavideostab/blob/HEAD/PWC_Module/PWC_Module.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, mkashifali/metavideostab when it was checked","code_sha256":"0d3d13d6e34e1072","code_sha256_prefix":"0d3d13d6e34e1072","mcp_get_code":{"code_sha256":"0d3d13d6e34e1072"}},{"arxiv_id":"2402.17826","arxiv_id_is_arxiv":true,"paper":"/paper/prediction-powered-ranking-of-large-language","title":"Prediction-Powered Ranking of Large Language Models","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"networks-learning/prediction-powered-ranking","path":"src/estimate.py","file_url":"https://github.com/networks-learning/prediction-powered-ranking/blob/HEAD/src/estimate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cdbfedcc67b27ade","code_sha256_prefix":"cdbfedcc67b27ade","mcp_get_code":{"code_sha256":"cdbfedcc67b27ade"}},{"arxiv_id":"2305.04468","arxiv_id_is_arxiv":true,"paper":"/paper/anomalybert-self-supervised-transformer-for","title":"AnomalyBERT: Self-Supervised Transformer for Time Series Anomaly Detection using Data Degradation Scheme","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jhryu30/AnomalyBERT","path":"estimate.py","file_url":"https://github.com/Jhryu30/AnomalyBERT/blob/HEAD/estimate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Jhryu30/AnomalyBERT when it was checked","code_sha256":"afd9fe5a924fcb74","code_sha256_prefix":"afd9fe5a924fcb74","mcp_get_code":{"code_sha256":"afd9fe5a924fcb74"}},{"arxiv_id":"2212.05342","arxiv_id_is_arxiv":true,"paper":"/paper/benchmark-dataset-and-effective-inter-frame","title":"Benchmark Dataset and Effective Inter-Frame Alignment for Real-World Video Super-Resolution","date":"2022-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitrainer/eavsr","path":"models/spy_net.py","file_url":"https://github.com/hitrainer/eavsr/blob/HEAD/models/spy_net.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":"90386834977a62ea","code_sha256_prefix":"90386834977a62ea","mcp_get_code":{"code_sha256":"90386834977a62ea"}},{"arxiv_id":"2205.12952","arxiv_id_is_arxiv":true,"paper":"/paper/pretraining-is-all-you-need-for-image-to","title":"Pretraining is All You Need for Image-to-Image Translation","date":"2022-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PITI-Synthesis/PITI","path":"preprocess/preprocess_sketch.py","file_url":"https://github.com/PITI-Synthesis/PITI/blob/HEAD/preprocess/preprocess_sketch.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":"17279541625491ee","code_sha256_prefix":"17279541625491ee","mcp_get_code":{"code_sha256":"17279541625491ee"}},{"arxiv_id":"2008.04237","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-of-audio-visual","title":"Self-Supervised Learning of Audio-Visual Objects from Video","date":"2020-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"afourast/avobjects","path":"flow/pwcnet.py","file_url":"https://github.com/afourast/avobjects/blob/HEAD/flow/pwcnet.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":"0747b9a053d42ac4","code_sha256_prefix":"0747b9a053d42ac4","mcp_get_code":{"code_sha256":"0747b9a053d42ac4"}},{"arxiv_id":"1907.07899","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-temporal-prior-from-motion-flow","title":"Incorporating Temporal Prior from Motion Flow for Instrument Segmentation in Minimally Invasive Surgery Video","date":"2019-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keyuncheng/MF-TAPNet","path":"src/gen_optflow.py","file_url":"https://github.com/keyuncheng/MF-TAPNet/blob/HEAD/src/gen_optflow.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, keyuncheng/MF-TAPNet when it was checked","code_sha256":"0e98af9be4e86267","code_sha256_prefix":"0e98af9be4e86267","mcp_get_code":{"code_sha256":"0e98af9be4e86267"}},{"arxiv_id":"1906.03323","arxiv_id_is_arxiv":true,"paper":"/paper/empirical-likelihood-for-contextual-bandits","title":"Empirical Likelihood for Contextual Bandits","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmineiro/elfcb","path":"MLE/MLE/estimate.py","file_url":"https://github.com/pmineiro/elfcb/blob/HEAD/MLE/MLE/estimate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ca423ab62a0439be","code_sha256_prefix":"ca423ab62a0439be","mcp_get_code":{"code_sha256":"ca423ab62a0439be"}},{"arxiv_id":"1803.09672","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-intrinsic-dimensionality-of-face","title":"On the Intrinsic Dimensionality of Image Representations","date":"2018-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ansuini/IntrinsicDimDeep","path":"IDNN/intrinsic_dimension.py","file_url":"https://github.com/ansuini/IntrinsicDimDeep/blob/HEAD/IDNN/intrinsic_dimension.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, ansuini/IntrinsicDimDeep when it was checked","code_sha256":"ccc4b5af2dd293b4","code_sha256_prefix":"ccc4b5af2dd293b4","mcp_get_code":{"code_sha256":"ccc4b5af2dd293b4"}},{"arxiv_id":"openreview_8jViL8YrB1","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_8jViL8YrB1","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CyberAgentAILab/cenreg","path":"src/cenreg/model/copula_graphic.py","file_url":"https://github.com/CyberAgentAILab/cenreg/blob/HEAD/src/cenreg/model/copula_graphic.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":"4119a07882d5e74e","code_sha256_prefix":"4119a07882d5e74e","mcp_get_code":{"code_sha256":"4119a07882d5e74e"}}],"record_sha256":"2e6449cb5562867c840f605bc4cd83e0615512bbafd15373f6bcb6ab0b109105","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}