{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WIGRUUYTJL3C2CK46BWC6CKLNO","short_pith_number":"pith:WIGRUUYT","schema_version":"1.0","canonical_sha256":"b20d1a53134af62d095cf06c2f094b6b8fa4d945146eba2e77b623741028288a","source":{"kind":"arxiv","id":"2402.17906","version":1},"attestation_state":"computed","paper":{"title":"Representation learning in multiplex graphs: Where and how to fuse information?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Piotr Bielak, Tomasz Kajdanowicz","submitted_at":"2024-02-27T21:47:06Z","abstract_excerpt":"In recent years, unsupervised and self-supervised graph representation learning has gained popularity in the research community. However, most proposed methods are focused on homogeneous networks, whereas real-world graphs often contain multiple node and edge types. Multiplex graphs, a special type of heterogeneous graphs, possess richer information, provide better modeling capabilities and integrate more detailed data from potentially different sources. The diverse edge types in multiplex graphs provide more context and insights into the underlying processes of representation learning. In thi"},"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":"2402.17906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-27T21:47:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"31c9b1838047a9fa980369f140ac29e6a54a88c37aecc2958db2f708f7354c0d","abstract_canon_sha256":"09bf97f4dbc733825a2c9e5fbac7d33f57e3c0a927d13143b8d724f67035cd05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:09.614428Z","signature_b64":"uEkcfwEOVpelK019/N8UsS0TngzQOuvM9QDavtjq1pJc34YbU+1kAePkhyGFlIJh33/Fe4YPhbUsHIuLqY+ICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b20d1a53134af62d095cf06c2f094b6b8fa4d945146eba2e77b623741028288a","last_reissued_at":"2026-07-05T07:50:09.614039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:09.614039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation learning in multiplex graphs: Where and how to fuse information?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Piotr Bielak, Tomasz Kajdanowicz","submitted_at":"2024-02-27T21:47:06Z","abstract_excerpt":"In recent years, unsupervised and self-supervised graph representation learning has gained popularity in the research community. However, most proposed methods are focused on homogeneous networks, whereas real-world graphs often contain multiple node and edge types. Multiplex graphs, a special type of heterogeneous graphs, possess richer information, provide better modeling capabilities and integrate more detailed data from potentially different sources. The diverse edge types in multiplex graphs provide more context and insights into the underlying processes of representation learning. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17906","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/2402.17906/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":"2402.17906","created_at":"2026-07-05T07:50:09.614100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17906v1","created_at":"2026-07-05T07:50:09.614100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17906","created_at":"2026-07-05T07:50:09.614100+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIGRUUYTJL3C","created_at":"2026-07-05T07:50:09.614100+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIGRUUYTJL3C2CK4","created_at":"2026-07-05T07:50:09.614100+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIGRUUYT","created_at":"2026-07-05T07:50:09.614100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15428","citing_title":"GeoAI-Enhanced Community Detection on Spatial Networks with Graph Deep Learning","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO","json":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO.json","graph_json":"https://pith.science/api/pith-number/WIGRUUYTJL3C2CK46BWC6CKLNO/graph.json","events_json":"https://pith.science/api/pith-number/WIGRUUYTJL3C2CK46BWC6CKLNO/events.json","paper":"https://pith.science/paper/WIGRUUYT"},"agent_actions":{"view_html":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO","download_json":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO.json","view_paper":"https://pith.science/paper/WIGRUUYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17906&json=true","fetch_graph":"https://pith.science/api/pith-number/WIGRUUYTJL3C2CK46BWC6CKLNO/graph.json","fetch_events":"https://pith.science/api/pith-number/WIGRUUYTJL3C2CK46BWC6CKLNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO/action/storage_attestation","attest_author":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO/action/author_attestation","sign_citation":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO/action/citation_signature","submit_replication":"https://pith.science/pith/WIGRUUYTJL3C2CK46BWC6CKLNO/action/replication_record"}},"created_at":"2026-07-05T07:50:09.614100+00:00","updated_at":"2026-07-05T07:50:09.614100+00:00"}