{"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/get-relative-path","entry":"get_relative_path","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":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":2,"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":0,"ran_violates":0,"ran_draft_wrong":3,"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":"2609.13778","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13778","title":"GEAR: From Dynamic Encoding to Dynamic Activation in Social Trajectory Prediction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"11isnotavailable/GEAR","path":"Re_cp/qpid/utils.py","file_url":"https://github.com/11isnotavailable/GEAR/blob/HEAD/Re_cp/qpid/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, 11isnotavailable/GEAR when it was checked","code_sha256":"d0ba1f482c4fa796","code_sha256_prefix":"d0ba1f482c4fa796","mcp_get_code":{"code_sha256":"d0ba1f482c4fa796"}},{"arxiv_id":"2608.05673","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05673","title":"A Unified Framework for Trajectory Prediction with Explicit Planning and Reaction Decomposition","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"11isnotavailable/INTraJ","path":"qpid/utils.py","file_url":"https://github.com/11isnotavailable/INTraJ/blob/HEAD/qpid/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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, 11isnotavailable/INTraJ, is not in the permissive set Syntology serves inline","code_sha256":"d0ba1f482c4fa796","code_sha256_prefix":"d0ba1f482c4fa796","mcp_get_code":{"code_sha256":"d0ba1f482c4fa796"}},{"arxiv_id":"2604.05635","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-05635","title":"From Uniform to Learned Knots: A Study of Spline-Based Numerical Encodings for Tabular Deep Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"mkumar73/tdl-numerical-encodings","path":"src/logger.py","file_url":"https://github.com/mkumar73/tdl-numerical-encodings/blob/HEAD/src/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16a3f13287bc232e","code_sha256_prefix":"16a3f13287bc232e","mcp_get_code":{"code_sha256":"16a3f13287bc232e"}},{"arxiv_id":"2601.22816","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22816","title":"Cascaded Flow Matching for Heterogeneous Tabular Data with Mixed-Type Features","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"yandex-research/tab-ddpm","path":"lib/env.py","file_url":"https://github.com/yandex-research/tab-ddpm/blob/HEAD/lib/env.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"170e57097113c6f4","code_sha256_prefix":"170e57097113c6f4","mcp_get_code":{"code_sha256":"170e57097113c6f4"}},{"arxiv_id":"2410.20626","arxiv_id_is_arxiv":true,"paper":"/paper/tabdiff-a-multi-modal-diffusion-model-for","title":"TabDiff: a Multi-Modal Diffusion Model for Tabular Data Generation","date":"2024-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/tabdiff","path":"src/env.py","file_url":"https://github.com/minkaixu/tabdiff/blob/HEAD/src/env.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"170e57097113c6f4","code_sha256_prefix":"170e57097113c6f4","mcp_get_code":{"code_sha256":"170e57097113c6f4"}},{"arxiv_id":"2211.16887","arxiv_id_is_arxiv":true,"paper":"/paper/t2g-former-organizing-tabular-features-into","title":"T2G-Former: Organizing Tabular Features into Relation Graphs Promotes Heterogeneous Feature Interaction","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyansir/t2g-former","path":"lib/env.py","file_url":"https://github.com/jyansir/t2g-former/blob/HEAD/lib/env.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":"a87e397491124834","code_sha256_prefix":"a87e397491124834","mcp_get_code":{"code_sha256":"a87e397491124834"}},{"arxiv_id":"2209.15421","arxiv_id_is_arxiv":true,"paper":"/paper/tabddpm-modelling-tabular-data-with-diffusion","title":"TabDDPM: Modelling Tabular Data with Diffusion Models","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rotot0/tab-ddpm","path":"lib/env.py","file_url":"https://github.com/rotot0/tab-ddpm/blob/HEAD/lib/env.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"170e57097113c6f4","code_sha256_prefix":"170e57097113c6f4","mcp_get_code":{"code_sha256":"170e57097113c6f4"}},{"arxiv_id":"2009.10588","arxiv_id_is_arxiv":true,"paper":"/paper/anomalous-diffusion-dynamics-of-learning-in","title":"Anomalous diffusion dynamics of learning in deep neural networks","date":"2020-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ifgovh/Anomalous-diffusion-dynamics-of-SGD","path":"dataloader.py","file_url":"https://github.com/ifgovh/Anomalous-diffusion-dynamics-of-SGD/blob/HEAD/dataloader.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":"028de37884922bbd","code_sha256_prefix":"028de37884922bbd","mcp_get_code":{"code_sha256":"028de37884922bbd"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vivswan/ECE-3195-Course-Project","path":"src/path_functions.py","file_url":"https://github.com/Vivswan/ECE-3195-Course-Project/blob/HEAD/src/path_functions.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":"6205a6fa46293aa8","code_sha256_prefix":"6205a6fa46293aa8","mcp_get_code":{"code_sha256":"6205a6fa46293aa8"}}],"record_sha256":"c6f12c9bcddeb035fbfb0450edc3473d39097fcfd82a0668cd612e130a2696c1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}