{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YZTIEOTSWPIKPOC5PINWKBLND2","short_pith_number":"pith:YZTIEOTS","schema_version":"1.0","canonical_sha256":"c666823a72b3d0a7b85d7a1b65056d1e8e6cf745bcf5839d3286ca5337447591","source":{"kind":"arxiv","id":"2301.11226","version":2},"attestation_state":"computed","paper":{"title":"Community Detection in Large Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Caterina De Bacco, Federico Battiston, Martina Contisciani, Nicol\\`o Ruggeri","submitted_at":"2023-01-26T17:01:58Z","abstract_excerpt":"Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems. In this work we propose a principled framework to model the organization of higher-order data. Our approach recovers community structure with accuracy exceeding that of currently available state-of-the-art algorithms, as tested in synthetic benchmarks with both hard and overlapping ground-truth partitions. Our model is flexible and allows capturing both assortative and disassortative community structures. Moreover, our method scale"},"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":"2301.11226","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-26T17:01:58Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b706a7af8db326921720be0dbdddbb31882d28660113ffce19a5d1306c7aa127","abstract_canon_sha256":"9e5d5d43d24a9939403656f159c289ad1f31169fea0625a8a0838704313b8f37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:12.421198Z","signature_b64":"vdiAFU9rQCmW3AEfYQdSQ7IY8LSsKije0gb88z5YPJKayPv9HdrRgtaqnu+vqIwlO4doBtL+1hOUUhkJNxBkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c666823a72b3d0a7b85d7a1b65056d1e8e6cf745bcf5839d3286ca5337447591","last_reissued_at":"2026-07-05T07:04:12.420700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:12.420700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection in Large Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Caterina De Bacco, Federico Battiston, Martina Contisciani, Nicol\\`o Ruggeri","submitted_at":"2023-01-26T17:01:58Z","abstract_excerpt":"Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems. In this work we propose a principled framework to model the organization of higher-order data. Our approach recovers community structure with accuracy exceeding that of currently available state-of-the-art algorithms, as tested in synthetic benchmarks with both hard and overlapping ground-truth partitions. Our model is flexible and allows capturing both assortative and disassortative community structures. Moreover, our method scale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.11226","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.11226/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2301.11226","created_at":"2026-07-05T07:04:12.420762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.11226v2","created_at":"2026-07-05T07:04:12.420762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.11226","created_at":"2026-07-05T07:04:12.420762+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZTIEOTSWPIK","created_at":"2026-07-05T07:04:12.420762+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZTIEOTSWPIKPOC5","created_at":"2026-07-05T07:04:12.420762+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZTIEOTS","created_at":"2026-07-05T07:04:12.420762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19227","citing_title":"Multi-view Fake News Detection Model Based on Dynamic Hypergraph","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2","json":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2.json","graph_json":"https://pith.science/api/pith-number/YZTIEOTSWPIKPOC5PINWKBLND2/graph.json","events_json":"https://pith.science/api/pith-number/YZTIEOTSWPIKPOC5PINWKBLND2/events.json","paper":"https://pith.science/paper/YZTIEOTS"},"agent_actions":{"view_html":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2","download_json":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2.json","view_paper":"https://pith.science/paper/YZTIEOTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.11226&json=true","fetch_graph":"https://pith.science/api/pith-number/YZTIEOTSWPIKPOC5PINWKBLND2/graph.json","fetch_events":"https://pith.science/api/pith-number/YZTIEOTSWPIKPOC5PINWKBLND2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2/action/storage_attestation","attest_author":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2/action/author_attestation","sign_citation":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2/action/citation_signature","submit_replication":"https://pith.science/pith/YZTIEOTSWPIKPOC5PINWKBLND2/action/replication_record"}},"created_at":"2026-07-05T07:04:12.420762+00:00","updated_at":"2026-07-05T07:04:12.420762+00:00"}