{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OMOC7YNKBIWIA6MMUA66BN7WUD","short_pith_number":"pith:OMOC7YNK","schema_version":"1.0","canonical_sha256":"731c2fe1aa0a2c80798ca03de0b7f6a0d9f0f8b080ca6016ad4fb524b0e1405b","source":{"kind":"arxiv","id":"2510.23507","version":1},"attestation_state":"computed","paper":{"title":"A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Amjad Seyedi, Eirini Ntoutsi, Fariba Karimi, Siamak Ghodsi, Tai Le Quy","submitted_at":"2025-10-27T16:40:52Z","abstract_excerpt":"Fair graph clustering seeks partitions that respect network structure while maintaining proportional representation across sensitive groups, with applications spanning community detection, team formation, resource allocation, and social network analysis. Many existing approaches enforce rigid constraints or rely on multi-stage pipelines (e.g., spectral embedding followed by $k$-means), limiting trade-off control, interpretability, and scalability. We introduce \\emph{DFNMF}, an end-to-end deep nonnegative tri-factorization tailored to graphs that directly optimizes cluster assignments with a so"},"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":"2510.23507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-27T16:40:52Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"76b0c702734efd3a36c305a583fec88e18c6cef3fbf250000a426ac768fc35fb","abstract_canon_sha256":"09de6b4948140896f93cd50c690ca680a68064a5b3d712b157cf67874eeb6b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:06.525498Z","signature_b64":"HlbUUex9C/IxOZRKD5zHLGXueJKUpaN0+cl5S174VS+NxHtgyjPKT+Rh13fhRRRUb1yJ3I6dP0mtaHMXyQC1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731c2fe1aa0a2c80798ca03de0b7f6a0d9f0f8b080ca6016ad4fb524b0e1405b","last_reissued_at":"2026-05-20T01:06:06.524456Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:06.524456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Amjad Seyedi, Eirini Ntoutsi, Fariba Karimi, Siamak Ghodsi, Tai Le Quy","submitted_at":"2025-10-27T16:40:52Z","abstract_excerpt":"Fair graph clustering seeks partitions that respect network structure while maintaining proportional representation across sensitive groups, with applications spanning community detection, team formation, resource allocation, and social network analysis. Many existing approaches enforce rigid constraints or rely on multi-stage pipelines (e.g., spectral embedding followed by $k$-means), limiting trade-off control, interpretability, and scalability. We introduce \\emph{DFNMF}, an end-to-end deep nonnegative tri-factorization tailored to graphs that directly optimizes cluster assignments with a so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.23507","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/2510.23507/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":"2510.23507","created_at":"2026-05-20T01:06:06.524598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.23507v1","created_at":"2026-05-20T01:06:06.524598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.23507","created_at":"2026-05-20T01:06:06.524598+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMOC7YNKBIWI","created_at":"2026-05-20T01:06:06.524598+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMOC7YNKBIWIA6MM","created_at":"2026-05-20T01:06:06.524598+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMOC7YNK","created_at":"2026-05-20T01:06:06.524598+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/OMOC7YNKBIWIA6MMUA66BN7WUD","json":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD.json","graph_json":"https://pith.science/api/pith-number/OMOC7YNKBIWIA6MMUA66BN7WUD/graph.json","events_json":"https://pith.science/api/pith-number/OMOC7YNKBIWIA6MMUA66BN7WUD/events.json","paper":"https://pith.science/paper/OMOC7YNK"},"agent_actions":{"view_html":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD","download_json":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD.json","view_paper":"https://pith.science/paper/OMOC7YNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.23507&json=true","fetch_graph":"https://pith.science/api/pith-number/OMOC7YNKBIWIA6MMUA66BN7WUD/graph.json","fetch_events":"https://pith.science/api/pith-number/OMOC7YNKBIWIA6MMUA66BN7WUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/action/storage_attestation","attest_author":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/action/author_attestation","sign_citation":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/action/citation_signature","submit_replication":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/action/replication_record"}},"created_at":"2026-05-20T01:06:06.524598+00:00","updated_at":"2026-05-20T01:06:06.524598+00:00"}