{"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/is-valid-number","entry":"is_valid_number","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":5,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":5,"n_places_pointer_only":2,"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":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2602.02139","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02139","title":"EvoMU: Evolutionary Machine Unlearning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Batorskq/EvoMU","path":"summarize.py","file_url":"https://github.com/Batorskq/EvoMU/blob/HEAD/summarize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Batorskq/EvoMU when it was checked","code_sha256":"b1c76c6b9fe7e034","code_sha256_prefix":"b1c76c6b9fe7e034","mcp_get_code":{"code_sha256":"b1c76c6b9fe7e034"}},{"arxiv_id":"2505.17479","arxiv_id_is_arxiv":true,"paper":"/paper/twin-2k-500-a-dataset-for-building-digital","title":"Twin-2K-500: A dataset for building digital twins of over 2,000 people based on their answers to over 500 questions","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyipeng-lab/digital-twin-simulation","path":"text_simulation/postprocess_responses.py","file_url":"https://github.com/tianyipeng-lab/digital-twin-simulation/blob/HEAD/text_simulation/postprocess_responses.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":"c595d47b7e66dd4c","code_sha256_prefix":"c595d47b7e66dd4c","mcp_get_code":{"code_sha256":"c595d47b7e66dd4c"}},{"arxiv_id":"2407.14614","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-language-models-as-risk-scores","title":"Evaluating language models as risk scores","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"socialfoundations/folktexts","path":"folktexts/_utils.py","file_url":"https://github.com/socialfoundations/folktexts/blob/HEAD/folktexts/_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31ad435fddbf752e","code_sha256_prefix":"31ad435fddbf752e","mcp_get_code":{"code_sha256":"31ad435fddbf752e"}},{"arxiv_id":"2007.09115","arxiv_id_is_arxiv":true,"paper":"/paper/scale-equivariance-improves-siamese-tracking","title":"Scale Equivariance Improves Siamese Tracking","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isosnovik/SiamSE","path":"lib/core/function.py","file_url":"https://github.com/isosnovik/SiamSE/blob/HEAD/lib/core/function.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, isosnovik/SiamSE, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"253107dc24b4b2c4","code_sha256_prefix":"253107dc24b4b2c4","mcp_get_code":{"code_sha256":"253107dc24b4b2c4"}},{"arxiv_id":"1911.02116","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-cross-lingual-representation-1","title":"Unsupervised Cross-lingual Representation Learning at Scale","date":"2019-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martincjespersen/DaAnonymization","path":"textprivacy/utils.py","file_url":"https://github.com/martincjespersen/DaAnonymization/blob/HEAD/textprivacy/utils.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":"81d3a619bdd21b88","code_sha256_prefix":"81d3a619bdd21b88","mcp_get_code":{"code_sha256":"81d3a619bdd21b88"}}],"record_sha256":"c6923c44f4ea22ee4fa94a522611c298c6e7d4bf7e0ceaa1ca70d4eb0bcceb94","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}