{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HYOGIADPV2PLCX7FGRTJJDPPB4","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":"e30af9032e511166d7148b87c40fd4f4642619e8075e24435d4ed33b8dca7511","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-28T10:30:19Z","title_canon_sha256":"86dfc3c3849dab6e0161aee06a7a00e09d7ec763f34fd8373a73d5d152b21afe"},"schema_version":"1.0","source":{"id":"1601.07714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07714","created_at":"2026-05-18T01:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07714v1","created_at":"2026-05-18T01:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07714","created_at":"2026-05-18T01:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"HYOGIADPV2PL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HYOGIADPV2PLCX7F","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HYOGIADP","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c8a202bafa161d3f1a34921da7917b3877f85a705352dace70dfde41ab33b6a7","target":"graph","created_at":"2026-05-18T01:21:42Z","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"},"paper":{"abstract_excerpt":"The ubiquitous proliferation of online social networks has led to the widescale emergence of relational graphs expressing unique patterns in link formation and descriptive user node features. Matrix Factorization and Completion have become popular methods for Link Prediction due to the low rank nature of mutual node friendship information, and the availability of parallel computer architectures for rapid matrix processing. Current Link Prediction literature has demonstrated vast performance improvement through the utilization of sparsity in addition to the low rank matrix assumption. However, ","authors_text":"Brian Mohtashemi, Thomas Ketseoglou","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-28T10:30:19Z","title":"Log-Normal Matrix Completion for Large Scale Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07714","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:14c1997b49bb33109667c3c1284c31e69fd6cf5acb9926736668edf7ec36190d","target":"record","created_at":"2026-05-18T01:21:42Z","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":"e30af9032e511166d7148b87c40fd4f4642619e8075e24435d4ed33b8dca7511","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-28T10:30:19Z","title_canon_sha256":"86dfc3c3849dab6e0161aee06a7a00e09d7ec763f34fd8373a73d5d152b21afe"},"schema_version":"1.0","source":{"id":"1601.07714","kind":"arxiv","version":1}},"canonical_sha256":"3e1c64006fae9eb15fe53466948def0f075003a2914b70a62ec347d49b5a4a6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e1c64006fae9eb15fe53466948def0f075003a2914b70a62ec347d49b5a4a6f","first_computed_at":"2026-05-18T01:21:42.366076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:42.366076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yv/7Hbw0OMDHtsVjx8uUQYs+75RHkrf4d0+bx7pDm0WMdEVPOssSdRR5O6CGu3b2A8YgMyEyVhOS2Oyq0eR7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:42.366462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14c1997b49bb33109667c3c1284c31e69fd6cf5acb9926736668edf7ec36190d","sha256:c8a202bafa161d3f1a34921da7917b3877f85a705352dace70dfde41ab33b6a7"],"state_sha256":"5df7cc52f6c6f21ae802129a603085604121feecec0e542912252a574352244e"}