{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JF3KCFKIBHRRRFKFSCHCB2YLFI","short_pith_number":"pith:JF3KCFKI","schema_version":"1.0","canonical_sha256":"4976a1154809e3189545908e20eb0b2a3644b0a38f0057f8da4700ff50ca202c","source":{"kind":"arxiv","id":"1807.08440","version":1},"attestation_state":"computed","paper":{"title":"Network Global Testing by Counting Graphlets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jiashun Jin, Shengming Luo, Zheng Tracy Ke","submitted_at":"2018-07-23T06:17:12Z","abstract_excerpt":"Consider a large social network with possibly severe degree heterogeneity and mixed-memberships. We are interested in testing whether the network has only one community or there are more than one communities. The problem is known to be non-trivial, partially due to the presence of severe degree heterogeneity. We construct a class of test statistics using the numbers of short paths and short cycles, and the key to our approach is a general framework for canceling the effects of degree heterogeneity. The tests compare favorably with existing methods. We support our methods with careful analysis "},"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":"1807.08440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-07-23T06:17:12Z","cross_cats_sorted":[],"title_canon_sha256":"44067ddcb962ff781c275df8b6c1e6fb5fb40581ad73a894e13cd56fce4cc565","abstract_canon_sha256":"57dbb53010cad04ae2213edc5de5af6303fac5453173e35052178d798c4959e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.023545Z","signature_b64":"uhMyl8o7OYytge4uv0sde/vKxDGk8uh47/tIyv7R/1gmHCLxFslf7isvpyfrcDC+xJo7aXDvRNAwXn98wqT/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4976a1154809e3189545908e20eb0b2a3644b0a38f0057f8da4700ff50ca202c","last_reissued_at":"2026-05-18T00:10:08.022889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.022889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Global Testing by Counting Graphlets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jiashun Jin, Shengming Luo, Zheng Tracy Ke","submitted_at":"2018-07-23T06:17:12Z","abstract_excerpt":"Consider a large social network with possibly severe degree heterogeneity and mixed-memberships. We are interested in testing whether the network has only one community or there are more than one communities. The problem is known to be non-trivial, partially due to the presence of severe degree heterogeneity. We construct a class of test statistics using the numbers of short paths and short cycles, and the key to our approach is a general framework for canceling the effects of degree heterogeneity. The tests compare favorably with existing methods. We support our methods with careful analysis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08440","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":"1807.08440","created_at":"2026-05-18T00:10:08.022996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08440v1","created_at":"2026-05-18T00:10:08.022996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08440","created_at":"2026-05-18T00:10:08.022996+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF3KCFKIBHRR","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF3KCFKIBHRRRFKF","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF3KCFKI","created_at":"2026-05-18T12:32:31.084164+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/JF3KCFKIBHRRRFKFSCHCB2YLFI","json":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI.json","graph_json":"https://pith.science/api/pith-number/JF3KCFKIBHRRRFKFSCHCB2YLFI/graph.json","events_json":"https://pith.science/api/pith-number/JF3KCFKIBHRRRFKFSCHCB2YLFI/events.json","paper":"https://pith.science/paper/JF3KCFKI"},"agent_actions":{"view_html":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI","download_json":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI.json","view_paper":"https://pith.science/paper/JF3KCFKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08440&json=true","fetch_graph":"https://pith.science/api/pith-number/JF3KCFKIBHRRRFKFSCHCB2YLFI/graph.json","fetch_events":"https://pith.science/api/pith-number/JF3KCFKIBHRRRFKFSCHCB2YLFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI/action/storage_attestation","attest_author":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI/action/author_attestation","sign_citation":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI/action/citation_signature","submit_replication":"https://pith.science/pith/JF3KCFKIBHRRRFKFSCHCB2YLFI/action/replication_record"}},"created_at":"2026-05-18T00:10:08.022996+00:00","updated_at":"2026-05-18T00:10:08.022996+00:00"}