{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6E5GGLUT74C46LQURXUWM6AZ7Q","short_pith_number":"pith:6E5GGLUT","canonical_record":{"source":{"id":"1804.05313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-15T07:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"5b5282db2fd75df630a2828dacc2ebd07953b86b34cdca03667d925a575bd16a","abstract_canon_sha256":"78c7f40da3a854283b106385616a10e327020657f52ab47913116b1eaa7a76e2"},"schema_version":"1.0"},"canonical_sha256":"f13a632e93ff05cf2e148de9667819fc0057c77b9d231eece039edcd9c90117b","source":{"kind":"arxiv","id":"1804.05313","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05313","created_at":"2026-05-18T00:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05313v2","created_at":"2026-05-18T00:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05313","created_at":"2026-05-18T00:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"6E5GGLUT74C4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6E5GGLUT74C46LQU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6E5GGLUT","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6E5GGLUT74C46LQURXUWM6AZ7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-15T07:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"5b5282db2fd75df630a2828dacc2ebd07953b86b34cdca03667d925a575bd16a","abstract_canon_sha256":"78c7f40da3a854283b106385616a10e327020657f52ab47913116b1eaa7a76e2"},"schema_version":"1.0"},"canonical_sha256":"f13a632e93ff05cf2e148de9667819fc0057c77b9d231eece039edcd9c90117b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:30.216989Z","signature_b64":"idi5eKvOpQZw2Ogzjtu/Ayi4C0oPo8OhfH7OAf3Jk6S2YH2wvzEFtM+zmC/lcmqOofhDR/tqvyzvmV4PJc1XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f13a632e93ff05cf2e148de9667819fc0057c77b9d231eece039edcd9c90117b","last_reissued_at":"2026-05-18T00:11:30.216478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:30.216478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05313","source_version":2,"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-18T00:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wXMOcBwPbHRmvQNfx2SEcIAauu6kAnnCo3xQx7DxA0M2TP+soIxs0vBM8wJEtf2Lxht2Yd6/bmd8j6QO5TqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:16:26.449213Z"},"content_sha256":"c3f43447a570a1ff0b4e6c89c7c780705ff7c48a139333f1e99b1e95393d8b77","schema_version":"1.0","event_id":"sha256:c3f43447a570a1ff0b4e6c89c7c780705ff7c48a139333f1e99b1e95393d8b77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6E5GGLUT74C46LQURXUWM6AZ7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FSCNMF: Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aswin Kannan, Harsh Kara, M N Murty, Sambaran Bandyopadhyay","submitted_at":"2018-04-15T07:09:34Z","abstract_excerpt":"Analysis and visualization of an information network can be facilitated better using an appropriate embedding of the network. Network embedding learns a compact low-dimensional vector representation for each node of the network, and uses this lower dimensional representation for different network analysis tasks. Only the structure of the network is considered by a majority of the current embedding algorithms. However, some content is associated with each node, in most of the practical applications, which can help to understand the underlying semantics of the network. It is not straightforward "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05313","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":""},"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-18T00:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NswVnGK4X36AvaNZ+/bTKZJE5RJc2PTp440SrNHPEzk32Xxsl2eyonCEl7+/xiL3NWtMhowqp19gi+x2a40Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:16:26.449899Z"},"content_sha256":"76fe9fba4c6a9ad6fbb30b10746021616d446a6bb2d9f36972afc5b1455b6641","schema_version":"1.0","event_id":"sha256:76fe9fba4c6a9ad6fbb30b10746021616d446a6bb2d9f36972afc5b1455b6641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6E5GGLUT74C46LQURXUWM6AZ7Q/bundle.json","state_url":"https://pith.science/pith/6E5GGLUT74C46LQURXUWM6AZ7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6E5GGLUT74C46LQURXUWM6AZ7Q/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-31T12:16:26Z","links":{"resolver":"https://pith.science/pith/6E5GGLUT74C46LQURXUWM6AZ7Q","bundle":"https://pith.science/pith/6E5GGLUT74C46LQURXUWM6AZ7Q/bundle.json","state":"https://pith.science/pith/6E5GGLUT74C46LQURXUWM6AZ7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6E5GGLUT74C46LQURXUWM6AZ7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6E5GGLUT74C46LQURXUWM6AZ7Q","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":"78c7f40da3a854283b106385616a10e327020657f52ab47913116b1eaa7a76e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-15T07:09:34Z","title_canon_sha256":"5b5282db2fd75df630a2828dacc2ebd07953b86b34cdca03667d925a575bd16a"},"schema_version":"1.0","source":{"id":"1804.05313","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05313","created_at":"2026-05-18T00:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05313v2","created_at":"2026-05-18T00:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05313","created_at":"2026-05-18T00:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"6E5GGLUT74C4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6E5GGLUT74C46LQU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6E5GGLUT","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:76fe9fba4c6a9ad6fbb30b10746021616d446a6bb2d9f36972afc5b1455b6641","target":"graph","created_at":"2026-05-18T00:11:30Z","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":"Analysis and visualization of an information network can be facilitated better using an appropriate embedding of the network. Network embedding learns a compact low-dimensional vector representation for each node of the network, and uses this lower dimensional representation for different network analysis tasks. Only the structure of the network is considered by a majority of the current embedding algorithms. However, some content is associated with each node, in most of the practical applications, which can help to understand the underlying semantics of the network. It is not straightforward ","authors_text":"Aswin Kannan, Harsh Kara, M N Murty, Sambaran Bandyopadhyay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-15T07:09:34Z","title":"FSCNMF: Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05313","kind":"arxiv","version":2},"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:c3f43447a570a1ff0b4e6c89c7c780705ff7c48a139333f1e99b1e95393d8b77","target":"record","created_at":"2026-05-18T00:11:30Z","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":"78c7f40da3a854283b106385616a10e327020657f52ab47913116b1eaa7a76e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-04-15T07:09:34Z","title_canon_sha256":"5b5282db2fd75df630a2828dacc2ebd07953b86b34cdca03667d925a575bd16a"},"schema_version":"1.0","source":{"id":"1804.05313","kind":"arxiv","version":2}},"canonical_sha256":"f13a632e93ff05cf2e148de9667819fc0057c77b9d231eece039edcd9c90117b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f13a632e93ff05cf2e148de9667819fc0057c77b9d231eece039edcd9c90117b","first_computed_at":"2026-05-18T00:11:30.216478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:30.216478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"idi5eKvOpQZw2Ogzjtu/Ayi4C0oPo8OhfH7OAf3Jk6S2YH2wvzEFtM+zmC/lcmqOofhDR/tqvyzvmV4PJc1XAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:30.216989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05313","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f43447a570a1ff0b4e6c89c7c780705ff7c48a139333f1e99b1e95393d8b77","sha256:76fe9fba4c6a9ad6fbb30b10746021616d446a6bb2d9f36972afc5b1455b6641"],"state_sha256":"8298ee588b3f96c9fa595cfac3451670def4e9893bfbb18875d3aea6b0f264e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOws5TYl+XE7JM36Svmc62lSIOKH0JIyLG6JFgaYNzoV5+lLuu2BtmpP0wZvBGCU3ztomHM3inKznKCDI5FMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:16:26.453507Z","bundle_sha256":"eae8023029517e6f83a66b92d9f9a1d05c69c6092649bdba8b2e8adb4329d04a"}}