We lifted 17 functions out of this paper's own repositories and ran 12 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| Xovee/casflow | canonical | 2 of 2 |
| Xovee/ccgl | pwc_unofficial | 8 of 13 |
| Xovee/hdgnn | pwc_unofficial | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| Invdegree_matrix | Ran | Xovee/ccgl/src/utils/graphwave/utils/graph_tools.py code served (permissive licence) · get_code("c41794102b9f3069") |
| acc | Ran | Xovee/hdgnn/codes/gnn_train/tools.py code served (permissive licence) · get_code("76d79073639d1c3c") |
| charac_function | Ran | Xovee/ccgl/src/utils/graphwave/characteristic_functions.py code served (permissive licence) · get_code("74187cbf2bffbbff") |
| compute_cheb_coeff | Ran | Xovee/ccgl/src/utils/graphwave/graphwave.py code served (permissive licence) · get_code("4290905ee7090fdc") |
| compute_cheb_coeff_basis | Ran | Xovee/ccgl/src/utils/graphwave/graphwave.py code served (permissive licence) · get_code("0fbc4387afcf2db4") |
| cross_entropy_loss | Ran | Xovee/hdgnn/codes/gnn_train/tools.py code served (permissive licence) · get_code("6dab6885871344ad") |
| degree_matrix | Ran | Xovee/ccgl/src/utils/graphwave/utils/graph_tools.py code served (permissive licence) · get_code("eb7ba08613818849") |
| dot_sim_2 | Ran | Xovee/ccgl/src/utils/tools.py code served (permissive licence) · get_code("de7ad73d28f91ccf") |
| get_negative_mask | Ran | Xovee/ccgl/src/utils/tools.py code served (permissive licence) · get_code("7ba2d94d446bf525") |
| laplacian | Ran | Xovee/ccgl/src/utils/graphwave/utils/graph_tools.py code served (permissive licence) · get_code("9858df6684d94526") |
| read_labels | Ran | Xovee/casflow/gene_emb.py code served (permissive licence) · get_code("b8a9341d81c3f6d8") |
| sequence2list | Ran | Xovee/casflow/gene_emb.py code served (permissive licence) · get_code("ef0b8f55202174f1") |
| augmentor_sim | Not yet run | Xovee/ccgl/src/augmentor.py code served (permissive licence) · get_code("4cf1a96acf28df24") |
| charac_function_multiscale | Not yet run | Xovee/ccgl/src/utils/graphwave/characteristic_functions.py code served (permissive licence) · get_code("d99ee1ea8c38a2b9") |
| dot_sim_1 | Not yet run | Xovee/ccgl/src/utils/tools.py code served (permissive licence) · get_code("f553a8a1f0f560c8") |
| main | Not yet run | Xovee/ccgl/src/distilling.py code served (permissive licence) · get_code("8b5ac074fd9e0047") |
| main | Not yet run | Xovee/ccgl/src/gene_emb.py code served (permissive licence) · get_code("103bb5930b2e4aa5") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The deluge of digital information in our daily life -- from user-generated content, such as microblogs and scientific papers, to online business, such as viral marketing and advertising -- offers unprecedented opportunities to explore and exploit the trajectories and structures of the evolution of information cascades. Abundant research efforts, both academic and industrial, have aimed to reach a better understanding of the mechanisms driving the spread of information and quantifying the outcome of information diffusion. This article presents a comprehensive review and categorization of information popularity prediction methods, from feature engineering and stochastic processes, through graph representation, to deep learning-based approaches. Specifically, we first formally define different types of information cascades and summarize the perspectives of existing studies. We then present a taxonomy that categorizes existing works into the aforementioned three main groups as well as the main subclasses in each group, and we systematically review cutting-edge research work. Finally, we summarize the pros and cons of existing research efforts and outline the open challenges and opportunities in this field.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.11041")
get_code_for_paper("2005.11041")
have("2005.11041")
Connect an agent — have() is free.