{"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/visualize","entry":"visualize","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":13,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"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":11,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":13,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":5,"unverified":4},"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":"2606.04749","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-04749","title":"COP-Q: Safety-First Reinforcement Learning for Robot Control via Cholesky-Ordered Projection","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"RomainLITUD/COPQ","path":"copq-brax/vis_utils.py","file_url":"https://github.com/RomainLITUD/COPQ/blob/HEAD/copq-brax/vis_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":"9656d45158b8bcfa","code_sha256_prefix":"9656d45158b8bcfa","mcp_get_code":{"code_sha256":"9656d45158b8bcfa"}},{"arxiv_id":"2405.10300","arxiv_id_is_arxiv":true,"paper":"/paper/grounding-dino-1-5-advance-the-edge-of-open","title":"Grounding DINO 1.5: Advance the \"Edge\" of Open-Set Object Detection","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-research/grounding-dino-1.5-api","path":"gdino/visualize.py","file_url":"https://github.com/idea-research/grounding-dino-1.5-api/blob/HEAD/gdino/visualize.py","status":"unverified","verification_level":0,"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":"b7ec463c59fa4f64","code_sha256_prefix":"b7ec463c59fa4f64","mcp_get_code":{"code_sha256":"b7ec463c59fa4f64"}},{"arxiv_id":"2312.00401","arxiv_id_is_arxiv":true,"paper":"/paper/viotgpt-learning-to-schedule-vision-tools","title":"VIoTGPT: Learning to Schedule Vision Tools in LLMs towards Intelligent Video Internet of Things","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyy/viotgpt","path":"VIoTGPT_Vision_nodemo.py","file_url":"https://github.com/zhongyy/viotgpt/blob/HEAD/VIoTGPT_Vision_nodemo.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, zhongyy/viotgpt when it was checked","code_sha256":"69d44b0bc956fb78","code_sha256_prefix":"69d44b0bc956fb78","mcp_get_code":{"code_sha256":"69d44b0bc956fb78"}},{"arxiv_id":"2309.05281","arxiv_id_is_arxiv":true,"paper":"/paper/class-incremental-grouping-network-for","title":"Class-Incremental Grouping Network for Continual Audio-Visual Learning","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stonemo/cign","path":"utils.py","file_url":"https://github.com/stonemo/cign/blob/HEAD/utils.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":"548ea444cb942399","code_sha256_prefix":"548ea444cb942399","mcp_get_code":{"code_sha256":"548ea444cb942399"}},{"arxiv_id":"2306.00127","arxiv_id_is_arxiv":true,"paper":"/paper/surrogate-model-extension-sme-a-fast-and","title":"Surrogate Model Extension (SME): A Fast and Accurate Weight Update Attack on Federated Learning","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/fedavg_leakage","path":"fedavg/attacks/grad_attack.py","file_url":"https://github.com/eth-sri/fedavg_leakage/blob/HEAD/fedavg/attacks/grad_attack.py","status":"unverified","verification_level":0,"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":"0161a159399d1e19","code_sha256_prefix":"0161a159399d1e19","mcp_get_code":{"code_sha256":"0161a159399d1e19"}},{"arxiv_id":"2209.09634","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-weakly-supervised-audio","title":"A Closer Look at Weakly-Supervised Audio-Visual Source Localization","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stonemo/slavc","path":"utils.py","file_url":"https://github.com/stonemo/slavc/blob/HEAD/utils.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":"548ea444cb942399","code_sha256_prefix":"548ea444cb942399","mcp_get_code":{"code_sha256":"548ea444cb942399"}},{"arxiv_id":"2203.04306","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-medical-anomaly","title":"Diffusion Models for Medical Anomaly Detection","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"004f59ffcd28edcc","code_sha256_prefix":"004f59ffcd28edcc","mcp_get_code":{"code_sha256":"004f59ffcd28edcc"}},{"arxiv_id":"2201.12926","arxiv_id_is_arxiv":true,"paper":"/paper/compositionality-as-lexical-symmetry","title":"Compositionality as Lexical Symmetry","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ekinakyurek/lexsym","path":"fiter_model_train.py","file_url":"https://github.com/ekinakyurek/lexsym/blob/HEAD/fiter_model_train.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":"211ed4da9ed745e9","code_sha256_prefix":"211ed4da9ed745e9","mcp_get_code":{"code_sha256":"211ed4da9ed745e9"}},{"arxiv_id":"2112.03145","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-implicit-image","title":"Diffusion Models for Implicit Image Segmentation Ensembles","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juliawolleb/diffusion-based-segmentation","path":"scripts/segmentation_sample.py","file_url":"https://github.com/juliawolleb/diffusion-based-segmentation/blob/HEAD/scripts/segmentation_sample.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"004f59ffcd28edcc","code_sha256_prefix":"004f59ffcd28edcc","mcp_get_code":{"code_sha256":"004f59ffcd28edcc"}},{"arxiv_id":"2106.06885","arxiv_id_is_arxiv":true,"paper":"/paper/online-learning-with-optimism-and-delay","title":"Online Learning with Optimism and Delay","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geflaspohler/poold","path":"src/poold/utils/visualize.py","file_url":"https://github.com/geflaspohler/poold/blob/HEAD/src/poold/utils/visualize.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":"a9c88e80a84c4e46","code_sha256_prefix":"a9c88e80a84c4e46","mcp_get_code":{"code_sha256":"a9c88e80a84c4e46"}},{"arxiv_id":"2102.05229","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-vessel-segmentation-via-deep","title":"Sequential vessel segmentation via deep channel attention network","date":"2021-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Binjie-Qin/SVS-net","path":"3D_new_run_test.py","file_url":"https://github.com/Binjie-Qin/SVS-net/blob/HEAD/3D_new_run_test.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c9619bf9903be96e","code_sha256_prefix":"c9619bf9903be96e","mcp_get_code":{"code_sha256":"c9619bf9903be96e"}},{"arxiv_id":"2001.06826","arxiv_id_is_arxiv":true,"paper":"/paper/zero-reference-deep-curve-estimation-for-low","title":"Zero-Reference Deep Curve Estimation for Low-Light Image Enhancement","date":"2020-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"canturan10/light_side","path":"light_side/utils.py","file_url":"https://github.com/canturan10/light_side/blob/HEAD/light_side/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":"d030fc89c60d67f4","code_sha256_prefix":"d030fc89c60d67f4","mcp_get_code":{"code_sha256":"d030fc89c60d67f4"}},{"arxiv_id":"1911.09070","arxiv_id_is_arxiv":true,"paper":"/paper/efficientdet-scalable-and-efficient-object","title":"EfficientDet: Scalable and Efficient Object Detection","date":"2019-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toandaominh1997/EfficientDet.Pytorch","path":"datasets/visual_aug.py","file_url":"https://github.com/toandaominh1997/EfficientDet.Pytorch/blob/HEAD/datasets/visual_aug.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":"43fbbcaf0aa13b99","code_sha256_prefix":"43fbbcaf0aa13b99","mcp_get_code":{"code_sha256":"43fbbcaf0aa13b99"}}],"record_sha256":"c6605c11a1c14d7fff677fcdec08886319bf8a39aa84b57fb46a9700eceb00f8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}