{"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/rectangle","entry":"rectangle","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":3,"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":1,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":0},"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":"2604.14925","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14925","title":"Improving Sparse Autoencoder with Dynamic Attention","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"qyj-bkjx/Sparsemax-SAE","path":"src/sae_training/sparse_autoencoder.py","file_url":"https://github.com/qyj-bkjx/Sparsemax-SAE/blob/HEAD/src/sae_training/sparse_autoencoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab8a7e7ab1adad5a","code_sha256_prefix":"ab8a7e7ab1adad5a","mcp_get_code":{"code_sha256":"ab8a7e7ab1adad5a"}},{"arxiv_id":"2602.20330","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-20330","title":"Circuit Tracing in Vision-Language Models: Understanding the Internal Mechanisms of Multimodal Thinking","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"UIUC-MONET/vlm-circuit-tracing","path":"circuit_tracer_vlm/circuit_tracer/transcoder/cross_layer_transcoder.py","file_url":"https://github.com/UIUC-MONET/vlm-circuit-tracing/blob/HEAD/circuit_tracer_vlm/circuit_tracer/transcoder/cross_layer_transcoder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65c175e3a9b67f20","code_sha256_prefix":"65c175e3a9b67f20","mcp_get_code":{"code_sha256":"65c175e3a9b67f20"}},{"arxiv_id":"2503.01822","arxiv_id_is_arxiv":true,"paper":"/paper/projecting-assumptions-the-duality-between","title":"Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometry","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EkdeepSLubana/spadeFormalGrammars","path":"sae/saes.py","file_url":"https://github.com/EkdeepSLubana/spadeFormalGrammars/blob/HEAD/sae/saes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c06d045892ef607","code_sha256_prefix":"7c06d045892ef607","mcp_get_code":{"code_sha256":"7c06d045892ef607"}},{"arxiv_id":"2411.07122","arxiv_id_is_arxiv":true,"paper":"/paper/scar-sparse-conditioned-autoencoders-for","title":"SCAR: Sparse Conditioned Autoencoders for Concept Detection and Steering in LLMs","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/SCAR","path":"llama3_SAE/modeling_llama3_SAE.py","file_url":"https://github.com/ml-research/SCAR/blob/HEAD/llama3_SAE/modeling_llama3_SAE.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, ml-research/SCAR when it was checked","code_sha256":"468ae565cf4fb501","code_sha256_prefix":"468ae565cf4fb501","mcp_get_code":{"code_sha256":"468ae565cf4fb501"}},{"arxiv_id":"2310.03249","arxiv_id_is_arxiv":true,"paper":"/paper/can-large-language-models-be-good-path","title":"Can Large Language Models be Good Path Planners? A Benchmark and Investigation on Spatial-temporal Reasoning","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohamedaghzal/llms-as-path-planners","path":"gpt-4-path-planning/src/geometries.py","file_url":"https://github.com/mohamedaghzal/llms-as-path-planners/blob/HEAD/gpt-4-path-planning/src/geometries.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, mohamedaghzal/llms-as-path-planners when it was checked","code_sha256":"ba3aa7daeaf50708","code_sha256_prefix":"ba3aa7daeaf50708","mcp_get_code":{"code_sha256":"ba3aa7daeaf50708"}},{"arxiv_id":"2310.00105","arxiv_id_is_arxiv":true,"paper":"/paper/latent-space-symmetry-discovery","title":"Latent Space Symmetry Discovery","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiankeyang/laligan","path":"src/data_utils/double_bump.py","file_url":"https://github.com/jiankeyang/laligan/blob/HEAD/src/data_utils/double_bump.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiankeyang/laligan when it was checked","code_sha256":"3e819bf465cf2436","code_sha256_prefix":"3e819bf465cf2436","mcp_get_code":{"code_sha256":"3e819bf465cf2436"}},{"arxiv_id":"2307.13251","arxiv_id_is_arxiv":true,"paper":"/paper/gapro-box-supervised-3d-point-cloud-instance","title":"GaPro: Box-Supervised 3D Point Cloud Instance Segmentation Using Gaussian Processes as Pseudo Labelers","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/GaPro","path":"gapro/scannet_planes.py","file_url":"https://github.com/VinAIResearch/GaPro/blob/HEAD/gapro/scannet_planes.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"539f79ffe2705afc","code_sha256_prefix":"539f79ffe2705afc","mcp_get_code":{"code_sha256":"539f79ffe2705afc"}}],"record_sha256":"06c7e0c3dec8809af199165bfa68b7c31b4a044a8530bf11a438156683c0b535","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}