{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q7CDXRCK2E643UDFCLYGLYXTTL","short_pith_number":"pith:Q7CDXRCK","schema_version":"1.0","canonical_sha256":"87c43bc44ad13dcdd06512f065e2f39adc0d29bf9975bb7c826700b85c81d7eb","source":{"kind":"arxiv","id":"2303.03705","version":1},"attestation_state":"computed","paper":{"title":"Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Guoren Wang, Qi Zhang, Rong-Hua Li, Wentao Zhang, Ziqi Yin","submitted_at":"2023-03-07T07:42:05Z","abstract_excerpt":"Maximal biclique enumeration is a fundamental problem in bipartite graph data analysis. Existing biclique enumeration methods mainly focus on non-attributed bipartite graphs and also ignore the \\emph{fairness} of graph attributes. In this paper, we introduce the concept of fairness into the biclique model for the first time and study the problem of fairness-aware biclique enumeration. Specifically, we propose two fairness-aware biclique models, called \\nonesidebc~and \\ntwosidebc~respectively. To efficiently enumerate all {\\nonesidebc}s, we first present two non-trivial pruning techniques, call"},"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":"2303.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-03-07T07:42:05Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"79ca0098774a573b7301186b6c1bf07854175d2d17be222702aa639687ea24db","abstract_canon_sha256":"798e57c0deb327a0a1f5dd7a04ef6b2767fc72ee49f02264903bef93fec05f03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:58.205519Z","signature_b64":"yDLk9XVygHwezhInBqVbjFQUYtwsA8TEhnMntFTH7F2PtwZK+3n1cTTIXpXjsqHmELbXoUZnVL0TQeUa0EDfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87c43bc44ad13dcdd06512f065e2f39adc0d29bf9975bb7c826700b85c81d7eb","last_reissued_at":"2026-07-05T05:48:58.205032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:58.205032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Guoren Wang, Qi Zhang, Rong-Hua Li, Wentao Zhang, Ziqi Yin","submitted_at":"2023-03-07T07:42:05Z","abstract_excerpt":"Maximal biclique enumeration is a fundamental problem in bipartite graph data analysis. Existing biclique enumeration methods mainly focus on non-attributed bipartite graphs and also ignore the \\emph{fairness} of graph attributes. In this paper, we introduce the concept of fairness into the biclique model for the first time and study the problem of fairness-aware biclique enumeration. Specifically, we propose two fairness-aware biclique models, called \\nonesidebc~and \\ntwosidebc~respectively. To efficiently enumerate all {\\nonesidebc}s, we first present two non-trivial pruning techniques, call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.03705","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/2303.03705/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":"2303.03705","created_at":"2026-07-05T05:48:58.205085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.03705v1","created_at":"2026-07-05T05:48:58.205085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.03705","created_at":"2026-07-05T05:48:58.205085+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7CDXRCK2E64","created_at":"2026-07-05T05:48:58.205085+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7CDXRCK2E643UDF","created_at":"2026-07-05T05:48:58.205085+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7CDXRCK","created_at":"2026-07-05T05:48:58.205085+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/Q7CDXRCK2E643UDFCLYGLYXTTL","json":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL.json","graph_json":"https://pith.science/api/pith-number/Q7CDXRCK2E643UDFCLYGLYXTTL/graph.json","events_json":"https://pith.science/api/pith-number/Q7CDXRCK2E643UDFCLYGLYXTTL/events.json","paper":"https://pith.science/paper/Q7CDXRCK"},"agent_actions":{"view_html":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL","download_json":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL.json","view_paper":"https://pith.science/paper/Q7CDXRCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.03705&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7CDXRCK2E643UDFCLYGLYXTTL/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7CDXRCK2E643UDFCLYGLYXTTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL/action/storage_attestation","attest_author":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL/action/author_attestation","sign_citation":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL/action/citation_signature","submit_replication":"https://pith.science/pith/Q7CDXRCK2E643UDFCLYGLYXTTL/action/replication_record"}},"created_at":"2026-07-05T05:48:58.205085+00:00","updated_at":"2026-07-05T05:48:58.205085+00:00"}