{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IS2HZRXAQJCTZQVL6ANRYYSLZD","short_pith_number":"pith:IS2HZRXA","canonical_record":{"source":{"id":"1411.3675","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-13T19:36:54Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"ad14b0269fa59dd7f63f448b107bde6089a27f67d21245089a223e975d24e990","abstract_canon_sha256":"ee274da75ebb5326d3d337bd0861367f208b0d36cba5d2e7300f6c1120b505ab"},"schema_version":"1.0"},"canonical_sha256":"44b47cc6e082453cc2abf01b1c624bc8c783bbfb3e6a3703b548e2bf816a9c50","source":{"kind":"arxiv","id":"1411.3675","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3675","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3675v3","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3675","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"IS2HZRXAQJCT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IS2HZRXAQJCTZQVL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IS2HZRXA","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IS2HZRXAQJCTZQVL6ANRYYSLZD","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3675","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-13T19:36:54Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"ad14b0269fa59dd7f63f448b107bde6089a27f67d21245089a223e975d24e990","abstract_canon_sha256":"ee274da75ebb5326d3d337bd0861367f208b0d36cba5d2e7300f6c1120b505ab"},"schema_version":"1.0"},"canonical_sha256":"44b47cc6e082453cc2abf01b1c624bc8c783bbfb3e6a3703b548e2bf816a9c50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:38.775749Z","signature_b64":"wm+ZNsLTAsDHrV76Q3hBDw7kUnNf8V5EFDQ+JgJJVOYD2BlFpgoF8ekmW/3/0B42eOnTfZ2iP3O1BleghOW6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b47cc6e082453cc2abf01b1c624bc8c783bbfb3e6a3703b548e2bf816a9c50","last_reissued_at":"2026-05-18T01:10:38.775086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:38.775086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3675","source_version":3,"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-05-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M05IpUCOLV+zoew91RmZmqk1UYuje8Vpnf1X3OjUqQXlp3Ywzf+Cn3hV7Zb1QOhnd4mb92Fde3qI7GczboFgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:47:00.162244Z"},"content_sha256":"0b963b14dad47cc53606ab1d71043b7770a9c347ded1da74f2be1ac74512c309","schema_version":"1.0","event_id":"sha256:0b963b14dad47cc53606ab1d71043b7770a9c347ded1da74f2be1ac74512c309"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IS2HZRXAQJCTZQVL6ANRYYSLZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.SI","authors_text":"Aram Galstyan, Dong Guo, Greg Ver Steeg, Junming Yin, Linhong Zhu","submitted_at":"2014-11-13T19:36:54Z","abstract_excerpt":"We propose a scalable temporal latent space model for link prediction in dynamic social networks, where the goal is to predict links over time based on a sequence of previous graph snapshots. The model assumes that each user lies in an unobserved latent space and interactions are more likely to form between similar users in the latent space representation. In addition, the model allows each user to gradually move its position in the latent space as the network structure evolves over time. We present a global optimization algorithm to effectively infer the temporal latent space, with a quadrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3675","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":""},"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-05-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBObgGNkZwURWAY1CbV+JHjTYpxyvx7lypB7AGJ5kj1BguprZANeTidpRfNC/A5vJvrf3hN4KXcw/VrW0nnBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:47:00.162607Z"},"content_sha256":"8c08f6e57b58fe062a34abce4a899fe8b08a5bec6ce25e86955815c2a4585f70","schema_version":"1.0","event_id":"sha256:8c08f6e57b58fe062a34abce4a899fe8b08a5bec6ce25e86955815c2a4585f70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD/bundle.json","state_url":"https://pith.science/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD/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-05-30T17:47:00Z","links":{"resolver":"https://pith.science/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD","bundle":"https://pith.science/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD/bundle.json","state":"https://pith.science/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS2HZRXAQJCTZQVL6ANRYYSLZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IS2HZRXAQJCTZQVL6ANRYYSLZD","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":"ee274da75ebb5326d3d337bd0861367f208b0d36cba5d2e7300f6c1120b505ab","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-13T19:36:54Z","title_canon_sha256":"ad14b0269fa59dd7f63f448b107bde6089a27f67d21245089a223e975d24e990"},"schema_version":"1.0","source":{"id":"1411.3675","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3675","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3675v3","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3675","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"IS2HZRXAQJCT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IS2HZRXAQJCTZQVL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IS2HZRXA","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:8c08f6e57b58fe062a34abce4a899fe8b08a5bec6ce25e86955815c2a4585f70","target":"graph","created_at":"2026-05-18T01:10:38Z","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":"We propose a scalable temporal latent space model for link prediction in dynamic social networks, where the goal is to predict links over time based on a sequence of previous graph snapshots. The model assumes that each user lies in an unobserved latent space and interactions are more likely to form between similar users in the latent space representation. In addition, the model allows each user to gradually move its position in the latent space as the network structure evolves over time. We present a global optimization algorithm to effectively infer the temporal latent space, with a quadrati","authors_text":"Aram Galstyan, Dong Guo, Greg Ver Steeg, Junming Yin, Linhong Zhu","cross_cats":["cs.AI","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-13T19:36:54Z","title":"Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3675","kind":"arxiv","version":3},"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:0b963b14dad47cc53606ab1d71043b7770a9c347ded1da74f2be1ac74512c309","target":"record","created_at":"2026-05-18T01:10:38Z","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":"ee274da75ebb5326d3d337bd0861367f208b0d36cba5d2e7300f6c1120b505ab","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-13T19:36:54Z","title_canon_sha256":"ad14b0269fa59dd7f63f448b107bde6089a27f67d21245089a223e975d24e990"},"schema_version":"1.0","source":{"id":"1411.3675","kind":"arxiv","version":3}},"canonical_sha256":"44b47cc6e082453cc2abf01b1c624bc8c783bbfb3e6a3703b548e2bf816a9c50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b47cc6e082453cc2abf01b1c624bc8c783bbfb3e6a3703b548e2bf816a9c50","first_computed_at":"2026-05-18T01:10:38.775086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:38.775086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wm+ZNsLTAsDHrV76Q3hBDw7kUnNf8V5EFDQ+JgJJVOYD2BlFpgoF8ekmW/3/0B42eOnTfZ2iP3O1BleghOW6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:38.775749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3675","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b963b14dad47cc53606ab1d71043b7770a9c347ded1da74f2be1ac74512c309","sha256:8c08f6e57b58fe062a34abce4a899fe8b08a5bec6ce25e86955815c2a4585f70"],"state_sha256":"b9e13a836407258f9483636bfa92b6d29e8bf64c0e21fb1ed1a0af667f062fe5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FL2cKvo8CPM/5BfrWD+wVHGNieKRNCmf3zCQNijRDGCT4fX+cagxpAFi2NhQPRt8jANAjBaegEd4oiLkFIjXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:47:00.164592Z","bundle_sha256":"ba4ba98344cff819d2ded34d28bdc4e4a89db14bbd007c76682ea8441a30c1bb"}}