{"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":"/paper/from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","arxiv_id":"2411.11149","date":"2024-11-17","proceeding":null,"authors":["Konstantinos Bougiatiotis","Georgios Paliouras"],"abstract":"Multi-relational networks capture intricate relationships in data and have diverse applications across fields such as biomedical, financial, and social sciences. As networks derived from increasingly large datasets become more common, identifying efficient methods for representing and analyzing them becomes crucial. This work extends the Prime Adjacency Matrices (PAMs) framework, which employs prime numbers to represent distinct relations within a network uniquely. This enables a compact representation of a complete multi-relational graph using a single adjacency matrix, which, in turn, facilitates quick computation of multi-hop adjacency matrices. In this work, we enhance the framework by introducing a lossless algorithm for calculating the multi-hop matrices and propose the Bag of Paths (BoP) representation, a versatile feature extraction methodology for various graph analytics tasks, at the node, edge, and graph level. We demonstrate the efficiency of the framework across various tasks and datasets, showing that simple BoP-based models perform comparably to or better than commonly used neural models while offering improved speed and interpretability.","url_abs":"https://arxiv.org/abs/2411.11149v1","url_pdf":"https://arxiv.org/pdf/2411.11149v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"from-primes-to-paths-enabling-fast-multi","repo_url":"https://github.com/kbogas/PAM_BoP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"graph-regression","task_name":"Graph Regression"},{"task_slug":"heterogeneous-node-classification","task_name":"Heterogeneous Node Classification"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"relation-prediction","task_name":"Relation Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-regression-on-peptides-struct","task":"Graph Regression","dataset":"Peptides-struct","model":"BoP","rank_in_archive_order":23,"of":39,"metrics":{"MAE":"0.25"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-zinc","task":"Graph Regression","dataset":"ZINC","model":"BoP","rank_in_archive_order":24,"of":27,"metrics":{"MAE":"0.297"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-aifb","task":"Node Classification","dataset":"AIFB","model":"BoP","rank_in_archive_order":4,"of":7,"metrics":{"Accuracy":"92.22"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-am","task":"Node Classification","dataset":"AM","model":"BoP","rank_in_archive_order":1,"of":8,"metrics":{"Accuracy":"92.41"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-bgs","task":"Node Classification","dataset":"BGS","model":"BoP","rank_in_archive_order":2,"of":7,"metrics":{"Accuracy":"90.34"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mutag","task":"Node Classification","dataset":"MUTAG","model":"BoP","rank_in_archive_order":1,"of":6,"metrics":{"Accuracy":"91.17"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"kbogas/PAM_BoP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d6e8f94629229b88b08fd1d08e4156444c5b56814627a79a933974b293aa46a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}