{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZFLNMX43CGPF7SVCWX35Y57EAF","short_pith_number":"pith:ZFLNMX43","schema_version":"1.0","canonical_sha256":"c956d65f9b119e5fcaa2b5f7dc77e401736d610fc19cc7ffaa47dc19aa80437d","source":{"kind":"arxiv","id":"2106.11721","version":1},"attestation_state":"computed","paper":{"title":"A Deep Latent Space Model for Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hanxuan Yang, Qingchao Kong, Wenji Mao","submitted_at":"2021-06-22T12:41:19Z","abstract_excerpt":"Graph representation learning is a fundamental problem for modeling relational data and benefits a number of downstream applications. Traditional Bayesian-based graph models and recent deep learning based GNN either suffer from impracticability or lack interpretability, thus combined models for undirected graphs have been proposed to overcome the weaknesses. As a large portion of real-world graphs are directed graphs (of which undirected graphs are special cases), in this paper, we propose a Deep Latent Space Model (DLSM) for directed graphs to incorporate the traditional latent variable based"},"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":"2106.11721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-22T12:41:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"14453c7ba7e7026d79800d5a5bc1f3416e838b4d79a0da1c58c377cbe3e644fa","abstract_canon_sha256":"a5d691ad8faf0018674ed867f0be4fdba0e00808a3e0783cfda34c730e8650dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:29.400173Z","signature_b64":"AuJvzhO0lBTxhmLgAsEnVcXob09Wk9c5QTlHCuFAOE6aGX5qtCu+BdMfEfEpHXHy1QyyvGeZXd1nx3EB3L5tBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c956d65f9b119e5fcaa2b5f7dc77e401736d610fc19cc7ffaa47dc19aa80437d","last_reissued_at":"2026-07-05T08:00:29.399640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:29.399640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deep Latent Space Model for Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hanxuan Yang, Qingchao Kong, Wenji Mao","submitted_at":"2021-06-22T12:41:19Z","abstract_excerpt":"Graph representation learning is a fundamental problem for modeling relational data and benefits a number of downstream applications. Traditional Bayesian-based graph models and recent deep learning based GNN either suffer from impracticability or lack interpretability, thus combined models for undirected graphs have been proposed to overcome the weaknesses. As a large portion of real-world graphs are directed graphs (of which undirected graphs are special cases), in this paper, we propose a Deep Latent Space Model (DLSM) for directed graphs to incorporate the traditional latent variable based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.11721","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/2106.11721/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":"2106.11721","created_at":"2026-07-05T08:00:29.399710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.11721v1","created_at":"2026-07-05T08:00:29.399710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.11721","created_at":"2026-07-05T08:00:29.399710+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFLNMX43CGPF","created_at":"2026-07-05T08:00:29.399710+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFLNMX43CGPF7SVC","created_at":"2026-07-05T08:00:29.399710+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFLNMX43","created_at":"2026-07-05T08:00:29.399710+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/ZFLNMX43CGPF7SVCWX35Y57EAF","json":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF.json","graph_json":"https://pith.science/api/pith-number/ZFLNMX43CGPF7SVCWX35Y57EAF/graph.json","events_json":"https://pith.science/api/pith-number/ZFLNMX43CGPF7SVCWX35Y57EAF/events.json","paper":"https://pith.science/paper/ZFLNMX43"},"agent_actions":{"view_html":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF","download_json":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF.json","view_paper":"https://pith.science/paper/ZFLNMX43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.11721&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFLNMX43CGPF7SVCWX35Y57EAF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFLNMX43CGPF7SVCWX35Y57EAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF/action/storage_attestation","attest_author":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF/action/author_attestation","sign_citation":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF/action/citation_signature","submit_replication":"https://pith.science/pith/ZFLNMX43CGPF7SVCWX35Y57EAF/action/replication_record"}},"created_at":"2026-07-05T08:00:29.399710+00:00","updated_at":"2026-07-05T08:00:29.399710+00:00"}