{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WACXLRH5A7ZXI6TVRLXEUZZAVM","short_pith_number":"pith:WACXLRH5","schema_version":"1.0","canonical_sha256":"b00575c4fd07f3747a758aee4a6720ab0e1e56d613acffa1c2a9db32fd8ab915","source":{"kind":"arxiv","id":"2507.03728","version":1},"attestation_state":"computed","paper":{"title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdennacer Badaoui, Daniele Malitesta, Fragkiskos D. Malliaros, Hatim Mrabet, Oussama Kharouiche","submitted_at":"2025-07-04T17:31:41Z","abstract_excerpt":"Recent advancements in graph diffusion models (GDMs) have enabled the synthesis of realistic network structures, yet ensuring fairness in the generated data remains a critical challenge. Existing solutions attempt to mitigate bias by re-training the GDMs with ad-hoc fairness constraints. Conversely, with this work, we propose FAROS, a novel FAir graph geneRatiOn framework leveraging attribute Switching mechanisms and directly running in the generation process of the pre-trained GDM. Technically, our approach works by altering nodes' sensitive attributes during the generation. To this end, FARO"},"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":"2507.03728","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-04T17:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"84498a76c5c89112800cbb8135f29b68815f8029a82b5caf2c2d4cc91b855ca1","abstract_canon_sha256":"a32eef4988b6bc420700d91b7b519fb90a6abc7a2f90cd278e820a434bf687b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:04.221321Z","signature_b64":"/87b8zv+agNhLJjBztWFElRNIn9SmESB16hCLgOPxFE3Vp8vOxR4Q9a+LlkoQZtPOagsLoJz65wzkAufN49gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b00575c4fd07f3747a758aee4a6720ab0e1e56d613acffa1c2a9db32fd8ab915","last_reissued_at":"2026-07-05T11:32:04.220825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:04.220825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdennacer Badaoui, Daniele Malitesta, Fragkiskos D. Malliaros, Hatim Mrabet, Oussama Kharouiche","submitted_at":"2025-07-04T17:31:41Z","abstract_excerpt":"Recent advancements in graph diffusion models (GDMs) have enabled the synthesis of realistic network structures, yet ensuring fairness in the generated data remains a critical challenge. Existing solutions attempt to mitigate bias by re-training the GDMs with ad-hoc fairness constraints. Conversely, with this work, we propose FAROS, a novel FAir graph geneRatiOn framework leveraging attribute Switching mechanisms and directly running in the generation process of the pre-trained GDM. Technically, our approach works by altering nodes' sensitive attributes during the generation. To this end, FARO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03728","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/2507.03728/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":"2507.03728","created_at":"2026-07-05T11:32:04.220883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03728v1","created_at":"2026-07-05T11:32:04.220883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03728","created_at":"2026-07-05T11:32:04.220883+00:00"},{"alias_kind":"pith_short_12","alias_value":"WACXLRH5A7ZX","created_at":"2026-07-05T11:32:04.220883+00:00"},{"alias_kind":"pith_short_16","alias_value":"WACXLRH5A7ZXI6TV","created_at":"2026-07-05T11:32:04.220883+00:00"},{"alias_kind":"pith_short_8","alias_value":"WACXLRH5","created_at":"2026-07-05T11:32:04.220883+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/WACXLRH5A7ZXI6TVRLXEUZZAVM","json":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM.json","graph_json":"https://pith.science/api/pith-number/WACXLRH5A7ZXI6TVRLXEUZZAVM/graph.json","events_json":"https://pith.science/api/pith-number/WACXLRH5A7ZXI6TVRLXEUZZAVM/events.json","paper":"https://pith.science/paper/WACXLRH5"},"agent_actions":{"view_html":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM","download_json":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM.json","view_paper":"https://pith.science/paper/WACXLRH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03728&json=true","fetch_graph":"https://pith.science/api/pith-number/WACXLRH5A7ZXI6TVRLXEUZZAVM/graph.json","fetch_events":"https://pith.science/api/pith-number/WACXLRH5A7ZXI6TVRLXEUZZAVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM/action/storage_attestation","attest_author":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM/action/author_attestation","sign_citation":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM/action/citation_signature","submit_replication":"https://pith.science/pith/WACXLRH5A7ZXI6TVRLXEUZZAVM/action/replication_record"}},"created_at":"2026-07-05T11:32:04.220883+00:00","updated_at":"2026-07-05T11:32:04.220883+00:00"}