{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EVUMGDJFYTY775GNCR2FRWEHB3","short_pith_number":"pith:EVUMGDJF","schema_version":"1.0","canonical_sha256":"2568c30d25c4f1fff4cd147458d8870eee70598a19247236da0e42204b40ab06","source":{"kind":"arxiv","id":"2103.01751","version":1},"attestation_state":"computed","paper":{"title":"Preferential attachment hypergraph with high modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Fr\\'ed\\'eric Giroire, Ma{\\l}gorzata Sulkowska, Nicolas Nisse, Thibaud Trolliet","submitted_at":"2021-03-01T13:01:39Z","abstract_excerpt":"Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist and no general model allows to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. We present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law and we give theoretical lower bounds for its modularit"},"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":"2103.01751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-03-01T13:01:39Z","cross_cats_sorted":["math.CO","physics.soc-ph"],"title_canon_sha256":"ec7a6f081b97feead92706264a1401783dc13678f9cc08d8c7119b92e8556e04","abstract_canon_sha256":"ade0713f871d22a0babd8ec037c77925872460376a122d25c58ff74a723bd85c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:50.231021Z","signature_b64":"TWs0q/HINUJdWE/c6kwnDb38a90HOb9ZL/xb3O0JcFwyx0gStsuuRNoQkA8t1IrVY8i7YRXMsLReTPlPWWuFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2568c30d25c4f1fff4cd147458d8870eee70598a19247236da0e42204b40ab06","last_reissued_at":"2026-07-05T02:19:50.230618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:50.230618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preferential attachment hypergraph with high modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Fr\\'ed\\'eric Giroire, Ma{\\l}gorzata Sulkowska, Nicolas Nisse, Thibaud Trolliet","submitted_at":"2021-03-01T13:01:39Z","abstract_excerpt":"Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist and no general model allows to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. We present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law and we give theoretical lower bounds for its modularit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.01751","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.01751/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":"2103.01751","created_at":"2026-07-05T02:19:50.230674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.01751v1","created_at":"2026-07-05T02:19:50.230674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.01751","created_at":"2026-07-05T02:19:50.230674+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVUMGDJFYTY7","created_at":"2026-07-05T02:19:50.230674+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVUMGDJFYTY775GN","created_at":"2026-07-05T02:19:50.230674+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVUMGDJF","created_at":"2026-07-05T02:19:50.230674+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/EVUMGDJFYTY775GNCR2FRWEHB3","json":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3.json","graph_json":"https://pith.science/api/pith-number/EVUMGDJFYTY775GNCR2FRWEHB3/graph.json","events_json":"https://pith.science/api/pith-number/EVUMGDJFYTY775GNCR2FRWEHB3/events.json","paper":"https://pith.science/paper/EVUMGDJF"},"agent_actions":{"view_html":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3","download_json":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3.json","view_paper":"https://pith.science/paper/EVUMGDJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.01751&json=true","fetch_graph":"https://pith.science/api/pith-number/EVUMGDJFYTY775GNCR2FRWEHB3/graph.json","fetch_events":"https://pith.science/api/pith-number/EVUMGDJFYTY775GNCR2FRWEHB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3/action/storage_attestation","attest_author":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3/action/author_attestation","sign_citation":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3/action/citation_signature","submit_replication":"https://pith.science/pith/EVUMGDJFYTY775GNCR2FRWEHB3/action/replication_record"}},"created_at":"2026-07-05T02:19:50.230674+00:00","updated_at":"2026-07-05T02:19:50.230674+00:00"}