{"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/timing","entry":"timing","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":6,"n_papers_ran":3,"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":6,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"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":"2602.21788","paper":"/paper/arxiv-2602-21788","title":"Efficient Scaling of LLM Training with Flexible Context Parallelism","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ivanniu/FCP","path":"scheduler.py","file_url":"https://github.com/ivanniu/FCP/blob/HEAD/scheduler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3b2b0b026933db79","mcp_get_code":{"code_sha256":"3b2b0b026933db79"}},{"arxiv_id":"2403.05026","paper":"/paper/spectral-invariant-learning-for-dynamic-1","title":"Spectral Invariant Learning for Dynamic Graphs under Distribution Shifts","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/sild","path":"sild/utils/misc.py","file_url":"https://github.com/wondergo2017/sild/blob/HEAD/sild/utils/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5e4e8d3f54d33bac","mcp_get_code":{"code_sha256":"5e4e8d3f54d33bac"}},{"arxiv_id":"2311.13613","paper":"/paper/spanning-training-progress-temporal-dual","title":"Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxin-xd/Dataset-Pruning-TDDS","path":"utils.py","file_url":"https://github.com/zhangxin-xd/Dataset-Pruning-TDDS/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"56c1ad0817555115","mcp_get_code":{"code_sha256":"56c1ad0817555115"}},{"arxiv_id":"2002.05709","paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AndrewAtanov/simclr-pytorch","path":"utils/utils.py","file_url":"https://github.com/AndrewAtanov/simclr-pytorch/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d95614711e96832","mcp_get_code":{"code_sha256":"7d95614711e96832"}},{"arxiv_id":"1910.03193","paper":"/paper/deeponet-learning-nonlinear-operators-for","title":"DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pratikkakkar/deep-diff","path":"deepxde/maps/opnn.py","file_url":"https://github.com/pratikkakkar/deep-diff/blob/HEAD/deepxde/maps/opnn.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,"code_sha256_prefix":"5dd03692a81aa1da","mcp_get_code":{"code_sha256":"5dd03692a81aa1da"}},{"arxiv_id":"1903.01287","paper":"/paper/safety-verification-and-robustness-analysis","title":"Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming","date":"2019-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arobey1/RobustNN","path":"src/utils.py","file_url":"https://github.com/arobey1/RobustNN/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"56e27e3aa35366c2","mcp_get_code":{"code_sha256":"56e27e3aa35366c2"}}]}