{"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":"/task/binarization","name":"Binarization","slug":"binarization","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":433,"papers_with_code":184,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":17,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/cifar-10","name":"CIFAR-10","full_name":"CIFAR-10","num_papers_in_archive":16145},{"url":"/dataset/imagenet","name":"ImageNet","full_name":"","num_papers_in_archive":15430},{"url":"/dataset/cifar-100","name":"CIFAR-100","full_name":"","num_papers_in_archive":9045},{"url":"/dataset/jhu-crowd","name":"JHU-CROWD","full_name":"","num_papers_in_archive":22},{"url":"/dataset/fdst","name":"FDST","full_name":"Fudan-ShanghaiTech","num_papers_in_archive":18},{"url":"/dataset/dibco-and-h-dibco","name":"DIBCO and H_DIBCO","full_name":"(Handwritten) Document Image Binarization Competition (DIBCO)","num_papers_in_archive":14},{"url":"/dataset/dibco-2011","name":"DIBCO 2011","full_name":"","num_papers_in_archive":7},{"url":"/dataset/h-dibco-2016","name":"H-DIBCO 2016","full_name":"","num_papers_in_archive":7},{"url":"/dataset/dibco-2017","name":"DIBCO 2017","full_name":"","num_papers_in_archive":6},{"url":"/dataset/h-dibco-2014","name":"H-DIBCO 2014","full_name":"","num_papers_in_archive":6},{"url":"/dataset/h-dibco-2018","name":"H-DIBCO 2018","full_name":"","num_papers_in_archive":6},{"url":"/dataset/dibco-2013","name":"DIBCO 2013","full_name":"","num_papers_in_archive":5},{"url":"/dataset/h-dibco-2012","name":"H-DIBCO 2012","full_name":"","num_papers_in_archive":5},{"url":"/dataset/dibco-2009","name":"DIBCO 2009","full_name":"","num_papers_in_archive":4},{"url":"/dataset/dibco-2019","name":"DIBCO 2019","full_name":"","num_papers_in_archive":4},{"url":"/dataset/h-dibco-2010","name":"H-DIBCO 2010","full_name":"","num_papers_in_archive":4},{"url":"/dataset/lrde-dbd","name":"LRDE DBD","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":433,"of_with_code":184,"tagged_in_all":433,"counts":{"archive_papers_tagged":433,"with_a_code_link":184,"where_syntology_ran_a_sample":39,"not_listed_spam_title":0,"listed":433,"listed_where_code_ran":39,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":36,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":36,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/xnor-net-imagenet-classification-using-binary","slug":"xnor-net-imagenet-classification-using-binary","title":"XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks","date":"2016-03-16","arxiv_id":"1603.05279","repositories_listed":20,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":9,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/xnor-net-imagenet-classification-using-binary#ran","syntology_url":"https://syntology.ai/paper/1603.05279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.05279"}},"official":null}},{"url":"/paper/real-time-scene-text-detection-with","slug":"real-time-scene-text-detection-with","title":"Real-time Scene Text Detection with Differentiable Binarization","date":"2019-11-20","arxiv_id":"1911.08947","repositories_listed":15,"syntology":{"n":25,"n_ran":20,"n_constructed":0,"n_ran_checked":17,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/real-time-scene-text-detection-with#ran","syntology_url":"https://syntology.ai/paper/1911.08947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08947"}},"official":{"repos":["MhLiao/DB"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/bimlp-compact-binary-architectures-for-vision","slug":"bimlp-compact-binary-architectures-for-vision","title":"BiMLP: Compact Binary Architectures for Vision Multi-Layer Perceptrons","date":"2022-12-29","arxiv_id":"2212.14158","repositories_listed":5,"syntology":null},{"url":"/paper/real-time-scene-text-detection-with-1","slug":"real-time-scene-text-detection-with-1","title":"Real-Time Scene Text Detection with Differentiable Binarization and Adaptive Scale Fusion","date":"2022-02-21","arxiv_id":"2202.10304","repositories_listed":5,"syntology":null},{"url":"/paper/de-gan-a-conditional-generative-adversarial-1","slug":"de-gan-a-conditional-generative-adversarial-1","title":"DE-GAN: A Conditional Generative Adversarial Network for Document Enhancement","date":"2020-10-17","arxiv_id":"2010.08764","repositories_listed":4,"syntology":null},{"url":"/paper/read-bad-a-new-dataset-and-evaluation-scheme","slug":"read-bad-a-new-dataset-and-evaluation-scheme","title":"READ-BAD: A New Dataset and Evaluation Scheme for Baseline Detection in Archival Documents","date":"2017-05-09","arxiv_id":"1705.03311","repositories_listed":4,"syntology":null},{"url":"/paper/bit-robustly-binarized-multi-distilled","slug":"bit-robustly-binarized-multi-distilled","title":"BiT: Robustly Binarized Multi-distilled Transformer","date":"2022-05-25","arxiv_id":"2205.13016","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bit-robustly-binarized-multi-distilled#ran","syntology_url":"https://syntology.ai/paper/2205.13016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13016"}},"official":{"repos":["facebookresearch/bit"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/recu-reviving-the-dead-weights-in-binary","slug":"recu-reviving-the-dead-weights-in-binary","title":"ReCU: Reviving the Dead Weights in Binary Neural Networks","date":"2021-03-23","arxiv_id":"2103.12369","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recu-reviving-the-dead-weights-in-binary#ran","syntology_url":"https://syntology.ai/paper/2103.12369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12369"}},"official":{"repos":["z-hXu/ReCU"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/adaptive-image-sampling-using-deep-learning","slug":"adaptive-image-sampling-using-deep-learning","title":"Adaptive Image Sampling using Deep Learning and its Application on X-Ray Fluorescence Image Reconstruction","date":"2018-12-27","arxiv_id":"1812.10836","repositories_listed":3,"syntology":null},{"url":"/paper/towards-the-first-adversarially-robust-neural","slug":"towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","arxiv_id":"1805.09190","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-the-first-adversarially-robust-neural#ran","syntology_url":"https://syntology.ai/paper/1805.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09190"}},"official":null}},{"url":"/paper/binarized-convolutional-landmark-localizers","slug":"binarized-convolutional-landmark-localizers","title":"Binarized Convolutional Landmark Localizers for Human Pose Estimation and Face Alignment with Limited Resources","date":"2017-03-02","arxiv_id":"1703.00862","repositories_listed":3,"syntology":null},{"url":"/paper/optimal-classification-trees-for-continuous","slug":"optimal-classification-trees-for-continuous","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","date":"2025-01-14","arxiv_id":"2501.07903","repositories_listed":2,"syntology":null},{"url":"/paper/naf-dpm-a-nonlinear-activation-free-diffusion","slug":"naf-dpm-a-nonlinear-activation-free-diffusion","title":"NAF-DPM: A Nonlinear Activation-Free Diffusion Probabilistic Model for Document Enhancement","date":"2024-04-08","arxiv_id":"2404.05669","repositories_listed":2,"syntology":null},{"url":"/paper/pb-llm-partially-binarized-large-language","slug":"pb-llm-partially-binarized-large-language","title":"PB-LLM: Partially Binarized Large Language Models","date":"2023-09-29","arxiv_id":"2310.00034","repositories_listed":2,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/pb-llm-partially-binarized-large-language#ran","syntology_url":"https://syntology.ai/paper/2310.00034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00034"}},"official":{"repos":["hahnyuan/binaryllm","hahnyuan/pb-llm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/binarized-spectral-compressive-imaging-1","slug":"binarized-spectral-compressive-imaging-1","title":"Binarized Spectral Compressive Imaging","date":"2023-05-17","arxiv_id":"2305.10299","repositories_listed":2,"syntology":{"n":32,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":20,"n_pointer_only":3,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/binarized-spectral-compressive-imaging-1#ran","syntology_url":"https://syntology.ai/paper/2305.10299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10299"}},"official":{"repos":["caiyuanhao1998/MST","caiyuanhao1998/bisci"],"state":"official (archive's flag): 21 ran","n_ran":21,"n_constructed":0,"n_ran_no_instrument_failure":20,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/basic-binary-convolution-unit-for-binarized","slug":"basic-binary-convolution-unit-for-binarized","title":"Basic Binary Convolution Unit for Binarized Image Restoration Network","date":"2022-10-02","arxiv_id":"2210.00405","repositories_listed":2,"syntology":null},{"url":"/paper/a-comprehensive-review-of-binary-neural","slug":"a-comprehensive-review-of-binary-neural","title":"A comprehensive review of Binary Neural Network","date":"2021-10-11","arxiv_id":"2110.06804","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-comprehensive-review-of-binary-neural#ran","syntology_url":"https://syntology.ai/paper/2110.06804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06804"}},"official":{"repos":["hpi-xnor/BMXNet-v2"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/siman-sign-to-magnitude-network-binarization","slug":"siman-sign-to-magnitude-network-binarization","title":"SiMaN: Sign-to-Magnitude Network Binarization","date":"2021-02-16","arxiv_id":"2102.07981","repositories_listed":2,"syntology":null},{"url":"/paper/fracbnn-accurate-and-fpga-efficient-binary","slug":"fracbnn-accurate-and-fpga-efficient-binary","title":"FracBNN: Accurate and FPGA-Efficient Binary Neural Networks with Fractional Activations","date":"2020-12-22","arxiv_id":"2012.12206","repositories_listed":2,"syntology":null},{"url":"/paper/rotated-binary-neural-network","slug":"rotated-binary-neural-network","title":"Rotated Binary Neural Network","date":"2020-09-28","arxiv_id":"2009.13055","repositories_listed":2,"syntology":null},{"url":"/paper/binary-neural-networks-a-survey","slug":"binary-neural-networks-a-survey","title":"Binary Neural Networks: A Survey","date":"2020-03-31","arxiv_id":"2004.03333","repositories_listed":2,"syntology":null},{"url":"/paper/bidet-an-efficient-binarized-object-detector","slug":"bidet-an-efficient-binarized-object-detector","title":"BiDet: An Efficient Binarized Object Detector","date":"2020-03-09","arxiv_id":"2003.03961","repositories_listed":2,"syntology":null},{"url":"/paper/neural-network-compression-framework-for-fast","slug":"neural-network-compression-framework-for-fast","title":"Neural Network Compression Framework for fast model inference","date":"2020-02-20","arxiv_id":"2002.08679","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-network-compression-framework-for-fast#ran","syntology_url":"https://syntology.ai/paper/2002.08679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08679"}},"official":{"repos":["openvinotoolkit/nncf","openvinotoolkit/nncf_pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lutnet-learning-fpga-configurations-for","slug":"lutnet-learning-fpga-configurations-for","title":"LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference","date":"2019-10-24","arxiv_id":"1910.12625","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lutnet-learning-fpga-configurations-for#ran","syntology_url":"https://syntology.ai/paper/1910.12625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12625"}},"official":{"repos":["awai54st/LUTNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ir-net-forward-and-backward-information","slug":"ir-net-forward-and-backward-information","title":"Forward and Backward Information Retention for Accurate Binary Neural Networks","date":"2019-09-24","arxiv_id":"1909.10788","repositories_listed":2,"syntology":null},{"url":"/paper/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}},"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-selectional-auto-encoder-approach-for","slug":"a-selectional-auto-encoder-approach-for","title":"A selectional auto-encoder approach for document image binarization","date":"2017-06-30","arxiv_id":"1706.10241","repositories_listed":2,"syntology":null},{"url":"/paper/hashnet-deep-learning-to-hash-by-continuation","slug":"hashnet-deep-learning-to-hash-by-continuation","title":"HashNet: Deep Learning to Hash by Continuation","date":"2017-02-02","arxiv_id":"1702.00758","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hashnet-deep-learning-to-hash-by-continuation#ran","syntology_url":"https://syntology.ai/paper/1702.00758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.00758"}},"official":{"repos":["thuml/HashNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-sample-efficient-conditional-independence","slug":"a-sample-efficient-conditional-independence","title":"A Sample Efficient Conditional Independence Test in the Presence of Discretization","date":"2025-06-10","arxiv_id":"2506.08747","repositories_listed":1,"syntology":null},{"url":"/paper/robis-robust-binary-segmentation-for-high","slug":"robis-robust-binary-segmentation-for-high","title":"RoBiS: Robust Binary Segmentation for High-Resolution Industrial Images","date":"2025-05-27","arxiv_id":"2505.21152","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11076","slug":"2505-11076","title":"Addition is almost all you need: Compressing neural networks with double binary factorization","date":"2025-05-16","arxiv_id":"2505.11076","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/2505-11076#ran","syntology_url":"https://syntology.ai/paper/2505.11076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.11076"}},"official":{"repos":["usamec/double_binary"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/physics-guided-and-fabrication-aware-inverse","slug":"physics-guided-and-fabrication-aware-inverse","title":"Physics-guided and fabrication-aware inverse design of photonic devices using diffusion models","date":"2025-04-23","arxiv_id":"2504.17077","repositories_listed":1,"syntology":null},{"url":"/paper/expanding-and-shrinking-binary-neural","slug":"expanding-and-shrinking-binary-neural","title":"Expanding-and-Shrinking Binary Neural Networks","date":"2025-03-31","arxiv_id":"2503.23709","repositories_listed":1,"syntology":null},{"url":"/paper/bhvit-binarized-hybrid-vision-transformer","slug":"bhvit-binarized-hybrid-vision-transformer","title":"BHViT: Binarized Hybrid Vision Transformer","date":"2025-03-04","arxiv_id":"2503.02394","repositories_listed":1,"syntology":{"n":29,"n_ran":16,"n_constructed":13,"n_ran_checked":15,"n_instrument":1,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"16 ran (of which 13 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/bhvit-binarized-hybrid-vision-transformer#ran","syntology_url":"https://syntology.ai/paper/2503.02394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.02394"}},"official":{"repos":["IMRL/BHViT"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":13,"n_ran_no_instrument_failure":15,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-accurate-binary-spiking-neural","slug":"towards-accurate-binary-spiking-neural","title":"Towards Accurate Binary Spiking Neural Networks: Learning with Adaptive Gradient Modulation Mechanism","date":"2025-02-20","arxiv_id":"2502.14344","repositories_listed":1,"syntology":null},{"url":"/paper/ptq1-61-push-the-real-limit-of-extremely-low","slug":"ptq1-61-push-the-real-limit-of-extremely-low","title":"PTQ1.61: Push the Real Limit of Extremely Low-Bit Post-Training Quantization Methods for Large Language Models","date":"2025-02-18","arxiv_id":"2502.13179","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-autoencoder-features-for","slug":"sparse-autoencoder-features-for","title":"Sparse Autoencoder Features for Classifications and Transferability","date":"2025-02-17","arxiv_id":"2502.11367","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-binarization-with-semi-structured","slug":"progressive-binarization-with-semi-structured","title":"Progressive Binarization with Semi-Structured Pruning for LLMs","date":"2025-02-03","arxiv_id":"2502.01705","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/progressive-binarization-with-semi-structured#ran","syntology_url":"https://syntology.ai/paper/2502.01705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.01705"}},"official":{"repos":["xianglongyan/pbs2p"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bimacosr-binary-one-step-diffusion-model","slug":"bimacosr-binary-one-step-diffusion-model","title":"BiMaCoSR: Binary One-Step Diffusion Model Leveraging Flexible Matrix Compression for Real Super-Resolution","date":"2025-02-01","arxiv_id":"2502.00333","repositories_listed":1,"syntology":null},{"url":"/paper/hadamrnn-binary-and-sparse-ternary-orthogonal","slug":"hadamrnn-binary-and-sparse-ternary-orthogonal","title":"HadamRNN: Binary and Sparse Ternary Orthogonal RNNs","date":"2025-01-28","arxiv_id":"2502.00047","repositories_listed":1,"syntology":null},{"url":"/paper/pfungst-and-clever-hans-identifying-the","slug":"pfungst-and-clever-hans-identifying-the","title":"Pfungst and Clever Hans: Identifying the unintended cues in a widely used Alzheimer's disease MRI dataset using explainable deep learning","date":"2025-01-27","arxiv_id":"2501.15831","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-the-original-appearance-of-damaged","slug":"predicting-the-original-appearance-of-damaged","title":"Predicting the Original Appearance of Damaged Historical Documents","date":"2024-12-16","arxiv_id":"2412.11634","repositories_listed":1,"syntology":null},{"url":"/paper/bidm-pushing-the-limit-of-quantization-for","slug":"bidm-pushing-the-limit-of-quantization-for","title":"BiDM: Pushing the Limit of Quantization for Diffusion Models","date":"2024-12-08","arxiv_id":"2412.05926","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":6,"n_instrument":8,"n_unverified":2,"n_honours":2,"n_violates":3,"n_no_contract":1,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 3 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bidm-pushing-the-limit-of-quantization-for#ran","syntology_url":"https://syntology.ai/paper/2412.05926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.05926"}},"official":{"repos":["xingyu-zheng/bidm"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bidense-binarization-for-dense-prediction","slug":"bidense-binarization-for-dense-prediction","title":"BiDense: Binarization for Dense Prediction","date":"2024-11-15","arxiv_id":"2411.10346","repositories_listed":1,"syntology":null},{"url":"/paper/diffpad-denoising-diffusion-based-adversarial","slug":"diffpad-denoising-diffusion-based-adversarial","title":"DiffPAD: Denoising Diffusion-based Adversarial Patch Decontamination","date":"2024-10-31","arxiv_id":"2410.24006","repositories_listed":1,"syntology":null},{"url":"/paper/anomalyncd-towards-novel-anomaly-class","slug":"anomalyncd-towards-novel-anomaly-class","title":"AnomalyNCD: Towards Novel Anomaly Class Discovery in Industrial Scenarios","date":"2024-10-18","arxiv_id":"2410.14379","repositories_listed":1,"syntology":null},{"url":"/paper/efficiera-residual-networks-hardware-friendly","slug":"efficiera-residual-networks-hardware-friendly","title":"Efficiera Residual Networks: Hardware-Friendly Fully Binary Weight with 2-bit Activation Model Achieves Practical ImageNet Accuracy","date":"2024-10-15","arxiv_id":"2410.11553","repositories_listed":1,"syntology":null},{"url":"/paper/arb-llm-alternating-refined-binarizations-for","slug":"arb-llm-alternating-refined-binarizations-for","title":"ARB-LLM: Alternating Refined Binarizations for Large Language Models","date":"2024-10-04","arxiv_id":"2410.03129","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/arb-llm-alternating-refined-binarizations-for#ran","syntology_url":"https://syntology.ai/paper/2410.03129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03129"}},"official":{"repos":["zhitengli/arb-llm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pathfinder-for-low-altitude-aircraft-with","slug":"pathfinder-for-low-altitude-aircraft-with","title":"Pathfinder for Low-altitude Aircraft with Binary Neural Network","date":"2024-09-13","arxiv_id":"2409.08824","repositories_listed":1,"syntology":null},{"url":"/paper/2408-03215","slug":"2408-03215","title":"FedBAT: Communication-Efficient Federated Learning via Learnable Binarization","date":"2024-08-06","arxiv_id":"2408.03215","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2408-03215#ran","syntology_url":"https://syntology.ai/paper/2408.03215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03215"}},"official":{"repos":["Leopold1423/fedbat-icml24"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-gans-for-document-image","slug":"efficient-gans-for-document-image","title":"Efficient GANs for Document Image Binarization Based on DWT and Normalization","date":"2024-07-05","arxiv_id":"2407.04231","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-scales-memory-efficient-token","slug":"mixture-of-scales-memory-efficient-token","title":"Mixture of Scales: Memory-Efficient Token-Adaptive Binarization for Large Language Models","date":"2024-06-18","arxiv_id":"2406.12311","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mixture-of-scales-memory-efficient-token#ran","syntology_url":"https://syntology.ai/paper/2406.12311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12311"}},"official":null}},{"url":"/paper/binarized-diffusion-model-for-image-super","slug":"binarized-diffusion-model-for-image-super","title":"Binarized Diffusion Model for Image Super-Resolution","date":"2024-06-09","arxiv_id":"2406.05723","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":3,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 2 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/binarized-diffusion-model-for-image-super#ran","syntology_url":"https://syntology.ai/paper/2406.05723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05723"}},"official":{"repos":["zhengchen1999/bi-diffsr"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-binarization-for-fast-keyword-spotting","slug":"sparse-binarization-for-fast-keyword-spotting","title":"Sparse Binarization for Fast Keyword Spotting","date":"2024-06-09","arxiv_id":"2406.06634","repositories_listed":1,"syntology":null},{"url":"/paper/bdc-occ-binarized-deep-convolution-unit-for","slug":"bdc-occ-binarized-deep-convolution-unit-for","title":"BDC-Occ: Binarized Deep Convolution Unit For Binarized Occupancy Network","date":"2024-05-27","arxiv_id":"2405.17037","repositories_listed":1,"syntology":null},{"url":"/paper/docres-a-generalist-model-toward-unifying","slug":"docres-a-generalist-model-toward-unifying","title":"DocRes: A Generalist Model Toward Unifying Document Image Restoration Tasks","date":"2024-05-07","arxiv_id":"2405.04408","repositories_listed":1,"syntology":null},{"url":"/paper/binarizing-documents-by-leveraging-both-space","slug":"binarizing-documents-by-leveraging-both-space","title":"Binarizing Documents by Leveraging both Space and Frequency","date":"2024-04-26","arxiv_id":"2404.17243","repositories_listed":1,"syntology":null},{"url":"/paper/drawing-the-line-deep-segmentation-for","slug":"drawing-the-line-deep-segmentation-for","title":"Drawing the Line: Deep Segmentation for Extracting Art from Ancient Etruscan Mirrors","date":"2024-04-24","arxiv_id":"2404.15903","repositories_listed":1,"syntology":null},{"url":"/paper/binarydm-towards-accurate-binarization-of","slug":"binarydm-towards-accurate-binarization-of","title":"BinaryDM: Accurate Weight Binarization for Efficient Diffusion Models","date":"2024-04-08","arxiv_id":"2404.05662","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/binarydm-towards-accurate-binarization-of#ran","syntology_url":"https://syntology.ai/paper/2404.05662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05662"}},"official":{"repos":["xingyu-zheng/binarydm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/biper-binary-neural-networks-using-a-periodic","slug":"biper-binary-neural-networks-using-a-periodic","title":"BiPer: Binary Neural Networks using a Periodic Function","date":"2024-04-01","arxiv_id":"2404.01278","repositories_listed":1,"syntology":null},{"url":"/paper/mini-splatting-representing-scenes-with-a","slug":"mini-splatting-representing-scenes-with-a","title":"Mini-Splatting: Representing Scenes with a Constrained Number of Gaussians","date":"2024-03-21","arxiv_id":"2403.14166","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mini-splatting-representing-scenes-with-a#ran","syntology_url":"https://syntology.ai/paper/2403.14166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.14166"}},"official":{"repos":["fatpeter/mini-splatting"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/lum-vit-learnable-under-sampling-mask-vision","slug":"lum-vit-learnable-under-sampling-mask-vision","title":"LUM-ViT: Learnable Under-sampling Mask Vision Transformer for Bandwidth Limited Optical Signal Acquisition","date":"2024-03-03","arxiv_id":"2403.01412","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lum-vit-learnable-under-sampling-mask-vision#ran","syntology_url":"https://syntology.ai/paper/2403.01412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01412"}},"official":{"repos":["maxllf/lum-vit"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neuromorphic-synergy-for-video-binarization","slug":"neuromorphic-synergy-for-video-binarization","title":"Neuromorphic Synergy for Video Binarization","date":"2024-02-20","arxiv_id":"2402.12644","repositories_listed":1,"syntology":null},{"url":"/paper/billm-pushing-the-limit-of-post-training","slug":"billm-pushing-the-limit-of-post-training","title":"BiLLM: Pushing the Limit of Post-Training Quantization for LLMs","date":"2024-02-06","arxiv_id":"2402.04291","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/billm-pushing-the-limit-of-post-training#ran","syntology_url":"https://syntology.ai/paper/2402.04291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04291"}},"official":{"repos":["aaronhuang-778/billm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-fair-evaluation-of-various-deep-learning","slug":"a-fair-evaluation-of-various-deep-learning","title":"A Fair Evaluation of Various Deep Learning-Based Document Image Binarization Approaches","date":"2024-01-22","arxiv_id":"2401.11831","repositories_listed":1,"syntology":null},{"url":"/paper/a-foundation-for-exact-binarized","slug":"a-foundation-for-exact-binarized","title":"A foundation for exact binarized morphological neural networks","date":"2024-01-08","arxiv_id":"2401.03830","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-foundation-for-exact-binarized#ran","syntology_url":"https://syntology.ai/paper/2401.03830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.03830"}},"official":{"repos":["TheodoreAouad/LBQNN2023"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bipft-binary-pre-trained-foundation","slug":"bipft-binary-pre-trained-foundation","title":"BiPFT: Binary Pre-trained Foundation Transformer with Low-rank Estimation of Binarization Residual Polynomials","date":"2023-12-14","arxiv_id":"2312.08937","repositories_listed":1,"syntology":null},{"url":"/paper/a-layer-wise-tokens-to-token-transformer","slug":"a-layer-wise-tokens-to-token-transformer","title":"A Layer-Wise Tokens-to-Token Transformer Network for Improved Historical Document Image Enhancement","date":"2023-12-06","arxiv_id":"2312.03946","repositories_listed":1,"syntology":null},{"url":"/paper/docbinformer-a-two-level-transformer-network","slug":"docbinformer-a-two-level-transformer-network","title":"DocBinFormer: A Two-Level Transformer Network for Effective Document Image Binarization","date":"2023-12-06","arxiv_id":"2312.03568","repositories_listed":1,"syntology":null},{"url":"/paper/signed-binarization-unlocking-efficiency","slug":"signed-binarization-unlocking-efficiency","title":"PLUM: Improving Inference Efficiency By Leveraging Repetition-Sparsity Trade-Off","date":"2023-12-04","arxiv_id":"2312.01581","repositories_listed":1,"syntology":null},{"url":"/paper/binarized-3d-whole-body-human-mesh-recovery","slug":"binarized-3d-whole-body-human-mesh-recovery","title":"BinaryHPE: 3D Human Pose and Shape Estimation via Binarization","date":"2023-11-24","arxiv_id":"2311.14323","repositories_listed":1,"syntology":null},{"url":"/paper/deep-hashing-via-householder-quantization","slug":"deep-hashing-via-householder-quantization","title":"Deep Hashing via Householder Quantization","date":"2023-11-07","arxiv_id":"2311.04207","repositories_listed":1,"syntology":null},{"url":"/paper/video-instance-matting","slug":"video-instance-matting","title":"Video Instance Matting","date":"2023-11-07","arxiv_id":"2311.04212","repositories_listed":1,"syntology":null},{"url":"/paper/persis-a-persian-font-recognition-pipeline-1","slug":"persis-a-persian-font-recognition-pipeline-1","title":"Persis: A Persian Font Recognition Pipeline Using Convolutional Neural Networks","date":"2023-10-08","arxiv_id":"2310.05255","repositories_listed":1,"syntology":null},{"url":"/paper/class-binarization-to-neuroevolution-for","slug":"class-binarization-to-neuroevolution-for","title":"Class Binarization to NeuroEvolution for Multiclass Classification","date":"2023-08-26","arxiv_id":"2308.13876","repositories_listed":1,"syntology":null},{"url":"/paper/estimator-meets-equilibrium-perspective-a","slug":"estimator-meets-equilibrium-perspective-a","title":"Estimator Meets Equilibrium Perspective: A Rectified Straight Through Estimator for Binary Neural Networks Training","date":"2023-08-13","arxiv_id":"2308.06689","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/estimator-meets-equilibrium-perspective-a#ran","syntology_url":"https://syntology.ai/paper/2308.06689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06689"}},"official":{"repos":["dravenalg/reste"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/binaryvit-pushing-binary-vision-transformers","slug":"binaryvit-pushing-binary-vision-transformers","title":"BinaryViT: Pushing Binary Vision Transformers Towards Convolutional Models","date":"2023-06-29","arxiv_id":"2306.16678","repositories_listed":1,"syntology":null},{"url":"/paper/binary-domain-generalization-for-sparsifying","slug":"binary-domain-generalization-for-sparsifying","title":"Binary domain generalization for sparsifying binary neural networks","date":"2023-06-23","arxiv_id":"2306.13515","repositories_listed":1,"syntology":null},{"url":"/paper/feature-mixing-for-writer-retrieval-and","slug":"feature-mixing-for-writer-retrieval-and","title":"Feature Mixing for Writer Retrieval and Identification on Papyri Fragments","date":"2023-06-22","arxiv_id":"2306.12939","repositories_listed":1,"syntology":null},{"url":"/paper/ccdwt-gan-generative-adversarial-networks","slug":"ccdwt-gan-generative-adversarial-networks","title":"CCDWT-GAN: Generative Adversarial Networks Based on Color Channel Using Discrete Wavelet Transform for Document Image Binarization","date":"2023-05-27","arxiv_id":"2305.17420","repositories_listed":1,"syntology":null},{"url":"/paper/gsb-group-superposition-binarization-for","slug":"gsb-group-superposition-binarization-for","title":"GSB: Group Superposition Binarization for Vision Transformer with Limited Training Samples","date":"2023-05-13","arxiv_id":"2305.07931","repositories_listed":1,"syntology":null},{"url":"/paper/partial-mathbb-b-nets-learning-discrete","slug":"partial-mathbb-b-nets-learning-discrete","title":"$\\partial\\mathbb{B}$ nets: learning discrete functions by gradient descent","date":"2023-05-12","arxiv_id":"2305.07315","repositories_listed":1,"syntology":null},{"url":"/paper/shadow-removal-of-text-document-images-using","slug":"shadow-removal-of-text-document-images-using","title":"Shadow Removal of Text Document Images Using Background Estimation and Adaptive Text Enhancement","date":"2023-05-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/arrhythmia-classifier-based-on-ultra","slug":"arrhythmia-classifier-based-on-ultra","title":"Arrhythmia Classifier Based on Ultra-Lightweight Binary Neural Network","date":"2023-04-04","arxiv_id":"2304.01568","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-distillation-for-feature-extraction","slug":"knowledge-distillation-for-feature-extraction","title":"Knowledge Distillation for Feature Extraction in Underwater VSLAM","date":"2023-03-31","arxiv_id":"2303.17981","repositories_listed":1,"syntology":null},{"url":"/paper/binary-embedding-based-retrieval-at-tencent","slug":"binary-embedding-based-retrieval-at-tencent","title":"Binary Embedding-based Retrieval at Tencent","date":"2023-02-17","arxiv_id":"2302.08714","repositories_listed":1,"syntology":null},{"url":"/paper/effective-document-image-enhancement-using","slug":"effective-document-image-enhancement-using","title":"Effective Document Image Enhancement Using tokens-to-token Transformer Network","date":"2023-02-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/binarized-neural-machine-translation-1","slug":"binarized-neural-machine-translation-1","title":"Binarized Neural Machine Translation","date":"2023-02-09","arxiv_id":"2302.04907","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/binarized-neural-machine-translation-1#ran","syntology_url":"https://syntology.ai/paper/2302.04907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04907"}},"official":{"repos":["google/aqt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gdb-gated-convolutions-based-document","slug":"gdb-gated-convolutions-based-document","title":"GDB: Gated convolutions-based Document Binarization","date":"2023-02-04","arxiv_id":"2302.02073","repositories_listed":1,"syntology":null},{"url":"/paper/bibench-benchmarking-and-analyzing-network","slug":"bibench-benchmarking-and-analyzing-network","title":"BiBench: Benchmarking and Analyzing Network Binarization","date":"2023-01-26","arxiv_id":"2301.11233","repositories_listed":1,"syntology":null},{"url":"/paper/dlbd-a-self-supervised-direct-learned-binary","slug":"dlbd-a-self-supervised-direct-learned-binary","title":"DLBD: A Self-Supervised Direct-Learned Binary Descriptor","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fan-beam-binarization-difference-projection","slug":"fan-beam-binarization-difference-projection","title":"Fan-Beam Binarization Difference Projection (FB-BDP): A Novel Local Object Descriptor for Fine-Grained Leaf Image Retrieval","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/walking-noise-understanding-implications-of","slug":"walking-noise-understanding-implications-of","title":"Walking Noise: On Layer-Specific Robustness of Neural Architectures against Noisy Computations and Associated Characteristic Learning Dynamics","date":"2022-12-20","arxiv_id":"2212.10430","repositories_listed":1,"syntology":null},{"url":"/paper/three-stage-binarization-of-color-document","slug":"three-stage-binarization-of-color-document","title":"Three-stage binarization of color document images based on discrete wavelet transform and generative adversarial networks","date":"2022-11-29","arxiv_id":"2211.16098","repositories_listed":1,"syntology":null},{"url":"/paper/bifsmnv2-pushing-binary-neural-networks-for","slug":"bifsmnv2-pushing-binary-neural-networks-for","title":"BiFSMNv2: Pushing Binary Neural Networks for Keyword Spotting to Real-Network Performance","date":"2022-11-13","arxiv_id":"2211.06987","repositories_listed":1,"syntology":null},{"url":"/paper/threshnet-segmentation-refinement-inspired-by","slug":"threshnet-segmentation-refinement-inspired-by","title":"PatchRefineNet: Improving Binary Segmentation by Incorporating Signals from Optimal Patch-wise Binarization","date":"2022-11-12","arxiv_id":"2211.06560","repositories_listed":1,"syntology":null},{"url":"/paper/variational-augmentation-for-enhancing","slug":"variational-augmentation-for-enhancing","title":"Variational Augmentation for Enhancing Historical Document Image Binarization","date":"2022-11-12","arxiv_id":"2211.06581","repositories_listed":1,"syntology":null},{"url":"/paper/bebert-efficient-and-robust-binary-ensemble","slug":"bebert-efficient-and-robust-binary-ensemble","title":"BEBERT: Efficient and Robust Binary Ensemble BERT","date":"2022-10-28","arxiv_id":"2210.15976","repositories_listed":1,"syntology":null},{"url":"/paper/lab-learnable-activation-binarizer-for-binary","slug":"lab-learnable-activation-binarizer-for-binary","title":"LAB: Learnable Activation Binarizer for Binary Neural Networks","date":"2022-10-25","arxiv_id":"2210.13858","repositories_listed":1,"syntology":null},{"url":"/paper/binary-graph-convolutional-network-with","slug":"binary-graph-convolutional-network-with","title":"Binary Graph Convolutional Network with Capacity Exploration","date":"2022-10-24","arxiv_id":"2210.13149","repositories_listed":1,"syntology":null}],"syntology_records":27,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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_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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":39,"papers_where_code_ran_first_page":"/task/binarization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/binarization/papers/2","json":"/task/binarization/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/binarization/papers/3","json":"/task/binarization/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/binarization/papers/4","json":"/task/binarization/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/binarization/papers/5","json":"/task/binarization/papers/5.json","rows":33},{"order":"ran","page":1,"of":1,"url":"/task/binarization/papers/ran/1","json":"/task/binarization/papers/ran/1.json","rows":39}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"b5e42ad54410b0d8c76ac1d2aceff065e89de0003cd3a3dab26e39080af45345","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}