{"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/create-matrix","entry":"create_matrix","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":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"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":"2606.03794","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03794","title":"Limit Analysis of Graph Neural Networks with Wireless Conflict Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"romm32/rgg_transferability","path":"data_generation.py","file_url":"https://github.com/romm32/rgg_transferability/blob/HEAD/data_generation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, romm32/rgg_transferability when it was checked","code_sha256":"b324b69b8260795c","code_sha256_prefix":"b324b69b8260795c","mcp_get_code":{"code_sha256":"b324b69b8260795c"}},{"arxiv_id":"2601.08219","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-08219","title":"A Preliminary Agentic Framework for Matrix Deflation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Pie115/Agentic-Deflation","path":"Deflation/prompt_gemini.py","file_url":"https://github.com/Pie115/Agentic-Deflation/blob/HEAD/Deflation/prompt_gemini.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, Pie115/Agentic-Deflation when it was checked","code_sha256":"12a4b21b04d9144c","code_sha256_prefix":"12a4b21b04d9144c","mcp_get_code":{"code_sha256":"12a4b21b04d9144c"}},{"arxiv_id":"2405.17507","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-sustainable-urban-mobility","title":"Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cy07gn/TeltoMob","path":"Model/STGNN.py","file_url":"https://github.com/cy07gn/TeltoMob/blob/HEAD/Model/STGNN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cy07gn/TeltoMob when it was checked","code_sha256":"e79aa0cfb776ff4f","code_sha256_prefix":"e79aa0cfb776ff4f","mcp_get_code":{"code_sha256":"e79aa0cfb776ff4f"}},{"arxiv_id":"2401.03138","arxiv_id_is_arxiv":true,"paper":"/paper/teltrans-applying-multi-type-telecom-data-to","title":"TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cylin-cmlab/GCT-Prediction","path":"Model/s_facet.py","file_url":"https://github.com/cylin-cmlab/GCT-Prediction/blob/HEAD/Model/s_facet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cylin-cmlab/GCT-Prediction when it was checked","code_sha256":"e79aa0cfb776ff4f","code_sha256_prefix":"e79aa0cfb776ff4f","mcp_get_code":{"code_sha256":"e79aa0cfb776ff4f"}},{"arxiv_id":"2308.12221","arxiv_id_is_arxiv":true,"paper":"/paper/critical-learning-periods-emerge-even-in-deep","title":"Critical Learning Periods Emerge Even in Deep Linear Networks","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mjkleinman/criticalperioddeeplinearnets","path":"matrixcompletion/model_utils.py","file_url":"https://github.com/mjkleinman/criticalperioddeeplinearnets/blob/HEAD/matrixcompletion/model_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":"d263c030f51f0c12","code_sha256_prefix":"d263c030f51f0c12","mcp_get_code":{"code_sha256":"d263c030f51f0c12"}},{"arxiv_id":"2308.12221","arxiv_id_is_arxiv":true,"paper":"/paper/critical-learning-periods-emerge-even-in-deep","title":"Critical Learning Periods Emerge Even in Deep Linear Networks","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mjkleinman/criticalperioddeeplinearnets","path":"matrixcompletion/analytical_singular_vectors_and_sim.py","file_url":"https://github.com/mjkleinman/criticalperioddeeplinearnets/blob/HEAD/matrixcompletion/analytical_singular_vectors_and_sim.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":"769e561b3b5a1434","code_sha256_prefix":"769e561b3b5a1434","mcp_get_code":{"code_sha256":"769e561b3b5a1434"}},{"arxiv_id":"2204.00406","arxiv_id_is_arxiv":true,"paper":"/paper/a-semismooth-newton-stochastic-proximal-point","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabian-sp/snspp","path":"snspp/helper/data_generation.py","file_url":"https://github.com/fabian-sp/snspp/blob/HEAD/snspp/helper/data_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ca80dd9ebac4b4a","code_sha256_prefix":"5ca80dd9ebac4b4a","mcp_get_code":{"code_sha256":"5ca80dd9ebac4b4a"}},{"arxiv_id":"2001.01046","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-learned-loss-for-domain","title":"Adversarial-Learned Loss for Domain Adaptation","date":"2020-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZJULearning/ALDA","path":"loss.py","file_url":"https://github.com/ZJULearning/ALDA/blob/HEAD/loss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, ZJULearning/ALDA when it was checked","code_sha256":"2166e183aeaa1c8e","code_sha256_prefix":"2166e183aeaa1c8e","mcp_get_code":{"code_sha256":"2166e183aeaa1c8e"}}],"record_sha256":"b62ea8c7387992bf267c141d7089e22765674771a191974fb2aa14460661a539","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}