{"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/post-processing","entry":"post_processing","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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":10,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"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":"2406.08434","arxiv_id_is_arxiv":true,"paper":"/paper/taste-teaching-large-language-models-to","title":"TasTe: Teaching Large Language Models to Translate through Self-Reflection","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yutongwang1216/reflectionllmmt","path":"infer/infer_prompt.py","file_url":"https://github.com/yutongwang1216/reflectionllmmt/blob/HEAD/infer/infer_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d533afcd5be0bb1b","code_sha256_prefix":"d533afcd5be0bb1b","mcp_get_code":{"code_sha256":"d533afcd5be0bb1b"}},{"arxiv_id":"2307.10037","arxiv_id_is_arxiv":true,"paper":"/paper/single-cell-rna-seq-data-imputation-using","title":"Single-cell RNA-seq data imputation using Feature Propagation","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":"archive","repo":"Junseok0207/scFP","path":"misc/graph_construction.py","file_url":"https://github.com/Junseok0207/scFP/blob/HEAD/misc/graph_construction.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, Junseok0207/scFP when it was checked","code_sha256":"b352577bebe91fc9","code_sha256_prefix":"b352577bebe91fc9","mcp_get_code":{"code_sha256":"b352577bebe91fc9"}},{"arxiv_id":"2307.04408","arxiv_id_is_arxiv":true,"paper":"/paper/tim-teaching-large-language-models-to","title":"TIM: Teaching Large Language Models to Translate with Comparison","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lemon0830/tim","path":"inference/infer_bloom.py","file_url":"https://github.com/lemon0830/tim/blob/HEAD/inference/infer_bloom.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lemon0830/tim when it was checked","code_sha256":"f65f716286d1c018","code_sha256_prefix":"f65f716286d1c018","mcp_get_code":{"code_sha256":"f65f716286d1c018"}},{"arxiv_id":"2004.05571","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-correspondence-learning-for","title":"Cross-domain Correspondence Learning for Exemplar-based Image Translation","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/CoCosNet","path":"models/networks/ContextualLoss.py","file_url":"https://github.com/microsoft/CoCosNet/blob/HEAD/models/networks/ContextualLoss.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":"fd231a057942e089","code_sha256_prefix":"fd231a057942e089","mcp_get_code":{"code_sha256":"fd231a057942e089"}},{"arxiv_id":"1911.01214","arxiv_id_is_arxiv":true,"paper":"/paper/a-richly-annotated-corpus-for-different-tasks-1","title":"A Richly Annotated Corpus for Different Tasks in Automated Fact-Checking","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/conll2019-snopes-experiments","path":"src/scripts/evidence_extraction.py","file_url":"https://github.com/UKPLab/conll2019-snopes-experiments/blob/HEAD/src/scripts/evidence_extraction.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":"d6644ab1b10b325d","code_sha256_prefix":"d6644ab1b10b325d","mcp_get_code":{"code_sha256":"d6644ab1b10b325d"}},{"arxiv_id":"1906.09909","arxiv_id_is_arxiv":true,"paper":"/paper/deep-exemplar-based-video-colorization-1","title":"Deep Exemplar-based Video Colorization","date":"2019-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangmozhe/video-colorization","path":"models/ContextualLoss.py","file_url":"https://github.com/zhangmozhe/video-colorization/blob/HEAD/models/ContextualLoss.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":"c4bcfa024dc38e50","code_sha256_prefix":"c4bcfa024dc38e50","mcp_get_code":{"code_sha256":"c4bcfa024dc38e50"}},{"arxiv_id":"1809.01479","arxiv_id_is_arxiv":true,"paper":"/paper/ukp-athene-multi-sentence-textual-entailment","title":"UKP-Athene: Multi-Sentence Textual Entailment for Claim Verification","date":"2018-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/fever-2018-team-athene","path":"src/athene/retrieval/sentences/ensemble.py","file_url":"https://github.com/UKPLab/fever-2018-team-athene/blob/HEAD/src/athene/retrieval/sentences/ensemble.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":"e8d106af8bff71ba","code_sha256_prefix":"e8d106af8bff71ba","mcp_get_code":{"code_sha256":"e8d106af8bff71ba"}},{"arxiv_id":"1809.01479","arxiv_id_is_arxiv":true,"paper":"/paper/ukp-athene-multi-sentence-textual-entailment","title":"UKP-Athene: Multi-Sentence Textual Entailment for Claim Verification","date":"2018-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/fever-2018-team-athene","path":"src/athene/retrieval/sentences/sentence_retrieval.py","file_url":"https://github.com/UKPLab/fever-2018-team-athene/blob/HEAD/src/athene/retrieval/sentences/sentence_retrieval.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":"339bbbadb4219f8f","code_sha256_prefix":"339bbbadb4219f8f","mcp_get_code":{"code_sha256":"339bbbadb4219f8f"}},{"arxiv_id":"1807.11164","arxiv_id_is_arxiv":true,"paper":"/paper/shufflenet-v2-practical-guidelines-for","title":"ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Design","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mnicnc404/CartoonGan-tensorflow","path":"cartoonize.py","file_url":"https://github.com/mnicnc404/CartoonGan-tensorflow/blob/HEAD/cartoonize.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":"b1dee98f6e19456f","code_sha256_prefix":"b1dee98f6e19456f","mcp_get_code":{"code_sha256":"b1dee98f6e19456f"}},{"arxiv_id":"1611.09326","arxiv_id_is_arxiv":true,"paper":"/paper/the-one-hundred-layers-tiramisu-fully","title":"The One Hundred Layers Tiramisu: Fully Convolutional DenseNets for Semantic Segmentation","date":"2016-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kskim-phd/mfcn","path":"MFCN_SMC/code_MFCN/stage1_conventional_model.py","file_url":"https://github.com/kskim-phd/mfcn/blob/HEAD/MFCN_SMC/code_MFCN/stage1_conventional_model.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":"65d0d9510aa373d4","code_sha256_prefix":"65d0d9510aa373d4","mcp_get_code":{"code_sha256":"65d0d9510aa373d4"}}],"record_sha256":"42677cd7828eb88f91ba6a85dac190f10a7baedaf0f90354a8f69e95bf574e8b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}