{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/create-matrix","entry":"create_matrix","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"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":6,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":5,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":4,"unverified":1},"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","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b324b69b8260795c","mcp_get_code":{"code_sha256":"b324b69b8260795c"}},{"arxiv_id":"2601.08219","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":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"12a4b21b04d9144c","mcp_get_code":{"code_sha256":"12a4b21b04d9144c"}},{"arxiv_id":"2405.17507","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e79aa0cfb776ff4f","mcp_get_code":{"code_sha256":"e79aa0cfb776ff4f"}},{"arxiv_id":"2401.03138","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e79aa0cfb776ff4f","mcp_get_code":{"code_sha256":"e79aa0cfb776ff4f"}},{"arxiv_id":"2308.12221","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,"code_sha256_prefix":"d263c030f51f0c12","mcp_get_code":{"code_sha256":"d263c030f51f0c12"}},{"arxiv_id":"2308.12221","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,"code_sha256_prefix":"769e561b3b5a1434","mcp_get_code":{"code_sha256":"769e561b3b5a1434"}},{"arxiv_id":"2204.00406","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"5ca80dd9ebac4b4a","mcp_get_code":{"code_sha256":"5ca80dd9ebac4b4a"}},{"arxiv_id":"2001.01046","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,"code_sha256_prefix":"2166e183aeaa1c8e","mcp_get_code":{"code_sha256":"2166e183aeaa1c8e"}}]}