{"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":"/dataset/sit","name":"SIT","full_name":"Symbol Interpretation Task","description_markdown":"This task is composed of five different subtasks that require interpreting statements referring to structures of a simple world. This world is built using emojis; a structure of the world is simply a sequence of six emojis. Crucially, in every variation, we make explicit the semantic link between the emojis and their name in a different way:\r\n\r\nPlain: \"🟥 is a red square\"\r\nAdversarial: \"🟡 is a red square\"\r\nTricky: \"🟥 is a der reauqs\"\r\nAgnostic name-side: \"🟥 is a X Y\"\r\nAgnostic emoji-side: \"🐮 is a red square\"\r\n\r\nIn each subtask, there are three sentence groups of increasing difficulty:\r\n\r\nThe first group comprises 66 examples with simple quantification sentences (e.g., “There is exactly one blue circle”).\r\nThe second group of 66 examples contain simple sentences connected with logical operators (e.g., “There are at least two yellow squares and exactly one blue circle”).\r\nFinally, the last 66 examples use sentences expressing positional relationships between pieces in the structure (e.g., “There is exactly one triangle at the right of a yellow circle”).\r\nThe subtask SIT-tricky may seem not so different from SIT agnostic name-side at first sight. However, the main difference is that the tricky subtask contains more information that an agent could exploit to solve it. In particular, in the tricky subtask, the text is the same as SIT-plain but in reverse order (e.g., “red square” -> “der erauqs”). Once an agent understands how to reverse words (GPT-3, for example, seems able to generate anagrams and reverse words), it could use the reverse function and the same knowledge learned in solving SIT-plain to solve SIT-tricky. In the name-agnostic subtask, words are entirely unrelated. We think that the SIT-tricky subtask introduces interesting variations like the ability to compose capabilities; it could be interesting to see the comparison between SIT-tricky and SIT agnostic name-side.\r\n\r\nUsually, to solve the SIT subtasks, humans implement the following strategy, which starts from the answers rather than the question: for each possible choice, check if it is consistent with the first structure and not consistent with the second structure, if this is the case, the choice is the correct one. Implementing this strategy could be challenging for a language model since it has to pay attention to each choice separately and, for each choice, test the consistency and not consistency of the structures in the question.\r\n\r\nThe position of the correct choice in each question is randomized.","description_withheld":null,"homepage":"https://github.com/google/BIG-bench/tree/main/bigbench/benchmark_tasks/symbol_interpretation","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[],"tasks":[],"languages":[],"variants":["SIT"],"data_loaders":[],"num_papers_in_archive":0,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":0,"of":0,"counts":{"papers_with_a_benchmark_row":0,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":0,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[],"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":0,"papers_with_a_run_with_no_instrument_failure":0,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"9cb512fb65138a2d8d20343ddb484d57099ac8156b19d33a69e527743036276e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}