{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6BX2C4W2ZCRGCK5OBNFVTVEAEK","short_pith_number":"pith:6BX2C4W2","schema_version":"1.0","canonical_sha256":"f06fa172dac8a2612bae0b4b59d480228581fff1678eeb3bffed44cdeb570855","source":{"kind":"arxiv","id":"2508.19907","version":1},"attestation_state":"computed","paper":{"title":"GegenNet: Spectral Convolutional Neural Networks for Link Sign Prediction in Signed Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Hewen Wang, Renchi Yang, Xiaokui Xiao","submitted_at":"2025-08-27T14:10:16Z","abstract_excerpt":"Given a signed bipartite graph (SBG) G with two disjoint node sets U and V, the goal of link sign prediction is to predict the signs of potential links connecting U and V based on known positive and negative edges in G. The majority of existing solutions towards link sign prediction mainly focus on unipartite signed graphs, which are sub-optimal due to the neglect of node heterogeneity and unique bipartite characteristics of SBGs. To this end, recent studies adapt graph neural networks to SBGs by introducing message-passing schemes for both inter-partition (UxV) and intra-partition (UxU or VxV"},"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":"2508.19907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T14:10:16Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"f7d48a94aee18dadf1a1c7fde08bb025737356cb2396d03be4b66b043290b89a","abstract_canon_sha256":"72cae71fb0fdf8eac7d726dcd6f0e0625c11c64c14b33005676440fb9becc0ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:19.740502Z","signature_b64":"uY1/8+ma05Sk5WZcj2GOei1gyXfMlTrYTTpDVd3Fm2GckUXkYKo5jBvLFLVJHqVJTXiC+8ip24tMWnc/6Vs2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f06fa172dac8a2612bae0b4b59d480228581fff1678eeb3bffed44cdeb570855","last_reissued_at":"2026-07-05T12:00:19.740034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:19.740034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GegenNet: Spectral Convolutional Neural Networks for Link Sign Prediction in Signed Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Hewen Wang, Renchi Yang, Xiaokui Xiao","submitted_at":"2025-08-27T14:10:16Z","abstract_excerpt":"Given a signed bipartite graph (SBG) G with two disjoint node sets U and V, the goal of link sign prediction is to predict the signs of potential links connecting U and V based on known positive and negative edges in G. The majority of existing solutions towards link sign prediction mainly focus on unipartite signed graphs, which are sub-optimal due to the neglect of node heterogeneity and unique bipartite characteristics of SBGs. To this end, recent studies adapt graph neural networks to SBGs by introducing message-passing schemes for both inter-partition (UxV) and intra-partition (UxU or VxV"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19907","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/2508.19907/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":"2508.19907","created_at":"2026-07-05T12:00:19.740089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19907v1","created_at":"2026-07-05T12:00:19.740089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19907","created_at":"2026-07-05T12:00:19.740089+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BX2C4W2ZCRG","created_at":"2026-07-05T12:00:19.740089+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BX2C4W2ZCRGCK5O","created_at":"2026-07-05T12:00:19.740089+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BX2C4W2","created_at":"2026-07-05T12:00:19.740089+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/6BX2C4W2ZCRGCK5OBNFVTVEAEK","json":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK.json","graph_json":"https://pith.science/api/pith-number/6BX2C4W2ZCRGCK5OBNFVTVEAEK/graph.json","events_json":"https://pith.science/api/pith-number/6BX2C4W2ZCRGCK5OBNFVTVEAEK/events.json","paper":"https://pith.science/paper/6BX2C4W2"},"agent_actions":{"view_html":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK","download_json":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK.json","view_paper":"https://pith.science/paper/6BX2C4W2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19907&json=true","fetch_graph":"https://pith.science/api/pith-number/6BX2C4W2ZCRGCK5OBNFVTVEAEK/graph.json","fetch_events":"https://pith.science/api/pith-number/6BX2C4W2ZCRGCK5OBNFVTVEAEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK/action/storage_attestation","attest_author":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK/action/author_attestation","sign_citation":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK/action/citation_signature","submit_replication":"https://pith.science/pith/6BX2C4W2ZCRGCK5OBNFVTVEAEK/action/replication_record"}},"created_at":"2026-07-05T12:00:19.740089+00:00","updated_at":"2026-07-05T12:00:19.740089+00:00"}