{"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/drop-feature","entry":"drop_feature","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":9,"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":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"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":1,"ran_fixture":1,"ran":1,"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":"2506.23825","arxiv_id_is_arxiv":true,"paper":"/paper/flash-vstream-efficient-real-time","title":"Flash-VStream: Efficient Real-Time Understanding for Long Video Streams","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IVGSZ/Flash-VStream","path":"Flash-VStream-Qwen/models/vstream_qwen2vl_realtime.py","file_url":"https://github.com/IVGSZ/Flash-VStream/blob/HEAD/Flash-VStream-Qwen/models/vstream_qwen2vl_realtime.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88e007251e2c289d","code_sha256_prefix":"88e007251e2c289d","mcp_get_code":{"code_sha256":"88e007251e2c289d"}},{"arxiv_id":"2412.09261","arxiv_id_is_arxiv":true,"paper":"/paper/single-view-graph-contrastive-learning-with","title":"Single-View Graph Contrastive Learning with Soft Neighborhood Awareness","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunisfighting/signa","path":"utils.py","file_url":"https://github.com/sunisfighting/signa/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from HKUDS/GraphST, and GitHub detected no licence in that repository when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2410.14886","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-generalist-graph-anomaly-detection","title":"Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Prompts","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/UNPrompt","path":"pretrain.py","file_url":"https://github.com/mala-lab/UNPrompt/blob/HEAD/pretrain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from HKUDS/GraphST, and GitHub detected no licence in that repository when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2409.16670","arxiv_id_is_arxiv":true,"paper":"/paper/graphlora-structure-aware-contrastive-low","title":"GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allminerlab/graphlora","path":"model/GRACE_model.py","file_url":"https://github.com/allminerlab/graphlora/blob/HEAD/model/GRACE_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, allminerlab/graphlora when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2310.03977","arxiv_id_is_arxiv":true,"paper":"/paper/perfect-alignment-may-be-poisonous-to-graph","title":"Perfect Alignment May be Poisonous to Graph Contrastive Learning","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"somebodyhh1/GRACEIS","path":"model.py","file_url":"https://github.com/somebodyhh1/GRACEIS/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, somebodyhh1/GRACEIS when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2309.13944","arxiv_id_is_arxiv":true,"paper":"/paper/provable-training-for-graph-contrastive-1","title":"Provable Training for Graph Contrastive Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VoidHaruhi/POT-GCL","path":"GRACE/model.py","file_url":"https://github.com/VoidHaruhi/POT-GCL/blob/HEAD/GRACE/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from HKUDS/GraphST, and GitHub detected no licence in that repository when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2306.10683","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-temporal-graph-learning-with","title":"Spatial-Temporal Graph Learning with Adversarial Contrastive Adaptation","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUDS/GraphST","path":"code/model.py","file_url":"https://github.com/HKUDS/GraphST/blob/HEAD/code/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HKUDS/GraphST when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2110.14038","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"model.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from HKUDS/GraphST, and GitHub detected no licence in that repository when it was checked","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2106.12484","arxiv_id_is_arxiv":true,"paper":"/paper/from-canonical-correlation-analysis-to-self","title":"From Canonical Correlation Analysis to Self-supervised Graph Neural Networks","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hengruizhang98/CCA-SSG","path":"aug.py","file_url":"https://github.com/hengruizhang98/CCA-SSG/blob/HEAD/aug.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":"3d974267cf1bef51","code_sha256_prefix":"3d974267cf1bef51","mcp_get_code":{"code_sha256":"3d974267cf1bef51"}},{"arxiv_id":"2006.04131","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"22bfb6129463d322","code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}}],"record_sha256":"431b4add3fff60ababa8ea30bcd26c0168d90edd111ef4f0d2d9e2574aee3101","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}