{"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/compute-error","entry":"compute_error","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":13,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":4,"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":13,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":4,"n_samples_unverified":1,"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":2,"ran_fixture":2,"ran":9,"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":"2606.09030","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-09030","title":"TRIAGE: Dialectical Reasoning for Explainable Risk Prediction on Irregularly Sampled Medical Time Series with LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"easonLuo2001/Hi-Patch","path":"lib/evaluation.py","file_url":"https://github.com/easonLuo2001/Hi-Patch/blob/HEAD/lib/evaluation.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, easonLuo2001/Hi-Patch when it was checked","code_sha256":"7e9be53cf12add2f","code_sha256_prefix":"7e9be53cf12add2f","mcp_get_code":{"code_sha256":"7e9be53cf12add2f"}},{"arxiv_id":"2410.22887","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-bounds-via-conditional-f","title":"Generalization Bounds via Conditional $f$-Information","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziqiaowanggeothe/conditional-f-information-bound","path":"fcmi_parse_results.py","file_url":"https://github.com/ziqiaowanggeothe/conditional-f-information-bound/blob/HEAD/fcmi_parse_results.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, ziqiaowanggeothe/conditional-f-information-bound when it was checked","code_sha256":"f1e8556c82281e71","code_sha256_prefix":"f1e8556c82281e71","mcp_get_code":{"code_sha256":"f1e8556c82281e71"}},{"arxiv_id":"2410.14066","arxiv_id_is_arxiv":true,"paper":"/paper/lightweight-correlation-aware-table","title":"Lightweight Correlation-Aware Table Compression","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utndatasystems/virtual","path":"virtual/models/k_regression.py","file_url":"https://github.com/utndatasystems/virtual/blob/HEAD/virtual/models/k_regression.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":"8d1469ccb137db5b","code_sha256_prefix":"8d1469ccb137db5b","mcp_get_code":{"code_sha256":"8d1469ccb137db5b"}},{"arxiv_id":"2410.09615","arxiv_id_is_arxiv":true,"paper":"/paper/slim-one-shot-quantized-sparse-plus-low-rank","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohammad-mozaffari/slim","path":"slim/quantization/quantization.py","file_url":"https://github.com/mohammad-mozaffari/slim/blob/HEAD/slim/quantization/quantization.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":"52c8d10182e8a260","code_sha256_prefix":"52c8d10182e8a260","mcp_get_code":{"code_sha256":"52c8d10182e8a260"}},{"arxiv_id":"2406.07532","arxiv_id_is_arxiv":true,"paper":"/paper/hearing-anything-anywhere","title":"Hearing Anything Anywhere","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maswang32/hearinganythinganywhere","path":"evaluate.py","file_url":"https://github.com/maswang32/hearinganythinganywhere/blob/HEAD/evaluate.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, maswang32/hearinganythinganywhere when it was checked","code_sha256":"445455cc5eec3fc3","code_sha256_prefix":"445455cc5eec3fc3","mcp_get_code":{"code_sha256":"445455cc5eec3fc3"}},{"arxiv_id":"2301.11955","arxiv_id_is_arxiv":true,"paper":"/paper/statistical-whitening-of-neural-populations","title":"Adaptive whitening in neural populations with gain-modulating interneurons","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyndond/frame_whitening","path":"frame_whitening/simulation.py","file_url":"https://github.com/lyndond/frame_whitening/blob/HEAD/frame_whitening/simulation.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":"1ccd9435f7664f94","code_sha256_prefix":"1ccd9435f7664f94","mcp_get_code":{"code_sha256":"1ccd9435f7664f94"}},{"arxiv_id":"2208.11726","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-task-embedding-for-measuring-task","title":"Wasserstein Task Embedding for Measuring Task Similarities","date":"2022-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinranliueva/Wasserstein-Task-Embedding","path":"utils/bures_wasserstein.py","file_url":"https://github.com/xinranliueva/Wasserstein-Task-Embedding/blob/HEAD/utils/bures_wasserstein.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, xinranliueva/Wasserstein-Task-Embedding when it was checked","code_sha256":"8b520d5b12c27015","code_sha256_prefix":"8b520d5b12c27015","mcp_get_code":{"code_sha256":"8b520d5b12c27015"}},{"arxiv_id":"2203.08586","arxiv_id_is_arxiv":true,"paper":"/paper/deep-vanishing-point-detection-geometric","title":"Deep vanishing point detection: Geometric priors make dataset variations vanish","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanconglin/vanishingpoint_houghtransform_gaussiansphere","path":"eval_manhattan.py","file_url":"https://github.com/yanconglin/vanishingpoint_houghtransform_gaussiansphere/blob/HEAD/eval_manhattan.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":"6125c3a4aaf2b8b3","code_sha256_prefix":"6125c3a4aaf2b8b3","mcp_get_code":{"code_sha256":"6125c3a4aaf2b8b3"}},{"arxiv_id":"2010.11838","arxiv_id_is_arxiv":true,"paper":"/paper/blind-video-temporal-consistency-via-deep","title":"Blind Video Temporal Consistency via Deep Video Prior","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzxing87/pytorch-deep-video-prior","path":"main_IRT.py","file_url":"https://github.com/yzxing87/pytorch-deep-video-prior/blob/HEAD/main_IRT.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, yzxing87/pytorch-deep-video-prior when it was checked","code_sha256":"b01ca069cf08abf6","code_sha256_prefix":"b01ca069cf08abf6","mcp_get_code":{"code_sha256":"b01ca069cf08abf6"}},{"arxiv_id":"2006.06879","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-sampling-to-reduce-disparate","title":"Active Sampling for Min-Max Fairness","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/active-sampling-for-minmax-fairness","path":"algorithms/utils.py","file_url":"https://github.com/amazon-research/active-sampling-for-minmax-fairness/blob/HEAD/algorithms/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":"49e9fc8141d285e5","code_sha256_prefix":"49e9fc8141d285e5","mcp_get_code":{"code_sha256":"49e9fc8141d285e5"}},{"arxiv_id":"1908.01311","arxiv_id_is_arxiv":true,"paper":"/paper/fully-automatic-video-colorization-with-self-1","title":"Fully Automatic Video Colorization with Self-Regularization and Diversity","date":"2019-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenyangLEI/Fully-Automatic-Video-Colorization-with-Self-Regularization-and-Diversity","path":"loss.py","file_url":"https://github.com/ChenyangLEI/Fully-Automatic-Video-Colorization-with-Self-Regularization-and-Diversity/blob/HEAD/loss.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":"a749989daf2242cf","code_sha256_prefix":"a749989daf2242cf","mcp_get_code":{"code_sha256":"a749989daf2242cf"}},{"arxiv_id":"1504.02863","arxiv_id_is_arxiv":true,"paper":"/paper/appearance-based-gaze-estimation-in-the-wild","title":"Appearance-Based Gaze Estimation in the Wild","date":"2015-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongzelian/multi-view-gaze","path":"code/Train_Multi_View_Multi_Task_ST_MPII.py","file_url":"https://github.com/dongzelian/multi-view-gaze/blob/HEAD/code/Train_Multi_View_Multi_Task_ST_MPII.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":"53744cb2c34010e0","code_sha256_prefix":"53744cb2c34010e0","mcp_get_code":{"code_sha256":"53744cb2c34010e0"}},{"arxiv_id":"aaai_25161","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25161","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THU-LYJ-Lab/DarkFeat","path":"pose_estimation.py","file_url":"https://github.com/THU-LYJ-Lab/DarkFeat/blob/HEAD/pose_estimation.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":"f79d79fc8f1c1c3e","code_sha256_prefix":"f79d79fc8f1c1c3e","mcp_get_code":{"code_sha256":"f79d79fc8f1c1c3e"}},{"arxiv_id":"136760331","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136760331 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"chang9711/BIPS","path":"ECCV2022/FAED/FID.py","file_url":"https://github.com/chang9711/BIPS/blob/HEAD/ECCV2022/FAED/FID.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":"e786fd548b63f62a","code_sha256_prefix":"e786fd548b63f62a","mcp_get_code":{"code_sha256":"e786fd548b63f62a"}}],"record_sha256":"5d7dd833237ed3e2b4411aadc6bd6eededcef4c0c141fcd1d2f34143d639d67a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}