{"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/restore-model","entry":"restore_model","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":9,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"unverified":4},"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":"2509.01337","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-01337","title":"LLM-Guided Semantic Relational Reasoning for Multimodal Intent Recognition","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"thuiar/LGSRR","path":"utils/functions.py","file_url":"https://github.com/thuiar/LGSRR/blob/HEAD/utils/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":"f4e332ae47e0f422","code_sha256_prefix":"f4e332ae47e0f422","mcp_get_code":{"code_sha256":"f4e332ae47e0f422"}},{"arxiv_id":"2405.12775","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-multimodal-clustering-for","title":"Unsupervised Multimodal Clustering for Semantics Discovery in Multimodal Utterances","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuiar/UMC","path":"methods/unsupervised/UMC/manager.py","file_url":"https://github.com/thuiar/UMC/blob/HEAD/methods/unsupervised/UMC/manager.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, thuiar/UMC when it was checked","code_sha256":"c3474f708b4f59e6","code_sha256_prefix":"c3474f708b4f59e6","mcp_get_code":{"code_sha256":"c3474f708b4f59e6"}},{"arxiv_id":"2405.11618","arxiv_id_is_arxiv":true,"paper":"/paper/transcriptomics-guided-slide-representation","title":"Transcriptomics-guided Slide Representation Learning in Computational Pathology","date":"2024-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahmoodlab/tangle","path":"extract_slide_embeddings_from_checkpoint.py","file_url":"https://github.com/mahmoodlab/tangle/blob/HEAD/extract_slide_embeddings_from_checkpoint.py","status":"ran","verification_level":1,"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, mahmoodlab/tangle (NOASSERTION)","code_sha256":"6fbfbf2f5b75e23b","code_sha256_prefix":"6fbfbf2f5b75e23b","mcp_get_code":{"code_sha256":"6fbfbf2f5b75e23b"}},{"arxiv_id":"2403.10943","arxiv_id_is_arxiv":true,"paper":"/paper/mintrec2-0-a-large-scale-benchmark-dataset","title":"MIntRec2.0: A Large-scale Benchmark Dataset for Multimodal Intent Recognition and Out-of-scope Detection in Conversations","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuiar/mintrec2.0","path":"utils/functions.py","file_url":"https://github.com/thuiar/mintrec2.0/blob/HEAD/utils/functions.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, thuiar/mintrec2.0 when it was checked","code_sha256":"c25b59874b2d48aa","code_sha256_prefix":"c25b59874b2d48aa","mcp_get_code":{"code_sha256":"c25b59874b2d48aa"}},{"arxiv_id":"2312.14667","arxiv_id_is_arxiv":true,"paper":"/paper/token-level-contrastive-learning-with","title":"Token-Level Contrastive Learning with Modality-Aware Prompting for Multimodal Intent Recognition","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuiar/TCL-MAP","path":"utils/functions.py","file_url":"https://github.com/thuiar/TCL-MAP/blob/HEAD/utils/functions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 thuiar/mintrec2.0, and GitHub detected no licence in that repository when it was checked","code_sha256":"c25b59874b2d48aa","code_sha256_prefix":"c25b59874b2d48aa","mcp_get_code":{"code_sha256":"c25b59874b2d48aa"}},{"arxiv_id":"2205.13531","arxiv_id_is_arxiv":true,"paper":"/paper/training-relu-networks-to-high-uniform","title":"Learning ReLU networks to high uniform accuracy is intractable","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juliusberner/theory2practice","path":"theory2practice/experiments.py","file_url":"https://github.com/juliusberner/theory2practice/blob/HEAD/theory2practice/experiments.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":"055cc753611a64e8","code_sha256_prefix":"055cc753611a64e8","mcp_get_code":{"code_sha256":"055cc753611a64e8"}},{"arxiv_id":"2105.08683","arxiv_id_is_arxiv":true,"paper":"/paper/learning-embeddings-from-knowledge-graphs","title":"Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Accenture/AmpliGraph","path":"ampligraph/utils/model_utils.py","file_url":"https://github.com/Accenture/AmpliGraph/blob/HEAD/ampligraph/utils/model_utils.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":"eed65ab60f7570f8","code_sha256_prefix":"eed65ab60f7570f8","mcp_get_code":{"code_sha256":"eed65ab60f7570f8"}},{"arxiv_id":"2005.13420","arxiv_id_is_arxiv":true,"paper":"/paper/discretize-optimize-vs-optimize-discretize","title":"Discretize-Optimize vs. Optimize-Discretize for Time-Series Regression and Continuous Normalizing Flows","date":"2020-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EmoryMLIP/DOvsOD_NeuralODEs","path":"cnf_python/train_tabular.py","file_url":"https://github.com/EmoryMLIP/DOvsOD_NeuralODEs/blob/HEAD/cnf_python/train_tabular.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":"1e9dc985e40ee0fd","code_sha256_prefix":"1e9dc985e40ee0fd","mcp_get_code":{"code_sha256":"1e9dc985e40ee0fd"}},{"arxiv_id":"1805.05492","arxiv_id_is_arxiv":true,"paper":"/paper/did-the-model-understand-the-question","title":"Did the Model Understand the Question?","date":"2018-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pramodkaushik/np_analysis","path":"neural_programmer/notebook_utils.py","file_url":"https://github.com/pramodkaushik/np_analysis/blob/HEAD/neural_programmer/notebook_utils.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":"f74d08d012c8804a","code_sha256_prefix":"f74d08d012c8804a","mcp_get_code":{"code_sha256":"f74d08d012c8804a"}}],"record_sha256":"9b797b39ee5a82105abfe567037dbae2073cc86f12fd61febf1670bab144f14e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}