{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NFVBW4UVZ7FQQJ45MJAPHDXG7Y","short_pith_number":"pith:NFVBW4UV","schema_version":"1.0","canonical_sha256":"696a1b7295cfcb08279d6240f38ee6fe29b03030e8b881dd3480aced1ea0bfca","source":{"kind":"arxiv","id":"1709.05454","version":1},"attestation_state":"computed","paper":{"title":"Statistical inference on random dot product graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Avanti Athreya, Carey E. Priebe, Daniel L. Sussman, Donniell E. Fishkind, Joshua T. Vogelstein, Keith Levin, Minh Tang, Vince Lyzinski, Yichen Qin, Youngser Park","submitted_at":"2017-09-16T04:22:57Z","abstract_excerpt":"The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describe a comprehensive paradigm for statistical inference on random dot product graphs, a paradigm centered on spectral embeddings of adjacency and Laplacian matrices. We examine the analogues, in graph inference, of several canonical tenets of classical Euclidean inference: in partic"},"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":"1709.05454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-09-16T04:22:57Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"db5a7582ddb35e9df5f8e16d63ad348b0fb989ed13e5afef752fd9b7be4aaea8","abstract_canon_sha256":"c7498f34a434a46a76b9a888b32c2bbd9841ef9ae529d8d85caebf0143f38b18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:35.190883Z","signature_b64":"TGzieqQuuVfJrArFagJuDtXu7swnxZ7e52AH1X3D2gVUndrkqYTYn6f3lVCneg2zr1aMv4R48mviDjt2Vv85AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"696a1b7295cfcb08279d6240f38ee6fe29b03030e8b881dd3480aced1ea0bfca","last_reissued_at":"2026-05-18T00:24:35.190405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:35.190405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical inference on random dot product graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Avanti Athreya, Carey E. Priebe, Daniel L. Sussman, Donniell E. Fishkind, Joshua T. Vogelstein, Keith Levin, Minh Tang, Vince Lyzinski, Yichen Qin, Youngser Park","submitted_at":"2017-09-16T04:22:57Z","abstract_excerpt":"The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describe a comprehensive paradigm for statistical inference on random dot product graphs, a paradigm centered on spectral embeddings of adjacency and Laplacian matrices. We examine the analogues, in graph inference, of several canonical tenets of classical Euclidean inference: in partic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05454","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":""},"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":"1709.05454","created_at":"2026-05-18T00:24:35.190469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05454v1","created_at":"2026-05-18T00:24:35.190469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05454","created_at":"2026-05-18T00:24:35.190469+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFVBW4UVZ7FQ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFVBW4UVZ7FQQJ45","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFVBW4UV","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09471","citing_title":"The Statistical Cost of Adaptation in Multi-Source Transfer Learning","ref_index":230,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y","json":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y.json","graph_json":"https://pith.science/api/pith-number/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/graph.json","events_json":"https://pith.science/api/pith-number/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/events.json","paper":"https://pith.science/paper/NFVBW4UV"},"agent_actions":{"view_html":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y","download_json":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y.json","view_paper":"https://pith.science/paper/NFVBW4UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05454&json=true","fetch_graph":"https://pith.science/api/pith-number/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/action/storage_attestation","attest_author":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/action/author_attestation","sign_citation":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/action/citation_signature","submit_replication":"https://pith.science/pith/NFVBW4UVZ7FQQJ45MJAPHDXG7Y/action/replication_record"}},"created_at":"2026-05-18T00:24:35.190469+00:00","updated_at":"2026-05-18T00:24:35.190469+00:00"}