{"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/extractor","entry":"Extractor","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":3,"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":"2605.22898","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22898","title":"FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hedjrachid/FIRMA","path":"fibfl/fibfl.py","file_url":"https://github.com/Hedjrachid/FIRMA/blob/HEAD/fibfl/fibfl.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":"476612b54169f6ed","code_sha256_prefix":"476612b54169f6ed","mcp_get_code":{"code_sha256":"476612b54169f6ed"}},{"arxiv_id":"2411.07231","arxiv_id_is_arxiv":true,"paper":"/paper/watermark-anything-with-localized-messages","title":"Watermark Anything with Localized Messages","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/watermark-anything","path":"watermark_anything/models/wam.py","file_url":"https://github.com/facebookresearch/watermark-anything/blob/HEAD/watermark_anything/models/wam.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":"e3ec9af8c9ef9bee","code_sha256_prefix":"e3ec9af8c9ef9bee","mcp_get_code":{"code_sha256":"e3ec9af8c9ef9bee"}},{"arxiv_id":"2405.11874","arxiv_id_is_arxiv":true,"paper":"/paper/xfinder-robust-and-pinpoint-answer-extraction","title":"xFinder: Robust and Pinpoint Answer Extraction for Large Language Models","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iaar-shanghai/xfinder","path":"src/xfinder/modules/answer_extractor.py","file_url":"https://github.com/iaar-shanghai/xfinder/blob/HEAD/src/xfinder/modules/answer_extractor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, iaar-shanghai/xfinder (NOASSERTION)","code_sha256":"bc9453be7dc5d8fc","code_sha256_prefix":"bc9453be7dc5d8fc","mcp_get_code":{"code_sha256":"bc9453be7dc5d8fc"}},{"arxiv_id":"2101.09704","arxiv_id_is_arxiv":true,"paper":"/paper/does-head-label-help-for-long-tailed-multi","title":"Does Head Label Help for Long-Tailed Multi-Label Text Classification","date":"2021-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaolin1207/HTTN-master","path":"models.py","file_url":"https://github.com/xiaolin1207/HTTN-master/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiaolin1207/HTTN-master when it was checked","code_sha256":"09f494aa352ab09a","code_sha256_prefix":"09f494aa352ab09a","mcp_get_code":{"code_sha256":"09f494aa352ab09a"}},{"arxiv_id":"2002.00737","arxiv_id_is_arxiv":true,"paper":"/paper/are-pre-trained-language-models-aware-of-1","title":"Are Pre-trained Language Models Aware of Phrases? Simple but Strong Baselines for Grammar Induction","date":"2020-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galsang/trees_from_transformers","path":"utils/extractor.py","file_url":"https://github.com/galsang/trees_from_transformers/blob/HEAD/utils/extractor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, galsang/trees_from_transformers when it was checked","code_sha256":"b552943828bfdd21","code_sha256_prefix":"b552943828bfdd21","mcp_get_code":{"code_sha256":"b552943828bfdd21"}}],"record_sha256":"31acaf6af51dfc6382d3de47ab74c4f9cc33a19838263712fd9bf0897d514630","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}