{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KUXJGSV2FF4S3LX265HDWKI7XG","short_pith_number":"pith:KUXJGSV2","schema_version":"1.0","canonical_sha256":"552e934aba29792daefaf74e3b291fb9a68834f485e03beed81647ba3dbb8cf9","source":{"kind":"arxiv","id":"2605.27172","version":1},"attestation_state":"computed","paper":{"title":"Convergence Rates of Ordering, Testing and Estimation Procedures for Graphons With Fast Boundary Decay Rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, Jeannette Janssen, Na Lin","submitted_at":"2026-05-26T15:28:05Z","abstract_excerpt":"In latent-position random graph models (LPMs), latent vertex positions $U_{1},\\ldots,U_{n}$ are sampled from some distribution on a latent space $\\Omega$, then edges of an observed graph $G = ([n],E)$ are sampled with some probability $\\mathbb{P}[(i,j) \\in E ]=w(U_i,U_j)$ that depends on the unobserved latent positions. LPMs are ubiquitous in the statistical analysis of networks, offering models that have good empirical performance, strong theoretical guarantees, and tractable algorithms. The special case $\\Omega = [0,1]$ is important, as it corresponds to graphs with temporal or preference-ba"},"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":"2605.27172","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-26T15:28:05Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"8047ce699e1ae5ee7b8ebf9325d0818c5e2b32f1cd57c57a6fb5d07f79d54e19","abstract_canon_sha256":"528c3efeddc9e72503c5f7839f55ac24c913a88c05fdadb8c8040a05de713606"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:05:46.313439Z","signature_b64":"/UjKK9FRCG7LLSe3dFA+Za7Xh4BU5Forul3FGzcIubtg0g9tjG6PafLNaKZbYy6+H2UJp4YMo+SWWYu9EcsxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"552e934aba29792daefaf74e3b291fb9a68834f485e03beed81647ba3dbb8cf9","last_reissued_at":"2026-05-27T02:05:46.312659Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:05:46.312659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Rates of Ordering, Testing and Estimation Procedures for Graphons With Fast Boundary Decay Rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, Jeannette Janssen, Na Lin","submitted_at":"2026-05-26T15:28:05Z","abstract_excerpt":"In latent-position random graph models (LPMs), latent vertex positions $U_{1},\\ldots,U_{n}$ are sampled from some distribution on a latent space $\\Omega$, then edges of an observed graph $G = ([n],E)$ are sampled with some probability $\\mathbb{P}[(i,j) \\in E ]=w(U_i,U_j)$ that depends on the unobserved latent positions. LPMs are ubiquitous in the statistical analysis of networks, offering models that have good empirical performance, strong theoretical guarantees, and tractable algorithms. The special case $\\Omega = [0,1]$ is important, as it corresponds to graphs with temporal or preference-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27172","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/2605.27172/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":"2605.27172","created_at":"2026-05-27T02:05:46.312787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27172v1","created_at":"2026-05-27T02:05:46.312787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27172","created_at":"2026-05-27T02:05:46.312787+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUXJGSV2FF4S","created_at":"2026-05-27T02:05:46.312787+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUXJGSV2FF4S3LX2","created_at":"2026-05-27T02:05:46.312787+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUXJGSV2","created_at":"2026-05-27T02:05:46.312787+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG","json":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG.json","graph_json":"https://pith.science/api/pith-number/KUXJGSV2FF4S3LX265HDWKI7XG/graph.json","events_json":"https://pith.science/api/pith-number/KUXJGSV2FF4S3LX265HDWKI7XG/events.json","paper":"https://pith.science/paper/KUXJGSV2"},"agent_actions":{"view_html":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG","download_json":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG.json","view_paper":"https://pith.science/paper/KUXJGSV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27172&json=true","fetch_graph":"https://pith.science/api/pith-number/KUXJGSV2FF4S3LX265HDWKI7XG/graph.json","fetch_events":"https://pith.science/api/pith-number/KUXJGSV2FF4S3LX265HDWKI7XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG/action/storage_attestation","attest_author":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG/action/author_attestation","sign_citation":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG/action/citation_signature","submit_replication":"https://pith.science/pith/KUXJGSV2FF4S3LX265HDWKI7XG/action/replication_record"}},"created_at":"2026-05-27T02:05:46.312787+00:00","updated_at":"2026-05-27T02:05:46.312787+00:00"}