{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/startup","entry":"startup","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":3,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2502.05171","paper":"/paper/scaling-up-test-time-compute-with-latent","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","date":"2025-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seal-rg/recurrent-pretraining","path":"finetuning_simple_example.py","file_url":"https://github.com/seal-rg/recurrent-pretraining/blob/HEAD/finetuning_simple_example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"78396767cd633b79","mcp_get_code":{"code_sha256":"78396767cd633b79"}},{"arxiv_id":"2106.10860","paper":"/paper/multiplying-matrices-without-multiplying","title":"Multiplying Matrices Without Multiplying","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joennlae/halutmatmul","path":".github/vast.ai/vast_ai_helper.py","file_url":"https://github.com/joennlae/halutmatmul/blob/HEAD/.github/vast.ai/vast_ai_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"080451f563966a56","mcp_get_code":{"code_sha256":"080451f563966a56"}},{"arxiv_id":"2103.01454","paper":"/paper/kernel-interpolation-for-scalable-online","title":"Kernel Interpolation for Scalable Online Gaussian Processes","date":"2021-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9e508d60e1dc44cc","mcp_get_code":{"code_sha256":"9e508d60e1dc44cc"}},{"arxiv_id":"1705.07131","paper":"/paper/streaming-sparse-gaussian-process","title":"Streaming Sparse Gaussian Process Approximations","date":"2017-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tyliu22/online_pacgp","path":"experiments/regression.py","file_url":"https://github.com/tyliu22/online_pacgp/blob/HEAD/experiments/regression.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9e508d60e1dc44cc","mcp_get_code":{"code_sha256":"9e508d60e1dc44cc"}},{"arxiv_id":"1503.01057","paper":"/paper/kernel-interpolation-for-scalable-structured","title":"Kernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)","date":"2015-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9e508d60e1dc44cc","mcp_get_code":{"code_sha256":"9e508d60e1dc44cc"}}]}