{"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/create-indices","entry":"create_indices","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":7,"n_papers_ran":7,"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":6,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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":"2503.07511","paper":"/paper/pointvla-injecting-the-3d-world-into-vision","title":"PointVLA: Injecting the 3D World into Vision-Language-Action Models","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YanjieZe/Improved-3D-Diffusion-Policy","path":"Improved-3D-Diffusion-Policy/diffusion_policy_3d/common/sampler.py","file_url":"https://github.com/YanjieZe/Improved-3D-Diffusion-Policy/blob/HEAD/Improved-3D-Diffusion-Policy/diffusion_policy_3d/common/sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a16eab1dfc7ced0","mcp_get_code":{"code_sha256":"0a16eab1dfc7ced0"}},{"arxiv_id":"2403.03954","paper":"/paper/3d-diffusion-policy","title":"3D Diffusion Policy: Generalizable Visuomotor Policy Learning via Simple 3D Representations","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YanjieZe/3D-Diffusion-Policy","path":"3D-Diffusion-Policy/diffusion_policy_3d/common/sampler.py","file_url":"https://github.com/YanjieZe/3D-Diffusion-Policy/blob/HEAD/3D-Diffusion-Policy/diffusion_policy_3d/common/sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a16eab1dfc7ced0","mcp_get_code":{"code_sha256":"0a16eab1dfc7ced0"}},{"arxiv_id":"2403.03206","paper":"/paper/scaling-rectified-flow-transformers-for-high","title":"Scaling Rectified Flow Transformers for High-Resolution Image Synthesis","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hxixixh/adaflow","path":"adaflow/common/sampler.py","file_url":"https://github.com/hxixixh/adaflow/blob/HEAD/adaflow/common/sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a8760aa62907510c","mcp_get_code":{"code_sha256":"a8760aa62907510c"}},{"arxiv_id":"2402.05421","paper":"/paper/difftop-differentiable-trajectory","title":"DiffTORI: Differentiable Trajectory Optimization for Deep Reinforcement and Imitation Learning","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wkwan7/DiffTORI","path":"DiffTORI_IL_Metaworld/DiffTORI/diffusion_policy_3d/common/sampler.py","file_url":"https://github.com/wkwan7/DiffTORI/blob/HEAD/DiffTORI_IL_Metaworld/DiffTORI/diffusion_policy_3d/common/sampler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0a16eab1dfc7ced0","mcp_get_code":{"code_sha256":"0a16eab1dfc7ced0"}},{"arxiv_id":"2310.02954","paper":"/paper/dq-lore-dual-queries-with-low-rank","title":"DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4fun/dq-lore","path":"src/models/biencoder.py","file_url":"https://github.com/ai4fun/dq-lore/blob/HEAD/src/models/biencoder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fbb2083d3607d94f","mcp_get_code":{"code_sha256":"fbb2083d3607d94f"}},{"arxiv_id":"2302.05698","paper":"/paper/compositional-exemplars-for-in-context","title":"Compositional Exemplars for In-context Learning","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/icl-ceil","path":"src/models/biencoder.py","file_url":"https://github.com/hkunlp/icl-ceil/blob/HEAD/src/models/biencoder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6926ec521fecfeac","mcp_get_code":{"code_sha256":"6926ec521fecfeac"}},{"arxiv_id":"2206.09194","paper":"/paper/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/agginc-paper","path":"agginc/np.py","file_url":"https://github.com/antoninschrab/agginc-paper/blob/HEAD/agginc/np.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"752346c21d60e812","mcp_get_code":{"code_sha256":"752346c21d60e812"}},{"arxiv_id":"2206.09194","paper":"/paper/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/agginc-paper","path":"agginc/jax.py","file_url":"https://github.com/antoninschrab/agginc-paper/blob/HEAD/agginc/jax.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b94b433bd9c69435","mcp_get_code":{"code_sha256":"b94b433bd9c69435"}}]}