{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ORDLWGWZMA4ZM5UDXUONCDJA64","short_pith_number":"pith:ORDLWGWZ","schema_version":"1.0","canonical_sha256":"7446bb1ad96039967683bd1cd10d20f7085b971ea2cfc6a44a91a7e6d978cefc","source":{"kind":"arxiv","id":"2001.09456","version":3},"attestation_state":"computed","paper":{"title":"Graph link prediction in computer networks using Poisson matrix factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.AP","authors_text":"Francesco Sanna Passino, Melissa J. M. Turcotte, Nicholas A. Heard","submitted_at":"2020-01-26T14:06:37Z","abstract_excerpt":"Graph link prediction is an important task in cyber-security: relationships between entities within a computer network, such as users interacting with computers, or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article, PMF is extended to include scenarios that are commonly encountered in cyber-security applications. Specifically, an extension is proposed to explicitly handle binary adj"},"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":"2001.09456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2020-01-26T14:06:37Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c94111fe625b2da8445e4e008970e176921be741a4d23e5a6aebbf47c143a06c","abstract_canon_sha256":"d95c7a76f82aedbc4eae292975eaec17bdf68f5d40590127eac876b951c74c53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:46:50.224715Z","signature_b64":"eqY5lqvtXLFdXZ6lKXuKor3djrOkCcj1ESGDQLH7URcUMxAgYCtwe1zyPbVEu7x87Zm3DJ33hTcjmWXZkD/vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7446bb1ad96039967683bd1cd10d20f7085b971ea2cfc6a44a91a7e6d978cefc","last_reissued_at":"2026-07-05T04:46:50.224374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:46:50.224374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph link prediction in computer networks using Poisson matrix factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.AP","authors_text":"Francesco Sanna Passino, Melissa J. M. Turcotte, Nicholas A. Heard","submitted_at":"2020-01-26T14:06:37Z","abstract_excerpt":"Graph link prediction is an important task in cyber-security: relationships between entities within a computer network, such as users interacting with computers, or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article, PMF is extended to include scenarios that are commonly encountered in cyber-security applications. Specifically, an extension is proposed to explicitly handle binary adj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09456","kind":"arxiv","version":3},"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/2001.09456/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":"2001.09456","created_at":"2026-07-05T04:46:50.224430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.09456v3","created_at":"2026-07-05T04:46:50.224430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09456","created_at":"2026-07-05T04:46:50.224430+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORDLWGWZMA4Z","created_at":"2026-07-05T04:46:50.224430+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORDLWGWZMA4ZM5UD","created_at":"2026-07-05T04:46:50.224430+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORDLWGWZ","created_at":"2026-07-05T04:46:50.224430+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/ORDLWGWZMA4ZM5UDXUONCDJA64","json":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64.json","graph_json":"https://pith.science/api/pith-number/ORDLWGWZMA4ZM5UDXUONCDJA64/graph.json","events_json":"https://pith.science/api/pith-number/ORDLWGWZMA4ZM5UDXUONCDJA64/events.json","paper":"https://pith.science/paper/ORDLWGWZ"},"agent_actions":{"view_html":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64","download_json":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64.json","view_paper":"https://pith.science/paper/ORDLWGWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.09456&json=true","fetch_graph":"https://pith.science/api/pith-number/ORDLWGWZMA4ZM5UDXUONCDJA64/graph.json","fetch_events":"https://pith.science/api/pith-number/ORDLWGWZMA4ZM5UDXUONCDJA64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64/action/storage_attestation","attest_author":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64/action/author_attestation","sign_citation":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64/action/citation_signature","submit_replication":"https://pith.science/pith/ORDLWGWZMA4ZM5UDXUONCDJA64/action/replication_record"}},"created_at":"2026-07-05T04:46:50.224430+00:00","updated_at":"2026-07-05T04:46:50.224430+00:00"}