{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OMOC7YNKBIWIA6MMUA66BN7WUD","short_pith_number":"pith:OMOC7YNK","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"},"canonical_sha256":"731c2fe1aa0a2c80798ca03de0b7f6a0d9f0f8b080ca6016ad4fb524b0e1405b","source":{"kind":"arxiv","id":"2510.23507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.23507","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2510.23507v1","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.23507","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"OMOC7YNKBIWI","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"OMOC7YNKBIWIA6MM","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"OMOC7YNK","created_at":"2026-05-20T01:06:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OMOC7YNKBIWIA6MMUA66BN7WUD","target":"record","payload":{"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"},"canonical_sha256":"731c2fe1aa0a2c80798ca03de0b7f6a0d9f0f8b080ca6016ad4fb524b0e1405b","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"},"source_kind":"arxiv","source_id":"2510.23507","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ClRxik7zK12whkm0Q9uG2cTMBxrxuHiHfJ80fX5l6ppbFvvcbkPtBIAGlnN/bpKAzSGrIMiFVR2CfY2hhXmcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:02:05.767459Z"},"content_sha256":"cf3e4541c2402750bf0db8da546a2b8af50bec7ff649376d5182a39b618569ea","schema_version":"1.0","event_id":"sha256:cf3e4541c2402750bf0db8da546a2b8af50bec7ff649376d5182a39b618569ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OMOC7YNKBIWIA6MMUA66BN7WUD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGzEkNTvl2ga/2ibs0okRI2yNAdARGb/lk4hklIb718431bjM8DRPW9iPFFKhzIJLCkeLLvlPdCAPNFkcMP2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:02:05.767838Z"},"content_sha256":"10839bc6f06720a2039397830f5b92c452d75e29115ff16c6404644668e6fdde","schema_version":"1.0","event_id":"sha256:10839bc6f06720a2039397830f5b92c452d75e29115ff16c6404644668e6fdde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/bundle.json","state_url":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T14:02:05Z","links":{"resolver":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD","bundle":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/bundle.json","state":"https://pith.science/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMOC7YNKBIWIA6MMUA66BN7WUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OMOC7YNKBIWIA6MMUA66BN7WUD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"09de6b4948140896f93cd50c690ca680a68064a5b3d712b157cf67874eeb6b1f","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-27T16:40:52Z","title_canon_sha256":"76b0c702734efd3a36c305a583fec88e18c6cef3fbf250000a426ac768fc35fb"},"schema_version":"1.0","source":{"id":"2510.23507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.23507","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2510.23507v1","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.23507","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"OMOC7YNKBIWI","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"OMOC7YNKBIWIA6MM","created_at":"2026-05-20T01:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"OMOC7YNK","created_at":"2026-05-20T01:06:06Z"}],"graph_snapshots":[{"event_id":"sha256:10839bc6f06720a2039397830f5b92c452d75e29115ff16c6404644668e6fdde","target":"graph","created_at":"2026-05-20T01:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.23507/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amjad Seyedi, Eirini Ntoutsi, Fariba Karimi, Siamak Ghodsi, Tai Le Quy","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-27T16:40:52Z","title":"A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.23507","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf3e4541c2402750bf0db8da546a2b8af50bec7ff649376d5182a39b618569ea","target":"record","created_at":"2026-05-20T01:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"09de6b4948140896f93cd50c690ca680a68064a5b3d712b157cf67874eeb6b1f","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-27T16:40:52Z","title_canon_sha256":"76b0c702734efd3a36c305a583fec88e18c6cef3fbf250000a426ac768fc35fb"},"schema_version":"1.0","source":{"id":"2510.23507","kind":"arxiv","version":1}},"canonical_sha256":"731c2fe1aa0a2c80798ca03de0b7f6a0d9f0f8b080ca6016ad4fb524b0e1405b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"731c2fe1aa0a2c80798ca03de0b7f6a0d9f0f8b080ca6016ad4fb524b0e1405b","first_computed_at":"2026-05-20T01:06:06.524456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:06:06.524456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HlbUUex9C/IxOZRKD5zHLGXueJKUpaN0+cl5S174VS+NxHtgyjPKT+Rh13fhRRRUb1yJ3I6dP0mtaHMXyQC1Ag==","signature_status":"signed_v1","signed_at":"2026-05-20T01:06:06.525498Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.23507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3e4541c2402750bf0db8da546a2b8af50bec7ff649376d5182a39b618569ea","sha256:10839bc6f06720a2039397830f5b92c452d75e29115ff16c6404644668e6fdde"],"state_sha256":"5e4e9dbd18c8058d54cc647aaad5af8dc0bc21ca67752eef559cbe90f85dc5f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pv5cEn0RAmd3Rw4XdXsivHnm7Bx4bVsFBuB+RYSA/gQiTqyGY3BjrKIv1xuRknN9pnN5S/ugd0Zzi/pZ460rAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:02:05.770017Z","bundle_sha256":"b7105af2b3d0d80c8128b9caee2a82d545c45bf4d786310129e2321b572c23c0"}}