{"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/data-compression/papers/ran/1","list_of":"/task/data-compression","task":"Data Compression","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,33],"of":33,"counts":{"archive_papers_tagged":459,"with_a_code_link":131,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":459,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":32,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":32,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"first_page":"/task/data-compression/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/2506-08306","slug":"2506-08306","title":"AstroCompress: A benchmark dataset for multi-purpose compression of astronomical data","date":"2025-06-10","arxiv_id":"2506.08306","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2506-08306#ran","syntology_url":"https://syntology.ai/paper/2506.08306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08306"}},"official":{"repos":["tuatruog/astrocompress"],"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/dd-ranking-rethinking-the-evaluation-of","slug":"dd-ranking-rethinking-the-evaluation-of","title":"DD-Ranking: Rethinking the Evaluation of Dataset Distillation","date":"2025-05-19","arxiv_id":"2505.13300","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dd-ranking-rethinking-the-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2505.13300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13300"}},"official":{"repos":["nus-hpc-ai-lab/dd-ranking"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/in-context-learning-and-occam-s-razor","slug":"in-context-learning-and-occam-s-razor","title":"In-context learning and Occam's razor","date":"2024-10-17","arxiv_id":"2410.14086","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/in-context-learning-and-occam-s-razor#ran","syntology_url":"https://syntology.ai/paper/2410.14086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14086"}},"official":{"repos":["3rdcore/prequentialcode"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/all-in-one-image-coding-for-joint-human","slug":"all-in-one-image-coding-for-joint-human","title":"All-in-One Image Coding for Joint Human-Machine Vision with Multi-Path Aggregation","date":"2024-09-29","arxiv_id":"2409.19660","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":4,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 1 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/all-in-one-image-coding-for-joint-human#ran","syntology_url":"https://syntology.ai/paper/2409.19660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19660"}},"official":{"repos":["NJUVISION/MPA"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/entropy-law-the-story-behind-data-compression","slug":"entropy-law-the-story-behind-data-compression","title":"Entropy Law: The Story Behind Data Compression and LLM Performance","date":"2024-07-09","arxiv_id":"2407.06645","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/entropy-law-the-story-behind-data-compression#ran","syntology_url":"https://syntology.ai/paper/2407.06645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06645"}},"official":{"repos":["ustc-starteam/zip"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/understanding-is-compression","slug":"understanding-is-compression","title":"Lossless data compression by large models","date":"2024-06-24","arxiv_id":"2407.07723","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/understanding-is-compression#ran","syntology_url":"https://syntology.ai/paper/2407.07723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07723"}},"official":{"repos":["mcGill-NLP/medal"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-resist-alignment","slug":"language-models-resist-alignment","title":"Language Models Resist Alignment: Evidence From Data Compression","date":"2024-06-10","arxiv_id":"2406.06144","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/language-models-resist-alignment#ran","syntology_url":"https://syntology.ai/paper/2406.06144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06144"}},"official":{"repos":["pku-alignment/llms-resist-alignment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tripod-three-complementary-inductive-biases","slug":"tripod-three-complementary-inductive-biases","title":"Tripod: Three Complementary Inductive Biases for Disentangled Representation Learning","date":"2024-04-16","arxiv_id":"2404.10282","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tripod-three-complementary-inductive-biases#ran","syntology_url":"https://syntology.ai/paper/2404.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10282"}},"official":{"repos":["kylehkhsu/tripod"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tokenization-is-more-than-compression","slug":"tokenization-is-more-than-compression","title":"Tokenization Is More Than Compression","date":"2024-02-28","arxiv_id":"2402.18376","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/tokenization-is-more-than-compression#ran","syntology_url":"https://syntology.ai/paper/2402.18376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18376"}},"official":{"repos":["kensho-technologies/pathpiece","kensho-technologies/timtc_vocabs_models"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-evaluation-via-matrix","slug":"large-language-model-evaluation-via-matrix","title":"Diff-eRank: A Novel Rank-Based Metric for Evaluating Large Language Models","date":"2024-01-30","arxiv_id":"2401.17139","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-model-evaluation-via-matrix#ran","syntology_url":"https://syntology.ai/paper/2401.17139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17139"}},"official":{"repos":["waltonfuture/Diff-eRank"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/residual-quantization-with-implicit-neural","slug":"residual-quantization-with-implicit-neural","title":"Residual Quantization with Implicit Neural Codebooks","date":"2024-01-26","arxiv_id":"2401.14732","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":13,"phrase":"10 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; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/residual-quantization-with-implicit-neural#ran","syntology_url":"https://syntology.ai/paper/2401.14732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14732"}},"official":{"repos":["facebookresearch/qinco"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/compact-3d-scene-representation-via-self","slug":"compact-3d-scene-representation-via-self","title":"Compact 3D Scene Representation via Self-Organizing Gaussian Grids","date":"2023-12-19","arxiv_id":"2312.13299","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compact-3d-scene-representation-via-self#ran","syntology_url":"https://syntology.ai/paper/2312.13299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13299"}},"official":{"repos":["fraunhoferhhi/Self-Organizing-Gaussians"],"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/white-box-transformers-via-sparse-rate-1","slug":"white-box-transformers-via-sparse-rate-1","title":"White-Box Transformers via Sparse Rate Reduction: Compression Is All There Is?","date":"2023-11-22","arxiv_id":"2311.13110","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/white-box-transformers-via-sparse-rate-1#ran","syntology_url":"https://syntology.ai/paper/2311.13110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13110"}},"official":null}},{"url":"/paper/convolve-and-conquer-data-comparison-with","slug":"convolve-and-conquer-data-comparison-with","title":"Convolve and Conquer: Data Comparison with Wiener Filters","date":"2023-11-11","arxiv_id":"2311.06558","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convolve-and-conquer-data-comparison-with#ran","syntology_url":"https://syntology.ai/paper/2311.06558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06558"}},"official":{"repos":["dpelacani/AWLoss"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mirage-model-agnostic-graph-distillation-for","slug":"mirage-model-agnostic-graph-distillation-for","title":"Mirage: Model-Agnostic Graph Distillation for Graph Classification","date":"2023-10-14","arxiv_id":"2310.09486","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mirage-model-agnostic-graph-distillation-for#ran","syntology_url":"https://syntology.ai/paper/2310.09486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09486"}},"official":{"repos":["idea-iitd/mirage"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/recombiner-robust-and-enhanced-compression","slug":"recombiner-robust-and-enhanced-compression","title":"RECOMBINER: Robust and Enhanced Compression with Bayesian Implicit Neural Representations","date":"2023-09-29","arxiv_id":"2309.17182","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recombiner-robust-and-enhanced-compression#ran","syntology_url":"https://syntology.ai/paper/2309.17182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17182"}},"official":{"repos":["cambridge-mlg/recombiner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-flow-networks","slug":"bayesian-flow-networks","title":"Bayesian Flow Networks","date":"2023-08-14","arxiv_id":"2308.07037","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":9,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bayesian-flow-networks#ran","syntology_url":"https://syntology.ai/paper/2308.07037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07037"}},"official":{"repos":["nnaisense/bayesian-flow-networks"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dnabert-2-efficient-foundation-model-and","slug":"dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","arxiv_id":"2306.15006","repositories_listed":6,"syntology":{"n":23,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/dnabert-2-efficient-foundation-model-and#ran","syntology_url":"https://syntology.ai/paper/2306.15006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15006"}},"official":{"repos":["magics-lab/dnabert_2","zhihan1996/dnabert_2"],"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/representation-learning-via-manifold","slug":"representation-learning-via-manifold","title":"Representation Learning via Manifold Flattening and Reconstruction","date":"2023-05-02","arxiv_id":"2305.01777","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-via-manifold#ran","syntology_url":"https://syntology.ai/paper/2305.01777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01777"}},"official":{"repos":["michael-psenka/manifold-linearization"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/trading-information-between-latents-in","slug":"trading-information-between-latents-in","title":"Trading Information between Latents in Hierarchical Variational Autoencoders","date":"2023-02-09","arxiv_id":"2302.04855","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/trading-information-between-latents-in#ran","syntology_url":"https://syntology.ai/paper/2302.04855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04855"}},"official":{"repos":["timxzz/hit"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ldmic-learning-based-distributed-multi-view","slug":"ldmic-learning-based-distributed-multi-view","title":"LDMIC: Learning-based Distributed Multi-view Image Coding","date":"2023-01-24","arxiv_id":"2301.09799","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ldmic-learning-based-distributed-multi-view#ran","syntology_url":"https://syntology.ai/paper/2301.09799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.09799"}},"official":{"repos":["xinjie-q/ldmic"],"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/dc-bench-dataset-condensation-benchmark","slug":"dc-bench-dataset-condensation-benchmark","title":"DC-BENCH: Dataset Condensation Benchmark","date":"2022-07-20","arxiv_id":"2207.09639","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 3 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dc-bench-dataset-condensation-benchmark#ran","syntology_url":"https://syntology.ai/paper/2207.09639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09639"}},"official":{"repos":["justincui03/dc_benchmark"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-estimation-of-the-rate-distortion","slug":"neural-estimation-of-the-rate-distortion","title":"Neural Estimation of the Rate-Distortion Function With Applications to Operational Source Coding","date":"2022-04-04","arxiv_id":"2204.01612","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-estimation-of-the-rate-distortion#ran","syntology_url":"https://syntology.ai/paper/2204.01612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01612"}},"official":{"repos":["leieric/nerd-rcc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-introduction-to-neural-data-compression","slug":"an-introduction-to-neural-data-compression","title":"An Introduction to Neural Data Compression","date":"2022-02-14","arxiv_id":"2202.06533","repositories_listed":3,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/an-introduction-to-neural-data-compression#ran","syntology_url":"https://syntology.ai/paper/2202.06533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06533"}},"official":null}},{"url":"/paper/memory-replay-with-data-compression-for-1","slug":"memory-replay-with-data-compression-for-1","title":"Memory Replay with Data Compression for Continual Learning","date":"2022-02-14","arxiv_id":"2202.06592","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/memory-replay-with-data-compression-for-1#ran","syntology_url":"https://syntology.ai/paper/2202.06592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06592"}},"official":{"repos":["lywang3081/MRDC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-empirical-sandwich-bounds-on-the-rate-1","slug":"towards-empirical-sandwich-bounds-on-the-rate-1","title":"Towards Empirical Sandwich Bounds on the Rate-Distortion Function","date":"2021-11-23","arxiv_id":"2111.12166","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-empirical-sandwich-bounds-on-the-rate-1#ran","syntology_url":"https://syntology.ai/paper/2111.12166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12166"}},"official":{"repos":["mandt-lab/RD-sandwich","mandt-lab/empirical-RD-sandwich"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ssmf-shifting-seasonal-matrix-factorization","slug":"ssmf-shifting-seasonal-matrix-factorization","title":"SSMF: Shifting Seasonal Matrix Factorization","date":"2021-10-25","arxiv_id":"2110.12763","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":0,"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/ssmf-shifting-seasonal-matrix-factorization#ran","syntology_url":"https://syntology.ai/paper/2110.12763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.12763"}},"official":{"repos":["kokikwbt/ssmf"],"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/supervised-compression-for-resource","slug":"supervised-compression-for-resource","title":"Supervised Compression for Resource-Constrained Edge Computing Systems","date":"2021-08-21","arxiv_id":"2108.11898","repositories_listed":2,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/supervised-compression-for-resource#ran","syntology_url":"https://syntology.ai/paper/2108.11898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11898"}},"official":{"repos":["yoshitomo-matsubara/supervised-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/redunet-a-white-box-deep-network-from-the","slug":"redunet-a-white-box-deep-network-from-the","title":"ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reduction","date":"2021-05-21","arxiv_id":"2105.10446","repositories_listed":2,"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":2,"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/redunet-a-white-box-deep-network-from-the#ran","syntology_url":"https://syntology.ai/paper/2105.10446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10446"}},"official":{"repos":["Ma-Lab-Berkeley/MCR2","Ma-Lab-Berkeley/ReduNet"],"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/boosting-co-teaching-with-compression","slug":"boosting-co-teaching-with-compression","title":"Boosting Co-teaching with Compression Regularization for Label Noise","date":"2021-04-28","arxiv_id":"2104.13766","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"13 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/boosting-co-teaching-with-compression#ran","syntology_url":"https://syntology.ai/paper/2104.13766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.13766"}},"official":null}},{"url":"/paper/self-supervised-variational-auto-encoders-1","slug":"self-supervised-variational-auto-encoders-1","title":"Self-Supervised Variational Auto-Encoders","date":"2020-10-05","arxiv_id":"2010.02014","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-variational-auto-encoders-1#ran","syntology_url":"https://syntology.ai/paper/2010.02014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02014"}},"official":{"repos":["ioangatop/srVAE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepzip-lossless-data-compression-using","slug":"deepzip-lossless-data-compression-using","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","date":"2018-11-20","arxiv_id":"1811.08162","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/deepzip-lossless-data-compression-using#ran","syntology_url":"https://syntology.ai/paper/1811.08162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.08162"}},"official":{"repos":["mohit1997/DeepZip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"f488a5bbdce7e6221baaae63214bdf95431f372b27441d8320bbd1e1fa6e517d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}