{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:43R2RD7CYX7DUMWV4KISIFCCDD","short_pith_number":"pith:43R2RD7C","schema_version":"1.0","canonical_sha256":"e6e3a88fe2c5fe3a32d5e29124144218c59ed3ebd80cb78bb169beff2979cd5d","source":{"kind":"arxiv","id":"2309.15648","version":1},"attestation_state":"computed","paper":{"title":"SANGEA: Scalable and Attributed Network Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gianmarco Aversano, Houssem Eddine Souid, Lucas Ody, Nicolas Posocco, Sabri Skhiri, Valentin Lemaire, Youssef Achenchabe","submitted_at":"2023-09-27T13:35:45Z","abstract_excerpt":"The topic of synthetic graph generators (SGGs) has recently received much attention due to the wave of the latest breakthroughs in generative modelling. However, many state-of-the-art SGGs do not scale well with the graph size. Indeed, in the generation process, all the possible edges for a fixed number of nodes must often be considered, which scales in $\\mathcal{O}(N^2)$, with $N$ being the number of nodes in the graph. For this reason, many state-of-the-art SGGs are not applicable to large graphs. In this paper, we present SANGEA, a sizeable synthetic graph generation framework which extends"},"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":"2309.15648","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-27T13:35:45Z","cross_cats_sorted":[],"title_canon_sha256":"01d6c13acff1bb3abd9763dbae717a988afdd4cf0b9f5118d96496ef69ebca21","abstract_canon_sha256":"c5836a72d1faa1c2c6682903db02eeaeba86be019e92ca48a2ddf59cd6652d06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:56.033624Z","signature_b64":"cvmsVxCUQTeFpNDsSF1CzKGbCzVaiwc4T6FSjFgnWrnc3fZMzXf9o5hwMikB63BdNdzmkNwuSd7KLkhus9jiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e3a88fe2c5fe3a32d5e29124144218c59ed3ebd80cb78bb169beff2979cd5d","last_reissued_at":"2026-07-05T06:54:56.033152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:56.033152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SANGEA: Scalable and Attributed Network Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gianmarco Aversano, Houssem Eddine Souid, Lucas Ody, Nicolas Posocco, Sabri Skhiri, Valentin Lemaire, Youssef Achenchabe","submitted_at":"2023-09-27T13:35:45Z","abstract_excerpt":"The topic of synthetic graph generators (SGGs) has recently received much attention due to the wave of the latest breakthroughs in generative modelling. However, many state-of-the-art SGGs do not scale well with the graph size. Indeed, in the generation process, all the possible edges for a fixed number of nodes must often be considered, which scales in $\\mathcal{O}(N^2)$, with $N$ being the number of nodes in the graph. For this reason, many state-of-the-art SGGs are not applicable to large graphs. In this paper, we present SANGEA, a sizeable synthetic graph generation framework which extends"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15648","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/2309.15648/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":"2309.15648","created_at":"2026-07-05T06:54:56.033206+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15648v1","created_at":"2026-07-05T06:54:56.033206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15648","created_at":"2026-07-05T06:54:56.033206+00:00"},{"alias_kind":"pith_short_12","alias_value":"43R2RD7CYX7D","created_at":"2026-07-05T06:54:56.033206+00:00"},{"alias_kind":"pith_short_16","alias_value":"43R2RD7CYX7DUMWV","created_at":"2026-07-05T06:54:56.033206+00:00"},{"alias_kind":"pith_short_8","alias_value":"43R2RD7C","created_at":"2026-07-05T06:54:56.033206+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/43R2RD7CYX7DUMWV4KISIFCCDD","json":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD.json","graph_json":"https://pith.science/api/pith-number/43R2RD7CYX7DUMWV4KISIFCCDD/graph.json","events_json":"https://pith.science/api/pith-number/43R2RD7CYX7DUMWV4KISIFCCDD/events.json","paper":"https://pith.science/paper/43R2RD7C"},"agent_actions":{"view_html":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD","download_json":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD.json","view_paper":"https://pith.science/paper/43R2RD7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15648&json=true","fetch_graph":"https://pith.science/api/pith-number/43R2RD7CYX7DUMWV4KISIFCCDD/graph.json","fetch_events":"https://pith.science/api/pith-number/43R2RD7CYX7DUMWV4KISIFCCDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD/action/storage_attestation","attest_author":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD/action/author_attestation","sign_citation":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD/action/citation_signature","submit_replication":"https://pith.science/pith/43R2RD7CYX7DUMWV4KISIFCCDD/action/replication_record"}},"created_at":"2026-07-05T06:54:56.033206+00:00","updated_at":"2026-07-05T06:54:56.033206+00:00"}