{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5ZHK457MD36FY6NIMS3R2FVD3N","short_pith_number":"pith:5ZHK457M","schema_version":"1.0","canonical_sha256":"ee4eae77ec1efc5c79a864b71d16a3db77ae4ec9b9930cd31b3b73c17624eef0","source":{"kind":"arxiv","id":"2502.08567","version":2},"attestation_state":"computed","paper":{"title":"Statistically validated projection of bipartite signed networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.app-ph","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Anna Gallo, Fabio Saracco, Tiziano Squartini","submitted_at":"2025-02-12T16:56:34Z","abstract_excerpt":"Bipartite networks provide a major insight into the organisation of many real-world systems. One of the most relevant issues encountered when modelling a bipartite network is that of facing the information shortage concerning intra-layer linkages. In the present contribution, we propose an unsupervised algorithm to obtain statistically validated projections of bipartite signed networks, according to which any two nodes sharing a statistically significant number of concordant (discordant) relationships are connected by a positive (negative) edge. Our algorithm outputs a matrix of link-specific "},"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":"2502.08567","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.soc-ph","submitted_at":"2025-02-12T16:56:34Z","cross_cats_sorted":["physics.app-ph","physics.data-an"],"title_canon_sha256":"024649a1403744ec8394e5e898a96f0b7c49e05d23b6dc7beadf1db7484667c5","abstract_canon_sha256":"dff79395eb87ae376407cd66842526b3cd18e0922ded70cbfc9c203375103953"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:47.253205Z","signature_b64":"glIFm5vX9BrpXZL2Tn26c+t5xAdsI+hdYAiWaBd0nnmNEMQY/aKJNtGYSaQ+2O87WnXe5CBz74mldV6+KTfHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4eae77ec1efc5c79a864b71d16a3db77ae4ec9b9930cd31b3b73c17624eef0","last_reissued_at":"2026-07-05T11:34:47.252605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:47.252605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistically validated projection of bipartite signed networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.app-ph","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Anna Gallo, Fabio Saracco, Tiziano Squartini","submitted_at":"2025-02-12T16:56:34Z","abstract_excerpt":"Bipartite networks provide a major insight into the organisation of many real-world systems. One of the most relevant issues encountered when modelling a bipartite network is that of facing the information shortage concerning intra-layer linkages. In the present contribution, we propose an unsupervised algorithm to obtain statistically validated projections of bipartite signed networks, according to which any two nodes sharing a statistically significant number of concordant (discordant) relationships are connected by a positive (negative) edge. Our algorithm outputs a matrix of link-specific "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08567","kind":"arxiv","version":2},"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/2502.08567/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":"2502.08567","created_at":"2026-07-05T11:34:47.252674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08567v2","created_at":"2026-07-05T11:34:47.252674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08567","created_at":"2026-07-05T11:34:47.252674+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZHK457MD36F","created_at":"2026-07-05T11:34:47.252674+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZHK457MD36FY6NI","created_at":"2026-07-05T11:34:47.252674+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZHK457M","created_at":"2026-07-05T11:34:47.252674+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/5ZHK457MD36FY6NIMS3R2FVD3N","json":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N.json","graph_json":"https://pith.science/api/pith-number/5ZHK457MD36FY6NIMS3R2FVD3N/graph.json","events_json":"https://pith.science/api/pith-number/5ZHK457MD36FY6NIMS3R2FVD3N/events.json","paper":"https://pith.science/paper/5ZHK457M"},"agent_actions":{"view_html":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N","download_json":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N.json","view_paper":"https://pith.science/paper/5ZHK457M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08567&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZHK457MD36FY6NIMS3R2FVD3N/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZHK457MD36FY6NIMS3R2FVD3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N/action/storage_attestation","attest_author":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N/action/author_attestation","sign_citation":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N/action/citation_signature","submit_replication":"https://pith.science/pith/5ZHK457MD36FY6NIMS3R2FVD3N/action/replication_record"}},"created_at":"2026-07-05T11:34:47.252674+00:00","updated_at":"2026-07-05T11:34:47.252674+00:00"}