{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:56FGKKZYLXYJNUTSCVPKOXEJF6","short_pith_number":"pith:56FGKKZY","schema_version":"1.0","canonical_sha256":"ef8a652b385df096d272155ea75c892f826e2450f56f53f88adcdf1aee1d2935","source":{"kind":"arxiv","id":"1309.5936","version":1},"attestation_state":"computed","paper":{"title":"Nonparametric graphon estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Patrick J. Wolfe, Sofia C. Olhede","submitted_at":"2013-09-23T19:54:20Z","abstract_excerpt":"We propose a nonparametric framework for the analysis of networks, based on a natural limit object termed a graphon. We prove consistency of graphon estimation under general conditions, giving rates which include the important practical setting of sparse networks. Our results cover dense and sparse stochastic blockmodels with a growing number of classes, under model misspecification. We use profile likelihood methods, and connect our results to approximation theory, nonparametric function estimation, and the theory of graph limits."},"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":"1309.5936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-23T19:54:20Z","cross_cats_sorted":["math.CO","math.PR","stat.TH"],"title_canon_sha256":"561de732a427d82552379536c7f6bc2b4d83790165b9da22e63874eae8450b7d","abstract_canon_sha256":"17069b9972d5f277f213197e8df2dc184ab862ac800074d6661ede4a5d9801a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:08.325416Z","signature_b64":"0U6CN/BmHgVRANsD/oTRFed7YFVCjh6d+yVtPMeCHQ9Zo2GhiMabEe2ICVTbXiPppeWQhf/wNUvhcrnt7VKSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef8a652b385df096d272155ea75c892f826e2450f56f53f88adcdf1aee1d2935","last_reissued_at":"2026-05-18T03:12:08.324711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:08.324711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonparametric graphon estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Patrick J. Wolfe, Sofia C. Olhede","submitted_at":"2013-09-23T19:54:20Z","abstract_excerpt":"We propose a nonparametric framework for the analysis of networks, based on a natural limit object termed a graphon. We prove consistency of graphon estimation under general conditions, giving rates which include the important practical setting of sparse networks. Our results cover dense and sparse stochastic blockmodels with a growing number of classes, under model misspecification. We use profile likelihood methods, and connect our results to approximation theory, nonparametric function estimation, and the theory of graph limits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5936","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":"1309.5936","created_at":"2026-05-18T03:12:08.324814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5936v1","created_at":"2026-05-18T03:12:08.324814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5936","created_at":"2026-05-18T03:12:08.324814+00:00"},{"alias_kind":"pith_short_12","alias_value":"56FGKKZYLXYJ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"56FGKKZYLXYJNUTS","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"56FGKKZY","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.04365","citing_title":"Attributed Network Alignment: Statistical Limits and Efficient Algorithm","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6","json":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6.json","graph_json":"https://pith.science/api/pith-number/56FGKKZYLXYJNUTSCVPKOXEJF6/graph.json","events_json":"https://pith.science/api/pith-number/56FGKKZYLXYJNUTSCVPKOXEJF6/events.json","paper":"https://pith.science/paper/56FGKKZY"},"agent_actions":{"view_html":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6","download_json":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6.json","view_paper":"https://pith.science/paper/56FGKKZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5936&json=true","fetch_graph":"https://pith.science/api/pith-number/56FGKKZYLXYJNUTSCVPKOXEJF6/graph.json","fetch_events":"https://pith.science/api/pith-number/56FGKKZYLXYJNUTSCVPKOXEJF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6/action/storage_attestation","attest_author":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6/action/author_attestation","sign_citation":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6/action/citation_signature","submit_replication":"https://pith.science/pith/56FGKKZYLXYJNUTSCVPKOXEJF6/action/replication_record"}},"created_at":"2026-05-18T03:12:08.324814+00:00","updated_at":"2026-05-18T03:12:08.324814+00:00"}