Home › Code › diff

diff

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

diff appears in the code Syntology harvested for 16 papers, as 13 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 16 papers, 11 with a sample that ran: 8 with a run with no instrument failure, 3 where every run was a failure of Syntology's instrument. 5 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named diff do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 13 distinct code bodies named diff: 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

1ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
2ran; the contract check could not run
6ran
4unverified
5fingerprinted

Licence is a property of each copy, so it is counted per place: 5 of the 16 places are pointer only (Syntology does not serve that copy's text); at 1 of them this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

16 papers shown of 16, newest first; 16 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 1 papers added by Syntology; 1 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Addressing Mark Imbalance in Integration-free Neural Marked Temporal Point Processes added by Syntology 2025-10 (from id) shchur/ifl-tpp/code/dpp/utils.py 202fb8a99152f9ef ran; the contract check could not run (RAISES) MIT (permissive)
Training Robust Graph Neural Networks by Modeling Noise Dependencies 27 Feb 2025 WtaoZhao/GraphGLOW/src/core/model_handler.py 29922ecc7c935e89 unverified no licence file found · pointer only
Generalization capabilities of MeshGraphNets to unseen geometries for fluid dynamics 12 Aug 2024 codebro634/modulus/modulus/constants.py bf73d1e709c9c2fb unverified Apache-2.0 (permissive)
The Lottery Ticket Hypothesis in Denoising: Towards Semantic-Driven Initialization 13 Dec 2023 UT-Mao/Initial-Noise-Construction/utils.py b0986a367362cc29 ran · honoured contract fingerprinted no licence file found · pointer only
I^3 Retriever: Incorporating Implicit Interaction in Pre-trained Language Models for Passage Retrieval 4 Jun 2023 kylrth/procedure-generation/dataset/LCStep/procedure_checks.py e3a718e66091d9b5 ran fingerprinted MIT (permissive)
Guided Image Synthesis via Initial Image Editing in Diffusion Model 5 May 2023 UT-Mao/Initial-Noise-Editing/utils.py b0986a367362cc29 ran · honoured contract fingerprinted no licence file found · pointer only
Modeling Inter-Dependence Between Time and Mark in Multivariate Temporal Point Processes 27 Oct 2022 waghmaregovind/joint_tpp/code/dpp/utils.py 202fb8a99152f9ef ran; the contract check could not run (RAISES) MIT (permissive)
Automated Crossword Solving 19 May 2022 albertkx/berkeley-crossword-solver/generate_demo_states.py 039616d0b2ba9038 ran MIT (permissive)
TOGA: A Neural Method for Test Oracle Generation 2021-09 (from id) microsoft/toga/model/ranking.py 9a5769855cf4c041 ran MIT (permissive)
Self-supervised Video Representation Learning Using Inter-intra Contrastive Framework 6 Aug 2020 BestJuly/IIC/train_ssl.py d98713247bf3d175 ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted no licence file found · pointer only
Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings 21 Jun 2020 hugochan/IDGL/src/core/model_handler.py 29922ecc7c935e89 unverified Apache-2.0 (permissive) here; the stored copy is pointer only
$p$-Norm Flow Diffusion for Local Graph Clustering 20 May 2020 kfoynt/LocalGraphClustering/localgraphclustering/algorithms/fista_dinput_dense.py 0eca415c135a6946 ran MIT (permissive)
Mixed-curvature Variational Autoencoders 19 Nov 2019 oskopek/mvae/mt/mvae/distributions/ars.py 81544b61f125ae3d ran fingerprinted Apache-2.0 (permissive)
Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders 17 Jan 2019 emilemathieu/pvae/pvae/distributions/ars.py 69c2938d5fbaa66e ran fingerprinted MIT (permissive)
CSRNet: Dilated Convolutional Neural Networks for Understanding the Highly Congested Scenes 27 Feb 2018 Saritus/Crowd-Counter/mat4conda.py 2e7c732fa310801f unverified MIT (permissive)
ACL Anthology id 2023.findings-emnlp.427 whyNLP/Conic10K/src/metric/metric/utils.py e54fba2c9f0af5ea unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections