{"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/readfile-2","entry":"readFile","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":3,"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":"2605.18133","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18133","title":"An Empirical Study of Privacy Leakage Chains via Prompt Injection in Black-Box Chatbot Environments","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"In-Sam/Kill-Chain-of-Privacy-Leakage-via-Prompt-Injection","path":"prompt_injection/manipulate_settings.py","file_url":"https://github.com/In-Sam/Kill-Chain-of-Privacy-Leakage-via-Prompt-Injection/blob/HEAD/prompt_injection/manipulate_settings.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, In-Sam/Kill-Chain-of-Privacy-Leakage-via-Prompt-Injection when it was checked","code_sha256":"c51a7fa8a0047000","code_sha256_prefix":"c51a7fa8a0047000","mcp_get_code":{"code_sha256":"c51a7fa8a0047000"}},{"arxiv_id":"2604.02520","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-02520","title":"Neural posterior estimation for scalable and accurate inverse parameter inference in Li-ion batteries","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"NatLabRockies/BatFIT","path":"batfit/calibration/data_utils.py","file_url":"https://github.com/NatLabRockies/BatFIT/blob/HEAD/batfit/calibration/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"749f14f18ac3a486","code_sha256_prefix":"749f14f18ac3a486","mcp_get_code":{"code_sha256":"749f14f18ac3a486"}},{"arxiv_id":"2204.05798","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-breast-cancer-classification-via","title":"Multi-View Hypercomplex Learning for Breast Cancer Screening","date":"2022-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispamm/phbreast","path":"utils/readFile.py","file_url":"https://github.com/ispamm/phbreast/blob/HEAD/utils/readFile.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":"519e9cfd9abb2442","code_sha256_prefix":"519e9cfd9abb2442","mcp_get_code":{"code_sha256":"519e9cfd9abb2442"}},{"arxiv_id":"1803.06815","arxiv_id_is_arxiv":true,"paper":"/paper/espnet-efficient-spatial-pyramid-of-dilated","title":"ESPNet: Efficient Spatial Pyramid of Dilated Convolutions for Semantic Segmentation","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simuler/ESPNet","path":"compute_classweight.py","file_url":"https://github.com/simuler/ESPNet/blob/HEAD/compute_classweight.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":"9c1bd7a7658cc12c","code_sha256_prefix":"9c1bd7a7658cc12c","mcp_get_code":{"code_sha256":"9c1bd7a7658cc12c"}},{"arxiv_id":"1511.05298","arxiv_id_is_arxiv":true,"paper":"/paper/structural-rnn-deep-learning-on-spatio","title":"Structural-RNN: Deep Learning on Spatio-Temporal Graphs","date":"2015-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaolongkzz/human_motion","path":"scripts/Animation/motionAnimation.py","file_url":"https://github.com/zhaolongkzz/human_motion/blob/HEAD/scripts/Animation/motionAnimation.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":"e767841ab10a369a","code_sha256_prefix":"e767841ab10a369a","mcp_get_code":{"code_sha256":"e767841ab10a369a"}},{"arxiv_id":"1507.05717","arxiv_id_is_arxiv":true,"paper":"/paper/an-end-to-end-trainable-neural-network-for","title":"An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition","date":"2015-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nithyadurai87/pottan-ocr-tamil","path":"pottan_ocr/utils.py","file_url":"https://github.com/nithyadurai87/pottan-ocr-tamil/blob/HEAD/pottan_ocr/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":"1d4c2738c60c2109","code_sha256_prefix":"1d4c2738c60c2109","mcp_get_code":{"code_sha256":"1d4c2738c60c2109"}}],"record_sha256":"eb88de4e7d79fc50b5537ad035a4965bc390b584cc73e2b22c7f2838c8f94bce","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}