{"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-batches","entry":"get_batches","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":12,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":12,"n_places_pointer_only":5,"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":3,"ran_fixture":0,"ran":5,"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":"2507.12075","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.12075","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"booknlp/booknlp","path":"booknlp/common/layered_reader.py","file_url":"https://github.com/booknlp/booknlp/blob/HEAD/booknlp/common/layered_reader.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":"e82b6bd0ee287315","code_sha256_prefix":"e82b6bd0ee287315","mcp_get_code":{"code_sha256":"e82b6bd0ee287315"}},{"arxiv_id":"2409.16554","arxiv_id_is_arxiv":true,"paper":"/paper/emit-event-based-masked-auto-encoding-for","title":"EMIT- Event-Based Masked Auto Encoding for Irregular Time Series","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrishi-ds/EMIT","path":"src/pretraining/pretrain_mimic.py","file_url":"https://github.com/hrishi-ds/EMIT/blob/HEAD/src/pretraining/pretrain_mimic.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":"1d91c0a1e3f11311","code_sha256_prefix":"1d91c0a1e3f11311","mcp_get_code":{"code_sha256":"1d91c0a1e3f11311"}},{"arxiv_id":"2306.05779","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-based-time-to-event-prediction","title":"Transformer-based Time-to-Event Prediction for Chronic Kidney Disease Deterioration","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dviraran/strafe","path":"prediction_preprocess.py","file_url":"https://github.com/dviraran/strafe/blob/HEAD/prediction_preprocess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, dviraran/strafe (NOASSERTION)","code_sha256":"e86ec096fad35866","code_sha256_prefix":"e86ec096fad35866","mcp_get_code":{"code_sha256":"e86ec096fad35866"}},{"arxiv_id":"2304.06116","arxiv_id_is_arxiv":true,"paper":"/paper/autoshot-a-short-video-dataset-and-state-of-1","title":"AutoShot: A Short Video Dataset and State-of-the-Art Shot Boundary Detection","date":"2023-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wentaozhu/AutoShot","path":"utils.py","file_url":"https://github.com/wentaozhu/AutoShot/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":"7d243f22f59049e3","code_sha256_prefix":"7d243f22f59049e3","mcp_get_code":{"code_sha256":"7d243f22f59049e3"}},{"arxiv_id":"2302.12431","arxiv_id_is_arxiv":true,"paper":"/paper/flexible-phase-dynamics-for-bio-plausible","title":"Flexible Phase Dynamics for Bio-Plausible Contrastive Learning","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zek3r/icml2023","path":"FF_EXP_ICML.py","file_url":"https://github.com/zek3r/icml2023/blob/HEAD/FF_EXP_ICML.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zek3r/icml2023 when it was checked","code_sha256":"0f16a3948f4388d1","code_sha256_prefix":"0f16a3948f4388d1","mcp_get_code":{"code_sha256":"0f16a3948f4388d1"}},{"arxiv_id":"2108.00104","arxiv_id_is_arxiv":true,"paper":"/paper/structural-guidance-for-transformer-language","title":"Structural Guidance for Transformer Language Models","date":"2021-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/transformers-struct-guidance","path":"src/lm.py","file_url":"https://github.com/IBM/transformers-struct-guidance/blob/HEAD/src/lm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec290339cc73f6e4","code_sha256_prefix":"ec290339cc73f6e4","mcp_get_code":{"code_sha256":"ec290339cc73f6e4"}},{"arxiv_id":"2010.02660","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-attackable-sentences-in-arguments","title":"Detecting Attackable Sentences in Arguments","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yohanjo/emnlp20_arg_attack","path":"src/clf_bert.py","file_url":"https://github.com/yohanjo/emnlp20_arg_attack/blob/HEAD/src/clf_bert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yohanjo/emnlp20_arg_attack when it was checked","code_sha256":"25ca511132d3d859","code_sha256_prefix":"25ca511132d3d859","mcp_get_code":{"code_sha256":"25ca511132d3d859"}},{"arxiv_id":"2008.04838","arxiv_id_is_arxiv":true,"paper":"/paper/transnet-v2-an-effective-deep-network","title":"TransNet V2: An effective deep network architecture for fast shot transition detection","date":"2020-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soCzech/TransNetV2","path":"training/evaluate.py","file_url":"https://github.com/soCzech/TransNetV2/blob/HEAD/training/evaluate.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":"7d243f22f59049e3","code_sha256_prefix":"7d243f22f59049e3","mcp_get_code":{"code_sha256":"7d243f22f59049e3"}},{"arxiv_id":"1908.08486","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-model-for-dialogue-coherence","title":"Dialogue Coherence Assessment Without Explicit Dialogue Act Labels","date":"2019-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/acl2020-dialogue-coherence-assessment","path":"data_preparation.py","file_url":"https://github.com/UKPLab/acl2020-dialogue-coherence-assessment/blob/HEAD/data_preparation.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":"85647999e99ebb92","code_sha256_prefix":"85647999e99ebb92","mcp_get_code":{"code_sha256":"85647999e99ebb92"}},{"arxiv_id":"1612.03651","arxiv_id_is_arxiv":true,"paper":"/paper/fasttextzip-compressing-text-classification","title":"FastText.zip: Compressing text classification models","date":"2016-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"cde234836e3f3978","code_sha256_prefix":"cde234836e3f3978","mcp_get_code":{"code_sha256":"cde234836e3f3978"}},{"arxiv_id":"1607.04606","arxiv_id_is_arxiv":true,"paper":"/paper/enriching-word-vectors-with-subword","title":"Enriching Word Vectors with Subword Information","date":"2016-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SarangShaikh201/fastText","path":"utils.py","file_url":"https://github.com/SarangShaikh201/fastText/blob/HEAD/utils.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, SarangShaikh201/fastText (NOASSERTION)","code_sha256":"cde234836e3f3978","code_sha256_prefix":"cde234836e3f3978","mcp_get_code":{"code_sha256":"cde234836e3f3978"}},{"arxiv_id":"aaai_30436","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_30436","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"vulus98/Rethinking-attention","path":"utils/simulator.py","file_url":"https://github.com/vulus98/Rethinking-attention/blob/HEAD/utils/simulator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aff0f75474f861cf","code_sha256_prefix":"aff0f75474f861cf","mcp_get_code":{"code_sha256":"aff0f75474f861cf"}}],"record_sha256":"365b3baf04a8db20f3fd3e47d867bee2dce5694ddfed5705eafe893c59854320","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}