{"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/read-label","entry":"read_label","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":5,"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":13,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":4,"unverified":3},"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":"2411.01542","arxiv_id_is_arxiv":true,"paper":"/paper/factorizephys-matrix-factorization-for","title":"FactorizePhys: Matrix Factorization for Multidimensional Attention in Remote Physiological Sensing","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhysiologicAILab/FactorizePhys","path":"evaluation/metrics.py","file_url":"https://github.com/PhysiologicAILab/FactorizePhys/blob/HEAD/evaluation/metrics.py","status":"unverified","verification_level":0,"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, PhysiologicAILab/FactorizePhys (NOASSERTION)","code_sha256":"db1d2850c08d04e4","code_sha256_prefix":"db1d2850c08d04e4","mcp_get_code":{"code_sha256":"db1d2850c08d04e4"}},{"arxiv_id":"2405.09901","arxiv_id_is_arxiv":true,"paper":"/paper/whole-song-hierarchical-generation-of","title":"Whole-Song Hierarchical Generation of Symbolic Music Using Cascaded Diffusion Models","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzwaang/melody-reduction-algo","path":"utils/read_pop909.py","file_url":"https://github.com/zzwaang/melody-reduction-algo/blob/HEAD/utils/read_pop909.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":"433e78e1dce73946","code_sha256_prefix":"433e78e1dce73946","mcp_get_code":{"code_sha256":"433e78e1dce73946"}},{"arxiv_id":"2404.14956","arxiv_id_is_arxiv":true,"paper":"/paper/dawn-domain-adaptive-weakly-supervised-nuclei","title":"DAWN: Domain-Adaptive Weakly Supervised Nuclei Segmentation via Cross-Task Interactions","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangye-zoe/dawn","path":"src/dawn/evaluation/metrics.py","file_url":"https://github.com/zhangye-zoe/dawn/blob/HEAD/src/dawn/evaluation/metrics.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, zhangye-zoe/dawn when it was checked","code_sha256":"218697f05771aba5","code_sha256_prefix":"218697f05771aba5","mcp_get_code":{"code_sha256":"218697f05771aba5"}},{"arxiv_id":"2404.06483","arxiv_id_is_arxiv":true,"paper":"/paper/rhythmmamba-fast-remote-physiological","title":"RhythmMamba: Fast Remote Physiological Measurement with Arbitrary Length Videos","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zizheng-guo/rhythmmamba","path":"evaluation/metrics.py","file_url":"https://github.com/zizheng-guo/rhythmmamba/blob/HEAD/evaluation/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 PhysiologicAILab/FactorizePhys, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"db1d2850c08d04e4","code_sha256_prefix":"db1d2850c08d04e4","mcp_get_code":{"code_sha256":"db1d2850c08d04e4"}},{"arxiv_id":"2009.12518","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-model-adaptation-for-continual","title":"Unsupervised Model Adaptation for Continual Semantic Segmentation","date":"2020-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serbanstan/mas3-continual","path":"io_utils.py","file_url":"https://github.com/serbanstan/mas3-continual/blob/HEAD/io_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":"1ea07d8dc81db6f5","code_sha256_prefix":"1ea07d8dc81db6f5","mcp_get_code":{"code_sha256":"1ea07d8dc81db6f5"}},{"arxiv_id":"2003.11080","arxiv_id_is_arxiv":true,"paper":"/paper/xtreme-a-massively-multilingual-multi-task","title":"XTREME: A Massively Multilingual Multi-task Benchmark for Evaluating Cross-lingual Generalization","date":"2020-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/xtreme","path":"evaluate.py","file_url":"https://github.com/google-research/xtreme/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6cdf941eeaf166a","code_sha256_prefix":"c6cdf941eeaf166a","mcp_get_code":{"code_sha256":"c6cdf941eeaf166a"}},{"arxiv_id":"2003.11080","arxiv_id_is_arxiv":true,"paper":"/paper/xtreme-a-massively-multilingual-multi-task","title":"XTREME: A Massively Multilingual Multi-task Benchmark for Evaluating Cross-lingual Generalization","date":"2020-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunjieHu/xtreme-dev","path":"evaluate.py","file_url":"https://github.com/JunjieHu/xtreme-dev/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25ec008fc6924728","code_sha256_prefix":"25ec008fc6924728","mcp_get_code":{"code_sha256":"25ec008fc6924728"}},{"arxiv_id":"1911.01196","arxiv_id_is_arxiv":true,"paper":"/paper/spherical-text-embedding","title":"Spherical Text Embedding","date":"2019-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yumeng5/Spherical-Text-Embedding","path":"classify.py","file_url":"https://github.com/yumeng5/Spherical-Text-Embedding/blob/HEAD/classify.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":"c7b2ce173ca52b69","code_sha256_prefix":"c7b2ce173ca52b69","mcp_get_code":{"code_sha256":"c7b2ce173ca52b69"}},{"arxiv_id":"1905.00641","arxiv_id_is_arxiv":true,"paper":"/paper/190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/RetinaFace","path":"src/retinaface_eval.py","file_url":"https://github.com/yangyucheng000/RetinaFace/blob/HEAD/src/retinaface_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bf91d15cb1c6a6d8","code_sha256_prefix":"bf91d15cb1c6a6d8","mcp_get_code":{"code_sha256":"bf91d15cb1c6a6d8"}},{"arxiv_id":"1904.01569","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-randomly-wired-neural-networks-for","title":"Exploring Randomly Wired Neural Networks for Image Recognition","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swdsld/RandWire_tensorflow","path":"dataset/mnist/mnist.py","file_url":"https://github.com/swdsld/RandWire_tensorflow/blob/HEAD/dataset/mnist/mnist.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":"38bfe991e2a72c25","code_sha256_prefix":"38bfe991e2a72c25","mcp_get_code":{"code_sha256":"38bfe991e2a72c25"}},{"arxiv_id":"1903.06405","arxiv_id_is_arxiv":true,"paper":"/paper/blvd-building-a-large-scale-5d-semantics","title":"BLVD: Building A Large-scale 5D Semantics Benchmark for Autonomous Driving","date":"2019-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VCCIV/BLVD","path":"utils.py","file_url":"https://github.com/VCCIV/BLVD/blob/HEAD/utils.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, VCCIV/BLVD when it was checked","code_sha256":"16da97b8bddad35f","code_sha256_prefix":"16da97b8bddad35f","mcp_get_code":{"code_sha256":"16da97b8bddad35f"}},{"arxiv_id":"1801.01681","arxiv_id_is_arxiv":true,"paper":"/paper/vuldeepecker-a-deep-learning-based-system-for","title":"VulDeePecker: A Deep Learning-Based System for Vulnerability Detection","date":"2018-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"messi-q/rechecker","path":"evaluations/reentrancy/Performance_evaluation.py","file_url":"https://github.com/messi-q/rechecker/blob/HEAD/evaluations/reentrancy/Performance_evaluation.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":"f6f1cc3ce83a4096","code_sha256_prefix":"f6f1cc3ce83a4096","mcp_get_code":{"code_sha256":"f6f1cc3ce83a4096"}},{"arxiv_id":"1512.00567","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwzwx1190522/inceptionv3","path":"inceptionv3/postprocess.py","file_url":"https://github.com/hwzwx1190522/inceptionv3/blob/HEAD/inceptionv3/postprocess.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":"14f5f199a7b894be","code_sha256_prefix":"14f5f199a7b894be","mcp_get_code":{"code_sha256":"14f5f199a7b894be"}},{"arxiv_id":"2023.findings-acl.426","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.426","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bazingagin/npc_gzip","path":"original_codebase/data.py","file_url":"https://github.com/bazingagin/npc_gzip/blob/HEAD/original_codebase/data.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":"a18073cd95a2b736","code_sha256_prefix":"a18073cd95a2b736","mcp_get_code":{"code_sha256":"a18073cd95a2b736"}}],"record_sha256":"22e60337a89d23323f0e29a4d9ec9502c24dae6eff7fe6d5c9ee901e1686eb0e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}