{"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/blocking","name":"Blocking","slug":"blocking","description_markdown":"Entity resolution (also known as entity matching, record linkage, or duplicate detection) is the task of finding records that refer to the same real-world entity across different data sources (e.g., data files, books, websites, and databases). (Source: Wikipedia)\r\n\r\n**Blocking** is a crucial step in any entity resolution pipeline because a pair-wise comparison of all records across two data sources is infeasible. \r\nBlocking applies a computationally cheap method to generate a smaller set of candidate record pairs reducing the workload of the matcher.\r\nDuring matching a more expensive pair-wise matcher generates a final set of matching record pairs.\r\n\r\n\r\nSurvey on blocking:\r\n\r\n- [Papadakis et al.: Blocking and Filtering Techniques for Entity Resolution: A Survey](https://dl.acm.org/doi/pdf/10.1145/3377455), 2020.","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":524,"papers_with_code":129,"benchmarks":5,"benchmark_tables_in_archive":5,"benchmark_tables_shown":5,"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":3,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/blocking-on-abt-buy","slug":"blocking-on-abt-buy","dataset":"Abt-Buy","dataset_url":"/dataset/abt-buy","rows_in_archive":6,"metrics":["Candidate Set Size","Recall"],"first_row_in_archive_order":{"model":"Sudowoodo","paper_title":"Sudowoodo: Contrastive Self-supervised Learning for Multi-purpose Data Integration and Preparation","paper_url":"/paper/sudowoodo-contrastive-self-supervised","paper_date":"2022-07-08","arxiv_id":"2207.04122","code_links":[{"title":"megagonlabs/sudowoodo","url":"https://github.com/megagonlabs/sudowoodo"}],"syntology":null}},{"leaderboard":"/sota/blocking-on-amazon-google","slug":"blocking-on-amazon-google","dataset":"Amazon-Google","dataset_url":"/dataset/amazon-google","rows_in_archive":6,"metrics":["Candidate Set Size","Recall"],"first_row_in_archive_order":{"model":"SC-Block","paper_title":"SC-Block: Supervised Contrastive Blocking within Entity Resolution Pipelines","paper_url":"/paper/sc-block-supervised-contrastive-blocking","paper_date":"2023-03-06","arxiv_id":"2303.03132","code_links":[{"title":"wbsg-uni-mannheim/sc-block","url":"https://github.com/wbsg-uni-mannheim/sc-block"}],"syntology":null}},{"leaderboard":"/sota/blocking-on-wdc-block-large","slug":"blocking-on-wdc-block-large","dataset":"WDC Block - large","dataset_url":"/dataset/wdc-block","rows_in_archive":2,"metrics":["Candidate Set Size","Recall"],"first_row_in_archive_order":{"model":"SC-Block","paper_title":"SC-Block: Supervised Contrastive Blocking within Entity Resolution Pipelines","paper_url":"/paper/sc-block-supervised-contrastive-blocking","paper_date":"2023-03-06","arxiv_id":"2303.03132","code_links":[{"title":"wbsg-uni-mannheim/sc-block","url":"https://github.com/wbsg-uni-mannheim/sc-block"}],"syntology":null}},{"leaderboard":"/sota/blocking-on-wdc-block-medium","slug":"blocking-on-wdc-block-medium","dataset":"WDC Block - medium","dataset_url":"/dataset/wdc-block","rows_in_archive":2,"metrics":["Candidate Set Size","Recall"],"first_row_in_archive_order":{"model":"SC-Block","paper_title":"SC-Block: Supervised Contrastive Blocking within Entity Resolution Pipelines","paper_url":"/paper/sc-block-supervised-contrastive-blocking","paper_date":"2023-03-06","arxiv_id":"2303.03132","code_links":[{"title":"wbsg-uni-mannheim/sc-block","url":"https://github.com/wbsg-uni-mannheim/sc-block"}],"syntology":null}},{"leaderboard":"/sota/blocking-on-wdc-block-small","slug":"blocking-on-wdc-block-small","dataset":"WDC Block - small","dataset_url":"/dataset/wdc-block","rows_in_archive":2,"metrics":["Recall","Candidate Set Size"],"first_row_in_archive_order":{"model":"BM25","paper_title":"SC-Block: Supervised Contrastive Blocking within Entity Resolution Pipelines","paper_url":"/paper/sc-block-supervised-contrastive-blocking","paper_date":"2023-03-06","arxiv_id":"2303.03132","code_links":[{"title":"wbsg-uni-mannheim/sc-block","url":"https://github.com/wbsg-uni-mannheim/sc-block"}],"syntology":null}}],"datasets":[{"url":"/dataset/amazon-google","name":"Amazon-Google","full_name":"","num_papers_in_archive":20},{"url":"/dataset/abt-buy","name":"Abt-Buy","full_name":"","num_papers_in_archive":19},{"url":"/dataset/wdc-block","name":"WDC Block","full_name":"WDC Block: A Blocking Benchmark","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/entity-resolution","name":"Entity Resolution"}],"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":6,"rows_per_page":100,"shown":100,"of":524,"of_with_code":129,"tagged_in_all":524,"counts":{"archive_papers_tagged":524,"with_a_code_link":129,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":524,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/sinet-extreme-lightweight-portrait","slug":"sinet-extreme-lightweight-portrait","title":"SINet: Extreme Lightweight Portrait Segmentation Networks with Spatial Squeeze Modules and Information Blocking Decoder","date":"2019-11-20","arxiv_id":"1911.09099","repositories_listed":8,"syntology":null},{"url":"/paper/neural-text-generation-with-unlikelihood","slug":"neural-text-generation-with-unlikelihood","title":"Neural Text Generation with Unlikelihood Training","date":"2019-08-12","arxiv_id":"1908.04319","repositories_listed":6,"syntology":{"n":6,"n_ran":6,"n_constructed":1,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-text-generation-with-unlikelihood#ran","syntology_url":"https://syntology.ai/paper/1908.04319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04319"}},"official":{"repos":["facebookresearch/unlikelihood_training"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/d-blink-distributed-end-to-end-bayesian","slug":"d-blink-distributed-end-to-end-bayesian","title":"d-blink: Distributed End-to-End Bayesian Entity Resolution","date":"2019-09-13","arxiv_id":"1909.06039","repositories_listed":4,"syntology":null},{"url":"/paper/compression-artifacts-reduction-by-a-deep","slug":"compression-artifacts-reduction-by-a-deep","title":"Compression Artifacts Reduction by a Deep Convolutional Network","date":"2015-04-27","arxiv_id":"1504.06993","repositories_listed":4,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/compression-artifacts-reduction-by-a-deep#ran","syntology_url":"https://syntology.ai/paper/1504.06993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1504.06993"}},"official":null}},{"url":"/paper/towards-effective-planning-strategies-for","slug":"towards-effective-planning-strategies-for","title":"Towards Effective Planning Strategies for Dynamic Opinion Networks","date":"2024-10-18","arxiv_id":"2410.14091","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-effective-planning-strategies-for#ran","syntology_url":"https://syntology.ai/paper/2410.14091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14091"}},"official":{"repos":["ai4society/infospread-neurips-24","BharathMuppasani/NeurIPS-Submission-2024"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-universal-dense-blocking-for-entity","slug":"towards-universal-dense-blocking-for-entity","title":"Towards Universal Dense Blocking for Entity Resolution","date":"2024-04-23","arxiv_id":"2404.14831","repositories_listed":2,"syntology":null},{"url":"/paper/streammultidiffusion-real-time-interactive","slug":"streammultidiffusion-real-time-interactive","title":"SemanticDraw: Towards Real-Time Interactive Content Creation from Image Diffusion Models","date":"2024-03-14","arxiv_id":"2403.09055","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/streammultidiffusion-real-time-interactive#ran","syntology_url":"https://syntology.ai/paper/2403.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09055"}},"official":{"repos":["ironjr/semantic-draw","ironjr/streammultidiffusion"],"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/dynamicvit-efficient-vision-transformers-with","slug":"dynamicvit-efficient-vision-transformers-with","title":"DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification","date":"2021-06-03","arxiv_id":"2106.02034","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":2,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dynamicvit-efficient-vision-transformers-with#ran","syntology_url":"https://syntology.ai/paper/2106.02034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02034"}},"official":{"repos":["raoyongming/DynamicViT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/slowmo-improving-communication-efficient","slug":"slowmo-improving-communication-efficient","title":"SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentum","date":"2019-10-01","arxiv_id":"1910.00643","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 3 unverified","sample_list":"/paper/slowmo-improving-communication-efficient#ran","syntology_url":"https://syntology.ai/paper/1910.00643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00643"}},"official":{"repos":["facebookresearch/fairscale"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/percival-making-in-browser-perceptual-ad","slug":"percival-making-in-browser-perceptual-ad","title":"Percival: Making In-Browser Perceptual Ad Blocking Practical With Deep Learning","date":"2019-05-17","arxiv_id":"1905.07444","repositories_listed":2,"syntology":null},{"url":"/paper/emergent-complexity-via-multi-agent","slug":"emergent-complexity-via-multi-agent","title":"Emergent Complexity via Multi-Agent Competition","date":"2017-10-10","arxiv_id":"1710.03748","repositories_listed":2,"syntology":null},{"url":"/paper/deep-convolution-networks-for-compression","slug":"deep-convolution-networks-for-compression","title":"Deep Convolution Networks for Compression Artifacts Reduction","date":"2016-08-09","arxiv_id":"1608.02778","repositories_listed":2,"syntology":null},{"url":"/paper/2506-10660","slug":"2506-10660","title":"Pushing the Limits of Extreme Weather: Constructing Extreme Heatwave Storylines with Differentiable Climate Models","date":"2025-06-12","arxiv_id":"2506.10660","repositories_listed":1,"syntology":null},{"url":"/paper/noloco-no-all-reduce-low-communication","slug":"noloco-no-all-reduce-low-communication","title":"NoLoCo: No-all-reduce Low Communication Training Method for Large Models","date":"2025-06-12","arxiv_id":"2506.10911","repositories_listed":1,"syntology":null},{"url":"/paper/open-captchaworld-a-comprehensive-web-based","slug":"open-captchaworld-a-comprehensive-web-based","title":"Open CaptchaWorld: A Comprehensive Web-based Platform for Testing and Benchmarking Multimodal LLM Agents","date":"2025-05-30","arxiv_id":"2505.24878","repositories_listed":1,"syntology":null},{"url":"/paper/progent-programmable-privilege-control-for","slug":"progent-programmable-privilege-control-for","title":"Progent: Programmable Privilege Control for LLM Agents","date":"2025-04-16","arxiv_id":"2504.11703","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-meets-teleconnections-improving","slug":"deep-learning-meets-teleconnections-improving","title":"Deep Learning Meets Teleconnections: Improving S2S Predictions for European Winter Weather","date":"2025-04-10","arxiv_id":"2504.07625","repositories_listed":1,"syntology":null},{"url":"/paper/corba-contagious-recursive-blocking-attacks","slug":"corba-contagious-recursive-blocking-attacks","title":"CORBA: Contagious Recursive Blocking Attacks on Multi-Agent Systems Based on Large Language Models","date":"2025-02-20","arxiv_id":"2502.14529","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-for-dynamic-resource-1","slug":"reinforcement-learning-for-dynamic-resource-1","title":"Reinforcement Learning for Dynamic Resource Allocation in Optical Networks: Hype or Hope?","date":"2025-02-18","arxiv_id":"2502.12804","repositories_listed":1,"syntology":null},{"url":"/paper/linking-cryptoasset-attribution-tags-to","slug":"linking-cryptoasset-attribution-tags-to","title":"Linking Cryptoasset Attribution Tags to Knowledge Graph Entities: An LLM-based Approach","date":"2025-02-12","arxiv_id":"2502.10453","repositories_listed":1,"syntology":null},{"url":"/paper/diffim-differentiable-influence-minimization","slug":"diffim-differentiable-influence-minimization","title":"DiffIM: Differentiable Influence Minimization with Surrogate Modeling and Continuous Relaxation","date":"2025-02-03","arxiv_id":"2502.01031","repositories_listed":1,"syntology":null},{"url":"/paper/foundation-for-unbiased-cross-validation-of","slug":"foundation-for-unbiased-cross-validation-of","title":"Foundation for unbiased cross-validation of spatio-temporal models for species distribution modeling","date":"2025-01-27","arxiv_id":"2502.03480","repositories_listed":1,"syntology":null},{"url":"/paper/gandalf-the-red-adaptive-security-for-llms","slug":"gandalf-the-red-adaptive-security-for-llms","title":"Gandalf the Red: Adaptive Security for LLMs","date":"2025-01-14","arxiv_id":"2501.07927","repositories_listed":1,"syntology":null},{"url":"/paper/fully-stochastic-primal-dual-gradient","slug":"fully-stochastic-primal-dual-gradient","title":"A Stochastic Approximation Approach for Efficient Decentralized Optimization on Random Networks","date":"2024-10-24","arxiv_id":"2410.18774","repositories_listed":1,"syntology":null},{"url":"/paper/on-calibration-of-llm-based-guard-models-for","slug":"on-calibration-of-llm-based-guard-models-for","title":"On Calibration of LLM-based Guard Models for Reliable Content Moderation","date":"2024-10-14","arxiv_id":"2410.10414","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-calibration-of-llm-based-guard-models-for#ran","syntology_url":"https://syntology.ai/paper/2410.10414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10414"}},"official":{"repos":["waffle-liu/calibration_guard_model"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-granularity-contrastive-cross-modal","slug":"multi-granularity-contrastive-cross-modal","title":"Multi-granularity Contrastive Cross-modal Collaborative Generation for End-to-End Long-term Video Question Answering","date":"2024-10-12","arxiv_id":"2410.09379","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-blocking-biases-in-entity-matching","slug":"evaluating-blocking-biases-in-entity-matching","title":"Evaluating Blocking Biases in Entity Matching","date":"2024-09-24","arxiv_id":"2409.16410","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-videos-become-outdated-short-video","slug":"not-all-videos-become-outdated-short-video","title":"Not All Videos Become Outdated: Short-Video Recommendation by Learning to Deconfound Release Interval Bias","date":"2024-08-30","arxiv_id":"2408.17332","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-llm-scheduling-by-learning-to-rank","slug":"efficient-llm-scheduling-by-learning-to-rank","title":"Efficient LLM Scheduling by Learning to Rank","date":"2024-08-28","arxiv_id":"2408.15792","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/efficient-llm-scheduling-by-learning-to-rank#ran","syntology_url":"https://syntology.ai/paper/2408.15792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15792"}},"official":{"repos":["hao-ai-lab/vllm-ltr"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/surgical-workflow-recognition-and-blocking","slug":"surgical-workflow-recognition-and-blocking","title":"Surgical Workflow Recognition and Blocking Effectiveness Detection in Laparoscopic Liver Resections with Pringle Maneuver","date":"2024-08-20","arxiv_id":"2408.10538","repositories_listed":1,"syntology":null},{"url":"/paper/bluetempnet-a-temporal-multi-network-dataset","slug":"bluetempnet-a-temporal-multi-network-dataset","title":"BlueTempNet: A Temporal Multi-network Dataset of Social Interactions in Bluesky Social","date":"2024-07-24","arxiv_id":"2407.17451","repositories_listed":1,"syntology":null},{"url":"/paper/how-useful-is-intermittent-asynchronous","slug":"how-useful-is-intermittent-asynchronous","title":"How Useful is Intermittent, Asynchronous Expert Feedback for Bayesian Optimization?","date":"2024-06-10","arxiv_id":"2406.06459","repositories_listed":1,"syntology":null},{"url":"/paper/one-queue-is-all-you-need-resolving-head-of","slug":"one-queue-is-all-you-need-resolving-head-of","title":"Queue management for slo-oriented large language model serving","date":"2024-06-05","arxiv_id":"2407.00047","repositories_listed":1,"syntology":null},{"url":"/paper/physics-informed-heterogeneous-graph-neural","slug":"physics-informed-heterogeneous-graph-neural","title":"Physics-Informed Heterogeneous Graph Neural Networks for DC Blocker Placement","date":"2024-05-16","arxiv_id":"2405.10389","repositories_listed":1,"syntology":null},{"url":"/paper/adflush-a-real-world-deployable-machine","slug":"adflush-a-real-world-deployable-machine","title":"AdFlush: A Real-World Deployable Machine Learning Solution for Effective Advertisement and Web Tracker Prevention","date":"2024-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sinbad-saliency-informed-detection-of","slug":"sinbad-saliency-informed-detection-of","title":"SINBAD: Saliency-informed detection of breakage caused by ad blocking","date":"2024-05-08","arxiv_id":"2405.05196","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-interactive-llm-serving-with-proxy","slug":"efficient-interactive-llm-serving-with-proxy","title":"Efficient Interactive LLM Serving with Proxy Model-based Sequence Length Prediction","date":"2024-04-12","arxiv_id":"2404.08509","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-interactive-llm-serving-with-proxy#ran","syntology_url":"https://syntology.ai/paper/2404.08509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08509"}},"official":{"repos":["james-qiuhaoran/llm-serving-with-proxy-models"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/using-explainable-ai-and-transfer-learning-to","slug":"using-explainable-ai-and-transfer-learning-to","title":"Using Explainable AI and Transfer Learning to understand and predict the maintenance of Atlantic blocking with limited observational data","date":"2024-04-12","arxiv_id":"2404.08613","repositories_listed":1,"syntology":null},{"url":"/paper/neural-video-compression-with-feature","slug":"neural-video-compression-with-feature","title":"Neural Video Compression with Feature Modulation","date":"2024-02-27","arxiv_id":"2402.17414","repositories_listed":1,"syntology":{"n":43,"n_ran":36,"n_constructed":17,"n_ran_checked":26,"n_instrument":10,"n_unverified":7,"n_honours":4,"n_violates":0,"n_no_contract":22,"n_pointer_only":0,"phrase":"36 ran (of which 17 constructed an object rather than computing a result; 26 with no instrument failure: 4 honoured, 0 violated, 22 with no contract checked; 10 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-video-compression-with-feature#ran","syntology_url":"https://syntology.ai/paper/2402.17414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17414"}},"official":{"repos":["microsoft/dcvc"],"state":"official (archive's flag): 36 ran","n_ran":36,"n_constructed":17,"n_ran_no_instrument_failure":26,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-prompt-optimizer-for-safe-text-to","slug":"universal-prompt-optimizer-for-safe-text-to","title":"Universal Prompt Optimizer for Safe Text-to-Image Generation","date":"2024-02-16","arxiv_id":"2402.10882","repositories_listed":1,"syntology":null},{"url":"/paper/human-curriculum-effects-emerge-with-in","slug":"human-curriculum-effects-emerge-with-in","title":"The dynamic interplay between in-context and in-weight learning in humans and neural networks","date":"2024-02-13","arxiv_id":"2402.08674","repositories_listed":1,"syntology":null},{"url":"/paper/masked-graph-autoencoder-with-non-discrete","slug":"masked-graph-autoencoder-with-non-discrete","title":"Masked Graph Autoencoder with Non-discrete Bandwidths","date":"2024-02-06","arxiv_id":"2402.03814","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-and-counteracting-feature-level","slug":"understanding-and-counteracting-feature-level","title":"Understanding and Counteracting Feature-Level Bias in Click-Through Rate Prediction","date":"2024-02-06","arxiv_id":"2402.03600","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-multi-view-stereo-with-late-cost","slug":"boosting-multi-view-stereo-with-late-cost","title":"Boosting Multi-view Stereo with Late Cost Aggregation","date":"2024-01-22","arxiv_id":"2401.11751","repositories_listed":1,"syntology":null},{"url":"/paper/scatterformer-efficient-voxel-transformer","slug":"scatterformer-efficient-voxel-transformer","title":"ScatterFormer: Efficient Voxel Transformer with Scattered Linear Attention","date":"2024-01-01","arxiv_id":"2401.00912","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/scatterformer-efficient-voxel-transformer#ran","syntology_url":"https://syntology.ai/paper/2401.00912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00912"}},"official":{"repos":["skyhehe123/scatterformer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/autodan-automatic-and-interpretable","slug":"autodan-automatic-and-interpretable","title":"AutoDAN: Interpretable Gradient-Based Adversarial Attacks on Large Language Models","date":"2023-10-23","arxiv_id":"2310.15140","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/autodan-automatic-and-interpretable#ran","syntology_url":"https://syntology.ai/paper/2310.15140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15140"}},"official":null}},{"url":"/paper/a-novel-geo-localization-method-for-uav-and","slug":"a-novel-geo-localization-method-for-uav-and","title":"A Novel Geo-Localization Method for UAV and Satellite Images Using Cross-View Consistent Attention","date":"2023-09-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/island-informing-brightness-and-surface","slug":"island-informing-brightness-and-surface","title":"ISLAND: Interpolating Land Surface Temperature using land cover","date":"2023-09-21","arxiv_id":"2309.12416","repositories_listed":1,"syntology":null},{"url":"/paper/cnn-injected-transformer-for-image-exposure","slug":"cnn-injected-transformer-for-image-exposure","title":"CNN Injected Transformer for Image Exposure Correction","date":"2023-09-08","arxiv_id":"2309.04366","repositories_listed":1,"syntology":null},{"url":"/paper/linktransformer-a-unified-package-for-record","slug":"linktransformer-a-unified-package-for-record","title":"LinkTransformer: A Unified Package for Record Linkage with Transformer Language Models","date":"2023-09-02","arxiv_id":"2309.00789","repositories_listed":1,"syntology":null},{"url":"/paper/altdiffusion-a-multilingual-text-to-image","slug":"altdiffusion-a-multilingual-text-to-image","title":"AltDiffusion: A Multilingual Text-to-Image Diffusion Model","date":"2023-08-19","arxiv_id":"2308.09991","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":4,"n_no_contract":4,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 4 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/altdiffusion-a-multilingual-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2308.09991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09991"}},"official":{"repos":["superhero-7/altdiffuson"],"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":["official"]}}},{"url":"/paper/o-2-recon-completing-3d-reconstruction-of","slug":"o-2-recon-completing-3d-reconstruction-of","title":"O$^2$-Recon: Completing 3D Reconstruction of Occluded Objects in the Scene with a Pre-trained 2D Diffusion Model","date":"2023-08-18","arxiv_id":"2308.09591","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-tracking-learning-for-frame","slug":"collaborative-tracking-learning-for-frame","title":"Collaborative Tracking Learning for Frame-Rate-Insensitive Multi-Object Tracking","date":"2023-08-11","arxiv_id":"2308.05911","repositories_listed":1,"syntology":null},{"url":"/paper/graphsha-synthesizing-harder-samples-for","slug":"graphsha-synthesizing-harder-samples-for","title":"GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification","date":"2023-06-16","arxiv_id":"2306.09612","repositories_listed":1,"syntology":null},{"url":"/paper/path-specific-counterfactual-fairness-for","slug":"path-specific-counterfactual-fairness-for","title":"Path-Specific Counterfactual Fairness for Recommender Systems","date":"2023-06-05","arxiv_id":"2306.02615","repositories_listed":1,"syntology":null},{"url":"/paper/road-planning-for-slums-via-deep","slug":"road-planning-for-slums-via-deep","title":"Road Planning for Slums via Deep Reinforcement Learning","date":"2023-05-22","arxiv_id":"2305.13060","repositories_listed":1,"syntology":null},{"url":"/paper/towards-an-accurate-and-secure-detector","slug":"towards-an-accurate-and-secure-detector","title":"Spatial-Frequency Discriminability for Revealing Adversarial Perturbations","date":"2023-05-18","arxiv_id":"2305.10856","repositories_listed":1,"syntology":null},{"url":"/paper/pre-trained-embeddings-for-entity-resolution","slug":"pre-trained-embeddings-for-entity-resolution","title":"Pre-trained Embeddings for Entity Resolution: An Experimental Analysis [Experiment, Analysis & Benchmark]","date":"2023-04-24","arxiv_id":"2304.12329","repositories_listed":1,"syntology":null},{"url":"/paper/sparkly-a-simple-yet-surprisingly-strong-tf","slug":"sparkly-a-simple-yet-surprisingly-strong-tf","title":"Sparkly: A Simple yet Surprisingly Strong TF/IDF Blocker for Entity Matching","date":"2023-04-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/classification-of-social-media-toxic-comments","slug":"classification-of-social-media-toxic-comments","title":"Classification of social media Toxic comments using Machine learning models","date":"2023-04-14","arxiv_id":"2304.06934","repositories_listed":1,"syntology":null},{"url":"/paper/tracker-meets-night-a-transformer-enhancer","slug":"tracker-meets-night-a-transformer-enhancer","title":"Tracker Meets Night: A Transformer Enhancer for UAV Tracking","date":"2023-03-20","arxiv_id":"2303.10951","repositories_listed":1,"syntology":null},{"url":"/paper/sc-block-supervised-contrastive-blocking","slug":"sc-block-supervised-contrastive-blocking","title":"SC-Block: Supervised Contrastive Blocking within Entity Resolution Pipelines","date":"2023-03-06","arxiv_id":"2303.03132","repositories_listed":1,"syntology":null},{"url":"/paper/robust-one-shot-estimation-over-shared","slug":"robust-one-shot-estimation-over-shared","title":"Robust one-shot estimation over shared networks in the presence of denial-of-service attacks","date":"2023-02-28","arxiv_id":"2302.14689","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-rule-based-dns-censorship","slug":"augmenting-rule-based-dns-censorship","title":"Augmenting Rule-based DNS Censorship Detection at Scale with Machine Learning","date":"2023-02-03","arxiv_id":"2302.02031","repositories_listed":1,"syntology":null},{"url":"/paper/pragmatic-fairness-developing-policies-with","slug":"pragmatic-fairness-developing-policies-with","title":"Pragmatic Fairness: Developing Policies with Outcome Disparity Control","date":"2023-01-28","arxiv_id":"2301.12278","repositories_listed":1,"syntology":null},{"url":"/paper/wavelet-diffusion-models-are-fast-and","slug":"wavelet-diffusion-models-are-fast-and","title":"Wavelet Diffusion Models are fast and scalable Image Generators","date":"2022-11-29","arxiv_id":"2211.16152","repositories_listed":1,"syntology":null},{"url":"/paper/self-destructing-models-increasing-the-costs","slug":"self-destructing-models-increasing-the-costs","title":"Self-Destructing Models: Increasing the Costs of Harmful Dual Uses of Foundation Models","date":"2022-11-27","arxiv_id":"2211.14946","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-destructing-models-increasing-the-costs#ran","syntology_url":"https://syntology.ai/paper/2211.14946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14946"}},"official":{"repos":["breakend/selfdestructingmodels"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sah-shifting-aware-asymmetric-hashing-for","slug":"sah-shifting-aware-asymmetric-hashing-for","title":"SAH: Shifting-aware Asymmetric Hashing for Reverse $k$-Maximum Inner Product Search","date":"2022-11-23","arxiv_id":"2211.12751","repositories_listed":1,"syntology":null},{"url":"/paper/abinet-autonomous-bidirectional-and-iterative","slug":"abinet-autonomous-bidirectional-and-iterative","title":"ABINet++: Autonomous, Bidirectional and Iterative Language Modeling for Scene Text Spotting","date":"2022-11-19","arxiv_id":"2211.10578","repositories_listed":1,"syntology":null},{"url":"/paper/mdflow-unsupervised-optical-flow-learning-by","slug":"mdflow-unsupervised-optical-flow-learning-by","title":"MDFlow: Unsupervised Optical Flow Learning by Reliable Mutual Knowledge Distillation","date":"2022-11-11","arxiv_id":"2211.06018","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mdflow-unsupervised-optical-flow-learning-by#ran","syntology_url":"https://syntology.ai/paper/2211.06018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06018"}},"official":{"repos":["ltkong218/mdflow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/scaling-directed-controller-synthesis-via","slug":"scaling-directed-controller-synthesis-via","title":"Exploration Policies for On-the-Fly Controller Synthesis: A Reinforcement Learning Approach","date":"2022-10-07","arxiv_id":"2210.05393","repositories_listed":1,"syntology":null},{"url":"/paper/multi-scale-attention-network-for-image-super","slug":"multi-scale-attention-network-for-image-super","title":"Multi-scale Attention Network for Single Image Super-Resolution","date":"2022-09-28","arxiv_id":"2209.14145","repositories_listed":1,"syntology":null},{"url":"/paper/s-2-transformer-for-mask-aware-hyperspectral","slug":"s-2-transformer-for-mask-aware-hyperspectral","title":"S^2-Transformer for Mask-Aware Hyperspectral Image Reconstruction","date":"2022-09-24","arxiv_id":"2209.12075","repositories_listed":1,"syntology":null},{"url":"/paper/content-aware-scalable-deep-compressed","slug":"content-aware-scalable-deep-compressed","title":"Content-aware Scalable Deep Compressed Sensing","date":"2022-07-19","arxiv_id":"2207.09313","repositories_listed":1,"syntology":null},{"url":"/paper/sudowoodo-contrastive-self-supervised","slug":"sudowoodo-contrastive-self-supervised","title":"Sudowoodo: Contrastive Self-supervised Learning for Multi-purpose Data Integration and Preparation","date":"2022-07-08","arxiv_id":"2207.04122","repositories_listed":1,"syntology":null},{"url":"/paper/neuralpassthrough-learned-real-time-view","slug":"neuralpassthrough-learned-real-time-view","title":"NeuralPassthrough: Learned Real-Time View Synthesis for VR","date":"2022-07-05","arxiv_id":"2207.02186","repositories_listed":1,"syntology":null},{"url":"/paper/backdoor-attacks-on-vision-transformers","slug":"backdoor-attacks-on-vision-transformers","title":"Backdoor Attacks on Vision Transformers","date":"2022-06-16","arxiv_id":"2206.08477","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/backdoor-attacks-on-vision-transformers#ran","syntology_url":"https://syntology.ai/paper/2206.08477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08477"}},"official":{"repos":["ucdvision/backdoor_transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/user-controllable-recommendation-against","slug":"user-controllable-recommendation-against","title":"User-controllable Recommendation Against Filter Bubbles","date":"2022-04-29","arxiv_id":"2204.13844","repositories_listed":1,"syntology":null},{"url":"/paper/s-dabt-schedule-and-dependency-aware-bug","slug":"s-dabt-schedule-and-dependency-aware-bug","title":"S-DABT: Schedule and Dependency-Aware Bug Triage in Open-Source Bug Tracking Systems","date":"2022-04-12","arxiv_id":"2204.05972","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-the-wild-decentralizing-hogwild-style","slug":"scaling-the-wild-decentralizing-hogwild-style","title":"Scaling the Wild: Decentralizing Hogwild!-style Shared-memory SGD","date":"2022-03-13","arxiv_id":"2203.06638","repositories_listed":1,"syntology":null},{"url":"/paper/autofr-automated-filter-rule-generation-for","slug":"autofr-automated-filter-rule-generation-for","title":"AutoFR: Automated Filter Rule Generation for Adblocking","date":"2022-02-25","arxiv_id":"2202.12872","repositories_listed":1,"syntology":null},{"url":"/paper/a-knowledge-graph-embeddings-based-approach","slug":"a-knowledge-graph-embeddings-based-approach","title":"A Knowledge Graph Embeddings based Approach for Author Name Disambiguation using Literals","date":"2022-01-24","arxiv_id":"2201.09555","repositories_listed":1,"syntology":null},{"url":"/paper/styleswin-transformer-based-gan-for-high-1","slug":"styleswin-transformer-based-gan-for-high-1","title":"StyleSwin: Transformer-based GAN for High-resolution Image Generation","date":"2021-12-20","arxiv_id":"2112.10762","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"5 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/styleswin-transformer-based-gan-for-high-1#ran","syntology_url":"https://syntology.ai/paper/2112.10762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10762"}},"official":{"repos":["microsoft/StyleSwin"],"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":["official","unlocated"]}}},{"url":"/paper/recursive-self-improvement-for-camera-image","slug":"recursive-self-improvement-for-camera-image","title":"Reinforcement Learning of Self Enhancing Camera Image and Signal Processing","date":"2021-11-15","arxiv_id":"2111.07499","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-tensor-completion-via-element-wise","slug":"efficient-tensor-completion-via-element-wise","title":"Effective Tensor Completion via Element-wise Weighted Low-rank Tensor Train with Overlapping Ket Augmentation","date":"2021-09-13","arxiv_id":"2109.05736","repositories_listed":1,"syntology":null},{"url":"/paper/from-general-to-specific-informative-scene","slug":"from-general-to-specific-informative-scene","title":"From General to Specific: Informative Scene Graph Generation via Balance Adjustment","date":"2021-08-30","arxiv_id":"2108.13129","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/from-general-to-specific-informative-scene#ran","syntology_url":"https://syntology.ai/paper/2108.13129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13129"}},"official":{"repos":["zhugekongkong/sgg-g2s"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/relation-aware-compositional-zero-shot","slug":"relation-aware-compositional-zero-shot","title":"Relation-aware Compositional Zero-shot Learning for Attribute-Object Pair Recognition","date":"2021-08-10","arxiv_id":"2108.04603","repositories_listed":1,"syntology":null},{"url":"/paper/coast-controllable-arbitrary-sampling-network","slug":"coast-controllable-arbitrary-sampling-network","title":"COAST: COntrollable Arbitrary-Sampling NeTwork for Compressive Sensing","date":"2021-07-15","arxiv_id":"2107.07225","repositories_listed":1,"syntology":null},{"url":"/paper/ml-cb-machine-learning-canvas-block","slug":"ml-cb-machine-learning-canvas-block","title":"ML-CB: Machine Learning Canvas Block","date":"2021-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-blocking-in-entity-matching","slug":"deep-learning-for-blocking-in-entity-matching","title":"Deep learning for blocking in entity matching: a design space exploration","date":"2021-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generate-prune-select-a-pipeline-for","slug":"generate-prune-select-a-pipeline-for","title":"Generate, Prune, Select: A Pipeline for Counterspeech Generation against Online Hate Speech","date":"2021-06-03","arxiv_id":"2106.01625","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generate-prune-select-a-pipeline-for#ran","syntology_url":"https://syntology.ai/paper/2106.01625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01625"}},"official":{"repos":["WanzhengZhu/GPS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-rule-mining-based-advanced-persistent","slug":"a-rule-mining-based-advanced-persistent","title":"A Rule Mining-Based Advanced Persistent Threats Detection System","date":"2021-05-20","arxiv_id":"2105.10053","repositories_listed":1,"syntology":null},{"url":"/paper/intriguing-usage-of-applicability-domain","slug":"intriguing-usage-of-applicability-domain","title":"BAARD: Blocking Adversarial Examples by Testing for Applicability, Reliability and Decidability","date":"2021-05-02","arxiv_id":"2105.00495","repositories_listed":1,"syntology":null},{"url":"/paper/dabt-a-dependency-aware-bug-triaging-method","slug":"dabt-a-dependency-aware-bug-triaging-method","title":"DABT: A Dependency-aware Bug Triaging Method","date":"2021-04-26","arxiv_id":"2104.12744","repositories_listed":1,"syntology":null},{"url":"/paper/deep-indexed-active-learning-for-matching","slug":"deep-indexed-active-learning-for-matching","title":"Deep Indexed Active Learning for Matching Heterogeneous Entity Representations","date":"2021-04-08","arxiv_id":"2104.03986","repositories_listed":1,"syntology":null},{"url":"/paper/ista-net-flexible-deep-unfolding-network-for","slug":"ista-net-flexible-deep-unfolding-network-for","title":"ISTA-Net++: Flexible Deep Unfolding Network for Compressive Sensing","date":"2021-03-22","arxiv_id":"2103.11554","repositories_listed":1,"syntology":null},{"url":"/paper/time-ordered-recent-event-tore-volumes-for","slug":"time-ordered-recent-event-tore-volumes-for","title":"Time-Ordered Recent Event (TORE) Volumes for Event Cameras","date":"2021-03-10","arxiv_id":"2103.06108","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-mpi-based-communication-for-gpu","slug":"efficient-mpi-based-communication-for-gpu","title":"Efficient MPI-based Communication for GPU-Accelerated Dask Applications","date":"2021-01-21","arxiv_id":"2101.08878","repositories_listed":1,"syntology":null},{"url":"/paper/wearmask-fast-in-browser-face-mask-detection","slug":"wearmask-fast-in-browser-face-mask-detection","title":"WearMask: Fast In-browser Face Mask Detection with Serverless Edge Computing for COVID-19","date":"2021-01-04","arxiv_id":"2101.00784","repositories_listed":1,"syntology":null},{"url":"/paper/system-identification-with-biophysical","slug":"system-identification-with-biophysical","title":"System Identification with Biophysical Constraints: A Circuit Model of the Inner Retina","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":19,"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":21,"papers_where_code_ran_first_page":"/task/blocking/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":6,"url":"/task/blocking/papers/2","json":"/task/blocking/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/task/blocking/papers/3","json":"/task/blocking/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/task/blocking/papers/4","json":"/task/blocking/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/task/blocking/papers/5","json":"/task/blocking/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/task/blocking/papers/6","json":"/task/blocking/papers/6.json","rows":24},{"order":"ran","page":1,"of":1,"url":"/task/blocking/papers/ran/1","json":"/task/blocking/papers/ran/1.json","rows":21}],"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":"d1c188f0f17e54c78e8e7e67f4afad75b1ee67fbef7f40a4dd5ef4dec4cb19f5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}