{"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/random-selection","entry":"random_selection","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":1,"ran":4,"unverified":0},"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":"2604.06207","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06207","title":"A Comparative Study of Demonstration Selection for Practical Large Language Models-based Next POI Prediction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ryonsd/DS-LLM4POI","path":"src/utils/demo_selection.py","file_url":"https://github.com/ryonsd/DS-LLM4POI/blob/HEAD/src/utils/demo_selection.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2f74cb610cff6ef","code_sha256_prefix":"c2f74cb610cff6ef","mcp_get_code":{"code_sha256":"c2f74cb610cff6ef"}},{"arxiv_id":"2405.15613","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-data-curation-for-self-supervised","title":"Automatic Data Curation for Self-Supervised Learning: A Clustering-Based Approach","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/ssl-data-curation","path":"src/hierarchical_sampling.py","file_url":"https://github.com/facebookresearch/ssl-data-curation/blob/HEAD/src/hierarchical_sampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/ssl-data-curation (NOASSERTION)","code_sha256":"b4b479fcfe0ff407","code_sha256_prefix":"b4b479fcfe0ff407","mcp_get_code":{"code_sha256":"b4b479fcfe0ff407"}},{"arxiv_id":"2404.00264","arxiv_id_is_arxiv":true,"paper":"/paper/dilm-distilling-dataset-into-language-model","title":"DiLM: Distilling Dataset into Language Model for Text-level Dataset Distillation","date":"2024-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arumaekawa/dilm","path":"src/coreset/random.py","file_url":"https://github.com/arumaekawa/dilm/blob/HEAD/src/coreset/random.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6df27b052e7836d0","code_sha256_prefix":"6df27b052e7836d0","mcp_get_code":{"code_sha256":"6df27b052e7836d0"}},{"arxiv_id":"2403.18802","arxiv_id_is_arxiv":true,"paper":"/paper/long-form-factuality-in-large-language-models","title":"Long-form factuality in large language models","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/long-form-factuality","path":"common/utils.py","file_url":"https://github.com/google-deepmind/long-form-factuality/blob/HEAD/common/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, google-deepmind/long-form-factuality (NOASSERTION)","code_sha256":"bee924b7c1a1b868","code_sha256_prefix":"bee924b7c1a1b868","mcp_get_code":{"code_sha256":"bee924b7c1a1b868"}},{"arxiv_id":"2402.15708","arxiv_id_is_arxiv":true,"paper":"/paper/query-augmentation-by-decoding-semantics-from","title":"Query Augmentation by Decoding Semantics from Brain Signals","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeziyi1998/brain-query-augmentation","path":"ict/part1_config.py","file_url":"https://github.com/yeziyi1998/brain-query-augmentation/blob/HEAD/ict/part1_config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5d90fbc71308d28","code_sha256_prefix":"e5d90fbc71308d28","mcp_get_code":{"code_sha256":"e5d90fbc71308d28"}},{"arxiv_id":"2103.16788","arxiv_id_is_arxiv":true,"paper":"/paper/der-dynamically-expandable-representation-for","title":"DER: Dynamically Expandable Representation for Class Incremental Learning","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rhyssiyan/DER-ClassIL.pytorch","path":"inclearn/models/incmodel.py","file_url":"https://github.com/Rhyssiyan/DER-ClassIL.pytorch/blob/HEAD/inclearn/models/incmodel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"655d09e23b2af00d","code_sha256_prefix":"655d09e23b2af00d","mcp_get_code":{"code_sha256":"655d09e23b2af00d"}},{"arxiv_id":"2007.15951","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-survey-of-data-augmentation-for","title":"An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uchidalab/time_series_augmentation","path":"utils/prototype_selection.py","file_url":"https://github.com/uchidalab/time_series_augmentation/blob/HEAD/utils/prototype_selection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43dc9c195316089e","code_sha256_prefix":"43dc9c195316089e","mcp_get_code":{"code_sha256":"43dc9c195316089e"}},{"arxiv_id":"2024.findings-naacl.199","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-naacl.199","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"arumaekawa/DiLM","path":"src/coreset/random.py","file_url":"https://github.com/arumaekawa/DiLM/blob/HEAD/src/coreset/random.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6df27b052e7836d0","code_sha256_prefix":"6df27b052e7836d0","mcp_get_code":{"code_sha256":"6df27b052e7836d0"}}],"record_sha256":"01ac481896a44a2927e44ef48ee5375012d9c154c692d4ab1a6d9bee19a17018","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}