{"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/evaluate-documents","entry":"evaluate_documents","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":0,"n_papers_ran_no_instrument_failure":0,"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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":4,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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":"2311.15941","arxiv_id_is_arxiv":true,"paper":"/paper/tell2design-a-dataset-for-language-guided","title":"Tell2Design: A Dataset for Language-Guided Floor Plan Generation","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lengsicong/tell2design","path":"T5/coreference_metrics.py","file_url":"https://github.com/lengsicong/tell2design/blob/HEAD/T5/coreference_metrics.py","status":"unverified","verification_level":0,"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, lengsicong/tell2design when it was checked","code_sha256":"44ea1242eeeb38ac","code_sha256_prefix":"44ea1242eeeb38ac","mcp_get_code":{"code_sha256":"44ea1242eeeb38ac"}},{"arxiv_id":"2311.03748","arxiv_id_is_arxiv":true,"paper":"/paper/unified-low-resource-sequence-labeling-by","title":"Unified Low-Resource Sequence Labeling by Sample-Aware Dynamic Sparse Finetuning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/fish-dip","path":"augment/coreference_metrics.py","file_url":"https://github.com/psunlpgroup/fish-dip/blob/HEAD/augment/coreference_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from lengsicong/tell2design, and GitHub detected no licence in that repository when it was checked","code_sha256":"44ea1242eeeb38ac","code_sha256_prefix":"44ea1242eeeb38ac","mcp_get_code":{"code_sha256":"44ea1242eeeb38ac"}},{"arxiv_id":"2310.13774","arxiv_id_is_arxiv":true,"paper":"/paper/seq2seq-is-all-you-need-for-coreference","title":"Seq2seq is All You Need for Coreference Resolution","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WenzhengZhang/Seq2seqCoref","path":"metrics.py","file_url":"https://github.com/WenzhengZhang/Seq2seqCoref/blob/HEAD/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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 lengsicong/tell2design, and GitHub detected no licence in that repository when it was checked","code_sha256":"44ea1242eeeb38ac","code_sha256_prefix":"44ea1242eeeb38ac","mcp_get_code":{"code_sha256":"44ea1242eeeb38ac"}},{"arxiv_id":"2205.10475","arxiv_id_is_arxiv":true,"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgraywang/deepstruct","path":"src/dataset_processing/coreference_metrics.py","file_url":"https://github.com/cgraywang/deepstruct/blob/HEAD/src/dataset_processing/coreference_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from lengsicong/tell2design, and GitHub detected no licence in that repository when it was checked","code_sha256":"44ea1242eeeb38ac","code_sha256_prefix":"44ea1242eeeb38ac","mcp_get_code":{"code_sha256":"44ea1242eeeb38ac"}},{"arxiv_id":"1804.05392","arxiv_id_is_arxiv":true,"paper":"/paper/higher-order-coreference-resolution-with","title":"Higher-order Coreference Resolution with Coarse-to-fine Inference","date":"2018-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Filter-Bubble/e2e-Dutch","path":"e2edutch/metrics.py","file_url":"https://github.com/Filter-Bubble/e2e-Dutch/blob/HEAD/e2edutch/metrics.py","status":"unverified","verification_level":0,"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":"fb091f0baeb8754b","code_sha256_prefix":"fb091f0baeb8754b","mcp_get_code":{"code_sha256":"fb091f0baeb8754b"}}],"record_sha256":"0910591abe086b56ed698f9607151c72eaabe1ce68d744069d6bb1847bcca35c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}