{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2VFDFS447BH5GDKUMTDPESDQFZ","short_pith_number":"pith:2VFDFS44","schema_version":"1.0","canonical_sha256":"d54a32cb9cf84fd30d5464c6f248702e527da30cf532fece03eb9b62542e1bda","source":{"kind":"arxiv","id":"1705.09355","version":5},"attestation_state":"computed","paper":{"title":"A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Avanti Athreya, Carey E. Priebe, Keith Levin, Minh Tang, Vince Lyzinski, Youngser Park","submitted_at":"2017-05-25T20:48:15Z","abstract_excerpt":"Performing statistical analyses on collections of graphs is of import to many disciplines, but principled, scalable methods for multi-sample graph inference are few. Here we describe an \"omnibus\" embedding in which multiple graphs on the same vertex set are jointly embedded into a single space with a distinct representation for each graph. We prove a central limit theorem for this embedding and demonstrate how it streamlines graph comparison, obviating the need for pairwise subspace alignments. The omnibus embedding achieves near-optimal inference accuracy when graphs arise from a common distr"},"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":"1705.09355","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-25T20:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"8090f402fd931e5c76e6e12e0130d6d0a04de1fd9b9bc010bc2841be053686f0","abstract_canon_sha256":"a0c63d6ef599931cf7a84ea7eeccd00848d089b78ce9a8e81aa44db603f941e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:15.543973Z","signature_b64":"b1Mdu0eNOWvAefxepCmM9PcJD4lxCSGsMmy+WgT3gN0em4SGbKvR3EHtS+Dw7E8XAYa7zEn7WpYRLensb0pCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d54a32cb9cf84fd30d5464c6f248702e527da30cf532fece03eb9b62542e1bda","last_reissued_at":"2026-05-17T23:42:15.543193Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:15.543193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Avanti Athreya, Carey E. Priebe, Keith Levin, Minh Tang, Vince Lyzinski, Youngser Park","submitted_at":"2017-05-25T20:48:15Z","abstract_excerpt":"Performing statistical analyses on collections of graphs is of import to many disciplines, but principled, scalable methods for multi-sample graph inference are few. Here we describe an \"omnibus\" embedding in which multiple graphs on the same vertex set are jointly embedded into a single space with a distinct representation for each graph. We prove a central limit theorem for this embedding and demonstrate how it streamlines graph comparison, obviating the need for pairwise subspace alignments. The omnibus embedding achieves near-optimal inference accuracy when graphs arise from a common distr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09355","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1705.09355","created_at":"2026-05-17T23:42:15.543337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09355v5","created_at":"2026-05-17T23:42:15.543337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09355","created_at":"2026-05-17T23:42:15.543337+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VFDFS447BH5","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VFDFS447BH5GDKU","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VFDFS44","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.12674","citing_title":"Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ","json":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ.json","graph_json":"https://pith.science/api/pith-number/2VFDFS447BH5GDKUMTDPESDQFZ/graph.json","events_json":"https://pith.science/api/pith-number/2VFDFS447BH5GDKUMTDPESDQFZ/events.json","paper":"https://pith.science/paper/2VFDFS44"},"agent_actions":{"view_html":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ","download_json":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ.json","view_paper":"https://pith.science/paper/2VFDFS44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09355&json=true","fetch_graph":"https://pith.science/api/pith-number/2VFDFS447BH5GDKUMTDPESDQFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2VFDFS447BH5GDKUMTDPESDQFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ/action/storage_attestation","attest_author":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ/action/author_attestation","sign_citation":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ/action/citation_signature","submit_replication":"https://pith.science/pith/2VFDFS447BH5GDKUMTDPESDQFZ/action/replication_record"}},"created_at":"2026-05-17T23:42:15.543337+00:00","updated_at":"2026-05-17T23:42:15.543337+00:00"}