{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RNOPPU2M3LFV3WRGLXJUUSXECP","short_pith_number":"pith:RNOPPU2M","schema_version":"1.0","canonical_sha256":"8b5cf7d34cdacb5dda265dd34a4ae413f328bc9c7190c1be2bd569410f47f330","source":{"kind":"arxiv","id":"2007.10455","version":3},"attestation_state":"computed","paper":{"title":"The multilayer random dot product graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrew Jones, Patrick Rubin-Delanchy","submitted_at":"2020-07-20T20:31:39Z","abstract_excerpt":"We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- which share a common subset of nodes, and propose a method for jointly embedding the associated adjacency matrices, or submatrices thereof, into a suitable latent space. Theoretical results concerning the asymptotic behaviour of the node representations thus obtained are established, showing that after the application of a linear transformation these converge uniformly in the Euclidean norm to the latent positions with"},"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":"2007.10455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-20T20:31:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cf6a971dd41abe257886761432cc9f2b54bd236b267a1d1e25ee40bbaa115310","abstract_canon_sha256":"7bbadcc881faa02237af289ef6407e635d6f0e7108b01b16102adcad1901110d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:11.577094Z","signature_b64":"jBsT5jPAM0YfC1fqZC4081oimaHHeblbx/ICKwNG7QkgXPi9tQ7XdfMvlazsg2t+iqBahVG7ErOdUfqfvSNwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b5cf7d34cdacb5dda265dd34a4ae413f328bc9c7190c1be2bd569410f47f330","last_reissued_at":"2026-07-05T02:09:11.576642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:11.576642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The multilayer random dot product graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrew Jones, Patrick Rubin-Delanchy","submitted_at":"2020-07-20T20:31:39Z","abstract_excerpt":"We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- which share a common subset of nodes, and propose a method for jointly embedding the associated adjacency matrices, or submatrices thereof, into a suitable latent space. Theoretical results concerning the asymptotic behaviour of the node representations thus obtained are established, showing that after the application of a linear transformation these converge uniformly in the Euclidean norm to the latent positions with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.10455","kind":"arxiv","version":3},"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/2007.10455/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":"2007.10455","created_at":"2026-07-05T02:09:11.576699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.10455v3","created_at":"2026-07-05T02:09:11.576699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.10455","created_at":"2026-07-05T02:09:11.576699+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNOPPU2M3LFV","created_at":"2026-07-05T02:09:11.576699+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNOPPU2M3LFV3WRG","created_at":"2026-07-05T02:09:11.576699+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNOPPU2M","created_at":"2026-07-05T02:09:11.576699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11768","citing_title":"Hierarchical excitatory processes for modelling event-time data in the presence of exogenous stimuli","ref_index":100,"is_internal_anchor":false},{"citing_arxiv_id":"2410.09810","citing_title":"Doubly unfolded adjacency spectral embedding of dynamic multiplex graphs","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2508.12674","citing_title":"Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP","json":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP.json","graph_json":"https://pith.science/api/pith-number/RNOPPU2M3LFV3WRGLXJUUSXECP/graph.json","events_json":"https://pith.science/api/pith-number/RNOPPU2M3LFV3WRGLXJUUSXECP/events.json","paper":"https://pith.science/paper/RNOPPU2M"},"agent_actions":{"view_html":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP","download_json":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP.json","view_paper":"https://pith.science/paper/RNOPPU2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.10455&json=true","fetch_graph":"https://pith.science/api/pith-number/RNOPPU2M3LFV3WRGLXJUUSXECP/graph.json","fetch_events":"https://pith.science/api/pith-number/RNOPPU2M3LFV3WRGLXJUUSXECP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP/action/storage_attestation","attest_author":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP/action/author_attestation","sign_citation":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP/action/citation_signature","submit_replication":"https://pith.science/pith/RNOPPU2M3LFV3WRGLXJUUSXECP/action/replication_record"}},"created_at":"2026-07-05T02:09:11.576699+00:00","updated_at":"2026-07-05T02:09:11.576699+00:00"}