{"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-labels","entry":"read_labels","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":2,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":11,"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":2,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":5,"unverified":1},"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":"2405.06926","arxiv_id_is_arxiv":true,"paper":"/paper/tai-text-as-image-for-multi-label-image","title":"TAI++: Text as Image for Multi-Label Image Classification by Co-Learning Transferable Prompt","date":"2024-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jinx630/Pseudo-Visual-Prompt","path":"pvp_finetune/datasets/coco2014_partial.py","file_url":"https://github.com/Jinx630/Pseudo-Visual-Prompt/blob/HEAD/pvp_finetune/datasets/coco2014_partial.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, Jinx630/Pseudo-Visual-Prompt when it was checked","code_sha256":"26b2d1385e57b28e","code_sha256_prefix":"26b2d1385e57b28e","mcp_get_code":{"code_sha256":"26b2d1385e57b28e"}},{"arxiv_id":"2303.05148","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-knowledge-transfer-with","title":"Weakly Supervised Knowledge Transfer with Probabilistic Logical Reasoning for Object Detection","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molden/ProbKT","path":"generate_data/visualize_dataset.py","file_url":"https://github.com/molden/ProbKT/blob/HEAD/generate_data/visualize_dataset.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":"6d30a340fe4349c7","code_sha256_prefix":"6d30a340fe4349c7","mcp_get_code":{"code_sha256":"6d30a340fe4349c7"}},{"arxiv_id":"2210.13210","arxiv_id_is_arxiv":true,"paper":"/paper/mutual-information-alleviates-hallucinations","title":"Mutual Information Alleviates Hallucinations in Abstractive Summarization","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderpoelliam/cpmi","path":"src/evaluate_decoding.py","file_url":"https://github.com/vanderpoelliam/cpmi/blob/HEAD/src/evaluate_decoding.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":"97289c22f4f957e9","code_sha256_prefix":"97289c22f4f957e9","mcp_get_code":{"code_sha256":"97289c22f4f957e9"}},{"arxiv_id":"2207.08141","arxiv_id_is_arxiv":true,"paper":"/paper/electra-is-a-zero-shot-learner-too","title":"ELECTRA is a Zero-Shot Learner, Too","date":"2022-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nishiwen1214/rtd-electra","path":"utils.py","file_url":"https://github.com/nishiwen1214/rtd-electra/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":"b3a1a6695e03774a","code_sha256_prefix":"b3a1a6695e03774a","mcp_get_code":{"code_sha256":"b3a1a6695e03774a"}},{"arxiv_id":"2005.11041","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-of-information-cascade-analysis","title":"A Survey of Information Cascade Analysis: Models, Predictions, and Recent Advances","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xovee/casflow","path":"gene_emb.py","file_url":"https://github.com/Xovee/casflow/blob/HEAD/gene_emb.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":"b8a9341d81c3f6d8","code_sha256_prefix":"b8a9341d81c3f6d8","mcp_get_code":{"code_sha256":"b8a9341d81c3f6d8"}},{"arxiv_id":"2004.11362","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexk1704/scclv2","path":"src/cl_replay/api/utils/convert_ds.py","file_url":"https://github.com/alexk1704/scclv2/blob/HEAD/src/cl_replay/api/utils/convert_ds.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":"f4731b89be918d6f","code_sha256_prefix":"f4731b89be918d6f","mcp_get_code":{"code_sha256":"f4731b89be918d6f"}},{"arxiv_id":"1906.01277","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BorgwardtLab/WWL","path":"experiments/utilities.py","file_url":"https://github.com/BorgwardtLab/WWL/blob/HEAD/experiments/utilities.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"72df551d8c4af0e4","code_sha256_prefix":"72df551d8c4af0e4","mcp_get_code":{"code_sha256":"72df551d8c4af0e4"}},{"arxiv_id":"1901.06852","arxiv_id_is_arxiv":true,"paper":"/paper/calibration-with-bias-corrected-temperature","title":"Maximum Likelihood with Bias-Corrected Calibration is Hard-To-Beat at Label Shift Adaptation","date":"2019-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kundajelab/labelshiftexperiments","path":"labelshiftexperiments/cifarandmnist.py","file_url":"https://github.com/kundajelab/labelshiftexperiments/blob/HEAD/labelshiftexperiments/cifarandmnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kundajelab/labelshiftexperiments when it was checked","code_sha256":"0f722b60f8c59c77","code_sha256_prefix":"0f722b60f8c59c77","mcp_get_code":{"code_sha256":"0f722b60f8c59c77"}},{"arxiv_id":"1811.04110","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-network-agnostophobia","title":"Reducing Network Agnostophobia","date":"2018-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ROBOTICSENGINEER/Reducing-Network-Agnostophobia-Center-Loss","path":"MNIST/data_prep.py","file_url":"https://github.com/ROBOTICSENGINEER/Reducing-Network-Agnostophobia-Center-Loss/blob/HEAD/MNIST/data_prep.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ROBOTICSENGINEER/Reducing-Network-Agnostophobia-Center-Loss, is not in the permissive set Syntology serves inline","code_sha256":"b25733043a18945d","code_sha256_prefix":"b25733043a18945d","mcp_get_code":{"code_sha256":"b25733043a18945d"}},{"arxiv_id":"1412.5567","arxiv_id_is_arxiv":true,"paper":"/paper/deep-speech-scaling-up-end-to-end-speech","title":"Deep Speech: Scaling up end-to-end speech recognition","date":"2014-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mangushev/deep_speech","path":"prepare_libri.py","file_url":"https://github.com/mangushev/deep_speech/blob/HEAD/prepare_libri.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":"a7e204ec063f026b","code_sha256_prefix":"a7e204ec063f026b","mcp_get_code":{"code_sha256":"a7e204ec063f026b"}},{"arxiv_id":"Guo_Texts_as_Images_in_Prompt_Tuning_for_Multi-Label_Image_Recognition_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Guo_Texts_as_Images_in_Prompt_Tuning_for_Multi-Label_Image_Recognition_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"guozix/TaI-DPT","path":"datasets/coco2014_partial.py","file_url":"https://github.com/guozix/TaI-DPT/blob/HEAD/datasets/coco2014_partial.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 Jinx630/Pseudo-Visual-Prompt, and GitHub detected no licence in that repository when it was checked","code_sha256":"26b2d1385e57b28e","code_sha256_prefix":"26b2d1385e57b28e","mcp_get_code":{"code_sha256":"26b2d1385e57b28e"}}],"record_sha256":"3ddea3375ca8c826dcb273572c61bf50bdf28ecb2dea07eb5bb2334302212980","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}