{"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":"/method/hope","slug":"hope","name":"HOPE","full_name":"High-Order Proximity preserved Embedding","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Asymmetric Transitivity Preserving Graph Embedding","paper":"/paper/asymmetric-transitivity-preserving-graph","first_author":"Mingdong Ou","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/asymmetric-transitivity-preserving-graph"},"source":{"url":"https://dl.acm.org/doi/abs/10.1145/2939672.2939751","title":"Asymmetric Transitivity Preserving Graph Embedding","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":16,"archive_num_papers":16,"papers_newest_first":[{"paper":null,"slug":"gmatch-geometry-constrained-feature-matching","title":"GMatch: Geometry-Constrained Feature Matching for RGB-D Object Pose Estimation","date":"2025-05-22","arxiv_id":"2505.16144","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-hope-domain-agnostic-automatic","title":"A New HOPE: Domain-agnostic Automatic Evaluation of Text Chunking","date":"2025-05-04","arxiv_id":"2505.02171","n_code_links":0,"syntology":null},{"paper":null,"slug":"sentiment-guided-commonsense-aware-response","title":"Sentiment-guided Commonsense-aware Response Generation for Mental Health Counseling","date":"2025-01-06","arxiv_id":"2501.03088","n_code_links":0,"syntology":null},{"paper":"/paper/there-is-hope-to-avoid-hippos-for-long-memory","slug":"there-is-hope-to-avoid-hippos-for-long-memory","title":"HOPE for a Robust Parameterization of Long-memory State Space Models","date":"2024-05-22","arxiv_id":"2405.13975","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["AnnanYu/HOPE-SSM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/robustness-of-graph-embedding-methods-for","slug":"robustness-of-graph-embedding-methods-for","title":"Robustness of graph embedding methods for community detection","date":"2024-05-01","arxiv_id":"2405.00636","n_code_links":1,"syntology":null},{"paper":"/paper/learning-embeddings-with-centroid-triplet","slug":"learning-embeddings-with-centroid-triplet","title":"Learning Embeddings with Centroid Triplet Loss for Object Identification in Robotic Grasping","date":"2024-04-09","arxiv_id":"2404.06277","n_code_links":2,"syntology":null},{"paper":"/paper/hope-hybrid-granularity-ordinal-prototype","slug":"hope-hybrid-granularity-ordinal-prototype","title":"HOPE: Hybrid-granularity Ordinal Prototype Learning for Progression Prediction of Mild Cognitive Impairment","date":"2024-01-19","arxiv_id":"2401.10966","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-high-quality-clustering-for-large","slug":"efficient-high-quality-clustering-for-large","title":"Efficient High-Quality Clustering for Large Bipartite Graphs","date":"2023-12-28","arxiv_id":"2312.16926","n_code_links":1,"syntology":null},{"paper":"/paper/hope-high-order-polynomial-expansion-of-black","slug":"hope-high-order-polynomial-expansion-of-black","title":"HOPE: High-order Polynomial Expansion of Black-box Neural Networks","date":"2023-07-17","arxiv_id":"2307.08192","n_code_links":1,"syntology":{"ran":16,"of":18,"n_ran_checked":16,"n_instrument":0,"unverified":2,"pointer_only":18,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["harrypotterxtx/hope"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"response-act-guided-reinforced-dialogue","title":"Response-act Guided Reinforced Dialogue Generation for Mental Health Counseling","date":"2023-01-30","arxiv_id":"2301.12729","n_code_links":0,"syntology":null},{"paper":"/paper/hope-a-task-oriented-and-human-centric","slug":"hope-a-task-oriented-and-human-centric","title":"HOPE: A Task-Oriented and Human-Centric Evaluation Framework Using Professional Post-Editing Towards More Effective MT Evaluation","date":"2021-12-27","arxiv_id":"2112.13833","n_code_links":1,"syntology":null},{"paper":"/paper/speaker-and-time-aware-joint-contextual","slug":"speaker-and-time-aware-joint-contextual","title":"Speaker and Time-aware Joint Contextual Learning for Dialogue-act Classification in Counselling Conversations","date":"2021-11-12","arxiv_id":"2111.06647","n_code_links":1,"syntology":null},{"paper":null,"slug":"directed-graph-representation-through-vector","title":"Directed Graph Representation through Vector Cross Product","date":"2020-10-21","arxiv_id":"2010.10737","n_code_links":0,"syntology":null},{"paper":"/paper/asymmetric-transitivity-preserving-graph","slug":"asymmetric-transitivity-preserving-graph","title":"Asymmetric Transitivity Preserving Graph Embedding","date":"2020-05-13","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/network-representation-learning-consolidation","slug":"network-representation-learning-consolidation","title":"Network Representation Learning: Consolidation and Renewed Bearing","date":"2019-05-02","arxiv_id":"1905.00987","n_code_links":1,"syntology":null},{"paper":"/paper/incremental-embedding-for-temporal-networks","slug":"incremental-embedding-for-temporal-networks","title":"FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings","date":"2019-04-06","arxiv_id":"1904.03423","n_code_links":1,"syntology":null}],"papers_shown":16,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":16,"with_a_code_link":11,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/hope/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/hope/papers/ran/1","json":"/method/hope/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/graph-embedding","name":"Graph Embedding","papers":4},{"task":"/task/link-prediction","name":"Link Prediction","papers":4},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/response-generation","name":"Response Generation","papers":2},{"task":"/task/chunking","name":"Chunking","papers":1},{"task":"/task/community-detection","name":"Community Detection","papers":1},{"task":"/task/dialogue-act-classification","name":"Dialogue Act Classification","papers":1},{"task":"/task/dialogue-generation","name":"Dialogue Generation","papers":1},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":1},{"task":"/task/dynamic-graph-embedding","name":"Dynamic graph embedding","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/graph-clustering","name":"Graph Clustering","papers":1},{"task":"/task/image-retrieval","name":"Image Retrieval","papers":1},{"task":"/task/incremental-learning","name":"Incremental Learning","papers":1},{"task":"/task/machine-translation","name":"Machine Translation","papers":1},{"task":"/task/marketing","name":"Marketing","papers":1},{"task":"/task/node-classification","name":"Node Classification","papers":1},{"task":"/task/object","name":"Object","papers":1}],"tasks_shown":20,"n_tasks":33,"usage_by_year":[{"year":"2019","papers":2},{"year":"2020","papers":2},{"year":"2021","papers":2},{"year":"2023","papers":3},{"year":"2024","papers":4},{"year":"2025","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/hope"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=HOPE","read_at":"2026-10-05T00:57:36+00:00","query":"HOPE","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"HOPE","origin_arxiv_id":"2609.18916"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":8,"served":{"arxiv_id":"2609.18916","citations":null},"leading_other_bearer":{"arxiv_id":"2512.24695","title":"Nested Learning: The Illusion of Deep Learning Architecture","citations":87,"named_by":["method_name"],"bearer_name":"Hope","ask_with":"have('2512.24695')"},"n_other_bearers_listed":5,"note":"'HOPE' is ALSO the name of 'Hope', a method in 'Nested Learning: The Illusion of Deep Learning Architecture' (arXiv:2512.24695, 87 citations), which is cited FAR more than the paper this answer is about (citations not recorded). This answer may be about the wrong HOPE. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to “Hope”, a method in the paper “Nested Learning: The Illusion of Deep Learning Architecture” (arXiv:2512.24695, 87 citations), which the lookup finds cited far more than the paper this answer is about (citations not recorded), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2609.18916","page":null,"syntology_url":"https://syntology.ai/paper/2609.18916","in_graph_layer":false,"samples":0},"line":"no code under this exact name (no_code; paper_only). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2609.18916) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"191b7f6949e413ba1766cf49aa0d0c0308e795553878f7018e6aa988ca40b97c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}