{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MDHYCMDTMC2BTIXH42N72TV2NZ","short_pith_number":"pith:MDHYCMDT","schema_version":"1.0","canonical_sha256":"60cf81307360b419a2e7e69bfd4eba6e6dce455efb26f6f77c5a346b85fc10a0","source":{"kind":"arxiv","id":"1812.00139","version":1},"attestation_state":"computed","paper":{"title":"Number of Connected Components in a Graph: Estimation via Counting Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Khetan, Harshay Shah, Sewoong Oh","submitted_at":"2018-12-01T04:08:46Z","abstract_excerpt":"Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that have been surveyed. Inferring a global property of the original graph from such a sampled subgraph is of a fundamental interest. In this work, we focus on estimating the number of connected components. It is a challenging problem and, for general graphs, little is known about the connection between the observed subgraph and the number of connected component"},"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":"1812.00139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-01T04:08:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ed6893cf646e38b691f5aea2882c9e5d697f9e3bfdc98835e1897f83beb722a4","abstract_canon_sha256":"1c001ee15e9a1e6a9d1e8b5a21da93a2c1c484e6112ef9a814dea58655185505"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.141022Z","signature_b64":"14qIxAwDzY5Q8DDo6gP04SAYRcAvAxVfVXEkYvnejDsdc7pq6HSlJbZheELCOSJZi49+BtIFr6TEDkax3wvdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60cf81307360b419a2e7e69bfd4eba6e6dce455efb26f6f77c5a346b85fc10a0","last_reissued_at":"2026-05-17T23:59:27.140497Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.140497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number of Connected Components in a Graph: Estimation via Counting Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Khetan, Harshay Shah, Sewoong Oh","submitted_at":"2018-12-01T04:08:46Z","abstract_excerpt":"Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that have been surveyed. Inferring a global property of the original graph from such a sampled subgraph is of a fundamental interest. In this work, we focus on estimating the number of connected components. It is a challenging problem and, for general graphs, little is known about the connection between the observed subgraph and the number of connected component"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00139","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":"1812.00139","created_at":"2026-05-17T23:59:27.140589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00139v1","created_at":"2026-05-17T23:59:27.140589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00139","created_at":"2026-05-17T23:59:27.140589+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDHYCMDTMC2B","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDHYCMDTMC2BTIXH","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDHYCMDT","created_at":"2026-05-18T12:32:37.024351+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/MDHYCMDTMC2BTIXH42N72TV2NZ","json":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ.json","graph_json":"https://pith.science/api/pith-number/MDHYCMDTMC2BTIXH42N72TV2NZ/graph.json","events_json":"https://pith.science/api/pith-number/MDHYCMDTMC2BTIXH42N72TV2NZ/events.json","paper":"https://pith.science/paper/MDHYCMDT"},"agent_actions":{"view_html":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ","download_json":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ.json","view_paper":"https://pith.science/paper/MDHYCMDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00139&json=true","fetch_graph":"https://pith.science/api/pith-number/MDHYCMDTMC2BTIXH42N72TV2NZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MDHYCMDTMC2BTIXH42N72TV2NZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ/action/storage_attestation","attest_author":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ/action/author_attestation","sign_citation":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ/action/citation_signature","submit_replication":"https://pith.science/pith/MDHYCMDTMC2BTIXH42N72TV2NZ/action/replication_record"}},"created_at":"2026-05-17T23:59:27.140589+00:00","updated_at":"2026-05-17T23:59:27.140589+00:00"}