{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-tau","entry":"get_tau","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":5,"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":4,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":0},"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":"2605.25127","paper":"/paper/arxiv-2605-25127","title":"PQDT: Pseudo-Query Dual Transformer for Robust Point Cloud Restoration","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ins-uni-bonn/PQDT","path":"pqdt/models/pq_transformer.py","file_url":"https://github.com/ins-uni-bonn/PQDT/blob/HEAD/pqdt/models/pq_transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d137b005c5688d22","mcp_get_code":{"code_sha256":"d137b005c5688d22"}},{"arxiv_id":"2407.02068","paper":"/paper/lpvit-low-power-semi-structured-pruning-for","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Akimoto-Cris/LPViT","path":"engine.py","file_url":"https://github.com/Akimoto-Cris/LPViT/blob/HEAD/engine.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aa9253d77220768c","mcp_get_code":{"code_sha256":"aa9253d77220768c"}},{"arxiv_id":"2402.02697","paper":"/paper/deep-equilibrium-models-are-almost-equivalent","title":"Deep Equilibrium Models are Almost Equivalent to Not-so-deep Explicit Models for High-dimensional Gaussian Mixtures","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephenli24/inn_eqvi_enn","path":"utils.py","file_url":"https://github.com/stephenli24/inn_eqvi_enn/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5c6dba917d1b5a83","mcp_get_code":{"code_sha256":"5c6dba917d1b5a83"}},{"arxiv_id":"2203.08243","paper":"/paper/unified-visual-transformer-compression-1","title":"Unified Visual Transformer Compression","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/uvc","path":"UVC/joint_train.py","file_url":"https://github.com/vita-group/uvc/blob/HEAD/UVC/joint_train.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa9253d77220768c","mcp_get_code":{"code_sha256":"aa9253d77220768c"}},{"arxiv_id":"2009.14193","paper":"/paper/uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matinmoezzi/ups_conformal_classification","path":"conformal_classification/conformal.py","file_url":"https://github.com/matinmoezzi/ups_conformal_classification/blob/HEAD/conformal_classification/conformal.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ffb82a3e85bf0356","mcp_get_code":{"code_sha256":"ffb82a3e85bf0356"}}]}