{"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/boolean-string","entry":"boolean_string","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":17,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":17,"n_papers_ran_instrument_only":0,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":14,"n_places_pointer_only_link_open":5,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":0},"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":"2603.07402","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07402","title":"Generalizing Linear Autoencoder Recommenders with Decoupled Expected Quadratic Loss","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"coderaBruce/DEQL","path":"world.py","file_url":"https://github.com/coderaBruce/DEQL/blob/HEAD/world.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from PruneTruong/GOCor, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2407.07304","arxiv_id_is_arxiv":true,"paper":"/paper/inference-performance-optimization-for-large","title":"Inference Performance Optimization for Large Language Models on CPUs","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intel/xfastertransformer","path":"serving/grpc_launcher/server.py","file_url":"https://github.com/intel/xfastertransformer/blob/HEAD/serving/grpc_launcher/server.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33860afb1aa4f561","code_sha256_prefix":"33860afb1aa4f561","mcp_get_code":{"code_sha256":"33860afb1aa4f561"}},{"arxiv_id":"2405.16486","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royzry98/moase-pytorch","path":"utils.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, royzry98/moase-pytorch when it was checked","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2310.09562","arxiv_id_is_arxiv":true,"paper":"/paper/does-clip-s-generalization-performance-mainly","title":"Does CLIP's Generalization Performance Mainly Stem from High Train-Test Similarity?","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","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":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2310.07289","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-factuality-a-comprehensive-evaluation","title":"Beyond Factuality: A Comprehensive Evaluation of Large Language Models as Knowledge Generators","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChanLiang/CONNER","path":"src/nq_validity.py","file_url":"https://github.com/ChanLiang/CONNER/blob/HEAD/src/nq_validity.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, ChanLiang/CONNER when it was checked","code_sha256":"a80ae8836c792809","code_sha256_prefix":"a80ae8836c792809","mcp_get_code":{"code_sha256":"a80ae8836c792809"}},{"arxiv_id":"2310.01468","arxiv_id_is_arxiv":true,"paper":"/paper/the-entity-deduction-arena-a-playground-for","title":"Probing the Multi-turn Planning Capabilities of LLMs via 20 Question Games","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-entity-deduction-arena","path":"utils.py","file_url":"https://github.com/apple/ml-entity-deduction-arena/blob/HEAD/utils.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, apple/ml-entity-deduction-arena when it was checked","code_sha256":"a80ae8836c792809","code_sha256_prefix":"a80ae8836c792809","mcp_get_code":{"code_sha256":"a80ae8836c792809"}},{"arxiv_id":"2305.15581","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-semantic-correspondence-using","title":"Unsupervised Semantic Correspondence Using Stable Diffusion","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-vision/LDM_correspondences","path":"utils/utils.py","file_url":"https://github.com/ubc-vision/LDM_correspondences/blob/HEAD/utils/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from PruneTruong/GOCor, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2010.08304","arxiv_id_is_arxiv":true,"paper":"/paper/neural-ordinary-differential-equations-for-1","title":"Neural Ordinary Differential Equations for Intervention Modeling","date":"2020-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eogns282/IMODE","path":"main_collision.py","file_url":"https://github.com/eogns282/IMODE/blob/HEAD/main_collision.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, eogns282/IMODE when it was checked","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2008.03525","arxiv_id_is_arxiv":true,"paper":"/paper/non-adversarial-imitation-learning-and-its","title":"Non-Adversarial Imitation Learning and its Connections to Adversarial Methods","date":"2020-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OlegArenz/O-NAIL","path":"common/utlis.py","file_url":"https://github.com/OlegArenz/O-NAIL/blob/HEAD/common/utlis.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from PruneTruong/GOCor, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2007.00295","arxiv_id_is_arxiv":true,"paper":"/paper/belief-propagation-neural-networks","title":"Belief Propagation Neural Networks","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","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":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"2006.11280","arxiv_id_is_arxiv":true,"paper":"/paper/self-pu-self-boosted-and-calibrated-positive","title":"Self-PU: Self Boosted and Calibrated Positive-Unlabeled Training","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAMU-VITA/Self-PU","path":"evaluation.py","file_url":"https://github.com/TAMU-VITA/Self-PU/blob/HEAD/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from PruneTruong/GOCor, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"1912.05524","arxiv_id_is_arxiv":true,"paper":"/paper/glu-net-global-local-universal-network-for","title":"GLU-Net: Global-Local Universal Network for Dense Flow and Correspondences","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PruneTruong/GOCor","path":"test_models.py","file_url":"https://github.com/PruneTruong/GOCor/blob/HEAD/test_models.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","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, PruneTruong/GOCor (NOASSERTION)","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"1910.12638","arxiv_id_is_arxiv":true,"paper":"/paper/mockingjay-unsupervised-speech-representation","title":"Mockingjay: Unsupervised Speech Representation Learning with Deep Bidirectional Transformer Encoders","date":"2019-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samirsahoo007/Audio-and-Speech-Processing","path":"preprocess.py","file_url":"https://github.com/samirsahoo007/Audio-and-Speech-Processing/blob/HEAD/preprocess.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":"f9694c7c35ca4ecf","code_sha256_prefix":"f9694c7c35ca4ecf","mcp_get_code":{"code_sha256":"f9694c7c35ca4ecf"}},{"arxiv_id":"1909.06092","arxiv_id_is_arxiv":true,"paper":"/paper/a-general-framework-for-implicit-and-explicit","title":"A General Framework for Implicit and Explicit Debiasing of Distributional Word Vector Spaces","date":"2019-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anlausch/debie","path":"exp_debiasnet_args.py","file_url":"https://github.com/anlausch/debie/blob/HEAD/exp_debiasnet_args.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, anlausch/debie when it was checked","code_sha256":"d481e95ca1390889","code_sha256_prefix":"d481e95ca1390889","mcp_get_code":{"code_sha256":"d481e95ca1390889"}},{"arxiv_id":"1908.09355","arxiv_id_is_arxiv":true,"paper":"/paper/patient-knowledge-distillation-for-bert-model","title":"Patient Knowledge Distillation for BERT Model Compression","date":"2019-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Daniel-H-99/Patient-Knowledge-Distillation","path":"src/argument_parser.py","file_url":"https://github.com/Daniel-H-99/Patient-Knowledge-Distillation/blob/HEAD/src/argument_parser.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, Daniel-H-99/Patient-Knowledge-Distillation, 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":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}},{"arxiv_id":"1906.00957","arxiv_id_is_arxiv":true,"paper":"/paper/symmetry-adapted-generation-of-3d-point-sets","title":"Symmetry-adapted generation of 3d point sets for the targeted discovery of molecules","date":"2019-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atomistic-machine-learning/G-SchNet","path":"utility_functions.py","file_url":"https://github.com/atomistic-machine-learning/G-SchNet/blob/HEAD/utility_functions.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":"9b980dbfd413d691","code_sha256_prefix":"9b980dbfd413d691","mcp_get_code":{"code_sha256":"9b980dbfd413d691"}},{"arxiv_id":"Sun_Pixel-level_Semantic_Correspondence_through_Layout-aware_Representation_Learning_and_Multi-scale_Matching_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_Pixel-level_Semantic_Correspondence_through_Layout-aware_Representation_Learning_and_Multi-scale_Matching_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YXSUNMADMAX/LPMFlow","path":"utils_training/utils.py","file_url":"https://github.com/YXSUNMADMAX/LPMFlow/blob/HEAD/utils_training/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from PruneTruong/GOCor, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"b1f9cebf0d177140","code_sha256_prefix":"b1f9cebf0d177140","mcp_get_code":{"code_sha256":"b1f9cebf0d177140"}}],"record_sha256":"02f528440779bf8727de9eb96fa4559e6d4cbeae08f8f0204e3d3268eea6b732","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}