{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2FP5XVOU7VF5JSMAFMTBE7Q7VF","short_pith_number":"pith:2FP5XVOU","canonical_record":{"source":{"id":"2411.11149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-17T18:43:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"56595ceb176fae64eb7f6050030e0918d06580679021ae27d9099e800a665c9e","abstract_canon_sha256":"cfa8f29bc062ce9f8fa82db5059703663a3d54615b1dc7b83d2c945cbd0b3eb7"},"schema_version":"1.0"},"canonical_sha256":"d15fdbd5d4fd4bd4c9802b26127e1fa950a6bc657004c5928d71e3103339ac40","source":{"kind":"arxiv","id":"2411.11149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11149","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11149v1","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11149","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_12","alias_value":"2FP5XVOU7VF5","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_16","alias_value":"2FP5XVOU7VF5JSMA","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_8","alias_value":"2FP5XVOU","created_at":"2026-07-05T09:36:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2FP5XVOU7VF5JSMAFMTBE7Q7VF","target":"record","payload":{"canonical_record":{"source":{"id":"2411.11149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-17T18:43:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"56595ceb176fae64eb7f6050030e0918d06580679021ae27d9099e800a665c9e","abstract_canon_sha256":"cfa8f29bc062ce9f8fa82db5059703663a3d54615b1dc7b83d2c945cbd0b3eb7"},"schema_version":"1.0"},"canonical_sha256":"d15fdbd5d4fd4bd4c9802b26127e1fa950a6bc657004c5928d71e3103339ac40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:29.455743Z","signature_b64":"q8YQ5ENZ8jlFRvmVXrSDcZ+8ctSkwGp/WcuhBhqfVzby76OqB/7IiUuOA9ivlGXIk43ch1BltFkkHjhwOojCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15fdbd5d4fd4bd4c9802b26127e1fa950a6bc657004c5928d71e3103339ac40","last_reissued_at":"2026-07-05T09:36:29.455335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:29.455335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.11149","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:36:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOuIM2TnSF+92nBWclEOVnlqKfzmrCOB/hIoxvo1VolQg1ciRWXU+5OPCulevNYgUjFjtJ3+hgUOPXsxzRcRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:19:58.103526Z"},"content_sha256":"7f72af567018d0eb6feafd8c304392acd4972e2bb5e09da585ed6d2577102008","schema_version":"1.0","event_id":"sha256:7f72af567018d0eb6feafd8c304392acd4972e2bb5e09da585ed6d2577102008"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2FP5XVOU7VF5JSMAFMTBE7Q7VF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Georgios Paliouras, Konstantinos Bougiatiotis","submitted_at":"2024-11-17T18:43:01Z","abstract_excerpt":"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, facili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11149","kind":"arxiv","version":1},"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/2411.11149/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:36:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPCgemk/VxTViuFiJBPQ3sDYwkpD9V0OUbLYXhhPuWgatD3QFHfBb0rwnVQDWcj9nP0ku6ArulcCjPVb8tllDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:19:58.104067Z"},"content_sha256":"67925c802a27002a4c8b3abee5760c4b95c2b14832108afd3dcc14775fac0433","schema_version":"1.0","event_id":"sha256:67925c802a27002a4c8b3abee5760c4b95c2b14832108afd3dcc14775fac0433"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF/bundle.json","state_url":"https://pith.science/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T14:19:58Z","links":{"resolver":"https://pith.science/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF","bundle":"https://pith.science/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF/bundle.json","state":"https://pith.science/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FP5XVOU7VF5JSMAFMTBE7Q7VF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2FP5XVOU7VF5JSMAFMTBE7Q7VF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cfa8f29bc062ce9f8fa82db5059703663a3d54615b1dc7b83d2c945cbd0b3eb7","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-17T18:43:01Z","title_canon_sha256":"56595ceb176fae64eb7f6050030e0918d06580679021ae27d9099e800a665c9e"},"schema_version":"1.0","source":{"id":"2411.11149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11149","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11149v1","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11149","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_12","alias_value":"2FP5XVOU7VF5","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_16","alias_value":"2FP5XVOU7VF5JSMA","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_8","alias_value":"2FP5XVOU","created_at":"2026-07-05T09:36:29Z"}],"graph_snapshots":[{"event_id":"sha256:67925c802a27002a4c8b3abee5760c4b95c2b14832108afd3dcc14775fac0433","target":"graph","created_at":"2026-07-05T09:36:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.11149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"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, facili","authors_text":"Georgios Paliouras, Konstantinos Bougiatiotis","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11149","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f72af567018d0eb6feafd8c304392acd4972e2bb5e09da585ed6d2577102008","target":"record","created_at":"2026-07-05T09:36:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cfa8f29bc062ce9f8fa82db5059703663a3d54615b1dc7b83d2c945cbd0b3eb7","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-17T18:43:01Z","title_canon_sha256":"56595ceb176fae64eb7f6050030e0918d06580679021ae27d9099e800a665c9e"},"schema_version":"1.0","source":{"id":"2411.11149","kind":"arxiv","version":1}},"canonical_sha256":"d15fdbd5d4fd4bd4c9802b26127e1fa950a6bc657004c5928d71e3103339ac40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d15fdbd5d4fd4bd4c9802b26127e1fa950a6bc657004c5928d71e3103339ac40","first_computed_at":"2026-07-05T09:36:29.455335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:29.455335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8YQ5ENZ8jlFRvmVXrSDcZ+8ctSkwGp/WcuhBhqfVzby76OqB/7IiUuOA9ivlGXIk43ch1BltFkkHjhwOojCAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:29.455743Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f72af567018d0eb6feafd8c304392acd4972e2bb5e09da585ed6d2577102008","sha256:67925c802a27002a4c8b3abee5760c4b95c2b14832108afd3dcc14775fac0433"],"state_sha256":"82488afc11598a3444c7b1c02afb274283132b511bbd42d30b0aeeb16dbc4bdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uerd4z8c6zptafOUtEeopTC/sCce2oAJvws7zHjGI7qxkTaagATTnw72mFmJBNNqM2Ibj12/OCHvVTVuaPs8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T14:19:58.110334Z","bundle_sha256":"77a8daa7d64716b7ba0a225d2f35dd0ce4851d50b2d796cd09334e49c97dd56d"}}