Home › Code › parse_line

parse_line

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.

parse_line appears in the code Syntology harvested for 17 papers, as 16 distinct code bodies found in 18 places (a place is one code body under one paper). Of the 17 papers, 16 with a sample that ran: 11 with a run with no instrument failure, 5 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 parse_line 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 16 distinct code bodies named parse_line: 15 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 1 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:

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

Licence is a property of each copy, so it is counted per place: 4 of the 18 places are pointer only (Syntology does not serve that copy's text). 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

17 papers shown of 17, newest first; 18 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; 2 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
UniDrive: Towards Universal Driving Perception Across Camera Configurations 17 Oct 2024 ywyeli/unidrive/create/nus_tool/draw_label.py e2413a47a9133772 ran · our draft was wrong MIT (permissive)
Fleet of Agents: Coordinated Problem Solving with Large Language Models 7 May 2024 au-clan/FoA/src/agents/crosswords.py b82c84ffb95b7fdc ran · our draft was wrong fingerprinted MIT (permissive)
Is Your LiDAR Placement Optimized for 3D Scene Understanding? 25 Mar 2024 ywyeli/place3d/nus_tool/draw_label.py e2413a47a9133772 ran · our draft was wrong MIT (permissive)
Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens 30 Jan 2024 liujch1998/infini-gram/pkg/infini_gram/indexing_v6.py dd167b0f64553a18 ran Apache-2.0 (permissive)
DistFormer: Enhancing Local and Global Features for Monocular Per-Object Distance Estimation 6 Jan 2024 apanariello4/DistFormer/dataset/get_gt.py d4d2238d0d97a50d ran · our draft was wrong MIT (permissive)
The 2022 n2c2/UW Shared Task on Extracting Social Determinants of Health 13 Jan 2023 romanows/sdoh-n2c2/n2c2_ss/brat.py 8f2772b7a56f802c unverified MIT recorded; this copy not marked cleared · pointer only
On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond 2022-09 (from id) stoianmihail/netzwerk/src/util.py b77562811e12351b ran MIT (permissive)
Transformer Language Models without Positional Encodings Still Learn Positional Information 30 Mar 2022 adihaviv/nopos/nopos_experiments/probe_generator/probe_generator_exp_analyser.py 230facb8e39690af ran MIT recorded; this copy not marked cleared · pointer only
Transformer Language Models without Positional Encodings Still Learn Positional Information 30 Mar 2022 adihaviv/nopos/nopos_experiments/shuffle_wikitext/shuffle_exp_analyser.py bfb204ebd31be12c ran fingerprinted MIT recorded; this copy not marked cleared · pointer only
Scaling Up Exact Neural Network Compression by ReLU Stability 15 Feb 2021 yuxwind/exactcompression/get_activation_patterns.py f745cdc193c5f937 ran · our draft was wrong fingerprinted no licence file found · pointer only
PolyLaneNet: Lane Estimation via Deep Polynomial Regression 23 Apr 2020 lucastabelini/PolyLaneNet/utils/plot_log.py a3d164c22a005dc7 ran MIT (permissive)
A Re-evaluation of Knowledge Graph Completion Methods 10 Nov 2019 svjan5/kg-reeval/CapsE/builddata_softplus.py e1642aeda2a336f1 ran Apache-2.0 (permissive)
VideoBERT: A Joint Model for Video and Language Representation Learning 3 Apr 2019 MDSKUL/MasterProject/stap2/process_text.py b550e40d1f477db6 ran fingerprinted MIT (permissive)
Bag of Freebies for Training Object Detection Neural Networks 11 Feb 2019 wizyoung/YOLOv3_TensorFlow/utils/data_utils.py 7a494e675e71f1f9 ran MIT (permissive)
ProteinNet: a standardized data set for machine learning of protein structure 1 Feb 2019 EricAlcaide/MiniFold/models/distance_pipeline/func_utils.py 9bc36923b2d9932e ran fingerprinted MIT (permissive)
A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization 13 Aug 2018 daiquocnguyen/CapsE/builddata_softplus.py e1642aeda2a336f1 ran Apache-2.0 (permissive)
IJCAI id ijcai2023_0772 gamarcad/paper-samba-code/analyzer.py 60b36ed7cb6e5528 ran MIT (permissive)
ACL Anthology id 2022.emnlp-main.727 gzerveas/CODER/create_memmaps.py 25d62f631111a8e3 ran BSD-3-Clause (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