{"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-results","entry":"read_results","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":19,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":4,"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":18,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":23,"n_places_pointer_only":9,"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":2,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":10,"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":"2605.09236","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09236","title":"Matching Meaning at Scale: Evaluating Semantic Search for 18th-Century Intellectual History through the Case of Locke","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TurkuNLP/semantic-sim","path":"plot.py","file_url":"https://github.com/TurkuNLP/semantic-sim/blob/HEAD/plot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc60092f64f71a73","code_sha256_prefix":"cc60092f64f71a73","mcp_get_code":{"code_sha256":"cc60092f64f71a73"}},{"arxiv_id":"2408.11850","arxiv_id_is_arxiv":true,"paper":"/paper/parallel-speculative-decoding-with-adaptive","title":"Parallel Speculative Decoding with Adaptive Draft Length","date":"2024-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smart-lty/ParallelSpeculativeDecoding","path":"benchmark/eval_mgsm.py","file_url":"https://github.com/smart-lty/ParallelSpeculativeDecoding/blob/HEAD/benchmark/eval_mgsm.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, smart-lty/ParallelSpeculativeDecoding when it was checked","code_sha256":"fcb64b361ddd54aa","code_sha256_prefix":"fcb64b361ddd54aa","mcp_get_code":{"code_sha256":"fcb64b361ddd54aa"}},{"arxiv_id":"2408.11850","arxiv_id_is_arxiv":true,"paper":"/paper/parallel-speculative-decoding-with-adaptive","title":"Parallel Speculative Decoding with Adaptive Draft Length","date":"2024-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smart-lty/ParallelSpeculativeDecoding","path":"benchmark/eval_mt_bench.py","file_url":"https://github.com/smart-lty/ParallelSpeculativeDecoding/blob/HEAD/benchmark/eval_mt_bench.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, smart-lty/ParallelSpeculativeDecoding when it was checked","code_sha256":"9c206ca20df50d10","code_sha256_prefix":"9c206ca20df50d10","mcp_get_code":{"code_sha256":"9c206ca20df50d10"}},{"arxiv_id":"2406.06671","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-counterfactual-harm-in-decision","title":"Controlling Counterfactual Harm in Decision Support Systems Based on Prediction Sets","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Networks-Learning/controlling-counterfactual-harm-prediction-sets","path":"plotters/post_process_results.py","file_url":"https://github.com/Networks-Learning/controlling-counterfactual-harm-prediction-sets/blob/HEAD/plotters/post_process_results.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, Networks-Learning/controlling-counterfactual-harm-prediction-sets when it was checked","code_sha256":"3311d2ae356fee19","code_sha256_prefix":"3311d2ae356fee19","mcp_get_code":{"code_sha256":"3311d2ae356fee19"}},{"arxiv_id":"2401.09870","arxiv_id_is_arxiv":true,"paper":"/paper/reconciling-spatial-and-temporal-abstractions","title":"Reconciling Spatial and Temporal Abstractions for Goal Representation","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cosynus-lix/STAR","path":"plotting.py","file_url":"https://github.com/cosynus-lix/STAR/blob/HEAD/plotting.py","status":"unverified","verification_level":0,"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, cosynus-lix/STAR when it was checked","code_sha256":"edc704754c53dba1","code_sha256_prefix":"edc704754c53dba1","mcp_get_code":{"code_sha256":"edc704754c53dba1"}},{"arxiv_id":"2401.03385","arxiv_id_is_arxiv":true,"paper":"/paper/grimoire-is-all-you-need-for-enhancing-large","title":"Grimoire is All You Need for Enhancing Large Language Models","date":"2024-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iaar-shanghai/grimoire","path":"analyst.py","file_url":"https://github.com/iaar-shanghai/grimoire/blob/HEAD/analyst.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d8e7193d8cbfea4","code_sha256_prefix":"2d8e7193d8cbfea4","mcp_get_code":{"code_sha256":"2d8e7193d8cbfea4"}},{"arxiv_id":"2303.08233","arxiv_id_is_arxiv":true,"paper":"/paper/nl4opt-competition-formulating-optimization","title":"NL4Opt Competition: Formulating Optimization Problems Based on Their Natural Language Descriptions","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlpgroup/nl4opt-eq-generation","path":"read_results.py","file_url":"https://github.com/mlpgroup/nl4opt-eq-generation/blob/HEAD/read_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, mlpgroup/nl4opt-eq-generation, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5997a198542ccaa4","code_sha256_prefix":"5997a198542ccaa4","mcp_get_code":{"code_sha256":"5997a198542ccaa4"}},{"arxiv_id":"2301.04330","arxiv_id_is_arxiv":true,"paper":"/paper/fast-kinodynamic-planning-on-the-constraint","title":"Fast Kinodynamic Planning on the Constraint Manifold with Deep Neural Networks","date":"2023-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkicki/cnp-b","path":"plots_and_stats/plot_air_hockey_hitting_simulation.py","file_url":"https://github.com/pkicki/cnp-b/blob/HEAD/plots_and_stats/plot_air_hockey_hitting_simulation.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":"3228a3e8730d5ce2","code_sha256_prefix":"3228a3e8730d5ce2","mcp_get_code":{"code_sha256":"3228a3e8730d5ce2"}},{"arxiv_id":"2203.16634","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-language-models-without","title":"Transformer Language Models without Positional Encodings Still Learn Positional Information","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adihaviv/nopos","path":"nopos_experiments/shuffle_wikitext/shuffle_exp_analyser.py","file_url":"https://github.com/adihaviv/nopos/blob/HEAD/nopos_experiments/shuffle_wikitext/shuffle_exp_analyser.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, adihaviv/nopos, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"f973bb8b0e78c3ab","code_sha256_prefix":"f973bb8b0e78c3ab","mcp_get_code":{"code_sha256":"f973bb8b0e78c3ab"}},{"arxiv_id":"2203.16634","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-language-models-without","title":"Transformer Language Models without Positional Encodings Still Learn Positional Information","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adihaviv/nopos","path":"nopos_experiments/probe_generator/probe_generator_exp_analyser.py","file_url":"https://github.com/adihaviv/nopos/blob/HEAD/nopos_experiments/probe_generator/probe_generator_exp_analyser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, adihaviv/nopos, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"46241bdef17fae0a","code_sha256_prefix":"46241bdef17fae0a","mcp_get_code":{"code_sha256":"46241bdef17fae0a"}},{"arxiv_id":"2202.13514","arxiv_id_is_arxiv":true,"paper":"/paper/strongsort-make-deepsort-great-again","title":"StrongSORT: Make DeepSORT Great Again","date":"2022-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goksenin-uav/strongsort-pip","path":"strongsort/io.py","file_url":"https://github.com/goksenin-uav/strongsort-pip/blob/HEAD/strongsort/io.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":"1958a4fce355d7a6","code_sha256_prefix":"1958a4fce355d7a6","mcp_get_code":{"code_sha256":"1958a4fce355d7a6"}},{"arxiv_id":"2112.04888","arxiv_id_is_arxiv":true,"paper":"/paper/a-bilingual-openworld-video-text-dataset-and","title":"A Bilingual, OpenWorld Video Text Dataset and End-to-end Video Text Spotter with Transformer","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijiawu/BOVText-Benchmark","path":"Evaluation_Protocol/Task1_VideoTextTracking/tracking_utils/io.py","file_url":"https://github.com/weijiawu/BOVText-Benchmark/blob/HEAD/Evaluation_Protocol/Task1_VideoTextTracking/tracking_utils/io.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, weijiawu/BOVText-Benchmark, is not in the permissive set Syntology serves inline","code_sha256":"3b4276dfe539afa3","code_sha256_prefix":"3b4276dfe539afa3","mcp_get_code":{"code_sha256":"3b4276dfe539afa3"}},{"arxiv_id":"2110.08394","arxiv_id_is_arxiv":true,"paper":"/paper/adapt-to-adaptation-learning-personalization","title":"Adapt to Adaptation: Learning Personalization for Cross-Silo Federated Learning","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljaiverson/pfl-apple","path":"plot_results.py","file_url":"https://github.com/ljaiverson/pfl-apple/blob/HEAD/plot_results.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":"5adccbc662722d6a","code_sha256_prefix":"5adccbc662722d6a","mcp_get_code":{"code_sha256":"5adccbc662722d6a"}},{"arxiv_id":"2104.00487","arxiv_id_is_arxiv":true,"paper":"/paper/linear-semantics-in-generative-adversarial","title":"Linear Semantics in Generative Adversarial Networks","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AtlantixJJ/LinearGAN","path":"evaluate.py","file_url":"https://github.com/AtlantixJJ/LinearGAN/blob/HEAD/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":"a4df817ebb088365","code_sha256_prefix":"a4df817ebb088365","mcp_get_code":{"code_sha256":"a4df817ebb088365"}},{"arxiv_id":"2010.12138","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-competition-between-detection","title":"Rethinking the competition between detection and ReID in Multi-Object Tracking","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhongdao/Towards-Realtime-MOT","path":"utils/io.py","file_url":"https://github.com/Zhongdao/Towards-Realtime-MOT/blob/HEAD/utils/io.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":"1958a4fce355d7a6","code_sha256_prefix":"1958a4fce355d7a6","mcp_get_code":{"code_sha256":"1958a4fce355d7a6"}},{"arxiv_id":"2004.10934","arxiv_id_is_arxiv":true,"paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JisuHann/MEME-Tracking","path":"deep_sort_pytorch/utils/io.py","file_url":"https://github.com/JisuHann/MEME-Tracking/blob/HEAD/deep_sort_pytorch/utils/io.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":"1958a4fce355d7a6","code_sha256_prefix":"1958a4fce355d7a6","mcp_get_code":{"code_sha256":"1958a4fce355d7a6"}},{"arxiv_id":"2004.01888","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harsh2912/people-tracking","path":"src/lib/tracking_utils/io.py","file_url":"https://github.com/harsh2912/people-tracking/blob/HEAD/src/lib/tracking_utils/io.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":"1958a4fce355d7a6","code_sha256_prefix":"1958a4fce355d7a6","mcp_get_code":{"code_sha256":"1958a4fce355d7a6"}},{"arxiv_id":"2004.01888","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zengwbz/Face-Tracking-usingFairMOT","path":"src/lib/tracking_utils/io.py","file_url":"https://github.com/zengwbz/Face-Tracking-usingFairMOT/blob/HEAD/src/lib/tracking_utils/io.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":"06869f0ca6ac6c89","code_sha256_prefix":"06869f0ca6ac6c89","mcp_get_code":{"code_sha256":"06869f0ca6ac6c89"}},{"arxiv_id":"2002.03665","arxiv_id_is_arxiv":true,"paper":"/paper/anomalydae-dual-autoencoder-for-anomaly","title":"AnomalyDAE: Dual autoencoder for anomaly detection on attributed networks","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoyfan/AnomalyDAE","path":"src/utils.py","file_url":"https://github.com/haoyfan/AnomalyDAE/blob/HEAD/src/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":"15b42e9e4ecb7c9e","code_sha256_prefix":"15b42e9e4ecb7c9e","mcp_get_code":{"code_sha256":"15b42e9e4ecb7c9e"}},{"arxiv_id":"1909.12605","arxiv_id_is_arxiv":true,"paper":"/paper/towards-real-time-multi-object-tracking","title":"Towards Real-Time Multi-Object Tracking","date":"2019-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bellekci/Towards-Realtime-MOT-windows-py37","path":"utils/io.py","file_url":"https://github.com/bellekci/Towards-Realtime-MOT-windows-py37/blob/HEAD/utils/io.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":"1958a4fce355d7a6","code_sha256_prefix":"1958a4fce355d7a6","mcp_get_code":{"code_sha256":"1958a4fce355d7a6"}},{"arxiv_id":"1909.12605","arxiv_id_is_arxiv":true,"paper":"/paper/towards-real-time-multi-object-tracking","title":"Towards Real-Time Multi-Object Tracking","date":"2019-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LKLQQ/JDE","path":"src/io.py","file_url":"https://github.com/LKLQQ/JDE/blob/HEAD/src/io.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":"73a4841a44752305","code_sha256_prefix":"73a4841a44752305","mcp_get_code":{"code_sha256":"73a4841a44752305"}},{"arxiv_id":"1909.08333","arxiv_id_is_arxiv":true,"paper":"/paper/an-adaptive-parareal-algorithm","title":"An Adaptive Parareal Algorithm","date":null,"month_inferred_from_arxiv_id":"2019-09","title_source":"archive","repo":"olga-mula/parareal-adaptive","path":"study_performance.py","file_url":"https://github.com/olga-mula/parareal-adaptive/blob/HEAD/study_performance.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, olga-mula/parareal-adaptive, is not in the permissive set Syntology serves inline","code_sha256":"df03a964fb1b17f2","code_sha256_prefix":"df03a964fb1b17f2","mcp_get_code":{"code_sha256":"df03a964fb1b17f2"}},{"arxiv_id":"ijcai2022_0301","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2022_0301","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ljaiverson/pFL-APPLE","path":"plot_results.py","file_url":"https://github.com/ljaiverson/pFL-APPLE/blob/HEAD/plot_results.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":"5adccbc662722d6a","code_sha256_prefix":"5adccbc662722d6a","mcp_get_code":{"code_sha256":"5adccbc662722d6a"}}],"record_sha256":"67c9b8b3d4721ea8ce71f2189a0c007cec55281f4a7a141d28d8cc842e9f0b47","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}