{"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/compute-angle","entry":"compute_angle","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":8,"n_papers_ran":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":8,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":7},"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":"2306.10168","paper":"/paper/beyond-geometry-comparing-the-temporal","title":"Beyond Geometry: Comparing the Temporal Structure of Computation in Neural Circuits with Dynamical Similarity Analysis","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitchellostrow/dsa","path":"DSA/simdist.py","file_url":"https://github.com/mitchellostrow/dsa/blob/HEAD/DSA/simdist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f619414f24f51acd","mcp_get_code":{"code_sha256":"f619414f24f51acd"}},{"arxiv_id":"2304.00423","paper":"/paper/geometric-constraints-improve-inference-of","title":"Geometric constraints improve inference of sparsely observed stochastic dynamics","date":"2023-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dimitra-maoutsa/geometric-path-augmentation-for-sdes","path":"NeurIPS_2022/plot_systematic_augmentations.py","file_url":"https://github.com/dimitra-maoutsa/geometric-path-augmentation-for-sdes/blob/HEAD/NeurIPS_2022/plot_systematic_augmentations.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"234753db8917a7e8","mcp_get_code":{"code_sha256":"234753db8917a7e8"}},{"arxiv_id":"2304.00423","paper":"/paper/geometric-constraints-improve-inference-of","title":"Geometric constraints improve inference of sparsely observed stochastic dynamics","date":"2023-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"2e79125cc163bf92","mcp_get_code":{"code_sha256":"2e79125cc163bf92"}},{"arxiv_id":"2301.08102","paper":"/paper/geometric-path-augmentation-for-inference-of","title":"Geometric path augmentation for inference of sparsely observed stochastic nonlinear systems","date":"2023-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dimitra-maoutsa/geometric-path-augmentation-for-sdes","path":"NeurIPS_2022/plot_systematic_augmentations.py","file_url":"https://github.com/dimitra-maoutsa/geometric-path-augmentation-for-sdes/blob/HEAD/NeurIPS_2022/plot_systematic_augmentations.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2e79125cc163bf92","mcp_get_code":{"code_sha256":"2e79125cc163bf92"}},{"arxiv_id":"2210.07681","paper":"/paper/quo-vadis-is-trajectory-forecasting-the-key","title":"Quo Vadis: Is Trajectory Forecasting the Key Towards Long-Term Multi-Object Tracking?","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dendorferpatrick/QuoVadis","path":"src/quovadis/bev_reconstruction/homography.py","file_url":"https://github.com/dendorferpatrick/QuoVadis/blob/HEAD/src/quovadis/bev_reconstruction/homography.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8962ff8234ffb527","mcp_get_code":{"code_sha256":"8962ff8234ffb527"}},{"arxiv_id":"2204.02337","paper":"/paper/multi-scale-representation-learning-on-1","title":"Multi-Scale Representation Learning on Proteins","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsomnath/holoprot","path":"holoprot/graphs/surface.py","file_url":"https://github.com/vsomnath/holoprot/blob/HEAD/holoprot/graphs/surface.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bd854a6cf535c1d","mcp_get_code":{"code_sha256":"5bd854a6cf535c1d"}},{"arxiv_id":"2011.00359","paper":"/paper/tartanvo-a-generalizable-learning-based-vo","title":"TartanVO: A Generalizable Learning-based VO","date":"2020-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castacks/tartanair_tools","path":"evaluation/evaluate_rpe.py","file_url":"https://github.com/castacks/tartanair_tools/blob/HEAD/evaluation/evaluate_rpe.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"3adee239c7da8370","mcp_get_code":{"code_sha256":"3adee239c7da8370"}},{"arxiv_id":"2003.14058","paper":"/paper/mtl-nas-task-agnostic-neural-architecture","title":"MTL-NAS: Task-Agnostic Neural Architecture Search towards General-Purpose Multi-Task Learning","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bhpfelix/MTLNAS","path":"core/utils/metrics.py","file_url":"https://github.com/bhpfelix/MTLNAS/blob/HEAD/core/utils/metrics.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":"27f37e43a9a8bf2a","mcp_get_code":{"code_sha256":"27f37e43a9a8bf2a"}},{"arxiv_id":"2003.00868","paper":"/paper/differentiable-molecular-simulations-for","title":"Differentiable Molecular Simulations for Control and Learning","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwang2/torchmd","path":"demo/fold.py","file_url":"https://github.com/wwang2/torchmd/blob/HEAD/demo/fold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5cf6994a9a6425de","mcp_get_code":{"code_sha256":"5cf6994a9a6425de"}}]}