{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WX7JTFJILMKTL346C4ANMC5IBM","short_pith_number":"pith:WX7JTFJI","schema_version":"1.0","canonical_sha256":"b5fe9995285b1535ef9e1700d60ba80b0bdb07a948a3f12431aac569723ef2c7","source":{"kind":"arxiv","id":"1904.09532","version":2},"attestation_state":"computed","paper":{"title":"Optimal Adaptivity of Signed-Polygon Statistics for Network Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Jiashun Jin, Shengming Luo, Zheng Tracy Ke","submitted_at":"2019-04-21T02:41:07Z","abstract_excerpt":"Given a symmetric social network, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree heterogeneity, (b) accommodate mixed-memberships, (c) have a tractable null distribution, and (d) adapt automatically to different levels of sparsity, and achieve the optimal phase diagram. How to find such a test is a challenging problem.\n  We propose the Signed Polygon as a class of new tests. Fixing $m \\geq 3$, for each $m$-gon in the network, define a score using the centered adjacency matrix. The sum of such scores"},"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":"1904.09532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-21T02:41:07Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"77a21ae658c2ab6073b4b486cc3414efe4896574f5a1a3d8670a8f80755a85c2","abstract_canon_sha256":"d3ff785d6fc85306a74b8fc6a56fa5d4d7eab1acd2887d95ce37065ee67325ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:25.701464Z","signature_b64":"qcUvU8kMf1dBtZJBGcPzIjjbrA7WIwkqMjB/Sq9flVNI5Egcw3u6NxoiDAqzF9Vr8jW41fae1TE5g6oKATsyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5fe9995285b1535ef9e1700d60ba80b0bdb07a948a3f12431aac569723ef2c7","last_reissued_at":"2026-05-17T23:45:25.701046Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:25.701046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Adaptivity of Signed-Polygon Statistics for Network Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Jiashun Jin, Shengming Luo, Zheng Tracy Ke","submitted_at":"2019-04-21T02:41:07Z","abstract_excerpt":"Given a symmetric social network, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree heterogeneity, (b) accommodate mixed-memberships, (c) have a tractable null distribution, and (d) adapt automatically to different levels of sparsity, and achieve the optimal phase diagram. How to find such a test is a challenging problem.\n  We propose the Signed Polygon as a class of new tests. Fixing $m \\geq 3$, for each $m$-gon in the network, define a score using the centered adjacency matrix. The sum of such scores"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09532","kind":"arxiv","version":2},"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":"1904.09532","created_at":"2026-05-17T23:45:25.701098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09532v2","created_at":"2026-05-17T23:45:25.701098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09532","created_at":"2026-05-17T23:45:25.701098+00:00"},{"alias_kind":"pith_short_12","alias_value":"WX7JTFJILMKT","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"WX7JTFJILMKTL346","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"WX7JTFJI","created_at":"2026-05-18T12:33:33.725879+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/WX7JTFJILMKTL346C4ANMC5IBM","json":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM.json","graph_json":"https://pith.science/api/pith-number/WX7JTFJILMKTL346C4ANMC5IBM/graph.json","events_json":"https://pith.science/api/pith-number/WX7JTFJILMKTL346C4ANMC5IBM/events.json","paper":"https://pith.science/paper/WX7JTFJI"},"agent_actions":{"view_html":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM","download_json":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM.json","view_paper":"https://pith.science/paper/WX7JTFJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09532&json=true","fetch_graph":"https://pith.science/api/pith-number/WX7JTFJILMKTL346C4ANMC5IBM/graph.json","fetch_events":"https://pith.science/api/pith-number/WX7JTFJILMKTL346C4ANMC5IBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/action/storage_attestation","attest_author":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/action/author_attestation","sign_citation":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/action/citation_signature","submit_replication":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/action/replication_record"}},"created_at":"2026-05-17T23:45:25.701098+00:00","updated_at":"2026-05-17T23:45:25.701098+00:00"}