{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WX7JTFJILMKTL346C4ANMC5IBM","short_pith_number":"pith:WX7JTFJI","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"},"canonical_sha256":"b5fe9995285b1535ef9e1700d60ba80b0bdb07a948a3f12431aac569723ef2c7","source":{"kind":"arxiv","id":"1904.09532","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09532","created_at":"2026-05-17T23:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09532v2","created_at":"2026-05-17T23:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09532","created_at":"2026-05-17T23:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"WX7JTFJILMKT","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WX7JTFJILMKTL346","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WX7JTFJI","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WX7JTFJILMKTL346C4ANMC5IBM","target":"record","payload":{"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"},"canonical_sha256":"b5fe9995285b1535ef9e1700d60ba80b0bdb07a948a3f12431aac569723ef2c7","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"},"source_kind":"arxiv","source_id":"1904.09532","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iKHIoZ5DgvmSFLCRD40Jdzyouzib+OdwH+4ZjEQoZ8UNlvEdeGcsnTB3vFso2kJ+NAS5xjEpAtwBNHs0nFwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:31:34.253008Z"},"content_sha256":"e3a8f355570924d6338468ae006955a17a46b3c4a1b5e85a31c7854c02b6d3a1","schema_version":"1.0","event_id":"sha256:e3a8f355570924d6338468ae006955a17a46b3c4a1b5e85a31c7854c02b6d3a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WX7JTFJILMKTL346C4ANMC5IBM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89Z1WXBtFQF7x7ODKHf1xCvkJTOkMcIww3CkUJqtMmREYFrY/4Tf6Jn874JUrNJZjkz4jmx8OyIODqLe9J0FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:31:34.253539Z"},"content_sha256":"0d0737224b011b3c211329ad21b742a4271d11d3a75bee43a58ed6020388bb0f","schema_version":"1.0","event_id":"sha256:0d0737224b011b3c211329ad21b742a4271d11d3a75bee43a58ed6020388bb0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/bundle.json","state_url":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WX7JTFJILMKTL346C4ANMC5IBM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T03:31:34Z","links":{"resolver":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM","bundle":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/bundle.json","state":"https://pith.science/pith/WX7JTFJILMKTL346C4ANMC5IBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WX7JTFJILMKTL346C4ANMC5IBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WX7JTFJILMKTL346C4ANMC5IBM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d3ff785d6fc85306a74b8fc6a56fa5d4d7eab1acd2887d95ce37065ee67325ab","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-21T02:41:07Z","title_canon_sha256":"77a21ae658c2ab6073b4b486cc3414efe4896574f5a1a3d8670a8f80755a85c2"},"schema_version":"1.0","source":{"id":"1904.09532","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09532","created_at":"2026-05-17T23:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09532v2","created_at":"2026-05-17T23:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09532","created_at":"2026-05-17T23:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"WX7JTFJILMKT","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WX7JTFJILMKTL346","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WX7JTFJI","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:0d0737224b011b3c211329ad21b742a4271d11d3a75bee43a58ed6020388bb0f","target":"graph","created_at":"2026-05-17T23:45:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jiashun Jin, Shengming Luo, Zheng Tracy Ke","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-21T02:41:07Z","title":"Optimal Adaptivity of Signed-Polygon Statistics for Network Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09532","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e3a8f355570924d6338468ae006955a17a46b3c4a1b5e85a31c7854c02b6d3a1","target":"record","created_at":"2026-05-17T23:45:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d3ff785d6fc85306a74b8fc6a56fa5d4d7eab1acd2887d95ce37065ee67325ab","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-21T02:41:07Z","title_canon_sha256":"77a21ae658c2ab6073b4b486cc3414efe4896574f5a1a3d8670a8f80755a85c2"},"schema_version":"1.0","source":{"id":"1904.09532","kind":"arxiv","version":2}},"canonical_sha256":"b5fe9995285b1535ef9e1700d60ba80b0bdb07a948a3f12431aac569723ef2c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5fe9995285b1535ef9e1700d60ba80b0bdb07a948a3f12431aac569723ef2c7","first_computed_at":"2026-05-17T23:45:25.701046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:25.701046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qcUvU8kMf1dBtZJBGcPzIjjbrA7WIwkqMjB/Sq9flVNI5Egcw3u6NxoiDAqzF9Vr8jW41fae1TE5g6oKATsyBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:25.701464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09532","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3a8f355570924d6338468ae006955a17a46b3c4a1b5e85a31c7854c02b6d3a1","sha256:0d0737224b011b3c211329ad21b742a4271d11d3a75bee43a58ed6020388bb0f"],"state_sha256":"baa7033373a409d079da0bd805ab24625a8aae5c41cfb12ec845ed0e4317535f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDrwy+R1/i4itGCvbTyN8jtPL9/dg+/JDbEoBx2DdrqkZ/oPjnhnWySf6P4RkxtUWZsOsdhXDefP0PVxFesHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:31:34.256651Z","bundle_sha256":"2bd9097ac88d18033262a6b3b9adaededbc3c39573075e77e77025ef6f4abaff"}}