{"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/is-square","entry":"is_square","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2404.05729","arxiv_id_is_arxiv":true,"paper":"/paper/finding-visual-task-vectors","title":"Finding Visual Task Vectors","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alhojel/visual_task_vectors","path":"evaluate/evaluate_reasoning.py","file_url":"https://github.com/alhojel/visual_task_vectors/blob/HEAD/evaluate/evaluate_reasoning.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, alhojel/visual_task_vectors when it was checked","code_sha256":"ce2513917f2cc4b5","code_sha256_prefix":"ce2513917f2cc4b5","mcp_get_code":{"code_sha256":"ce2513917f2cc4b5"}},{"arxiv_id":"2403.05645","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-neural-network-based-on-phase-space","title":"Geometric Neural Network based on Phase Space for BCI-EEG decoding","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carraraig/Phase-SPDNet","path":"PhaseSPDnet/Connectivities.py","file_url":"https://github.com/carraraig/Phase-SPDNet/blob/HEAD/PhaseSPDnet/Connectivities.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, carraraig/Phase-SPDNet when it was checked","code_sha256":"5f6a9fa7cdbfdb27","code_sha256_prefix":"5f6a9fa7cdbfdb27","mcp_get_code":{"code_sha256":"5f6a9fa7cdbfdb27"}},{"arxiv_id":"2311.03648","arxiv_id_is_arxiv":true,"paper":"/paper/instruct-me-more-random-prompting-for-visual","title":"Instruct Me More! Random Prompting for Visual In-Context Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackieam/inmemo","path":"evaluate/evaluate_reasoning.py","file_url":"https://github.com/jackieam/inmemo/blob/HEAD/evaluate/evaluate_reasoning.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, jackieam/inmemo when it was checked","code_sha256":"ce2513917f2cc4b5","code_sha256_prefix":"ce2513917f2cc4b5","mcp_get_code":{"code_sha256":"ce2513917f2cc4b5"}},{"arxiv_id":"2303.10834","arxiv_id_is_arxiv":true,"paper":"/paper/object-centric-slot-diffusion-1","title":"Object-Centric Slot Diffusion","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jindongjiang/latent-slot-diffusion","path":"src/models/slot_attn.py","file_url":"https://github.com/jindongjiang/latent-slot-diffusion/blob/HEAD/src/models/slot_attn.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":"c348f6b1a3946d1b","code_sha256_prefix":"c348f6b1a3946d1b","mcp_get_code":{"code_sha256":"c348f6b1a3946d1b"}},{"arxiv_id":"2301.13670","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-good-examples-for-visual-in-1","title":"What Makes Good Examples for Visual In-Context Learning?","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyuanhan-ai/visual_prompt_retrieval","path":"evaluate/evaluate_reasoning.py","file_url":"https://github.com/zhangyuanhan-ai/visual_prompt_retrieval/blob/HEAD/evaluate/evaluate_reasoning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (CC0-1.0), but get_code serves the stored copy, first harvested from alhojel/visual_task_vectors, and GitHub detected no licence in that repository when it was checked","code_sha256":"ce2513917f2cc4b5","code_sha256_prefix":"ce2513917f2cc4b5","mcp_get_code":{"code_sha256":"ce2513917f2cc4b5"}},{"arxiv_id":"2205.14334","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-models-to-express-their-uncertainty","title":"Teaching Models to Express Their Uncertainty in Words","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sylinrl/calibratedmath","path":"dataset.py","file_url":"https://github.com/sylinrl/calibratedmath/blob/HEAD/dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sylinrl/calibratedmath when it was checked","code_sha256":"81e3d6e064a6f6aa","code_sha256_prefix":"81e3d6e064a6f6aa","mcp_get_code":{"code_sha256":"81e3d6e064a6f6aa"}},{"arxiv_id":"1912.04958","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-improving-the-image-quality-of","title":"Analyzing and Improving the Image Quality of StyleGAN","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kerryvernebegeman/Kerry-Verne-Begeman","path":"train_resnet.py","file_url":"https://github.com/kerryvernebegeman/Kerry-Verne-Begeman/blob/HEAD/train_resnet.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":"a691acff20d5a466","code_sha256_prefix":"a691acff20d5a466","mcp_get_code":{"code_sha256":"a691acff20d5a466"}},{"arxiv_id":"1906.07538","arxiv_id_is_arxiv":true,"paper":"/paper/locate-size-and-count-accurately-resolving","title":"Locate, Size and Count: Accurately Resolving People in Dense Crowds via Detection","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/lsc-cnn","path":"utils/nms.py","file_url":"https://github.com/val-iisc/lsc-cnn/blob/HEAD/utils/nms.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":"925f23b10b193d5d","code_sha256_prefix":"925f23b10b193d5d","mcp_get_code":{"code_sha256":"925f23b10b193d5d"}}],"record_sha256":"b6519b92130c7b375c93d283a6f941791765c9e00458a759c27753b3cec94afd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}