{"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/sim","entry":"sim","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":5,"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":14,"n_samples_ran":13,"n_samples_constructed":1,"n_samples_ran_checked":8,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":10,"n_places":14,"n_places_pointer_only":4,"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":2,"ran":8,"unverified":1},"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":"2604.15998","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15998","title":"SCHK-HTC: SIBLING CONTRASTIVE LEARNING WITH HIERARCHICAL KNOWLEDGE-AWARE PROMPT TUNING FOR HIERARCHY TEXT CLASSIFICATION","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"happywinder/SCHK-HTC","path":"models/loss.py","file_url":"https://github.com/happywinder/SCHK-HTC/blob/HEAD/models/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, happywinder/SCHK-HTC when it was checked","code_sha256":"7f715d5aa1c04819","code_sha256_prefix":"7f715d5aa1c04819","mcp_get_code":{"code_sha256":"7f715d5aa1c04819"}},{"arxiv_id":"2506.15201","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.15201","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"JiayinXu5499/PSIC","path":"loss/prediction.py","file_url":"https://github.com/JiayinXu5499/PSIC/blob/HEAD/loss/prediction.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":"a814d2a4b8f6b306","code_sha256_prefix":"a814d2a4b8f6b306","mcp_get_code":{"code_sha256":"a814d2a4b8f6b306"}},{"arxiv_id":"2409.03203","arxiv_id_is_arxiv":true,"paper":"/paper/an-effective-deployment-of-diffusion-lm-for","title":"An Effective Deployment of Diffusion LM for Data Augmentation in Low-Resource Sentiment Classification","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohnnyChanV/DiffusionCLS","path":"Components/utils.py","file_url":"https://github.com/JohnnyChanV/DiffusionCLS/blob/HEAD/Components/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, JohnnyChanV/DiffusionCLS when it was checked","code_sha256":"0c5fdcc70ca54c26","code_sha256_prefix":"0c5fdcc70ca54c26","mcp_get_code":{"code_sha256":"0c5fdcc70ca54c26"}},{"arxiv_id":"2406.03358","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-quantile-estimation-and-regression","title":"Bayesian Quantile Estimation and Regression with Martingale Posteriors","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"edfong/qmp","path":"run_scripts/7.1_sim_qmp.py","file_url":"https://github.com/edfong/qmp/blob/HEAD/run_scripts/7.1_sim_qmp.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":"57c0abba4a8284ab","code_sha256_prefix":"57c0abba4a8284ab","mcp_get_code":{"code_sha256":"57c0abba4a8284ab"}},{"arxiv_id":"2405.14077","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-transform-dynamically-for-better","title":"Learning to Transform Dynamically for Better Adversarial Transferability","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhangAIPI/TransferAttack","path":"transferattack/input_transformation/l2t.py","file_url":"https://github.com/ZhangAIPI/TransferAttack/blob/HEAD/transferattack/input_transformation/l2t.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":"b7715794a192878f","code_sha256_prefix":"b7715794a192878f","mcp_get_code":{"code_sha256":"b7715794a192878f"}},{"arxiv_id":"2308.09663","arxiv_id_is_arxiv":true,"paper":"/paper/gigamae-generalizable-graph-masked","title":"GiGaMAE: Generalizable Graph Masked Autoencoder via Collaborative Latent Space Reconstruction","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sycny/gigamae","path":"main_lp.py","file_url":"https://github.com/sycny/gigamae/blob/HEAD/main_lp.py","status":"ran","verification_level":1,"contract_check":null,"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, sycny/gigamae when it was checked","code_sha256":"4eab2ff901bf063b","code_sha256_prefix":"4eab2ff901bf063b","mcp_get_code":{"code_sha256":"4eab2ff901bf063b"}},{"arxiv_id":"2301.01404","arxiv_id_is_arxiv":true,"paper":"/paper/neighbor-contrastive-learning-on-learnable","title":"Neighbor Contrastive Learning on Learnable Graph Augmentation","date":null,"month_inferred_from_arxiv_id":"2023-01","title_source":"archive","repo":"shenxiaocam/NCLA","path":"loss.py","file_url":"https://github.com/shenxiaocam/NCLA/blob/HEAD/loss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, shenxiaocam/NCLA when it was checked","code_sha256":"3edcf51cfd360829","code_sha256_prefix":"3edcf51cfd360829","mcp_get_code":{"code_sha256":"3edcf51cfd360829"}},{"arxiv_id":"2207.10941","arxiv_id_is_arxiv":true,"paper":"/paper/respecting-time-series-properties-makes-deep","title":"Respecting Time Series Properties Makes Deep Time Series Forecasting Perfect","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"origamisl/rtnet","path":"utils/tools.py","file_url":"https://github.com/origamisl/rtnet/blob/HEAD/utils/tools.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":"31a45e2deaa0cbea","code_sha256_prefix":"31a45e2deaa0cbea","mcp_get_code":{"code_sha256":"31a45e2deaa0cbea"}},{"arxiv_id":"2207.05584","arxiv_id_is_arxiv":true,"paper":"/paper/multi-behavior-hypergraph-enhanced","title":"Multi-Behavior Hypergraph-Enhanced Transformer for Sequential Recommendation","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuh-yang/mbht-kdd22","path":"recbole/model/sequential_recommender/mbht.py","file_url":"https://github.com/yuh-yang/mbht-kdd22/blob/HEAD/recbole/model/sequential_recommender/mbht.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"078ce5ce33f8bae0","code_sha256_prefix":"078ce5ce33f8bae0","mcp_get_code":{"code_sha256":"078ce5ce33f8bae0"}},{"arxiv_id":"2105.05682","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-contrastive-siamese-networks-for","title":"Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GRAND-Lab/MERIT","path":"net/merit.py","file_url":"https://github.com/GRAND-Lab/MERIT/blob/HEAD/net/merit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"612c07cec9743bd8","code_sha256_prefix":"612c07cec9743bd8","mcp_get_code":{"code_sha256":"612c07cec9743bd8"}},{"arxiv_id":"1906.06187","arxiv_id_is_arxiv":true,"paper":"/paper/nlprolog-reasoning-with-weak-unification-for-1","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonweber/nlprolog","path":"model.py","file_url":"https://github.com/leonweber/nlprolog/blob/HEAD/model.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":"a2e8d8ee2aa98330","code_sha256_prefix":"a2e8d8ee2aa98330","mcp_get_code":{"code_sha256":"a2e8d8ee2aa98330"}},{"arxiv_id":"1804.02767","arxiv_id_is_arxiv":true,"paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvxxx/mimuw-hats","path":"model/api/similarity.py","file_url":"https://github.com/mvxxx/mimuw-hats/blob/HEAD/model/api/similarity.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":"509c44b82896e66d","code_sha256_prefix":"509c44b82896e66d","mcp_get_code":{"code_sha256":"509c44b82896e66d"}},{"arxiv_id":"1301.3781","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-estimation-of-word-representations","title":"Efficient Estimation of Word Representations in Vector Space","date":"2013-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/socialed","path":"SocialED/detector/hcrc.py","file_url":"https://github.com/ringbdstack/socialed/blob/HEAD/SocialED/detector/hcrc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56d44f1f9b80ffe4","code_sha256_prefix":"56d44f1f9b80ffe4","mcp_get_code":{"code_sha256":"56d44f1f9b80ffe4"}},{"arxiv_id":"2022.findings-emnlp.341","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.341","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"vinhsuhi/JMAC","path":"JMAC_DBPv1/modules/finding/similarity.py","file_url":"https://github.com/vinhsuhi/JMAC/blob/HEAD/JMAC_DBPv1/modules/finding/similarity.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":"b9d38f87140da325","code_sha256_prefix":"b9d38f87140da325","mcp_get_code":{"code_sha256":"b9d38f87140da325"}}],"record_sha256":"95180f136b6685b02c713e51a94c9e977c98162de8dc9fe8e0be0aed61c7de94","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}