{"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/int-tuple","entry":"int_tuple","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2408.09051","arxiv_id_is_arxiv":true,"paper":"/paper/ai-assisted-super-resolution-cosmological-3","title":"AI-assisted super-resolution cosmological simulations IV: An emulator for deterministic realizations","date":null,"month_inferred_from_arxiv_id":"2024-08","title_source":"archive","repo":"xwzhang98/SREmulator","path":"map2map/map2map/args.py","file_url":"https://github.com/xwzhang98/SREmulator/blob/HEAD/map2map/map2map/args.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, xwzhang98/SREmulator when it was checked","code_sha256":"f7edc53fab359043","code_sha256_prefix":"f7edc53fab359043","mcp_get_code":{"code_sha256":"f7edc53fab359043"}},{"arxiv_id":"2304.01529","arxiv_id_is_arxiv":true,"paper":"/paper/iterativepfn-true-iterative-point-cloud","title":"IterativePFN: True Iterative Point Cloud Filtering","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddsediri/IterativePFN","path":"utils/misc.py","file_url":"https://github.com/ddsediri/IterativePFN/blob/HEAD/utils/misc.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":"970334367a29c358","code_sha256_prefix":"970334367a29c358","mcp_get_code":{"code_sha256":"970334367a29c358"}},{"arxiv_id":"2111.14820","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-and-adaptive-motion","title":"Towards Robust and Adaptive Motion Forecasting: A Causal Representation Perspective","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/causalmotion","path":"spurious/utils.py","file_url":"https://github.com/vita-epfl/causalmotion/blob/HEAD/spurious/utils.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":"c7a0b110ef7c5e03","code_sha256_prefix":"c7a0b110ef7c5e03","mcp_get_code":{"code_sha256":"c7a0b110ef7c5e03"}},{"arxiv_id":"1909.05379","arxiv_id_is_arxiv":true,"paper":"/paper/specifying-object-attributes-and-relations-in","title":"Specifying Object Attributes and Relations in Interactive Scene Generation","date":"2019-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashual/scene_generation","path":"scene_generation/utils.py","file_url":"https://github.com/ashual/scene_generation/blob/HEAD/scene_generation/utils.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":"c7a0b110ef7c5e03","code_sha256_prefix":"c7a0b110ef7c5e03","mcp_get_code":{"code_sha256":"c7a0b110ef7c5e03"}},{"arxiv_id":"1804.01622","arxiv_id_is_arxiv":true,"paper":"/paper/image-generation-from-scene-graphs","title":"Image Generation from Scene Graphs","date":"2018-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/sg2im","path":"sg2im/utils.py","file_url":"https://github.com/google/sg2im/blob/HEAD/sg2im/utils.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":"c7a0b110ef7c5e03","code_sha256_prefix":"c7a0b110ef7c5e03","mcp_get_code":{"code_sha256":"c7a0b110ef7c5e03"}},{"arxiv_id":"1803.10892","arxiv_id_is_arxiv":true,"paper":"/paper/social-gan-socially-acceptable-trajectories","title":"Social GAN: Socially Acceptable Trajectories with Generative Adversarial Networks","date":"2018-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agrimgupta92/sgan","path":"sgan/utils.py","file_url":"https://github.com/agrimgupta92/sgan/blob/HEAD/sgan/utils.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":"c7a0b110ef7c5e03","code_sha256_prefix":"c7a0b110ef7c5e03","mcp_get_code":{"code_sha256":"c7a0b110ef7c5e03"}}],"record_sha256":"e8cd055b9b71a3712b91491ae364e7441be8921798fa9621032fdfd35d2a9d0a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}