{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/graphencoder","entry":"GraphEncoder","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":2,"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":9,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":7},"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":"2608.22642","paper":"/paper/arxiv-2608-22642","title":"Mol-JEPA: A multimodal Joint Embedding Predictive Architecture for Molecules","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Boehringer-Ingelheim/mol-jepa","path":"src/models/modules/jepa.py","file_url":"https://github.com/Boehringer-Ingelheim/mol-jepa/blob/HEAD/src/models/modules/jepa.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"003c2e4f38303a54","mcp_get_code":{"code_sha256":"003c2e4f38303a54"}},{"arxiv_id":"2608.04381","paper":"/paper/arxiv-2608-04381","title":"NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"OliverZ-dot/Node-Jepa","path":"graph_jepa/models/graph_jepa.py","file_url":"https://github.com/OliverZ-dot/Node-Jepa/blob/HEAD/graph_jepa/models/graph_jepa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7ab863ffa7d71c7","mcp_get_code":{"code_sha256":"e7ab863ffa7d71c7"}},{"arxiv_id":"2603.15708","paper":"/paper/arxiv-2603-15708","title":"Mastering the Minority: An Uncertainty-guided Multi-Expert Framework for Challenging-tailed Sequence Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"CQUPTWZX/Multi-experts","path":"code/model/contrast_multi.py","file_url":"https://github.com/CQUPTWZX/Multi-experts/blob/HEAD/code/model/contrast_multi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3d94942968d1dc55","mcp_get_code":{"code_sha256":"3d94942968d1dc55"}},{"arxiv_id":"2409.17687","paper":"/paper/graph-edit-distance-with-general-costs-using","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/graphedx","path":"models/graphedx.py","file_url":"https://github.com/structlearning/graphedx/blob/HEAD/models/graphedx.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f351498dcb392cc","mcp_get_code":{"code_sha256":"3f351498dcb392cc"}},{"arxiv_id":"2204.13413","paper":"/paper/hpt-hierarchy-aware-prompt-tuning-for","title":"HPT: Hierarchy-aware Prompt Tuning for Hierarchical Text Classification","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzh9969/HPT","path":"models/prompt.py","file_url":"https://github.com/wzh9969/HPT/blob/HEAD/models/prompt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f016bcbbfeb4f1f","mcp_get_code":{"code_sha256":"1f016bcbbfeb4f1f"}},{"arxiv_id":"2203.03825","paper":"/paper/incorporating-hierarchy-into-text-encoder-a","title":"Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classification","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzh9969/contrastive-htc","path":"model/contrast.py","file_url":"https://github.com/wzh9969/contrastive-htc/blob/HEAD/model/contrast.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa93cb13fe01f92c","mcp_get_code":{"code_sha256":"aa93cb13fe01f92c"}},{"arxiv_id":"2105.05682","paper":"/paper/multi-scale-contrastive-siamese-networks-for","title":"Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GRAND-Lab/MERIT","path":"net/merit.py","file_url":"https://github.com/GRAND-Lab/MERIT/blob/HEAD/net/merit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c529b4d31915af24","mcp_get_code":{"code_sha256":"c529b4d31915af24"}},{"arxiv_id":"2005.05806","paper":"/paper/document-modeling-with-graph-attention","title":"Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DancingSoul/NQ_BERT-DM","path":"modules/graph_encoder.py","file_url":"https://github.com/DancingSoul/NQ_BERT-DM/blob/HEAD/modules/graph_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8d472f7368f335e3","mcp_get_code":{"code_sha256":"8d472f7368f335e3"}},{"arxiv_id":"2004.12704","paper":"/paper/semantic-graphs-for-generating-deep-questions","title":"Semantic Graphs for Generating Deep Questions","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WING-NUS/SG-Deep-Question-Generation","path":"src/onqg/models/Encoders.py","file_url":"https://github.com/WING-NUS/SG-Deep-Question-Generation/blob/HEAD/src/onqg/models/Encoders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"86df33d346709e8e","mcp_get_code":{"code_sha256":"86df33d346709e8e"}}]}