{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WDWISAJNIU25ZHLNTK4DCN7RIM","short_pith_number":"pith:WDWISAJN","schema_version":"1.0","canonical_sha256":"b0ec89012d4535dc9d6d9ab83137f1433330bae5be3c1d8f57739eb67780ddb1","source":{"kind":"arxiv","id":"1610.08473","version":1},"attestation_state":"computed","paper":{"title":"Estimating the Size of a Large Network and its Communities from a Random Sample","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.ML","authors_text":"Amin Karbasi, Forrest W. Crawford, Lin Chen","submitted_at":"2016-10-26T19:26:47Z","abstract_excerpt":"Most real-world networks are too large to be measured or studied directly and there is substantial interest in estimating global network properties from smaller sub-samples. One of the most important global properties is the number of vertices/nodes in the network. Estimating the number of vertices in a large network is a major challenge in computer science, epidemiology, demography, and intelligence analysis. In this paper we consider a population random graph G = (V;E) from the stochastic block model (SBM) with K communities/blocks. A sample is obtained by randomly choosing a subset W and le"},"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":"1610.08473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-26T19:26:47Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"6a012ac0e8f76d2569cbee680711a5d93d6311359853380018c41be71a748b83","abstract_canon_sha256":"0ebdaba728f931b8277b780adeb9196d790ef5f5f23ef6995aba3ded0d2a0676"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.357265Z","signature_b64":"C1ZwlUSH3N3t87QVGZhxiIDwG0p/HYl59O9m0MYtr1a4gAVpDUoAzOsSzW3osMocuZc53bt63Z/orapJW9OEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ec89012d4535dc9d6d9ab83137f1433330bae5be3c1d8f57739eb67780ddb1","last_reissued_at":"2026-05-18T01:01:09.356559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.356559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating the Size of a Large Network and its Communities from a Random Sample","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.ML","authors_text":"Amin Karbasi, Forrest W. Crawford, Lin Chen","submitted_at":"2016-10-26T19:26:47Z","abstract_excerpt":"Most real-world networks are too large to be measured or studied directly and there is substantial interest in estimating global network properties from smaller sub-samples. One of the most important global properties is the number of vertices/nodes in the network. Estimating the number of vertices in a large network is a major challenge in computer science, epidemiology, demography, and intelligence analysis. In this paper we consider a population random graph G = (V;E) from the stochastic block model (SBM) with K communities/blocks. A sample is obtained by randomly choosing a subset W and le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08473","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":"1610.08473","created_at":"2026-05-18T01:01:09.356677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08473v1","created_at":"2026-05-18T01:01:09.356677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08473","created_at":"2026-05-18T01:01:09.356677+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDWISAJNIU25","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDWISAJNIU25ZHLN","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDWISAJN","created_at":"2026-05-18T12:30:48.956258+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/WDWISAJNIU25ZHLNTK4DCN7RIM","json":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM.json","graph_json":"https://pith.science/api/pith-number/WDWISAJNIU25ZHLNTK4DCN7RIM/graph.json","events_json":"https://pith.science/api/pith-number/WDWISAJNIU25ZHLNTK4DCN7RIM/events.json","paper":"https://pith.science/paper/WDWISAJN"},"agent_actions":{"view_html":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM","download_json":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM.json","view_paper":"https://pith.science/paper/WDWISAJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08473&json=true","fetch_graph":"https://pith.science/api/pith-number/WDWISAJNIU25ZHLNTK4DCN7RIM/graph.json","fetch_events":"https://pith.science/api/pith-number/WDWISAJNIU25ZHLNTK4DCN7RIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM/action/storage_attestation","attest_author":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM/action/author_attestation","sign_citation":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM/action/citation_signature","submit_replication":"https://pith.science/pith/WDWISAJNIU25ZHLNTK4DCN7RIM/action/replication_record"}},"created_at":"2026-05-18T01:01:09.356677+00:00","updated_at":"2026-05-18T01:01:09.356677+00:00"}