{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3UIM65HD4XFH5UYBOWA43CQRW7","short_pith_number":"pith:3UIM65HD","schema_version":"1.0","canonical_sha256":"dd10cf74e3e5ca7ed3017581cd8a11b7fda20862f01e1440e9dd3caf3fe018f5","source":{"kind":"arxiv","id":"2102.06371","version":1},"attestation_state":"computed","paper":{"title":"Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Hansheng Xue, Luwei Yang, Vaibhav Rajan, Wen Jiang, Yi Wei, Yu Lin","submitted_at":"2021-02-12T07:20:36Z","abstract_excerpt":"A bipartite network is a graph structure where nodes are from two distinct domains and only inter-domain interactions exist as edges. A large number of network embedding methods exist to learn vectorial node representations from general graphs with both homogeneous and heterogeneous node and edge types, including some that can specifically model the distinct properties of bipartite networks. However, these methods are inadequate to model multiplex bipartite networks (e.g., in e-commerce), that have multiple types of interactions (e.g., click, inquiry, and buy) and node attributes. Most real-wo"},"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":"2102.06371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-12T07:20:36Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0c10688a7f287eb1746f54a45d0df6c8e0781a87d7e010985b8c7d2a8bba3c6d","abstract_canon_sha256":"23abe65f4e916d27445882e85e0cabf704c7446eecbaf3b287e2161919a54a98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:47.528577Z","signature_b64":"v+E3066K4FvXArxUTH7MMoqiZGjXASyGDyf6p0egkn/m1vroVUe1Op4Sy+G5yax0opFWUjUJhdBOgpeG5wZPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd10cf74e3e5ca7ed3017581cd8a11b7fda20862f01e1440e9dd3caf3fe018f5","last_reissued_at":"2026-07-05T02:14:47.528057Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:47.528057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Hansheng Xue, Luwei Yang, Vaibhav Rajan, Wen Jiang, Yi Wei, Yu Lin","submitted_at":"2021-02-12T07:20:36Z","abstract_excerpt":"A bipartite network is a graph structure where nodes are from two distinct domains and only inter-domain interactions exist as edges. A large number of network embedding methods exist to learn vectorial node representations from general graphs with both homogeneous and heterogeneous node and edge types, including some that can specifically model the distinct properties of bipartite networks. However, these methods are inadequate to model multiplex bipartite networks (e.g., in e-commerce), that have multiple types of interactions (e.g., click, inquiry, and buy) and node attributes. Most real-wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06371","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/2102.06371/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":"2102.06371","created_at":"2026-07-05T02:14:47.528123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.06371v1","created_at":"2026-07-05T02:14:47.528123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06371","created_at":"2026-07-05T02:14:47.528123+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UIM65HD4XFH","created_at":"2026-07-05T02:14:47.528123+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UIM65HD4XFH5UYB","created_at":"2026-07-05T02:14:47.528123+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UIM65HD","created_at":"2026-07-05T02:14:47.528123+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/3UIM65HD4XFH5UYBOWA43CQRW7","json":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7.json","graph_json":"https://pith.science/api/pith-number/3UIM65HD4XFH5UYBOWA43CQRW7/graph.json","events_json":"https://pith.science/api/pith-number/3UIM65HD4XFH5UYBOWA43CQRW7/events.json","paper":"https://pith.science/paper/3UIM65HD"},"agent_actions":{"view_html":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7","download_json":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7.json","view_paper":"https://pith.science/paper/3UIM65HD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.06371&json=true","fetch_graph":"https://pith.science/api/pith-number/3UIM65HD4XFH5UYBOWA43CQRW7/graph.json","fetch_events":"https://pith.science/api/pith-number/3UIM65HD4XFH5UYBOWA43CQRW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7/action/storage_attestation","attest_author":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7/action/author_attestation","sign_citation":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7/action/citation_signature","submit_replication":"https://pith.science/pith/3UIM65HD4XFH5UYBOWA43CQRW7/action/replication_record"}},"created_at":"2026-07-05T02:14:47.528123+00:00","updated_at":"2026-07-05T02:14:47.528123+00:00"}