{"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/sociology/papers/ran/1","list_of":"/task/sociology","task":"Sociology","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,6],"of":6,"counts":{"archive_papers_tagged":167,"with_a_code_link":35,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":167,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":4,"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"},"first_page":"/task/sociology/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/yulan-onesim-towards-the-next-generation-of","slug":"yulan-onesim-towards-the-next-generation-of","title":"YuLan-OneSim: Towards the Next Generation of Social Simulator with Large Language Models","date":"2025-05-12","arxiv_id":"2505.07581","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/yulan-onesim-towards-the-next-generation-of#ran","syntology_url":"https://syntology.ai/paper/2505.07581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.07581"}},"official":{"repos":["RUC-GSAI/YuLan-OneSim"],"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/discoverybench-towards-data-driven-discovery","slug":"discoverybench-towards-data-driven-discovery","title":"DiscoveryBench: Towards Data-Driven Discovery with Large Language Models","date":"2024-07-01","arxiv_id":"2407.01725","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"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) · 3 unverified","sample_list":"/paper/discoverybench-towards-data-driven-discovery#ran","syntology_url":"https://syntology.ai/paper/2407.01725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01725"}},"official":{"repos":["allenai/discoverybench"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/survey-of-computerized-adaptive-testing-a","slug":"survey-of-computerized-adaptive-testing-a","title":"Survey of Computerized Adaptive Testing: A Machine Learning Perspective","date":"2024-03-31","arxiv_id":"2404.00712","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/survey-of-computerized-adaptive-testing-a#ran","syntology_url":"https://syntology.ai/paper/2404.00712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00712"}},"official":{"repos":["bigdata-ustc/educat"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-variable-model-for-high-dimensional","slug":"latent-variable-model-for-high-dimensional","title":"Latent variable model for high-dimensional point process with structured missingness","date":"2024-02-08","arxiv_id":"2402.05758","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/latent-variable-model-for-high-dimensional#ran","syntology_url":"https://syntology.ai/paper/2402.05758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05758"}},"official":{"repos":["sinelnikovmaxim/mpp-vae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/adversarial-balancing-based-representation","slug":"adversarial-balancing-based-representation","title":"Adversarial Balancing-based Representation Learning for Causal Effect Inference with Observational Data","date":"2019-04-30","arxiv_id":"1904.13335","repositories_listed":2,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":2,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/adversarial-balancing-based-representation#ran","syntology_url":"https://syntology.ai/paper/1904.13335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.13335"}},"official":{"repos":["octeufer/Adversarial-Balancing-based-representation-learning-for-Causal-Effect-Inference"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-recurrent-graph-neural-network-for-multi","slug":"a-recurrent-graph-neural-network-for-multi","title":"A Recurrent Graph Neural Network for Multi-Relational Data","date":"2018-11-05","arxiv_id":"1811.02061","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"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) · 5 unverified","sample_list":"/paper/a-recurrent-graph-neural-network-for-multi#ran","syntology_url":"https://syntology.ai/paper/1811.02061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02061"}},"official":null}}],"record_sha256":"f7f542d5dedb6859623a03fdba689236ff048731f88d9184ee34b4dc95335deb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}