{"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/time-function","entry":"time_function","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":5,"n_papers_ran_instrument_only":1,"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":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"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":1,"ran_fixture":0,"ran":3,"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":"2509.11937","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-11937","title":"MMORE: Massive Multimodal Open RAG & Extraction","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"swiss-ai/mmore","path":"src/mmore/profiler.py","file_url":"https://github.com/swiss-ai/mmore/blob/HEAD/src/mmore/profiler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f1a5d72ab15e48bc","code_sha256_prefix":"f1a5d72ab15e48bc","mcp_get_code":{"code_sha256":"f1a5d72ab15e48bc"}},{"arxiv_id":"2402.03300","arxiv_id_is_arxiv":true,"paper":"/paper/deepseekmath-pushing-the-limits-of","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yynil/rwkvinside","path":"rl/profiler.py","file_url":"https://github.com/yynil/rwkvinside/blob/HEAD/rl/profiler.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":"b016e9b55d3c8dad","code_sha256_prefix":"b016e9b55d3c8dad","mcp_get_code":{"code_sha256":"b016e9b55d3c8dad"}},{"arxiv_id":"2311.16054","arxiv_id_is_arxiv":true,"paper":"/paper/metric-space-magnitude-for-evaluating","title":"Metric Space Magnitude for Evaluating the Diversity of Latent Representations","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uoguelph-mlrg/GGM-metrics","path":"evaluation/gin_evaluation.py","file_url":"https://github.com/uoguelph-mlrg/GGM-metrics/blob/HEAD/evaluation/gin_evaluation.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":"9dbb5a4e5682531e","code_sha256_prefix":"9dbb5a4e5682531e","mcp_get_code":{"code_sha256":"9dbb5a4e5682531e"}},{"arxiv_id":"2305.04111","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-degree-guided-graph-generation","title":"Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling","date":"2023-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tufts-ml/graph-generation-EDGE","path":"eval_utils/evaluation/graph_structure_evaluation.py","file_url":"https://github.com/tufts-ml/graph-generation-EDGE/blob/HEAD/eval_utils/evaluation/graph_structure_evaluation.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":"9dbb5a4e5682531e","code_sha256_prefix":"9dbb5a4e5682531e","mcp_get_code":{"code_sha256":"9dbb5a4e5682531e"}},{"arxiv_id":"1902.00981","arxiv_id_is_arxiv":true,"paper":"/paper/learning-counterfactual-representations-for","title":"Learning Counterfactual Representations for Estimating Individual Dose-Response Curves","date":"2019-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d909b/drnet","path":"drnet/apps/util.py","file_url":"https://github.com/d909b/drnet/blob/HEAD/drnet/apps/util.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":"8d839b0d284d8c2e","code_sha256_prefix":"8d839b0d284d8c2e","mcp_get_code":{"code_sha256":"8d839b0d284d8c2e"}},{"arxiv_id":"1810.00656","arxiv_id_is_arxiv":true,"paper":"/paper/perfect-match-a-simple-method-for-learning","title":"Perfect Match: A Simple Method for Learning Representations For Counterfactual Inference With Neural Networks","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d909b/perfect_match","path":"perfect_match/apps/util.py","file_url":"https://github.com/d909b/perfect_match/blob/HEAD/perfect_match/apps/util.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":"8d839b0d284d8c2e","code_sha256_prefix":"8d839b0d284d8c2e","mcp_get_code":{"code_sha256":"8d839b0d284d8c2e"}},{"arxiv_id":"1807.09413","arxiv_id_is_arxiv":true,"paper":"/paper/3dfeat-net-weakly-supervised-local-3d","title":"3DFeat-Net: Weakly Supervised Local 3D Features for Point Cloud Registration","date":"2018-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzijian/3DFeatNet","path":"utils.py","file_url":"https://github.com/yewzijian/3DFeatNet/blob/HEAD/utils.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":"a3b6c16887fc456c","code_sha256_prefix":"a3b6c16887fc456c","mcp_get_code":{"code_sha256":"a3b6c16887fc456c"}}],"record_sha256":"a013de62eaa3e8e50afa6f5a2d88ba66cb5d17ce59c628e4a4ec5ce71feeb6e7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}