{"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/transductive-learning/papers/ran/1","list_of":"/task/transductive-learning","task":"Transductive Learning","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,15],"of":15,"counts":{"archive_papers_tagged":135,"with_a_code_link":41,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":135,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":14,"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/transductive-learning/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/towards-quantifying-long-range-interactions","slug":"towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","date":"2025-03-12","arxiv_id":"2503.09008","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-quantifying-long-range-interactions#ran","syntology_url":"https://syntology.ai/paper/2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"}},"official":{"repos":["leonresearch/city-networks"],"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/single-view-graph-contrastive-learning-with","slug":"single-view-graph-contrastive-learning-with","title":"Single-View Graph Contrastive Learning with Soft Neighborhood Awareness","date":"2024-12-12","arxiv_id":"2412.09261","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/single-view-graph-contrastive-learning-with#ran","syntology_url":"https://syntology.ai/paper/2412.09261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09261"}},"official":{"repos":["sunisfighting/signa"],"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"]}}},{"url":"/paper/umfc-unsupervised-multi-domain-feature","slug":"umfc-unsupervised-multi-domain-feature","title":"UMFC: Unsupervised Multi-Domain Feature Calibration for Vision-Language Models","date":"2024-11-11","arxiv_id":"2411.06921","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/umfc-unsupervised-multi-domain-feature#ran","syntology_url":"https://syntology.ai/paper/2411.06921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06921"}},"official":{"repos":["git-ljc/umfc"],"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":["official"]}}},{"url":"/paper/graphrouter-a-graph-based-router-for-llm","slug":"graphrouter-a-graph-based-router-for-llm","title":"GraphRouter: A Graph-based Router for LLM Selections","date":"2024-10-04","arxiv_id":"2410.03834","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":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) · 0 unverified","sample_list":"/paper/graphrouter-a-graph-based-router-for-llm#ran","syntology_url":"https://syntology.ai/paper/2410.03834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03834"}},"official":{"repos":["ulab-uiuc/graphrouter"],"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/label-propagation-for-zero-shot","slug":"label-propagation-for-zero-shot","title":"Label Propagation for Zero-shot Classification with Vision-Language Models","date":"2024-04-05","arxiv_id":"2404.04072","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/label-propagation-for-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2404.04072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04072"}},"official":{"repos":["vladan-stojnic/zlap"],"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/information-based-transductive-active","slug":"information-based-transductive-active","title":"Transductive Active Learning: Theory and Applications","date":"2024-02-13","arxiv_id":"2402.15898","repositories_listed":2,"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/information-based-transductive-active#ran","syntology_url":"https://syntology.ai/paper/2402.15898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15898"}},"official":null}},{"url":"/paper/fast-online-node-labeling-for-very-large","slug":"fast-online-node-labeling-for-very-large","title":"Fast Online Node Labeling for Very Large Graphs","date":"2023-05-25","arxiv_id":"2305.16257","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/fast-online-node-labeling-for-very-large#ran","syntology_url":"https://syntology.ai/paper/2305.16257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16257"}},"official":{"repos":["baojian/FastONL"],"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/towards-evaluating-the-robustness-of-neural-2","slug":"towards-evaluating-the-robustness-of-neural-2","title":"Towards Evaluating the Robustness of Neural Networks Learned by Transduction","date":"2021-10-27","arxiv_id":"2110.14735","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/towards-evaluating-the-robustness-of-neural-2#ran","syntology_url":"https://syntology.ai/paper/2110.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14735"}},"official":{"repos":["jfc43/eval-transductive-robustness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transductive-learning-for-unsupervised-text","slug":"transductive-learning-for-unsupervised-text","title":"Transductive Learning for Unsupervised Text Style Transfer","date":"2021-09-16","arxiv_id":"2109.07812","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transductive-learning-for-unsupervised-text#ran","syntology_url":"https://syntology.ai/paper/2109.07812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07812"}},"official":{"repos":["xiaofei05/tsst"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-domain-generalizable-person","slug":"semi-supervised-domain-generalizable-person","title":"Semi-Supervised Domain Generalizable Person Re-Identification","date":"2021-08-11","arxiv_id":"2108.05045","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semi-supervised-domain-generalizable-person#ran","syntology_url":"https://syntology.ai/paper/2108.05045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05045"}},"official":{"repos":["JDAI-CV/fast-reid"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/distill-and-fine-tune-effective-adaptation","slug":"distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","arxiv_id":"2104.01539","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/distill-and-fine-tune-effective-adaptation#ran","syntology_url":"https://syntology.ai/paper/2104.01539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01539"}},"official":{"repos":["tim-learn/Dis-tune","tim-learn/dine"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/embedding-propagation-smoother-manifold-for","slug":"embedding-propagation-smoother-manifold-for","title":"Embedding Propagation: Smoother Manifold for Few-Shot Classification","date":"2020-03-09","arxiv_id":"2003.04151","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/embedding-propagation-smoother-manifold-for#ran","syntology_url":"https://syntology.ai/paper/2003.04151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04151"}},"official":{"repos":["ElementAI/embedding-propagation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/geom-gcn-geometric-graph-convolutional-1","slug":"geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","arxiv_id":"2002.05287","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/geom-gcn-geometric-graph-convolutional-1#ran","syntology_url":"https://syntology.ai/paper/2002.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05287"}},"official":{"repos":["graphdml-uiuc-jlu/geom-gcn"],"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-to-learn-by-self-critique","slug":"learning-to-learn-by-self-critique","title":"Learning to learn via Self-Critique","date":"2019-05-24","arxiv_id":"1905.10295","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/learning-to-learn-by-self-critique#ran","syntology_url":"https://syntology.ai/paper/1905.10295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10295"}},"official":null}},{"url":"/paper/label-propagation-for-deep-semi-supervised","slug":"label-propagation-for-deep-semi-supervised","title":"Label Propagation for Deep Semi-supervised Learning","date":"2019-04-09","arxiv_id":"1904.04717","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":12,"n_pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 1 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/label-propagation-for-deep-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/1904.04717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04717"}},"official":{"repos":["ahmetius/LP-DeepSSL"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"8ea305e464c67b4f8c733645a72860c9ce15975e7dbd5e1b4c810ab23e971f6d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}