{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/init-centers","entry":"init_centers","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":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":6,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":4},"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":"2312.04604","paper":"/paper/transferable-candidate-proposal-with-bounded","title":"Transferable Candidate Proposal with Bounded Uncertainty","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gokyeongryeol/TBU","path":"active/selection/badge.py","file_url":"https://github.com/gokyeongryeol/TBU/blob/HEAD/active/selection/badge.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75953c142ae4e662","mcp_get_code":{"code_sha256":"75953c142ae4e662"}},{"arxiv_id":"2209.08425","paper":"/paper/introspective-learning-a-two-stage-approach-1","title":"Introspective Learning : A Two-Stage Approach for Inference in Neural Networks","date":"2022-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"28cc855e066f5ccd","mcp_get_code":{"code_sha256":"28cc855e066f5ccd"}},{"arxiv_id":"2203.13450","paper":"/paper/a-comparative-survey-of-deep-active-learning","title":"A Comparative Survey of Deep Active Learning","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SineZHAN/deepALplus","path":"query_strategies/badge_sampling.py","file_url":"https://github.com/SineZHAN/deepALplus/blob/HEAD/query_strategies/badge_sampling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e25e112696ada3fe","mcp_get_code":{"code_sha256":"e25e112696ada3fe"}},{"arxiv_id":"2112.00166","paper":"/paper/talisman-targeted-active-learning-for-object","title":"TALISMAN: Targeted Active Learning for Object Detection with Rare Classes and Slices using Submodular Mutual Information","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"surajkothawade/talisman","path":"talisman/strategies/active_learning_utils/clustering.py","file_url":"https://github.com/surajkothawade/talisman/blob/HEAD/talisman/strategies/active_learning_utils/clustering.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a60fc8e6d28f3903","mcp_get_code":{"code_sha256":"a60fc8e6d28f3903"}},{"arxiv_id":"2109.14155","paper":"/paper/customs-fraud-detection-in-the-presence-of","title":"Customs Fraud Detection in the Presence of Concept Drift","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Seondong/Customs-Fraud-Detection","path":"query_strategies/badge.py","file_url":"https://github.com/Seondong/Customs-Fraud-Detection/blob/HEAD/query_strategies/badge.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db9dd2d8525eb5e4","mcp_get_code":{"code_sha256":"db9dd2d8525eb5e4"}},{"arxiv_id":"2107.00717","paper":"/paper/similar-submodular-information-measures-based","title":"SIMILAR: Submodular Information Measures Based Active Learning In Realistic Scenarios","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decile-team/distil","path":"distil/active_learning_strategies/badge.py","file_url":"https://github.com/decile-team/distil/blob/HEAD/distil/active_learning_strategies/badge.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af56f1b5edfdba7f","mcp_get_code":{"code_sha256":"af56f1b5edfdba7f"}},{"arxiv_id":"2106.09675","paper":"/paper/gone-fishing-neural-active-learning-with","title":"Gone Fishing: Neural Active Learning with Fisher Embeddings","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"28cc855e066f5ccd","mcp_get_code":{"code_sha256":"28cc855e066f5ccd"}},{"arxiv_id":"1906.03671","paper":"/paper/deep-batch-active-learning-by-diverse","title":"Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JordanAsh/badge","path":"query_strategies/badge_sampling.py","file_url":"https://github.com/JordanAsh/badge/blob/HEAD/query_strategies/badge_sampling.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"28cc855e066f5ccd","mcp_get_code":{"code_sha256":"28cc855e066f5ccd"}}]}