{"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/get-pos","entry":"get_pos","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"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":1,"ran_fixture":0,"ran":2,"unverified":2},"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":"2010.12042","arxiv_id_is_arxiv":true,"paper":"/paper/saint-integrating-temporal-features-for-ednet","title":"SAINT+: Integrating Temporal Features for EdNet Correctness Prediction","date":"2020-10-19","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":"well_formed","behaviour_fingerprint":false,"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":"31d0bea1c5a0c6d5","code_sha256_prefix":"31d0bea1c5a0c6d5","mcp_get_code":{"code_sha256":"31d0bea1c5a0c6d5"}},{"arxiv_id":"2004.09984","arxiv_id_is_arxiv":true,"paper":"/paper/bert-attack-adversarial-attack-against-bert","title":"BERT-ATTACK: Adversarial Attack Against BERT Using BERT","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jind11/TextFooler","path":"attack_classification.py","file_url":"https://github.com/jind11/TextFooler/blob/HEAD/attack_classification.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":"ad632c9af117ee61","code_sha256_prefix":"ad632c9af117ee61","mcp_get_code":{"code_sha256":"ad632c9af117ee61"}},{"arxiv_id":"2003.12464","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-autonomous-driving-perception-with","title":"End-to-end Autonomous Driving Perception with Sequential Latent Representation Learning","date":"2020-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjy1992/gym-carla","path":"gym_carla/envs/misc.py","file_url":"https://github.com/cjy1992/gym-carla/blob/HEAD/gym_carla/envs/misc.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":"48de9d3f6175f0d0","code_sha256_prefix":"48de9d3f6175f0d0","mcp_get_code":{"code_sha256":"48de9d3f6175f0d0"}},{"arxiv_id":"2002.07033","arxiv_id_is_arxiv":true,"paper":"/paper/towards-an-appropriate-query-key-and-value","title":"Towards an Appropriate Query, Key, and Value Computation for Knowledge Tracing","date":"2020-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arshadshk/SAINT-pytorch","path":"saint.py","file_url":"https://github.com/arshadshk/SAINT-pytorch/blob/HEAD/saint.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, arshadshk/SAINT-pytorch when it was checked","code_sha256":"31d0bea1c5a0c6d5","code_sha256_prefix":"31d0bea1c5a0c6d5","mcp_get_code":{"code_sha256":"31d0bea1c5a0c6d5"}},{"arxiv_id":"1909.02177","arxiv_id_is_arxiv":true,"paper":"/paper/neural-rule-grounding-for-low-resource","title":"NERO: A Neural Rule Grounding Framework for Label-Efficient Relation Extraction","date":"2019-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"INK-USC/NERO","path":"util.py","file_url":"https://github.com/INK-USC/NERO/blob/HEAD/util.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":"0a1db6c62bc1e9d8","code_sha256_prefix":"0a1db6c62bc1e9d8","mcp_get_code":{"code_sha256":"0a1db6c62bc1e9d8"}},{"arxiv_id":"1611.08481","arxiv_id_is_arxiv":true,"paper":"/paper/guesswhat-visual-object-discovery-through","title":"GuessWhat?! Visual object discovery through multi-modal dialogue","date":"2016-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibrahimSouleiman/GuessWhat","path":"src/guesswhat/preprocess_data/create_dictionary.py","file_url":"https://github.com/ibrahimSouleiman/GuessWhat/blob/HEAD/src/guesswhat/preprocess_data/create_dictionary.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":"1dd7a41518293ddd","code_sha256_prefix":"1dd7a41518293ddd","mcp_get_code":{"code_sha256":"1dd7a41518293ddd"}},{"arxiv_id":"1609.09799","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-spectral-transportation-with","title":"Optimal spectral transportation with application to music transcription","date":"2016-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rflamary/OST","path":"demo_unmix.py","file_url":"https://github.com/rflamary/OST/blob/HEAD/demo_unmix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec5d60b1c75a2cfd","code_sha256_prefix":"ec5d60b1c75a2cfd","mcp_get_code":{"code_sha256":"ec5d60b1c75a2cfd"}}],"record_sha256":"f0b3f22d530de399d9fd1c96b0d34a26a2cff70830d90e4e681c926c98bdaf54","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}