{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q3THSMETNBZGEQK43DXSNWJKCX","short_pith_number":"pith:Q3THSMET","schema_version":"1.0","canonical_sha256":"86e6793093687262415cd8ef26d92a15c8cfb2186287a81b432ede479c6bf3d8","source":{"kind":"arxiv","id":"1801.04339","version":3},"attestation_state":"computed","paper":{"title":"Estimating the Number of Connected Components in a Graph via Subgraph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jason M. Klusowski, Yihong Wu","submitted_at":"2018-01-12T22:13:48Z","abstract_excerpt":"Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \\cite{Goodman1949} and Frank \\cite{Frank1978}. We revisit a problem formulated by Frank \\cite{Frank1978} of estimating the number of connected components in a large graph based on the subgraph sampling model, in which we randomly sample a subset of the vertices and observe the induced subgraph. The key question is whether accurate estimation is achievable in the \\emph{sublinear} regime where only a vanishing fraction of the vertices are sampled. We show"},"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":"1801.04339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-12T22:13:48Z","cross_cats_sorted":["cs.DM","cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"e9a8a7e62f4003ed0107a38613740286b987061eb83b1ebdcf16e53ce086ee44","abstract_canon_sha256":"7e90b4e17e263744de05f3bf0faca5715c656a1413554db5e80521a576a5e28b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:18.293628Z","signature_b64":"GtFY4cHxOqThJ8WUZRvDVSr6J81FdXE1HObzpOMk9oao4ZOLPCrtWidu7kH/Omh584sbuwAEI70Mxhlv4YjoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e6793093687262415cd8ef26d92a15c8cfb2186287a81b432ede479c6bf3d8","last_reissued_at":"2026-05-17T23:43:18.292668Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:18.292668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating the Number of Connected Components in a Graph via Subgraph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jason M. Klusowski, Yihong Wu","submitted_at":"2018-01-12T22:13:48Z","abstract_excerpt":"Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \\cite{Goodman1949} and Frank \\cite{Frank1978}. We revisit a problem formulated by Frank \\cite{Frank1978} of estimating the number of connected components in a large graph based on the subgraph sampling model, in which we randomly sample a subset of the vertices and observe the induced subgraph. The key question is whether accurate estimation is achievable in the \\emph{sublinear} regime where only a vanishing fraction of the vertices are sampled. We show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04339","kind":"arxiv","version":3},"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":"1801.04339","created_at":"2026-05-17T23:43:18.292824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04339v3","created_at":"2026-05-17T23:43:18.292824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04339","created_at":"2026-05-17T23:43:18.292824+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3THSMETNBZG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3THSMETNBZGEQK4","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3THSMET","created_at":"2026-05-18T12:32:46.962924+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/Q3THSMETNBZGEQK43DXSNWJKCX","json":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX.json","graph_json":"https://pith.science/api/pith-number/Q3THSMETNBZGEQK43DXSNWJKCX/graph.json","events_json":"https://pith.science/api/pith-number/Q3THSMETNBZGEQK43DXSNWJKCX/events.json","paper":"https://pith.science/paper/Q3THSMET"},"agent_actions":{"view_html":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX","download_json":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX.json","view_paper":"https://pith.science/paper/Q3THSMET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04339&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3THSMETNBZGEQK43DXSNWJKCX/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3THSMETNBZGEQK43DXSNWJKCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX/action/storage_attestation","attest_author":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX/action/author_attestation","sign_citation":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX/action/citation_signature","submit_replication":"https://pith.science/pith/Q3THSMETNBZGEQK43DXSNWJKCX/action/replication_record"}},"created_at":"2026-05-17T23:43:18.292824+00:00","updated_at":"2026-05-17T23:43:18.292824+00:00"}