{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QCN3VZNTGMZWLDHRTCVSNFVZ47","short_pith_number":"pith:QCN3VZNT","schema_version":"1.0","canonical_sha256":"809bbae5b33333658cf198ab2696b9e7f5133b28edf07e685acc72d1d23fd571","source":{"kind":"arxiv","id":"2001.01383","version":2},"attestation_state":"computed","paper":{"title":"A Block-based Generative Model for Attributed Networks Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Yang, Hongxu Chen, Hongzhi Yin, Katarzyna Musial, Wanli Zuo, Wenzhuo Song, Xueyan Liu","submitted_at":"2020-01-06T03:44:15Z","abstract_excerpt":"Attributed network embedding has attracted plenty of interest in recent years. It aims to learn task-independent, low-dimensional, and continuous vectors for nodes preserving both topology and attribute information. Most of the existing methods, such as random-walk based methods and GCNs, mainly focus on the local information, i.e., the attributes of the neighbours. Thus, they have been well studied for assortative networks (i.e., networks with communities) but ignored disassortative networks (i.e., networks with multipartite, hubs, and hybrid structures), which are common in the real world. T"},"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.01383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-06T03:44:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ddf7b3f4026b5248c59bc2b0ae8cb4afb80e90dbf03eb50ed00d1751ec4cb03","abstract_canon_sha256":"25fdac5e83ad58474a1f7c8ff0d2ad0dc053295df83e48f9aea5d7321f6bb1ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:07.499372Z","signature_b64":"CtXjf2ZIODpFxK0xoulNi27lh7kuk+xoO1L61RmTzQWCulYYVKnTZ5bY5TIZ+MDWl3i5Wr3Eudk4msyvXMwACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"809bbae5b33333658cf198ab2696b9e7f5133b28edf07e685acc72d1d23fd571","last_reissued_at":"2026-07-05T01:48:07.498932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:07.498932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Block-based Generative Model for Attributed Networks Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Yang, Hongxu Chen, Hongzhi Yin, Katarzyna Musial, Wanli Zuo, Wenzhuo Song, Xueyan Liu","submitted_at":"2020-01-06T03:44:15Z","abstract_excerpt":"Attributed network embedding has attracted plenty of interest in recent years. It aims to learn task-independent, low-dimensional, and continuous vectors for nodes preserving both topology and attribute information. Most of the existing methods, such as random-walk based methods and GCNs, mainly focus on the local information, i.e., the attributes of the neighbours. Thus, they have been well studied for assortative networks (i.e., networks with communities) but ignored disassortative networks (i.e., networks with multipartite, hubs, and hybrid structures), which are common in the real world. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01383","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.01383/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.01383","created_at":"2026-07-05T01:48:07.498991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.01383v2","created_at":"2026-07-05T01:48:07.498991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01383","created_at":"2026-07-05T01:48:07.498991+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCN3VZNTGMZW","created_at":"2026-07-05T01:48:07.498991+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCN3VZNTGMZWLDHR","created_at":"2026-07-05T01:48:07.498991+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCN3VZNT","created_at":"2026-07-05T01:48:07.498991+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/QCN3VZNTGMZWLDHRTCVSNFVZ47","json":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47.json","graph_json":"https://pith.science/api/pith-number/QCN3VZNTGMZWLDHRTCVSNFVZ47/graph.json","events_json":"https://pith.science/api/pith-number/QCN3VZNTGMZWLDHRTCVSNFVZ47/events.json","paper":"https://pith.science/paper/QCN3VZNT"},"agent_actions":{"view_html":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47","download_json":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47.json","view_paper":"https://pith.science/paper/QCN3VZNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.01383&json=true","fetch_graph":"https://pith.science/api/pith-number/QCN3VZNTGMZWLDHRTCVSNFVZ47/graph.json","fetch_events":"https://pith.science/api/pith-number/QCN3VZNTGMZWLDHRTCVSNFVZ47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47/action/storage_attestation","attest_author":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47/action/author_attestation","sign_citation":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47/action/citation_signature","submit_replication":"https://pith.science/pith/QCN3VZNTGMZWLDHRTCVSNFVZ47/action/replication_record"}},"created_at":"2026-07-05T01:48:07.498991+00:00","updated_at":"2026-07-05T01:48:07.498991+00:00"}