{"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/extract-path","entry":"extract_path","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":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"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":"2405.04950","paper":"/paper/visiongraph-leveraging-large-multimodal","title":"VisionGraph: Leveraging Large Multimodal Models for Graph Theory Problems in Visual Context","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitsz-tmg/visiongraph","path":"Evaluate/Evaluate_ChatGPT*.py","file_url":"https://github.com/hitsz-tmg/visiongraph/blob/HEAD/Evaluate/Evaluate_ChatGPT%2A.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"60b212bfdeb50359","mcp_get_code":{"code_sha256":"60b212bfdeb50359"}},{"arxiv_id":"2203.09283","paper":"/paper/panoformer-panorama-transformer-for-indoor","title":"PanoFormer: Panorama Transformer for Indoor 360 Depth Estimation","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhijieshen-bjtu/panoformer","path":"PanoFormer/common.py","file_url":"https://github.com/zhijieshen-bjtu/panoformer/blob/HEAD/PanoFormer/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a2f685cb7ea6a39","mcp_get_code":{"code_sha256":"6a2f685cb7ea6a39"}},{"arxiv_id":"2003.00430","paper":"/paper/a-hybrid-stochastic-policy-gradient-algorithm","title":"A Hybrid Stochastic Policy Gradient Algorithm for Reinforcement Learning","date":"2020-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unc-optimization/ProxHSPGA","path":"utils/utils.py","file_url":"https://github.com/unc-optimization/ProxHSPGA/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78f3b67c1b7a49ae","mcp_get_code":{"code_sha256":"78f3b67c1b7a49ae"}},{"arxiv_id":"1905.11068","paper":"/paper/value-iteration-networks-on-multiple-levels","title":"Value Iteration Networks on Multiple Levels of Abstraction","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIS-Bonn/abstract_vin","path":"utils.py","file_url":"https://github.com/AIS-Bonn/abstract_vin/blob/HEAD/utils.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":"09544ad183940e78","mcp_get_code":{"code_sha256":"09544ad183940e78"}},{"arxiv_id":"1811.01824","paper":"/paper/structured-neural-summarization","title":"Structured Neural Summarization","date":"2018-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CoderPat/structured-neural-summarization","path":"parsers/sourcecode/utils.py","file_url":"https://github.com/CoderPat/structured-neural-summarization/blob/HEAD/parsers/sourcecode/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c49b2997b2be692","mcp_get_code":{"code_sha256":"6c49b2997b2be692"}}]}