{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QEBGI7POQ4TLYDDLSBY5GI5EGC","short_pith_number":"pith:QEBGI7PO","canonical_record":{"source":{"id":"1802.00926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T06:35:23Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"0b2c4cd4c85bfe21686875d5cd5d2dfd7d9d72dca58fd5f66585fe21017b6091","abstract_canon_sha256":"d7b5856eefd90d3dae8733cd31edad7cf78af4e81bbe3192eb7f6f62e8751998"},"schema_version":"1.0"},"canonical_sha256":"8102647dee8726bc0c6b9071d323a4308dc3343d384c7cf283cba42122b524a0","source":{"kind":"arxiv","id":"1802.00926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00926","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00926v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00926","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"QEBGI7POQ4TL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QEBGI7POQ4TLYDDL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QEBGI7PO","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QEBGI7POQ4TLYDDLSBY5GI5EGC","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T06:35:23Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"0b2c4cd4c85bfe21686875d5cd5d2dfd7d9d72dca58fd5f66585fe21017b6091","abstract_canon_sha256":"d7b5856eefd90d3dae8733cd31edad7cf78af4e81bbe3192eb7f6f62e8751998"},"schema_version":"1.0"},"canonical_sha256":"8102647dee8726bc0c6b9071d323a4308dc3343d384c7cf283cba42122b524a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.859173Z","signature_b64":"FTqcJP0oaB0EBq6BVxEdf1/7/m6OnvFDYA4TXbGst24vL6oxQf7Jt3ynknZeaB0S8E2a+SnLetL+mjhMcYAeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8102647dee8726bc0c6b9071d323a4308dc3343d384c7cf283cba42122b524a0","last_reissued_at":"2026-05-18T00:24:27.858729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.858729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00926","source_version":1,"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-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTiKkCCzNOyA/VViUD6gJFYe6DpiH0xy1THZyJaGODC3QzI2OaForC/rhW89VbMRDDIOl8gu7cUl2hViR18JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:49:29.791457Z"},"content_sha256":"3d4f42a26c1b631ca8d17620f4fda37580fd34755497b50dd96c50af06f064f2","schema_version":"1.0","event_id":"sha256:3d4f42a26c1b631ca8d17620f4fda37580fd34755497b50dd96c50af06f064f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QEBGI7POQ4TLYDDLSBY5GI5EGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimax Misclassification Ratio of Hypergraph Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Chung-Yi Lin, I Chien, I-Hsiang Wang","submitted_at":"2018-02-03T06:35:23Z","abstract_excerpt":"Community detection in hypergraphs is explored. Under a generative hypergraph model called \"d-wise hypergraph stochastic block model\" (d-hSBM) which naturally extends the Stochastic Block Model from graphs to d-uniform hypergraphs, the asymptotic minimax mismatch ratio is characterized. For proving the achievability, we propose a two-step polynomial time algorithm that achieves the fundamental limit. The first step of the algorithm is a hypergraph spectral clustering method which achieves partial recovery to a certain precision level. The second step is a local refinement method which leverage"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00926","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"},"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-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y21UaksuRrODJGZwv8Jl6jQ23gtyjurAGkFX/4gcP9zO5QyP6WcdwngVdIS+DxCeEPAN/ChoWN22Afcs6mWeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:49:29.791811Z"},"content_sha256":"21d1b3a3e2c8d4cf50ba6b376ca4d7269d5d71a43cedca89ba02281fb34a7971","schema_version":"1.0","event_id":"sha256:21d1b3a3e2c8d4cf50ba6b376ca4d7269d5d71a43cedca89ba02281fb34a7971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC/bundle.json","state_url":"https://pith.science/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC/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-06-02T06:49:29Z","links":{"resolver":"https://pith.science/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC","bundle":"https://pith.science/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC/bundle.json","state":"https://pith.science/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEBGI7POQ4TLYDDLSBY5GI5EGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QEBGI7POQ4TLYDDLSBY5GI5EGC","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":"d7b5856eefd90d3dae8733cd31edad7cf78af4e81bbe3192eb7f6f62e8751998","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T06:35:23Z","title_canon_sha256":"0b2c4cd4c85bfe21686875d5cd5d2dfd7d9d72dca58fd5f66585fe21017b6091"},"schema_version":"1.0","source":{"id":"1802.00926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00926","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00926v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00926","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"QEBGI7POQ4TL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QEBGI7POQ4TLYDDL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QEBGI7PO","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:21d1b3a3e2c8d4cf50ba6b376ca4d7269d5d71a43cedca89ba02281fb34a7971","target":"graph","created_at":"2026-05-18T00:24:27Z","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":"Community detection in hypergraphs is explored. Under a generative hypergraph model called \"d-wise hypergraph stochastic block model\" (d-hSBM) which naturally extends the Stochastic Block Model from graphs to d-uniform hypergraphs, the asymptotic minimax mismatch ratio is characterized. For proving the achievability, we propose a two-step polynomial time algorithm that achieves the fundamental limit. The first step of the algorithm is a hypergraph spectral clustering method which achieves partial recovery to a certain precision level. The second step is a local refinement method which leverage","authors_text":"Chung-Yi Lin, I Chien, I-Hsiang Wang","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T06:35:23Z","title":"On the Minimax Misclassification Ratio of Hypergraph Community Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00926","kind":"arxiv","version":1},"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:3d4f42a26c1b631ca8d17620f4fda37580fd34755497b50dd96c50af06f064f2","target":"record","created_at":"2026-05-18T00:24:27Z","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":"d7b5856eefd90d3dae8733cd31edad7cf78af4e81bbe3192eb7f6f62e8751998","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-03T06:35:23Z","title_canon_sha256":"0b2c4cd4c85bfe21686875d5cd5d2dfd7d9d72dca58fd5f66585fe21017b6091"},"schema_version":"1.0","source":{"id":"1802.00926","kind":"arxiv","version":1}},"canonical_sha256":"8102647dee8726bc0c6b9071d323a4308dc3343d384c7cf283cba42122b524a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8102647dee8726bc0c6b9071d323a4308dc3343d384c7cf283cba42122b524a0","first_computed_at":"2026-05-18T00:24:27.858729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:27.858729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FTqcJP0oaB0EBq6BVxEdf1/7/m6OnvFDYA4TXbGst24vL6oxQf7Jt3ynknZeaB0S8E2a+SnLetL+mjhMcYAeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:27.859173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d4f42a26c1b631ca8d17620f4fda37580fd34755497b50dd96c50af06f064f2","sha256:21d1b3a3e2c8d4cf50ba6b376ca4d7269d5d71a43cedca89ba02281fb34a7971"],"state_sha256":"411490dc19056b0d4dec1b8e45bbeb7c6382ba2a869f4f6fcca9b0af3b21b52e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZQSLM4fZW1+cEqjHqAInyOzqnE4cRIRfTp51iRkokkCV76kOPvoOQUSMn10Iy4luDWxLGUyzuW10ZxLBR7NBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:49:29.793879Z","bundle_sha256":"1099df1c1eec5c805e85b2d12deb6915752720d9b8df96cffc52d58fc6a79b9c"}}