{"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-sampling","entry":"random_sampling","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":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":5,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":14,"n_places_pointer_only":9,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":5,"unverified":2},"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":"2605.01642","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01642","title":"Adaptive Pluralistic Alignment: A pipeline for dynamic artificial democracy","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"RachelFreedman/APA","path":"apa/democratic_response.py","file_url":"https://github.com/RachelFreedman/APA/blob/HEAD/apa/democratic_response.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, RachelFreedman/APA when it was checked","code_sha256":"6237cf7d14a11ffc","code_sha256_prefix":"6237cf7d14a11ffc","mcp_get_code":{"code_sha256":"6237cf7d14a11ffc"}},{"arxiv_id":"2505.02625","arxiv_id_is_arxiv":true,"paper":"/paper/llama-omni2-llm-based-real-time-spoken","title":"LLaMA-Omni2: LLM-based Real-time Spoken Chatbot with Autoregressive Streaming Speech Synthesis","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainbowluocs/openomni","path":"openomni/model/speech_generator_ar/speech_generator.py","file_url":"https://github.com/rainbowluocs/openomni/blob/HEAD/openomni/model/speech_generator_ar/speech_generator.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rainbowluocs/openomni when it was checked","code_sha256":"989f0fc8f2162c7c","code_sha256_prefix":"989f0fc8f2162c7c","mcp_get_code":{"code_sha256":"989f0fc8f2162c7c"}},{"arxiv_id":"2412.02402","arxiv_id_is_arxiv":true,"paper":"/paper/rg-san-rule-guided-spatial-awareness-network","title":"RG-SAN: Rule-Guided Spatial Awareness Network for End-to-End 3D Referring Expression Segmentation","date":"2024-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sosppxo/RG-SAN","path":"rg_san/model/pc_util.py","file_url":"https://github.com/sosppxo/RG-SAN/blob/HEAD/rg_san/model/pc_util.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sosppxo/RG-SAN when it was checked","code_sha256":"b91d93c29e979019","code_sha256_prefix":"b91d93c29e979019","mcp_get_code":{"code_sha256":"b91d93c29e979019"}},{"arxiv_id":"2411.02988","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-calibration-of-classifiers-with","title":"Confidence Calibration of Classifiers with Many Classes","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mominabbass/LinC","path":"utils.py","file_url":"https://github.com/mominabbass/LinC/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mominabbass/LinC when it was checked","code_sha256":"c6b46764733c312e","code_sha256_prefix":"c6b46764733c312e","mcp_get_code":{"code_sha256":"c6b46764733c312e"}},{"arxiv_id":"2410.19192","arxiv_id_is_arxiv":true,"paper":"/paper/team-topological-evolution-aware-framework","title":"TEAM: Topological Evolution-aware Framework for Traffic Forecasting--Extended Version","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvmduc/TEAM-topo-evo-traffic-forecasting","path":"src/model/replay.py","file_url":"https://github.com/kvmduc/TEAM-topo-evo-traffic-forecasting/blob/HEAD/src/model/replay.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kvmduc/TEAM-topo-evo-traffic-forecasting when it was checked","code_sha256":"29bee1b43be9b869","code_sha256_prefix":"29bee1b43be9b869","mcp_get_code":{"code_sha256":"29bee1b43be9b869"}},{"arxiv_id":"2402.19472","arxiv_id_is_arxiv":true,"paper":"/paper/lifelong-benchmarks-efficient-model","title":"Efficient Lifelong Model Evaluation in an Era of Rapid Progress","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bethgelab/sort-and-search","path":"src/sort_and_search.py","file_url":"https://github.com/bethgelab/sort-and-search/blob/HEAD/src/sort_and_search.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bethgelab/sort-and-search when it was checked","code_sha256":"26d3a93b00f00fa0","code_sha256_prefix":"26d3a93b00f00fa0","mcp_get_code":{"code_sha256":"26d3a93b00f00fa0"}},{"arxiv_id":"2401.12406","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-in-context-learning-via-linear","title":"Enhancing In-context Learning via Linear Probe Calibration","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mominabbass/linc","path":"utils.py","file_url":"https://github.com/mominabbass/linc/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mominabbass/linc when it was checked","code_sha256":"c6b46764733c312e","code_sha256_prefix":"c6b46764733c312e","mcp_get_code":{"code_sha256":"c6b46764733c312e"}},{"arxiv_id":"2312.04021","arxiv_id_is_arxiv":true,"paper":"/paper/a-study-on-the-calibration-of-in-context","title":"A Study on the Calibration of In-context Learning","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hlzhang109/icl-calibration","path":"utils.py","file_url":"https://github.com/hlzhang109/icl-calibration/blob/HEAD/utils.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":"2ed507c8c59739f5","code_sha256_prefix":"2ed507c8c59739f5","mcp_get_code":{"code_sha256":"2ed507c8c59739f5"}},{"arxiv_id":"2309.01692","arxiv_id_is_arxiv":true,"paper":"/paper/mask-attention-free-transformer-for-3d","title":"Mask-Attention-Free Transformer for 3D Instance Segmentation","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/mask-attention-free-transformer","path":"maft/model/pc_util.py","file_url":"https://github.com/dvlab-research/mask-attention-free-transformer/blob/HEAD/maft/model/pc_util.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dvlab-research/mask-attention-free-transformer when it was checked","code_sha256":"b91d93c29e979019","code_sha256_prefix":"b91d93c29e979019","mcp_get_code":{"code_sha256":"b91d93c29e979019"}},{"arxiv_id":"2307.10316","arxiv_id_is_arxiv":true,"paper":"/paper/cpcm-contextual-point-cloud-modeling-for","title":"CPCM: Contextual Point Cloud Modeling for Weakly-supervised Point Cloud Semantic Segmentation","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lizhaoliu-Lec/CPCM","path":"lib/pc_utils.py","file_url":"https://github.com/lizhaoliu-Lec/CPCM/blob/HEAD/lib/pc_utils.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":"1d1392e58959df67","code_sha256_prefix":"1d1392e58959df67","mcp_get_code":{"code_sha256":"1d1392e58959df67"}},{"arxiv_id":"2109.04282","arxiv_id_is_arxiv":true,"paper":"/paper/cartography-active-learning","title":"Cartography Active Learning","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjzha/cal","path":"project/src/acquisition/random_sampling.py","file_url":"https://github.com/jjzha/cal/blob/HEAD/project/src/acquisition/random_sampling.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":"99936f3cb79c614b","code_sha256_prefix":"99936f3cb79c614b","mcp_get_code":{"code_sha256":"99936f3cb79c614b"}},{"arxiv_id":"1904.00637","arxiv_id_is_arxiv":true,"paper":"/paper/single-image-reflection-removal-exploiting","title":"Single Image Reflection Removal Exploiting Misaligned Training Data and Network Enhancements","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vandermode/ERRNet","path":"models/CX/CX_helper.py","file_url":"https://github.com/Vandermode/ERRNet/blob/HEAD/models/CX/CX_helper.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":"5b0d0624510bbe25","code_sha256_prefix":"5b0d0624510bbe25","mcp_get_code":{"code_sha256":"5b0d0624510bbe25"}},{"arxiv_id":"1701.03551","arxiv_id_is_arxiv":true,"paper":"/paper/cost-effective-active-learning-for-deep-image","title":"Cost-Effective Active Learning for Deep Image Classification","date":"2017-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhaalves/CEAL_keras","path":"CEAL_keras.py","file_url":"https://github.com/dhaalves/CEAL_keras/blob/HEAD/CEAL_keras.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dhaalves/CEAL_keras when it was checked","code_sha256":"8458148753d45f8b","code_sha256_prefix":"8458148753d45f8b","mcp_get_code":{"code_sha256":"8458148753d45f8b"}},{"arxiv_id":"aaai_21180","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21180","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yuanmu97/MLink","path":"mlink/sampler.py","file_url":"https://github.com/yuanmu97/MLink/blob/HEAD/mlink/sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33f083b21b2e2e3b","code_sha256_prefix":"33f083b21b2e2e3b","mcp_get_code":{"code_sha256":"33f083b21b2e2e3b"}}],"record_sha256":"1fbc6bdf3d304828b44ddc796488079f90b5ee4b48e10912d2c0e474d5713f45","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}