{"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/random-string","entry":"random_string","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":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":2,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"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":"2601.16473","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16473","title":"DEMARK: A Query-Free Black-Box Attack on Deepfake Watermarking Defenses","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"adobe/trustmark","path":"python/trustmark/datalayer.py","file_url":"https://github.com/adobe/trustmark/blob/HEAD/python/trustmark/datalayer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, adobe/trustmark (NOASSERTION)","code_sha256":"7ca3d41ede0e46bd","code_sha256_prefix":"7ca3d41ede0e46bd","mcp_get_code":{"code_sha256":"7ca3d41ede0e46bd"}},{"arxiv_id":"2412.12791","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-location-caption-alignment-via","title":"Implicit Location-Caption Alignment via Complementary Masking for Weakly-Supervised Dense Video Captioning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShipingGe/ILCACM","path":"src/dvc_eval/eval_dvc.py","file_url":"https://github.com/ShipingGe/ILCACM/blob/HEAD/src/dvc_eval/eval_dvc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cfb0aa2342a41918","code_sha256_prefix":"cfb0aa2342a41918","mcp_get_code":{"code_sha256":"cfb0aa2342a41918"}},{"arxiv_id":"2405.16405","arxiv_id_is_arxiv":true,"paper":"/paper/intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leirunlin/Text-level-Graph-Attack","path":"LLM_utils.py","file_url":"https://github.com/Leirunlin/Text-level-Graph-Attack/blob/HEAD/LLM_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Leirunlin/Text-level-Graph-Attack when it was checked","code_sha256":"ac99c179b0418ee8","code_sha256_prefix":"ac99c179b0418ee8","mcp_get_code":{"code_sha256":"ac99c179b0418ee8"}},{"arxiv_id":"2405.13382","arxiv_id_is_arxiv":true,"paper":"/paper/vtg-llm-integrating-timestamp-knowledge-into","title":"VTG-LLM: Integrating Timestamp Knowledge into Video LLMs for Enhanced Video Temporal Grounding","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyxxyg/vtg-llm","path":"metrics/dvc/eval_dvc_anet.py","file_url":"https://github.com/gyxxyg/vtg-llm/blob/HEAD/metrics/dvc/eval_dvc_anet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cfb0aa2342a41918","code_sha256_prefix":"cfb0aa2342a41918","mcp_get_code":{"code_sha256":"cfb0aa2342a41918"}},{"arxiv_id":"2403.17935","arxiv_id_is_arxiv":true,"paper":"/paper/omnivid-a-generative-framework-for-universal","title":"OmniVid: A Generative Framework for Universal Video Understanding","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjk666/OmniVid","path":"densevid_eval3/evaluate2021.py","file_url":"https://github.com/wangjk666/OmniVid/blob/HEAD/densevid_eval3/evaluate2021.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, wangjk666/OmniVid when it was checked","code_sha256":"cfb0aa2342a41918","code_sha256_prefix":"cfb0aa2342a41918","mcp_get_code":{"code_sha256":"cfb0aa2342a41918"}},{"arxiv_id":"2403.00867","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-cuff-detecting-jailbreak-attacks-on","title":"Gradient Cuff: Detecting Jailbreak Attacks on Large Language Models by Exploring Refusal Loss Landscapes","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICommunity/TAP","path":"common.py","file_url":"https://github.com/RICommunity/TAP/blob/HEAD/common.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":"8b16e6a7085993f1","code_sha256_prefix":"8b16e6a7085993f1","mcp_get_code":{"code_sha256":"8b16e6a7085993f1"}},{"arxiv_id":"2003.10865","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-asynchronous-hyperparameter","title":"Model-based Asynchronous Hyperparameter and Neural Architecture Search","date":"2020-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/syne-tune","path":"syne_tune/util.py","file_url":"https://github.com/awslabs/syne-tune/blob/HEAD/syne_tune/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1fea3210be705f13","code_sha256_prefix":"1fea3210be705f13","mcp_get_code":{"code_sha256":"1fea3210be705f13"}},{"arxiv_id":"1910.04540","arxiv_id_is_arxiv":true,"paper":"/paper/qpytorch-a-low-precision-arithmetic","title":"QPyTorch: A Low-Precision Arithmetic Simulation Framework","date":"2019-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robust-systems-group/illusion_system","path":"distributed_endurer/endurer_tests/illusion_lifetime_feb.py","file_url":"https://github.com/robust-systems-group/illusion_system/blob/HEAD/distributed_endurer/endurer_tests/illusion_lifetime_feb.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":"46f69e02f2721956","code_sha256_prefix":"46f69e02f2721956","mcp_get_code":{"code_sha256":"46f69e02f2721956"}}],"record_sha256":"1793a454fec7a5a09f8a61f0c6d74bccc020813b6f10a2850945cf338ab82b70","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}