{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WVCHKFOOOLEMBHBTA3XEOZDUM3","short_pith_number":"pith:WVCHKFOO","schema_version":"1.0","canonical_sha256":"b5447515ce72c8c09c3306ee47647466dfeef92c6e4b92e2f46b6835eb7f83c6","source":{"kind":"arxiv","id":"1611.00843","version":1},"attestation_state":"computed","paper":{"title":"Sampling and Estimation for (Sparse) Exchangeable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel M. Roy, Victor Veitch","submitted_at":"2016-11-02T23:24:15Z","abstract_excerpt":"Sparse exchangeable graphs on $\\mathbb{R}_+$, and the associated graphex framework for sparse graphs, generalize exchangeable graphs on $\\mathbb{N}$, and the associated graphon framework for dense graphs. We develop the graphex framework as a tool for statistical network analysis by identifying the sampling scheme that is naturally associated with the models of the framework, and by introducing a general consistent estimator for the parameter (the graphex) underlying these models. The sampling scheme is a modification of independent vertex sampling that throws away vertices that are isolated i"},"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":"1611.00843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-11-02T23:24:15Z","cross_cats_sorted":["cs.SI","math.CO","stat.TH"],"title_canon_sha256":"fdb6311709d7410b4bb7a36caac3519ca373dbab360537f170a6cf18446f7183","abstract_canon_sha256":"0baa4ebdde9058d20868244e29302f5498fae4a18129a747ebf7da0fe554be41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:18.539372Z","signature_b64":"3pLs1WuAyyr1bAO5wuxCjkXUUM0dvsLzeEtNFHynW8WeYpCOyHKgWkvzqBTCdeifYUKCaZbie0UHX1laUSsjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5447515ce72c8c09c3306ee47647466dfeef92c6e4b92e2f46b6835eb7f83c6","last_reissued_at":"2026-05-18T01:00:18.538667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:18.538667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling and Estimation for (Sparse) Exchangeable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel M. Roy, Victor Veitch","submitted_at":"2016-11-02T23:24:15Z","abstract_excerpt":"Sparse exchangeable graphs on $\\mathbb{R}_+$, and the associated graphex framework for sparse graphs, generalize exchangeable graphs on $\\mathbb{N}$, and the associated graphon framework for dense graphs. We develop the graphex framework as a tool for statistical network analysis by identifying the sampling scheme that is naturally associated with the models of the framework, and by introducing a general consistent estimator for the parameter (the graphex) underlying these models. The sampling scheme is a modification of independent vertex sampling that throws away vertices that are isolated i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00843","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":"1611.00843","created_at":"2026-05-18T01:00:18.538778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00843v1","created_at":"2026-05-18T01:00:18.538778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00843","created_at":"2026-05-18T01:00:18.538778+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVCHKFOOOLEM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVCHKFOOOLEMBHBT","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVCHKFOO","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.01613","citing_title":"A correction to Kallenberg's theorem for jointly exchangeable random measures","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01605","citing_title":"Limits of Sparse Configuration Models and Beyond: Graphexes and Multi-Graphexes","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3","json":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3.json","graph_json":"https://pith.science/api/pith-number/WVCHKFOOOLEMBHBTA3XEOZDUM3/graph.json","events_json":"https://pith.science/api/pith-number/WVCHKFOOOLEMBHBTA3XEOZDUM3/events.json","paper":"https://pith.science/paper/WVCHKFOO"},"agent_actions":{"view_html":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3","download_json":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3.json","view_paper":"https://pith.science/paper/WVCHKFOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00843&json=true","fetch_graph":"https://pith.science/api/pith-number/WVCHKFOOOLEMBHBTA3XEOZDUM3/graph.json","fetch_events":"https://pith.science/api/pith-number/WVCHKFOOOLEMBHBTA3XEOZDUM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3/action/storage_attestation","attest_author":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3/action/author_attestation","sign_citation":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3/action/citation_signature","submit_replication":"https://pith.science/pith/WVCHKFOOOLEMBHBTA3XEOZDUM3/action/replication_record"}},"created_at":"2026-05-18T01:00:18.538778+00:00","updated_at":"2026-05-18T01:00:18.538778+00:00"}