{"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/diff","entry":"diff","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":16,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":8,"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":13,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":5,"n_places":16,"n_places_pointer_only":5,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":6,"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":"2510.20414","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20414","title":"Addressing Mark Imbalance in Integration-free Neural Marked Temporal Point Processes","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"shchur/ifl-tpp","path":"code/dpp/utils.py","file_url":"https://github.com/shchur/ifl-tpp/blob/HEAD/code/dpp/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"202fb8a99152f9ef","code_sha256_prefix":"202fb8a99152f9ef","mcp_get_code":{"code_sha256":"202fb8a99152f9ef"}},{"arxiv_id":"2502.19670","arxiv_id_is_arxiv":true,"paper":"/paper/training-robust-graph-neural-networks-by","title":"Training Robust Graph Neural Networks by Modeling Noise Dependencies","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WtaoZhao/GraphGLOW","path":"src/core/model_handler.py","file_url":"https://github.com/WtaoZhao/GraphGLOW/blob/HEAD/src/core/model_handler.py","status":"unverified","verification_level":0,"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, WtaoZhao/GraphGLOW when it was checked","code_sha256":"29922ecc7c935e89","code_sha256_prefix":"29922ecc7c935e89","mcp_get_code":{"code_sha256":"29922ecc7c935e89"}},{"arxiv_id":"2408.06101","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-capabilities-of-meshgraphnets","title":"Generalization capabilities of MeshGraphNets to unseen geometries for fluid dynamics","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"codebro634/modulus","path":"modulus/constants.py","file_url":"https://github.com/codebro634/modulus/blob/HEAD/modulus/constants.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":"bf73d1e709c9c2fb","code_sha256_prefix":"bf73d1e709c9c2fb","mcp_get_code":{"code_sha256":"bf73d1e709c9c2fb"}},{"arxiv_id":"2312.08872","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-driven-initial-image-construction","title":"The Lottery Ticket Hypothesis in Denoising: Towards Semantic-Driven Initialization","date":"2023-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UT-Mao/Initial-Noise-Construction","path":"utils.py","file_url":"https://github.com/UT-Mao/Initial-Noise-Construction/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, UT-Mao/Initial-Noise-Construction when it was checked","code_sha256":"b0986a367362cc29","code_sha256_prefix":"b0986a367362cc29","mcp_get_code":{"code_sha256":"b0986a367362cc29"}},{"arxiv_id":"2306.02371","arxiv_id_is_arxiv":true,"paper":"/paper/i-3-retriever-incorporating-implicit","title":"I^3 Retriever: Incorporating Implicit Interaction in Pre-trained Language Models for Passage Retrieval","date":"2023-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kylrth/procedure-generation","path":"dataset/LCStep/procedure_checks.py","file_url":"https://github.com/kylrth/procedure-generation/blob/HEAD/dataset/LCStep/procedure_checks.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":"e3a718e66091d9b5","code_sha256_prefix":"e3a718e66091d9b5","mcp_get_code":{"code_sha256":"e3a718e66091d9b5"}},{"arxiv_id":"2305.03382","arxiv_id_is_arxiv":true,"paper":"/paper/guided-image-synthesis-via-initial-image","title":"Guided Image Synthesis via Initial Image Editing in Diffusion Model","date":"2023-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UT-Mao/Initial-Noise-Editing","path":"utils.py","file_url":"https://github.com/UT-Mao/Initial-Noise-Editing/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, UT-Mao/Initial-Noise-Editing when it was checked","code_sha256":"b0986a367362cc29","code_sha256_prefix":"b0986a367362cc29","mcp_get_code":{"code_sha256":"b0986a367362cc29"}},{"arxiv_id":"2210.15294","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-inter-dependence-between-time-and","title":"Modeling Inter-Dependence Between Time and Mark in Multivariate Temporal Point Processes","date":"2022-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waghmaregovind/joint_tpp","path":"code/dpp/utils.py","file_url":"https://github.com/waghmaregovind/joint_tpp/blob/HEAD/code/dpp/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"202fb8a99152f9ef","code_sha256_prefix":"202fb8a99152f9ef","mcp_get_code":{"code_sha256":"202fb8a99152f9ef"}},{"arxiv_id":"2205.09665","arxiv_id_is_arxiv":true,"paper":"/paper/automated-crossword-solving-1","title":"Automated Crossword Solving","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertkx/berkeley-crossword-solver","path":"generate_demo_states.py","file_url":"https://github.com/albertkx/berkeley-crossword-solver/blob/HEAD/generate_demo_states.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":"039616d0b2ba9038","code_sha256_prefix":"039616d0b2ba9038","mcp_get_code":{"code_sha256":"039616d0b2ba9038"}},{"arxiv_id":"2109.09262","arxiv_id_is_arxiv":true,"paper":"/paper/neural-unit-test-suggestions","title":"TOGA: A Neural Method for Test Oracle Generation","date":null,"month_inferred_from_arxiv_id":"2021-09","title_source":"archive","repo":"microsoft/toga","path":"model/ranking.py","file_url":"https://github.com/microsoft/toga/blob/HEAD/model/ranking.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":"9a5769855cf4c041","code_sha256_prefix":"9a5769855cf4c041","mcp_get_code":{"code_sha256":"9a5769855cf4c041"}},{"arxiv_id":"2008.02531","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-video-representation-learning-3","title":"Self-supervised Video Representation Learning Using Inter-intra Contrastive Framework","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BestJuly/IIC","path":"train_ssl.py","file_url":"https://github.com/BestJuly/IIC/blob/HEAD/train_ssl.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, BestJuly/IIC when it was checked","code_sha256":"d98713247bf3d175","code_sha256_prefix":"d98713247bf3d175","mcp_get_code":{"code_sha256":"d98713247bf3d175"}},{"arxiv_id":"2006.13009","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/IDGL","path":"src/core/model_handler.py","file_url":"https://github.com/hugochan/IDGL/blob/HEAD/src/core/model_handler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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 WtaoZhao/GraphGLOW, and GitHub detected no licence in that repository when it was checked","code_sha256":"29922ecc7c935e89","code_sha256_prefix":"29922ecc7c935e89","mcp_get_code":{"code_sha256":"29922ecc7c935e89"}},{"arxiv_id":"2005.09810","arxiv_id_is_arxiv":true,"paper":"/paper/p-norm-flow-diffusion-for-local-graph","title":"$p$-Norm Flow Diffusion for Local Graph Clustering","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kfoynt/LocalGraphClustering","path":"localgraphclustering/algorithms/fista_dinput_dense.py","file_url":"https://github.com/kfoynt/LocalGraphClustering/blob/HEAD/localgraphclustering/algorithms/fista_dinput_dense.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":"0eca415c135a6946","code_sha256_prefix":"0eca415c135a6946","mcp_get_code":{"code_sha256":"0eca415c135a6946"}},{"arxiv_id":"1911.08411","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-curvature-variational-autoencoders-1","title":"Mixed-curvature Variational Autoencoders","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oskopek/mvae","path":"mt/mvae/distributions/ars.py","file_url":"https://github.com/oskopek/mvae/blob/HEAD/mt/mvae/distributions/ars.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81544b61f125ae3d","code_sha256_prefix":"81544b61f125ae3d","mcp_get_code":{"code_sha256":"81544b61f125ae3d"}},{"arxiv_id":"1901.06033","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-representations-with-poincare","title":"Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders","date":"2019-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emilemathieu/pvae","path":"pvae/distributions/ars.py","file_url":"https://github.com/emilemathieu/pvae/blob/HEAD/pvae/distributions/ars.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":"69c2938d5fbaa66e","code_sha256_prefix":"69c2938d5fbaa66e","mcp_get_code":{"code_sha256":"69c2938d5fbaa66e"}},{"arxiv_id":"1802.10062","arxiv_id_is_arxiv":true,"paper":"/paper/csrnet-dilated-convolutional-neural-networks","title":"CSRNet: Dilated Convolutional Neural Networks for Understanding the Highly Congested Scenes","date":"2018-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Saritus/Crowd-Counter","path":"mat4conda.py","file_url":"https://github.com/Saritus/Crowd-Counter/blob/HEAD/mat4conda.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":"2e7c732fa310801f","code_sha256_prefix":"2e7c732fa310801f","mcp_get_code":{"code_sha256":"2e7c732fa310801f"}},{"arxiv_id":"2023.findings-emnlp.427","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.427","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"whyNLP/Conic10K","path":"src/metric/metric/utils.py","file_url":"https://github.com/whyNLP/Conic10K/blob/HEAD/src/metric/metric/utils.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":"e54fba2c9f0af5ea","code_sha256_prefix":"e54fba2c9f0af5ea","mcp_get_code":{"code_sha256":"e54fba2c9f0af5ea"}}],"record_sha256":"b0264acc73bb62bb7db0cbfeef00649866edbf2347348a55eb7a6b9e23f703d1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}