{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S23CRAT2REMHNS4TNV4CUP3RRY","short_pith_number":"pith:S23CRAT2","schema_version":"1.0","canonical_sha256":"96b628827a891876cb936d782a3f718e08792ded9481d8d7e8c54ed4fad7ac02","source":{"kind":"arxiv","id":"2501.15725","version":1},"attestation_state":"computed","paper":{"title":"Eigenvector fluctuations and limit results for random graphs with infinite rank kernels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Joshua R. Cape, Minh Tang","submitted_at":"2025-01-27T01:40:03Z","abstract_excerpt":"This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly indefinite. We first derive uniform error bounds in the two-to-infinity norm as well as row-wise normal approximations for the leading sample eigenvectors. We then build on these results to tackle two graph inference problems, namely (i) entrywise bounds for graphon estimation and (ii) testing for the equality of latent positions, the latter of which is achieved by "},"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":"2501.15725","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-01-27T01:40:03Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"7075d458974bcd244f61c0bff37056d95989a693d1f1b39689175d6669319849","abstract_canon_sha256":"d8866b577ad1a61e9ab1b3e374d454cbe9d7cda3463663eaca09692f3964780b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:49.614248Z","signature_b64":"rJCYn76QSyjgDE0WKWfzsb3NitkZ4IqCGCDQ1sR6uvCyZMt9j1gZ64CxXoPUpAL0DuYHWCM/K7OSEVR3MslYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b628827a891876cb936d782a3f718e08792ded9481d8d7e8c54ed4fad7ac02","last_reissued_at":"2026-07-05T10:05:49.613725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:49.613725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eigenvector fluctuations and limit results for random graphs with infinite rank kernels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Joshua R. Cape, Minh Tang","submitted_at":"2025-01-27T01:40:03Z","abstract_excerpt":"This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly indefinite. We first derive uniform error bounds in the two-to-infinity norm as well as row-wise normal approximations for the leading sample eigenvectors. We then build on these results to tackle two graph inference problems, namely (i) entrywise bounds for graphon estimation and (ii) testing for the equality of latent positions, the latter of which is achieved by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15725","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/2501.15725/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":"2501.15725","created_at":"2026-07-05T10:05:49.613789+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15725v1","created_at":"2026-07-05T10:05:49.613789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15725","created_at":"2026-07-05T10:05:49.613789+00:00"},{"alias_kind":"pith_short_12","alias_value":"S23CRAT2REMH","created_at":"2026-07-05T10:05:49.613789+00:00"},{"alias_kind":"pith_short_16","alias_value":"S23CRAT2REMHNS4T","created_at":"2026-07-05T10:05:49.613789+00:00"},{"alias_kind":"pith_short_8","alias_value":"S23CRAT2","created_at":"2026-07-05T10:05:49.613789+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06482","citing_title":"Two-Sample Hypothesis Testing for Subspace Equality in Network Data","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06483","citing_title":"Statistically and Computationally Optimal Estimation and Inference of Common Subspaces","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20072","citing_title":"Vertex misalignment and changepoint localization in network time series","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY","json":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY.json","graph_json":"https://pith.science/api/pith-number/S23CRAT2REMHNS4TNV4CUP3RRY/graph.json","events_json":"https://pith.science/api/pith-number/S23CRAT2REMHNS4TNV4CUP3RRY/events.json","paper":"https://pith.science/paper/S23CRAT2"},"agent_actions":{"view_html":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY","download_json":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY.json","view_paper":"https://pith.science/paper/S23CRAT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15725&json=true","fetch_graph":"https://pith.science/api/pith-number/S23CRAT2REMHNS4TNV4CUP3RRY/graph.json","fetch_events":"https://pith.science/api/pith-number/S23CRAT2REMHNS4TNV4CUP3RRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY/action/storage_attestation","attest_author":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY/action/author_attestation","sign_citation":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY/action/citation_signature","submit_replication":"https://pith.science/pith/S23CRAT2REMHNS4TNV4CUP3RRY/action/replication_record"}},"created_at":"2026-07-05T10:05:49.613789+00:00","updated_at":"2026-07-05T10:05:49.613789+00:00"}