{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:D2UBBXJIUW43K5C6NCSZAS37GV","short_pith_number":"pith:D2UBBXJI","schema_version":"1.0","canonical_sha256":"1ea810dd28a5b9b5745e68a5904b7f356621c055b8015196229dac2602864761","source":{"kind":"arxiv","id":"2209.06575","version":2},"attestation_state":"computed","paper":{"title":"Efficient multi-relational network representation using primes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios Paliouras, Konstantinos Bougiatiotis","submitted_at":"2022-09-14T11:59:58Z","abstract_excerpt":"In this work, we propose a novel representation of complex multi-relational networks, which is compact and allows very efficient network analysis. Multi-relational networks capture complex data relationships and have a variety of applications, ranging from biomedical to financial, social, etc. As they get to be used with ever larger quantities of data, it is crucial to find efficient ways to represent and analyse such networks. This paper introduces the concept of Prime Adjacency Matrices (PAMs), which utilize prime numbers, to represent the relations of the network. Due to the fundamental the"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2209.06575","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-14T11:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"8be9ac8d597dadca9323d3d6231ff439742b87aea84b07f08e06aa22a4164d35","abstract_canon_sha256":"7940c2589027e4afa870d814314e55d017cff7f3ac45070f27f4b89bb41535cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:01.351466Z","signature_b64":"e0a3tesvc7WYemfqsIfIbh7uDPsx2Y3/DGRA1h0NNw1d2CO9XZRhHftzR0lY2xwaRnTRv9UryvkEJ4fKLGSPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea810dd28a5b9b5745e68a5904b7f356621c055b8015196229dac2602864761","last_reissued_at":"2026-07-05T06:11:01.350964Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:01.350964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient multi-relational network representation using primes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios Paliouras, Konstantinos Bougiatiotis","submitted_at":"2022-09-14T11:59:58Z","abstract_excerpt":"In this work, we propose a novel representation of complex multi-relational networks, which is compact and allows very efficient network analysis. Multi-relational networks capture complex data relationships and have a variety of applications, ranging from biomedical to financial, social, etc. As they get to be used with ever larger quantities of data, it is crucial to find efficient ways to represent and analyse such networks. This paper introduces the concept of Prime Adjacency Matrices (PAMs), which utilize prime numbers, to represent the relations of the network. Due to the fundamental the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.06575","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.06575/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2209.06575","created_at":"2026-07-05T06:11:01.351021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.06575v2","created_at":"2026-07-05T06:11:01.351021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.06575","created_at":"2026-07-05T06:11:01.351021+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2UBBXJIUW43","created_at":"2026-07-05T06:11:01.351021+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2UBBXJIUW43K5C6","created_at":"2026-07-05T06:11:01.351021+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2UBBXJI","created_at":"2026-07-05T06:11:01.351021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV","json":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV.json","graph_json":"https://pith.science/api/pith-number/D2UBBXJIUW43K5C6NCSZAS37GV/graph.json","events_json":"https://pith.science/api/pith-number/D2UBBXJIUW43K5C6NCSZAS37GV/events.json","paper":"https://pith.science/paper/D2UBBXJI"},"agent_actions":{"view_html":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV","download_json":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV.json","view_paper":"https://pith.science/paper/D2UBBXJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.06575&json=true","fetch_graph":"https://pith.science/api/pith-number/D2UBBXJIUW43K5C6NCSZAS37GV/graph.json","fetch_events":"https://pith.science/api/pith-number/D2UBBXJIUW43K5C6NCSZAS37GV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV/action/storage_attestation","attest_author":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV/action/author_attestation","sign_citation":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV/action/citation_signature","submit_replication":"https://pith.science/pith/D2UBBXJIUW43K5C6NCSZAS37GV/action/replication_record"}},"created_at":"2026-07-05T06:11:01.351021+00:00","updated_at":"2026-07-05T06:11:01.351021+00:00"}