{"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/cycle-index","entry":"cycle_index","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":9,"n_papers_ran_instrument_only":0,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":9,"n_places_pointer_only_link_open":3,"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":0,"ran":0,"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":"2605.29926","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29926","title":"A Triple-Modal Contrastive Learning Framework with Sequence, Graph, and 3D Features for Drug-Target Interaction Prediction","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"klez1/TriMod-DTI","path":"drugbank/model.py","file_url":"https://github.com/klez1/TriMod-DTI/blob/HEAD/drugbank/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from shen-lab/graphcl_automated, and GitHub detected no licence in that repository when it was checked","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2401.11360","arxiv_id_is_arxiv":true,"paper":"/paper/pepharmony-a-multi-view-contrastive-learning","title":"PepHarmony: A Multi-View Contrastive Learning Framework for Integrated Sequence and Structure-Based Peptide Encoding","date":"2024-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangruochi/pepharmony","path":"utils/loss.py","file_url":"https://github.com/zhangruochi/pepharmony/blob/HEAD/utils/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhangruochi/pepharmony when it was checked","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2312.10401","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-dimensional-rationale-in-graph","title":"Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspective","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byronji/drgcl","path":"TransferLearning/bio/pretrain_drgcl.py","file_url":"https://github.com/byronji/drgcl/blob/HEAD/TransferLearning/bio/pretrain_drgcl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, byronji/drgcl when it was checked","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2309.01788","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-grammar-induced-geometry-for","title":"Hierarchical Grammar-Induced Geometry for Data-Efficient Molecular Property Prediction","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmh14/Geo-DEG","path":"GCN/pretrain_contextpred.py","file_url":"https://github.com/gmh14/Geo-DEG/blob/HEAD/GCN/pretrain_contextpred.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from shen-lab/graphcl_automated, and GitHub detected no licence in that repository when it was checked","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2302.04611","arxiv_id_is_arxiv":true,"paper":"/paper/a-text-guided-protein-design-framework","title":"A Text-guided Protein Design Framework","date":"2023-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2212.10789","arxiv_id_is_arxiv":true,"paper":"/paper/multi-modal-molecule-structure-text-model-for","title":"Multi-modal Molecule Structure-text Model for Text-based Retrieval and Editing","date":"2022-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2106.07594","arxiv_id_is_arxiv":true,"paper":"/paper/graph-contrastive-learning-automated","title":"Graph Contrastive Learning Automated","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shen-lab/graphcl_automated","path":"transferLearning_MoleculeNet_PPI/bio/pretrain_joao.py","file_url":"https://github.com/shen-lab/graphcl_automated/blob/HEAD/transferLearning_MoleculeNet_PPI/bio/pretrain_joao.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shen-lab/graphcl_automated when it was checked","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"2010.13902","arxiv_id_is_arxiv":true,"paper":"/paper/graph-contrastive-learning-with-augmentations","title":"Graph Contrastive Learning with Augmentations","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}},{"arxiv_id":"1905.12265","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/pretrain-gnns","path":"bio/pretrain_contextpred.py","file_url":"https://github.com/snap-stanford/pretrain-gnns/blob/HEAD/bio/pretrain_contextpred.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from shen-lab/graphcl_automated, and GitHub detected no licence in that repository when it was checked","code_sha256":"b822dd00427403bf","code_sha256_prefix":"b822dd00427403bf","mcp_get_code":{"code_sha256":"b822dd00427403bf"}}],"record_sha256":"00305a82f7f494921b46ca00765c1dd1351af2e0d0e68baee4ec17ffa039481e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}