{"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":"/code/multinomial-num-samples-1","entry":"multinomial_num_samples_1","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":1},"key_notes":{"n_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'","n_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2410.11190","arxiv_id_is_arxiv":true,"paper":"/paper/mini-omni2-towards-open-source-gpt-4o-model","title":"Mini-Omni2: Towards Open-source GPT-4o with Vision, Speech and Duplex Capabilities","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpt-omni/mini-omni2","path":"litgpt/generate/base.py","file_url":"https://github.com/gpt-omni/mini-omni2/blob/HEAD/litgpt/generate/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17e4446536a73126","code_sha256_prefix":"17e4446536a73126","mcp_get_code":{"code_sha256":"17e4446536a73126"}},{"arxiv_id":"2410.08102","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-collaborative-data-selection-for","title":"Multi-Agent Collaborative Data Selection for Efficient LLM Pretraining","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beccabai/multi-agent-data-selection","path":"src/lit_gpt/gen.py","file_url":"https://github.com/beccabai/multi-agent-data-selection/blob/HEAD/src/lit_gpt/gen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, beccabai/multi-agent-data-selection when it was checked","code_sha256":"bd2356fd43fa1a5e","code_sha256_prefix":"bd2356fd43fa1a5e","mcp_get_code":{"code_sha256":"bd2356fd43fa1a5e"}},{"arxiv_id":"2408.16725","arxiv_id_is_arxiv":true,"paper":"/paper/mini-omni-language-models-can-hear-talk-while","title":"Mini-Omni: Language Models Can Hear, Talk While Thinking in Streaming","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpt-omni/mini-omni","path":"litgpt/generate/base.py","file_url":"https://github.com/gpt-omni/mini-omni/blob/HEAD/litgpt/generate/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17e4446536a73126","code_sha256_prefix":"17e4446536a73126","mcp_get_code":{"code_sha256":"17e4446536a73126"}},{"arxiv_id":"2406.06046","arxiv_id_is_arxiv":true,"paper":"/paper/mates-model-aware-data-selection-for","title":"MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Models","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cxcscmu/MATES","path":"src/lit_gpt/gen.py","file_url":"https://github.com/cxcscmu/MATES/blob/HEAD/src/lit_gpt/gen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from beccabai/multi-agent-data-selection, and GitHub detected no licence in that repository when it was checked","code_sha256":"bd2356fd43fa1a5e","code_sha256_prefix":"bd2356fd43fa1a5e","mcp_get_code":{"code_sha256":"bd2356fd43fa1a5e"}},{"arxiv_id":"2402.09154","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-large-language-models-with","title":"Attacking Large Language Models with Projected Gradient Descent","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigeisler/reinforce-attacks-llms","path":"baselines/reinforce/generate_utils.py","file_url":"https://github.com/sigeisler/reinforce-attacks-llms/blob/HEAD/baselines/reinforce/generate_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d66e02fe1262afdb","code_sha256_prefix":"d66e02fe1262afdb","mcp_get_code":{"code_sha256":"d66e02fe1262afdb"}}],"record_sha256":"62180110d28bb6d806cecdfd646368b89bd3c26dd8565f32464a227693019b54","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}