{"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/multi-source-unsupervised-domain-adaptation","name":"Multi-Source Unsupervised Domain Adaptation","slug":"multi-source-unsupervised-domain-adaptation","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":46,"papers_with_code":26,"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":6,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/office-home","name":"Office-Home","full_name":"","num_papers_in_archive":1074},{"url":"/dataset/domainnet","name":"DomainNet","full_name":"DomainNet","num_papers_in_archive":753},{"url":"/dataset/office-31","name":"Office-31","full_name":"Office Dataset","num_papers_in_archive":643},{"url":"/dataset/imageclef-da","name":"ImageCLEF-DA","full_name":"ImageCLEF-DA","num_papers_in_archive":96},{"url":"/dataset/gtzan","name":"GTZAN","full_name":"","num_papers_in_archive":15},{"url":"/dataset/tennessee-eastman-process","name":"Tennessee Eastman Process","full_name":"","num_papers_in_archive":7}],"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":1,"rows_per_page":100,"shown":46,"of":46,"of_with_code":26,"tagged_in_all":46,"counts":{"archive_papers_tagged":46,"with_a_code_link":26,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":46,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/maximum-classifier-discrepancy-for","slug":"maximum-classifier-discrepancy-for","title":"Maximum Classifier Discrepancy for Unsupervised Domain Adaptation","date":"2017-12-07","arxiv_id":"1712.02560","repositories_listed":9,"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/maximum-classifier-discrepancy-for#ran","syntology_url":"https://syntology.ai/paper/1712.02560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02560"}},"official":{"repos":["mil-tokyo/MCD_DA"],"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/learning-transferable-features-with-deep","slug":"learning-transferable-features-with-deep","title":"Learning Transferable Features with Deep Adaptation Networks","date":"2015-02-10","arxiv_id":"1502.02791","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-transferable-features-with-deep#ran","syntology_url":"https://syntology.ai/paper/1502.02791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.02791"}},"official":null}},{"url":"/paper/moment-matching-for-multi-source-domain","slug":"moment-matching-for-multi-source-domain","title":"Moment Matching for Multi-Source Domain Adaptation","date":"2018-12-04","arxiv_id":"1812.01754","repositories_listed":3,"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/moment-matching-for-multi-source-domain#ran","syntology_url":"https://syntology.ai/paper/1812.01754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01754"}},"official":null}},{"url":"/paper/multi-source-domain-adaptation-through","slug":"multi-source-domain-adaptation-through","title":"Multi-Source Domain Adaptation through Dataset Dictionary Learning in Wasserstein Space","date":"2023-07-27","arxiv_id":"2307.14953","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-domain-adaptation-through-prompt","slug":"enhancing-domain-adaptation-through-prompt","title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","date":"2024-06-13","arxiv_id":"2406.09353","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":5,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-domain-adaptation-through-prompt#ran","syntology_url":"https://syntology.ai/paper/2406.09353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09353"}},"official":{"repos":["viethoang1512/pga"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-weight-aware-based-multi-source","slug":"a-weight-aware-based-multi-source","title":"A Weight-aware-based Multi-source Unsupervised Domain Adaptation Method for Human Motion Intention Recognition","date":"2024-04-19","arxiv_id":"2404.15366","repositories_listed":1,"syntology":null},{"url":"/paper/multi-source-domain-adaptation-for-object-1","slug":"multi-source-domain-adaptation-for-object-1","title":"Multi-Source Domain Adaptation for Object Detection with Prototype-based Mean-teacher","date":"2023-09-26","arxiv_id":"2309.14950","repositories_listed":1,"syntology":null},{"url":"/paper/distributionally-robust-machine-learning-with","slug":"distributionally-robust-machine-learning-with","title":"Distributionally Robust Learning for Multi-source Unsupervised Domain Adaptation","date":"2023-09-05","arxiv_id":"2309.02211","repositories_listed":1,"syntology":null},{"url":"/paper/multi-source-domain-adaptation-for-cross","slug":"multi-source-domain-adaptation-for-cross","title":"Benchmarking Domain Adaptation for Chemical Processes on the Tennessee Eastman Process","date":"2023-08-22","arxiv_id":"2308.11247","repositories_listed":1,"syntology":null},{"url":"/paper/ms3d-ensemble-of-experts-for-multi-source","slug":"ms3d-ensemble-of-experts-for-multi-source","title":"MS3D++: Ensemble of Experts for Multi-Source Unsupervised Domain Adaption in 3D Object Detection","date":"2023-08-11","arxiv_id":"2308.05988","repositories_listed":1,"syntology":null},{"url":"/paper/fact-federated-adversarial-cross-training","slug":"fact-federated-adversarial-cross-training","title":"FACT: Federated Adversarial Cross Training","date":"2023-06-01","arxiv_id":"2306.00607","repositories_listed":1,"syntology":null},{"url":"/paper/multi-prompt-alignment-for-multi-source","slug":"multi-prompt-alignment-for-multi-source","title":"Multi-Prompt Alignment for Multi-Source Unsupervised Domain Adaptation","date":"2022-09-30","arxiv_id":"2209.15210","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/multi-prompt-alignment-for-multi-source#ran","syntology_url":"https://syntology.ai/paper/2209.15210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15210"}},"official":{"repos":["haoranchen/multi-prompt-alignment-for-msuda"],"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/aligning-domain-specific-distribution-and","slug":"aligning-domain-specific-distribution-and","title":"Aligning Domain-specific Distribution and Classifier for Cross-domain Classification from Multiple Sources","date":"2022-01-04","arxiv_id":"2201.01003","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/aligning-domain-specific-distribution-and#ran","syntology_url":"https://syntology.ai/paper/2201.01003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.01003"}},"official":{"repos":["easezyc/deep-transfer-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/seeking-similarities-over-differences","slug":"seeking-similarities-over-differences","title":"Seeking Similarities over Differences: Similarity-based Domain Alignment for Adaptive Object Detection","date":"2021-10-04","arxiv_id":"2110.01428","repositories_listed":1,"syntology":null},{"url":"/paper/improving-transferability-of-domain","slug":"improving-transferability-of-domain","title":"Improving Transferability of Domain Adaptation Networks Through Domain Alignment Layers","date":"2021-09-06","arxiv_id":"2109.02693","repositories_listed":1,"syntology":null},{"url":"/paper/secure-domain-adaptation-with-multiple","slug":"secure-domain-adaptation-with-multiple","title":"Secure Domain Adaptation with Multiple Sources","date":"2021-06-23","arxiv_id":"2106.12124","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-barycenter-for-multi-source","slug":"wasserstein-barycenter-for-multi-source","title":"Wasserstein Barycenter for Multi-Source Domain Adaptation","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/most-multi-source-domain-adaptation-via","slug":"most-multi-source-domain-adaptation-via","title":"MOST: Multi-Source Domain Adaptation via Optimal Transport for Student-Teacher Learning","date":"2021-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stem-an-approach-to-multi-source-domain","slug":"stem-an-approach-to-multi-source-domain","title":"STEM: An Approach to Multi-Source Domain Adaptation With Guarantees","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kd3a-unsupervised-multi-source-decentralized","slug":"kd3a-unsupervised-multi-source-decentralized","title":"KD3A: Unsupervised Multi-Source Decentralized Domain Adaptation via Knowledge Distillation","date":"2020-11-19","arxiv_id":"2011.09757","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-combine-knowledge-aggregation-for","slug":"learning-to-combine-knowledge-aggregation-for","title":"Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptation","date":"2020-07-17","arxiv_id":"2007.08801","repositories_listed":1,"syntology":null},{"url":"/paper/multi-source-attention-for-unsupervised","slug":"multi-source-attention-for-unsupervised","title":"Multi-source Attention for Unsupervised Domain Adaptation","date":"2020-04-14","arxiv_id":"2004.06608","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adaptive-ensemble-learning","slug":"domain-adaptive-ensemble-learning","title":"Domain Adaptive Ensemble Learning","date":"2020-03-16","arxiv_id":"2003.07325","repositories_listed":1,"syntology":null},{"url":"/paper/multi-source-distilling-domain-adaptation","slug":"multi-source-distilling-domain-adaptation","title":"Multi-source Distilling Domain Adaptation","date":"2019-11-22","arxiv_id":"1911.11554","repositories_listed":1,"syntology":null},{"url":"/paper/deep-cocktail-network-multi-source","slug":"deep-cocktail-network-multi-source","title":"Deep Cocktail Network: Multi-source Unsupervised Domain Adaptation with Category Shift","date":"2018-03-02","arxiv_id":"1803.00830","repositories_listed":1,"syntology":null},{"url":"/paper/deep-transfer-learning-with-joint-adaptation","slug":"deep-transfer-learning-with-joint-adaptation","title":"Deep Transfer Learning with Joint Adaptation Networks","date":"2016-05-21","arxiv_id":"1605.06636","repositories_listed":1,"syntology":null},{"url":null,"slug":"robust-indoor-localization-in-dynamic","title":"Robust Indoor Localization in Dynamic Environments: A Multi-source Unsupervised Domain Adaptation Framework","date":"2025-02-11","arxiv_id":"2502.07246","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-unsupervised-domain-adaptation-2","title":"Multi-Source Unsupervised Domain Adaptation with Prototype Aggregation","date":"2024-12-20","arxiv_id":"2412.16255","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradual-fine-tuning-with-graph-routing-for","title":"Gradual Fine-Tuning with Graph Routing for Multi-Source Unsupervised Domain Adaptation","date":"2024-11-11","arxiv_id":"2411.07185","repositories_listed":0,"syntology":null},{"url":null,"slug":"btmuda-a-bi-level-multi-source-unsupervised","title":"BTMuda: A Bi-level Multi-source unsupervised domain adaptation framework for breast cancer diagnosis","date":"2024-08-30","arxiv_id":"2408.17054","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-unsupervised-domain-adaptation-1","title":"Multi-source Unsupervised Domain Adaptation on Graphs with Transferability Modeling","date":"2024-06-14","arxiv_id":"2406.10425","repositories_listed":0,"syntology":null},{"url":null,"slug":"aed-pada-improving-generalizability-of","title":"AED-PADA:Improving Generalizability of Adversarial Example Detection via Principal Adversarial Domain Adaptation","date":"2024-04-19","arxiv_id":"2404.12635","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-domain-discrepancy-adjustment-for","title":"Dynamic Domain Discrepancy Adjustment for Active Multi-Domain Adaptation","date":"2023-07-26","arxiv_id":"2307.14068","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-attention-driven-domain-fusion-and","title":"Joint Attention-Driven Domain Fusion and Noise-Tolerant Learning for Multi-Source Domain Adaptation","date":"2022-08-05","arxiv_id":"2208.02947","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-unsupervised-domain-adaptation","title":"Multi-Source Unsupervised Domain Adaptation via Pseudo Target Domain","date":"2022-02-22","arxiv_id":"2202.10725","repositories_listed":0,"syntology":null},{"url":null,"slug":"dasegan-domain-adaptation-for-segmentation","title":"DaSeGAN: Domain Adaptation for Segmentation Tasks via Generative Adversarial Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-domain-adaptation-via-supervised","title":"Multi-Source domain adaptation via supervised contrastive learning and confident consistency regularization","date":"2021-06-30","arxiv_id":"2106.16093","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-consistency-regularization-for","title":"Domain Consistency Regularization for Unsupervised Multi-source Domain Adaptive Classification","date":"2021-06-16","arxiv_id":"2106.08590","repositories_listed":0,"syntology":null},{"url":null,"slug":"your-classifier-can-secretly-suffice-multi-1","title":"Your Classifier can Secretly Suffice Multi-Source Domain Adaptation","date":"2021-03-20","arxiv_id":"2103.11169","repositories_listed":0,"syntology":null},{"url":"/paper/multi-source-domain-adaptation-with","slug":"multi-source-domain-adaptation-with","title":"Multi-Source Domain Adaptation with Collaborative Learning for Semantic Segmentation","date":"2021-03-08","arxiv_id":"2103.04717","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-optimization-and-aggregation","title":"Collaborative Optimization and Aggregation for Decentralized Domain Generalization and Adaptation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"curriculum-manager-for-source-selection-in","title":"Curriculum Manager for Source Selection in Multi-Source Domain Adaptation","date":"2020-07-02","arxiv_id":"2007.01261","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-training-based-multi-source","title":"Adversarial Training Based Multi-Source Unsupervised Domain Adaptation for Sentiment Analysis","date":"2020-06-10","arxiv_id":"2006.05602","repositories_listed":0,"syntology":null},{"url":null,"slug":"trigan-image-to-image-translation-for-multi","title":"TriGAN: Image-to-Image Translation for Multi-Source Domain Adaptation","date":"2020-04-19","arxiv_id":"2004.08769","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-meta-learning-for-multi-source-and","title":"Online Meta-Learning for Multi-Source and Semi-Supervised Domain Adaptation","date":"2020-04-09","arxiv_id":"2004.04398","repositories_listed":0,"syntology":null},{"url":"/paper/adversarial-multiple-source-domain-adaptation","slug":"adversarial-multiple-source-domain-adaptation","title":"Adversarial Multiple Source Domain Adaptation","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":6,"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":6,"papers_where_code_ran_first_page":"/task/multi-source-unsupervised-domain-adaptation/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":"ran","page":1,"of":1,"url":"/task/multi-source-unsupervised-domain-adaptation/papers/ran/1","json":"/task/multi-source-unsupervised-domain-adaptation/papers/ran/1.json","rows":6}],"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":"1a74d2dcd4475ec8af49770104c8e1c62cf19d1d29407da31eaae6d34672a9e6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}