{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FMCS4YDKTWK45TLFVHELROPA2E","short_pith_number":"pith:FMCS4YDK","schema_version":"1.0","canonical_sha256":"2b052e606a9d95cecd65a9c8b8b9e0d10c04bc7a8fe8f215169302d5bf3a86f1","source":{"kind":"arxiv","id":"2307.01942","version":1},"attestation_state":"computed","paper":{"title":"Minimax rates for latent position estimation in the generalized random dot product graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hao Yan, Keith Levin","submitted_at":"2023-07-04T22:18:27Z","abstract_excerpt":"Latent space models play an important role in the modeling and analysis of network data. Under these models, each node has an associated latent point in some (typically low-dimensional) geometric space, and network formation is driven by this unobserved geometric structure. The random dot product graph (RDPG) and its generalization (GRDPG) are latent space models under which this latent geometry is taken to be Euclidean. These latent vectors can be efficiently and accurately estimated using well-studied spectral embeddings. In this paper, we develop a minimax lower bound for estimating the lat"},"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":"2307.01942","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-07-04T22:18:27Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"247e46a56981bd4bc27a895a224d9e54899962ba5e47e5ceaeedbe190c0a3821","abstract_canon_sha256":"c438f3f5efc99dc289bd9b47248a5a970877f3c938d5a1383d076c51e05ad0d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:02.793262Z","signature_b64":"QVXa/Ksu7A7sIiLQ5Yeb1xxoggAqA6wcXreZ4Sj+Cp0SnwIDNpRlP/Ar08FH0qska1buOUYByAdhU4LeynvGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b052e606a9d95cecd65a9c8b8b9e0d10c04bc7a8fe8f215169302d5bf3a86f1","last_reissued_at":"2026-07-05T06:28:02.792833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:02.792833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimax rates for latent position estimation in the generalized random dot product graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hao Yan, Keith Levin","submitted_at":"2023-07-04T22:18:27Z","abstract_excerpt":"Latent space models play an important role in the modeling and analysis of network data. Under these models, each node has an associated latent point in some (typically low-dimensional) geometric space, and network formation is driven by this unobserved geometric structure. The random dot product graph (RDPG) and its generalization (GRDPG) are latent space models under which this latent geometry is taken to be Euclidean. These latent vectors can be efficiently and accurately estimated using well-studied spectral embeddings. In this paper, we develop a minimax lower bound for estimating the lat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01942","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/2307.01942/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":"2307.01942","created_at":"2026-07-05T06:28:02.792899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01942v1","created_at":"2026-07-05T06:28:02.792899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01942","created_at":"2026-07-05T06:28:02.792899+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMCS4YDKTWK4","created_at":"2026-07-05T06:28:02.792899+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMCS4YDKTWK45TLF","created_at":"2026-07-05T06:28:02.792899+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMCS4YDK","created_at":"2026-07-05T06:28:02.792899+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17274","citing_title":"Signal Recovery from Random Dot-Product Graphs Under Local Differential Privacy","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E","json":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E.json","graph_json":"https://pith.science/api/pith-number/FMCS4YDKTWK45TLFVHELROPA2E/graph.json","events_json":"https://pith.science/api/pith-number/FMCS4YDKTWK45TLFVHELROPA2E/events.json","paper":"https://pith.science/paper/FMCS4YDK"},"agent_actions":{"view_html":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E","download_json":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E.json","view_paper":"https://pith.science/paper/FMCS4YDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01942&json=true","fetch_graph":"https://pith.science/api/pith-number/FMCS4YDKTWK45TLFVHELROPA2E/graph.json","fetch_events":"https://pith.science/api/pith-number/FMCS4YDKTWK45TLFVHELROPA2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E/action/storage_attestation","attest_author":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E/action/author_attestation","sign_citation":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E/action/citation_signature","submit_replication":"https://pith.science/pith/FMCS4YDKTWK45TLFVHELROPA2E/action/replication_record"}},"created_at":"2026-07-05T06:28:02.792899+00:00","updated_at":"2026-07-05T06:28:02.792899+00:00"}