{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YTA2QTIU6YD7CIO7QDEOGPMRJG","short_pith_number":"pith:YTA2QTIU","canonical_record":{"source":{"id":"1810.04617","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2018-10-10T16:21:17Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8b4259a3e5a2533902f4a12a3270edd11c077941215142983ece6cc8508b1454","abstract_canon_sha256":"17b525be6e9e245a96e0f5faf871441c1ecef620f4529f460b38b9bcb679b15d"},"schema_version":"1.0"},"canonical_sha256":"c4c1a84d14f607f121df80c8e33d9149a1f4673074c1cf095ab92ccfcfa56cef","source":{"kind":"arxiv","id":"1810.04617","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04617","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04617v3","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04617","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"YTA2QTIU6YD7","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"pith_short_16","alias_value":"YTA2QTIU6YD7CIO7","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"pith_short_8","alias_value":"YTA2QTIU","created_at":"2026-07-05T02:46:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YTA2QTIU6YD7CIO7QDEOGPMRJG","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04617","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2018-10-10T16:21:17Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8b4259a3e5a2533902f4a12a3270edd11c077941215142983ece6cc8508b1454","abstract_canon_sha256":"17b525be6e9e245a96e0f5faf871441c1ecef620f4529f460b38b9bcb679b15d"},"schema_version":"1.0"},"canonical_sha256":"c4c1a84d14f607f121df80c8e33d9149a1f4673074c1cf095ab92ccfcfa56cef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:07.215170Z","signature_b64":"+RNIKFPUouu4BCMcemmCEi1UQ9yuWIkHnlNY3K9RqM89a40Gu/P4/rO7b1H63qMEn0ZNJRpBgWleFQkRS4tKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4c1a84d14f607f121df80c8e33d9149a1f4673074c1cf095ab92ccfcfa56cef","last_reissued_at":"2026-07-05T02:46:07.214673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:07.214673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04617","source_version":3,"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-07-05T02:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7/DAZT+aXRW74hvPsfe2buHtRR3dKLxDXFXCPI1Jtcxh8/jB+Y2pTdvAmA4koxVa4ICIYcyS8WkqcSGux/gDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:49:31.867406Z"},"content_sha256":"c49180a5ea208e028ce9ad6b7b68e2d478506e5234f17d23819b19eac8a7d36f","schema_version":"1.0","event_id":"sha256:c49180a5ea208e028ce9ad6b7b68e2d478506e5234f17d23819b19eac8a7d36f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YTA2QTIU6YD7CIO7QDEOGPMRJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Community Structures for Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Mingao Yuan, Ruiqi Liu, Yang Feng, Zuofeng Shang","submitted_at":"2018-10-10T16:21:17Z","abstract_excerpt":"Many complex networks in real world can be formulated as hypergraphs where community detection has been widely used. However, the fundamental question of whether communities exist or not in an observed hypergraph still remains unresolved. The aim of the present paper is to tackle this important problem. Specifically, we study when a hypergraph with community structure can be successfully distinguished from its Erd\\\"{o}s-Renyi counterpart, and propose concrete test statistics based on hypergraph cycles when the models are distinguishable. Our contributions are summarized as follows. For uniform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04617","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.04617/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGpmmlEzvGASOneo9dzkreKF3INJX+4MuOZYYRpEx4Jz4j6FWhVqSmY2weeDF4EcEMntyLKg+KHWWPnfhsv8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:49:31.867972Z"},"content_sha256":"3d82be245c7bbbb17b56450ce0bccfbb89b1c09c87c50758443bc40b15f1b6f5","schema_version":"1.0","event_id":"sha256:3d82be245c7bbbb17b56450ce0bccfbb89b1c09c87c50758443bc40b15f1b6f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG/bundle.json","state_url":"https://pith.science/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG/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-08-03T16:49:31Z","links":{"resolver":"https://pith.science/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG","bundle":"https://pith.science/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG/bundle.json","state":"https://pith.science/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTA2QTIU6YD7CIO7QDEOGPMRJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YTA2QTIU6YD7CIO7QDEOGPMRJG","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":"17b525be6e9e245a96e0f5faf871441c1ecef620f4529f460b38b9bcb679b15d","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2018-10-10T16:21:17Z","title_canon_sha256":"8b4259a3e5a2533902f4a12a3270edd11c077941215142983ece6cc8508b1454"},"schema_version":"1.0","source":{"id":"1810.04617","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04617","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04617v3","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04617","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"YTA2QTIU6YD7","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"pith_short_16","alias_value":"YTA2QTIU6YD7CIO7","created_at":"2026-07-05T02:46:07Z"},{"alias_kind":"pith_short_8","alias_value":"YTA2QTIU","created_at":"2026-07-05T02:46:07Z"}],"graph_snapshots":[{"event_id":"sha256:3d82be245c7bbbb17b56450ce0bccfbb89b1c09c87c50758443bc40b15f1b6f5","target":"graph","created_at":"2026-07-05T02:46:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.04617/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many complex networks in real world can be formulated as hypergraphs where community detection has been widely used. However, the fundamental question of whether communities exist or not in an observed hypergraph still remains unresolved. The aim of the present paper is to tackle this important problem. Specifically, we study when a hypergraph with community structure can be successfully distinguished from its Erd\\\"{o}s-Renyi counterpart, and propose concrete test statistics based on hypergraph cycles when the models are distinguishable. Our contributions are summarized as follows. For uniform","authors_text":"Mingao Yuan, Ruiqi Liu, Yang Feng, Zuofeng Shang","cross_cats":["stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2018-10-10T16:21:17Z","title":"Testing Community Structures for Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04617","kind":"arxiv","version":3},"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:c49180a5ea208e028ce9ad6b7b68e2d478506e5234f17d23819b19eac8a7d36f","target":"record","created_at":"2026-07-05T02:46:07Z","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":"17b525be6e9e245a96e0f5faf871441c1ecef620f4529f460b38b9bcb679b15d","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2018-10-10T16:21:17Z","title_canon_sha256":"8b4259a3e5a2533902f4a12a3270edd11c077941215142983ece6cc8508b1454"},"schema_version":"1.0","source":{"id":"1810.04617","kind":"arxiv","version":3}},"canonical_sha256":"c4c1a84d14f607f121df80c8e33d9149a1f4673074c1cf095ab92ccfcfa56cef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4c1a84d14f607f121df80c8e33d9149a1f4673074c1cf095ab92ccfcfa56cef","first_computed_at":"2026-07-05T02:46:07.214673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:07.214673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RNIKFPUouu4BCMcemmCEi1UQ9yuWIkHnlNY3K9RqM89a40Gu/P4/rO7b1H63qMEn0ZNJRpBgWleFQkRS4tKCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:07.215170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04617","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c49180a5ea208e028ce9ad6b7b68e2d478506e5234f17d23819b19eac8a7d36f","sha256:3d82be245c7bbbb17b56450ce0bccfbb89b1c09c87c50758443bc40b15f1b6f5"],"state_sha256":"83ed8ca6486b6ff9fae05dd2741c584ccf34f5e179041c259f4e4b716b9e0f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4N8wQ+6DK0UBoqu+G5YQ+aEAhA3OHulqGlRI9HKfz4O4XsiMQ5yXx6jhcOGCl9NdO1U2xeFhfePLdLHQyHHHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:49:31.872959Z","bundle_sha256":"a33b5ac88481ca83c2d62a86d7fb546e8ea24e2af85356497c60247551ed4047"}}