{"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/load-cfg","entry":"load_cfg","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":17,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":20,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":7,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":22,"n_places_pointer_only":11,"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":7,"ran_fixture":0,"ran":4,"unverified":9},"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":"2602.11882","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11882","title":"Where Bits Matter in World Model Planning: A Paired Mixed-Bit Study for Efficient Spatial Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suraj-ranganath/DINO-MBQuant","path":"experiments/aggregate.py","file_url":"https://github.com/suraj-ranganath/DINO-MBQuant/blob/HEAD/experiments/aggregate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suraj-ranganath/DINO-MBQuant when it was checked","code_sha256":"e4e4adb3a2fb6932","code_sha256_prefix":"e4e4adb3a2fb6932","mcp_get_code":{"code_sha256":"e4e4adb3a2fb6932"}},{"arxiv_id":"2602.11882","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11882","title":"Where Bits Matter in World Model Planning: A Paired Mixed-Bit Study for Efficient Spatial Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suraj-ranganath/DINO-MBQuant","path":"experiments/analyze_mixedbit_stats.py","file_url":"https://github.com/suraj-ranganath/DINO-MBQuant/blob/HEAD/experiments/analyze_mixedbit_stats.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suraj-ranganath/DINO-MBQuant when it was checked","code_sha256":"d1e10db6dd35f7cd","code_sha256_prefix":"d1e10db6dd35f7cd","mcp_get_code":{"code_sha256":"d1e10db6dd35f7cd"}},{"arxiv_id":"2602.11882","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11882","title":"Where Bits Matter in World Model Planning: A Paired Mixed-Bit Study for Efficient Spatial Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suraj-ranganath/DINO-MBQuant","path":"experiments/build_variants.py","file_url":"https://github.com/suraj-ranganath/DINO-MBQuant/blob/HEAD/experiments/build_variants.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suraj-ranganath/DINO-MBQuant when it was checked","code_sha256":"1c6bd1d9cc5b9738","code_sha256_prefix":"1c6bd1d9cc5b9738","mcp_get_code":{"code_sha256":"1c6bd1d9cc5b9738"}},{"arxiv_id":"2602.11882","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11882","title":"Where Bits Matter in World Model Planning: A Paired Mixed-Bit Study for Efficient Spatial Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suraj-ranganath/DINO-MBQuant","path":"experiments/make_bitsweep_figures.py","file_url":"https://github.com/suraj-ranganath/DINO-MBQuant/blob/HEAD/experiments/make_bitsweep_figures.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suraj-ranganath/DINO-MBQuant when it was checked","code_sha256":"62919d0f5626587b","code_sha256_prefix":"62919d0f5626587b","mcp_get_code":{"code_sha256":"62919d0f5626587b"}},{"arxiv_id":"2602.11882","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11882","title":"Where Bits Matter in World Model Planning: A Paired Mixed-Bit Study for Efficient Spatial Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suraj-ranganath/DINO-MBQuant","path":"experiments/make_figures.py","file_url":"https://github.com/suraj-ranganath/DINO-MBQuant/blob/HEAD/experiments/make_figures.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suraj-ranganath/DINO-MBQuant when it was checked","code_sha256":"221e01112098f15b","code_sha256_prefix":"221e01112098f15b","mcp_get_code":{"code_sha256":"221e01112098f15b"}},{"arxiv_id":"2601.20142","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20142","title":"Mind the Shift: Using Delta SSL Embeddings to Enhance Child ASR","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Zilai-WANG/Delta-Embedding-Fusion","path":"embed_fusion/utils.py","file_url":"https://github.com/Zilai-WANG/Delta-Embedding-Fusion/blob/HEAD/embed_fusion/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Zilai-WANG/Delta-Embedding-Fusion when it was checked","code_sha256":"471d1beb797e813d","code_sha256_prefix":"471d1beb797e813d","mcp_get_code":{"code_sha256":"471d1beb797e813d"}},{"arxiv_id":"2512.01428","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-01428","title":"Masked Symbol Modeling for Demodulation of Oversampled Baseband Communication Signals in Impulsive Noise-Dominated Channels","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"OguzBedir/Masked_Symbol_Modeling","path":"plot_metrics.py","file_url":"https://github.com/OguzBedir/Masked_Symbol_Modeling/blob/HEAD/plot_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, OguzBedir/Masked_Symbol_Modeling when it was checked","code_sha256":"265e36f5ea10846f","code_sha256_prefix":"265e36f5ea10846f","mcp_get_code":{"code_sha256":"265e36f5ea10846f"}},{"arxiv_id":"2410.08840","arxiv_id_is_arxiv":true,"paper":"/paper/learning-interaction-aware-3d-gaussian","title":"Learning Interaction-aware 3D Gaussian Splatting for One-shot Hand Avatars","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuanhuang0/guassianhand","path":"config.py","file_url":"https://github.com/xuanhuang0/guassianhand/blob/HEAD/config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xuanhuang0/guassianhand when it was checked","code_sha256":"43f1c2e1ad5b32d1","code_sha256_prefix":"43f1c2e1ad5b32d1","mcp_get_code":{"code_sha256":"43f1c2e1ad5b32d1"}},{"arxiv_id":"2405.12218","arxiv_id_is_arxiv":true,"paper":"/paper/fast-generalizable-gaussian-splatting","title":"MVSGaussian: Fast Generalizable Gaussian Splatting Reconstruction from Multi-View Stereo","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TQTQliu/MVSGaussian","path":"lib/config/yacs.py","file_url":"https://github.com/TQTQliu/MVSGaussian/blob/HEAD/lib/config/yacs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65d6513bc44b700c","code_sha256_prefix":"65d6513bc44b700c","mcp_get_code":{"code_sha256":"65d6513bc44b700c"}},{"arxiv_id":"2401.00979","arxiv_id_is_arxiv":true,"paper":"/paper/3d-visibility-aware-generalizable-neural","title":"3D Visibility-aware Generalizable Neural Radiance Fields for Interacting Hands","date":"2024-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuanhuang0/vanerf","path":"src/config.py","file_url":"https://github.com/xuanhuang0/vanerf/blob/HEAD/src/config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xuanhuang0/vanerf when it was checked","code_sha256":"43f1c2e1ad5b32d1","code_sha256_prefix":"43f1c2e1ad5b32d1","mcp_get_code":{"code_sha256":"43f1c2e1ad5b32d1"}},{"arxiv_id":"2311.14155","arxiv_id_is_arxiv":true,"paper":"/paper/gigapose-fast-and-robust-novel-object-pose","title":"GigaPose: Fast and Robust Novel Object Pose Estimation via One Correspondence","date":"2023-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nv-nguyen/gigapose","path":"src/custom_megapose/refiner_utils.py","file_url":"https://github.com/nv-nguyen/gigapose/blob/HEAD/src/custom_megapose/refiner_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6ef71ad09abc9d9","code_sha256_prefix":"b6ef71ad09abc9d9","mcp_get_code":{"code_sha256":"b6ef71ad09abc9d9"}},{"arxiv_id":"2310.08585","arxiv_id_is_arxiv":true,"paper":"/paper/im4d-high-fidelity-and-real-time-novel-view","title":"Im4D: High-Fidelity and Real-Time Novel View Synthesis for Dynamic Scenes","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zju3dv/im4d","path":"lib/config/yacs.py","file_url":"https://github.com/zju3dv/im4d/blob/HEAD/lib/config/yacs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zju3dv/im4d when it was checked","code_sha256":"65d6513bc44b700c","code_sha256_prefix":"65d6513bc44b700c","mcp_get_code":{"code_sha256":"65d6513bc44b700c"}},{"arxiv_id":"2309.12253","arxiv_id_is_arxiv":true,"paper":"/paper/salsa-clrs-a-sparse-and-scalable-benchmark","title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkminder/salsa-clrs","path":"baselines/core/config.py","file_url":"https://github.com/jkminder/salsa-clrs/blob/HEAD/baselines/core/config.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":"71ef340eac4c9808","code_sha256_prefix":"71ef340eac4c9808","mcp_get_code":{"code_sha256":"71ef340eac4c9808"}},{"arxiv_id":"2309.07918","arxiv_id_is_arxiv":true,"paper":"/paper/unified-human-scene-interaction-via-prompted","title":"Unified Human-Scene Interaction via Prompted Chain-of-Contacts","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openrobotlab/unihsi","path":"unihsi/utils/config.py","file_url":"https://github.com/openrobotlab/unihsi/blob/HEAD/unihsi/utils/config.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, openrobotlab/unihsi when it was checked","code_sha256":"eb655c1f24399d8c","code_sha256_prefix":"eb655c1f24399d8c","mcp_get_code":{"code_sha256":"eb655c1f24399d8c"}},{"arxiv_id":"2209.12890","arxiv_id_is_arxiv":true,"paper":"/paper/it-takes-two-learning-to-plan-for-human-robot","title":"It Takes Two: Learning to Plan for Human-Robot Cooperative Carrying","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleyng/cooperative_planner","path":"utils/vis.py","file_url":"https://github.com/eleyng/cooperative_planner/blob/HEAD/utils/vis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a62a926cd953718c","code_sha256_prefix":"a62a926cd953718c","mcp_get_code":{"code_sha256":"a62a926cd953718c"}},{"arxiv_id":"2209.12890","arxiv_id_is_arxiv":true,"paper":"/paper/it-takes-two-learning-to-plan-for-human-robot","title":"It Takes Two: Learning to Plan for Human-Robot Cooperative Carrying","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleyng/table-carrying-ai","path":"cooperative_transport/gym_table/envs/utils.py","file_url":"https://github.com/eleyng/table-carrying-ai/blob/HEAD/cooperative_transport/gym_table/envs/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b84672293599a617","code_sha256_prefix":"b84672293599a617","mcp_get_code":{"code_sha256":"b84672293599a617"}},{"arxiv_id":"2203.14402","arxiv_id_is_arxiv":true,"paper":"/paper/uv-volumes-for-real-time-rendering-of","title":"UV Volumes for Real-time Rendering of Editable Free-view Human Performance","date":"2022-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanegg/UV-Volumes","path":"lib/config/yacs.py","file_url":"https://github.com/fanegg/UV-Volumes/blob/HEAD/lib/config/yacs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97bdde621f4f33ec","code_sha256_prefix":"97bdde621f4f33ec","mcp_get_code":{"code_sha256":"97bdde621f4f33ec"}},{"arxiv_id":"2010.07494","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-deep-reinforcement-learning-with-1","title":"Knowledge Transfer in Multi-Task Deep Reinforcement Learning for Continuous Control","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuzhiyuan1528/KTM-DRL","path":"utils/preprocess.py","file_url":"https://github.com/xuzhiyuan1528/KTM-DRL/blob/HEAD/utils/preprocess.py","status":"ran","verification_level":1,"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":"8bd78f602d04bb93","code_sha256_prefix":"8bd78f602d04bb93","mcp_get_code":{"code_sha256":"8bd78f602d04bb93"}},{"arxiv_id":"2003.13678","arxiv_id_is_arxiv":true,"paper":"/paper/designing-network-design-spaces","title":"Designing Network Design Spaces","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alessiacosmos/Basic-RegNet-pytorch","path":"utils/parse_cfg.py","file_url":"https://github.com/Alessiacosmos/Basic-RegNet-pytorch/blob/HEAD/utils/parse_cfg.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":"de7df4cd7f7cb239","code_sha256_prefix":"de7df4cd7f7cb239","mcp_get_code":{"code_sha256":"de7df4cd7f7cb239"}},{"arxiv_id":"1912.02919","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-intrinsic-privacy-of-stochastic","title":"An Empirical Study on the Intrinsic Privacy of SGD","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/intrinsic-private-sgd","path":"aDPSGD/cfg_utils.py","file_url":"https://github.com/microsoft/intrinsic-private-sgd/blob/HEAD/aDPSGD/cfg_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af89613292776213","code_sha256_prefix":"af89613292776213","mcp_get_code":{"code_sha256":"af89613292776213"}},{"arxiv_id":"1904.08900","arxiv_id_is_arxiv":true,"paper":"/paper/190408900","title":"CornerNet-Lite: Efficient Keypoint Based Object Detection","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/CornerNet-Lite","path":"core/base.py","file_url":"https://github.com/princeton-vl/CornerNet-Lite/blob/HEAD/core/base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c98d51db76f717db","code_sha256_prefix":"c98d51db76f717db","mcp_get_code":{"code_sha256":"c98d51db76f717db"}},{"arxiv_id":"1903.01864","arxiv_id_is_arxiv":true,"paper":"/paper/frustum-convnet-sliding-frustums-to-aggregate","title":"Frustum ConvNet: Sliding Frustums to Aggregate Local Point-Wise Features for Amodal 3D Object Detection","date":"2019-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixinwang/frustum-convnet","path":"configs/config.py","file_url":"https://github.com/zhixinwang/frustum-convnet/blob/HEAD/configs/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a124059a5c42fe93","code_sha256_prefix":"a124059a5c42fe93","mcp_get_code":{"code_sha256":"a124059a5c42fe93"}}],"record_sha256":"10e8b4c1ac822b4ddf7a0209901df0daf498c4d34c7fc617dda51c8902d6a853","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}