{"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/calc-f1","entry":"calc_f1","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":4,"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":"2307.01453","arxiv_id_is_arxiv":true,"paper":"/paper/diverse-retrieval-augmented-in-context","title":"Diverse Retrieval-Augmented In-Context Learning for Dialogue State Tracking","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jlab-nlp/refpydst","path":"src/refpydst/error_analysis.py","file_url":"https://github.com/jlab-nlp/refpydst/blob/HEAD/src/refpydst/error_analysis.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":"7a6e63763ec9c11f","code_sha256_prefix":"7a6e63763ec9c11f","mcp_get_code":{"code_sha256":"7a6e63763ec9c11f"}},{"arxiv_id":"2109.07839","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-contrastive-learning-for-eeg","title":"Self-supervised Contrastive Learning for EEG-based Sleep Staging","date":"2021-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuejiang16/ssl-torch","path":"mit_utils.py","file_url":"https://github.com/xuejiang16/ssl-torch/blob/HEAD/mit_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":"55b92fba20e7d4dd","code_sha256_prefix":"55b92fba20e7d4dd","mcp_get_code":{"code_sha256":"55b92fba20e7d4dd"}},{"arxiv_id":"2105.04528","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-large-scale-real-time-gnn","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tedzhouhk/GCNP","path":"GNN/metric.py","file_url":"https://github.com/tedzhouhk/GCNP/blob/HEAD/GNN/metric.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":"abd93718f606fd86","code_sha256_prefix":"abd93718f606fd86","mcp_get_code":{"code_sha256":"abd93718f606fd86"}},{"arxiv_id":"1907.10903","arxiv_id_is_arxiv":true,"paper":"/paper/the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sandl99/KGraph","path":"graphsaint/metric.py","file_url":"https://github.com/sandl99/KGraph/blob/HEAD/graphsaint/metric.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":"abd93718f606fd86","code_sha256_prefix":"abd93718f606fd86","mcp_get_code":{"code_sha256":"abd93718f606fd86"}},{"arxiv_id":"1906.00591","arxiv_id_is_arxiv":true,"paper":"/paper/190600591","title":"Evaluating Gender Bias in Machine Translation","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michellekappl/mt_gender_german","path":"src/evaluate.py","file_url":"https://github.com/michellekappl/mt_gender_german/blob/HEAD/src/evaluate.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":"3f5e1cccce1aad43","code_sha256_prefix":"3f5e1cccce1aad43","mcp_get_code":{"code_sha256":"3f5e1cccce1aad43"}},{"arxiv_id":"1904.09981","arxiv_id_is_arxiv":true,"paper":"/paper/graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphNAS/GraphNAS-simple","path":"graphnas/utils/model_utils.py","file_url":"https://github.com/GraphNAS/GraphNAS-simple/blob/HEAD/graphnas/utils/model_utils.py","status":"ran","verification_level":1,"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":"217cd43d66baee23","code_sha256_prefix":"217cd43d66baee23","mcp_get_code":{"code_sha256":"217cd43d66baee23"}},{"arxiv_id":"2023.findings-acl.344","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.344","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jlab-nlp/RefPyDST","path":"src/refpydst/error_analysis.py","file_url":"https://github.com/jlab-nlp/RefPyDST/blob/HEAD/src/refpydst/error_analysis.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":"7a6e63763ec9c11f","code_sha256_prefix":"7a6e63763ec9c11f","mcp_get_code":{"code_sha256":"7a6e63763ec9c11f"}}],"record_sha256":"36ed3e046097e54b6a56d9cd893d2ae0d3020b4286c8f2021171461027cecc14","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}