{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RYHBQPTMBT3B55APBGOE4GDWN4","short_pith_number":"pith:RYHBQPTM","schema_version":"1.0","canonical_sha256":"8e0e183e6c0cf61ef40f099c4e18766f1ce3af53fd1e9154442be4fdd9e7fb8e","source":{"kind":"arxiv","id":"1104.4418","version":2},"attestation_state":"computed","paper":{"title":"Internal links and pairs as a new tool for the analysis of bipartite complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Cl\\'emence Magnien, Lionel Tabourier, Matthieu Latapy, Oussama Allali","submitted_at":"2011-04-22T10:38:48Z","abstract_excerpt":"Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such graphs as most existing measures and methods are suited to classical graphs. A usual but limited approach consists in deriving 1-mode graphs (called projections) from the underlying bipartite structure, though it causes important loss of information and data storage issues. We introduce here internal links and pairs as a new notion useful for such analysis: it "},"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":"1104.4418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-04-22T10:38:48Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"fd1e6d127587dfcfbe526cab4f4d08a8ed92f582778e886d694e8b861adaaffb","abstract_canon_sha256":"17e7d9888ecd43c4cfdc33342d399bb5a60b067a2b780d67f8ad783fdcba9875"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:10.423563Z","signature_b64":"zuIZK9KH6IXsGOzLg8WpF3Ng7vkM1Ok90Xg+DStbZ68WBOS2aI0nePhBsmYmmsGqqmE7CQ3hAJXUeW52lHcUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e0e183e6c0cf61ef40f099c4e18766f1ce3af53fd1e9154442be4fdd9e7fb8e","last_reissued_at":"2026-05-18T04:10:10.423046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:10.423046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Internal links and pairs as a new tool for the analysis of bipartite complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Cl\\'emence Magnien, Lionel Tabourier, Matthieu Latapy, Oussama Allali","submitted_at":"2011-04-22T10:38:48Z","abstract_excerpt":"Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such graphs as most existing measures and methods are suited to classical graphs. A usual but limited approach consists in deriving 1-mode graphs (called projections) from the underlying bipartite structure, though it causes important loss of information and data storage issues. We introduce here internal links and pairs as a new notion useful for such analysis: it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4418","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":""},"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":"1104.4418","created_at":"2026-05-18T04:10:10.423112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4418v2","created_at":"2026-05-18T04:10:10.423112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4418","created_at":"2026-05-18T04:10:10.423112+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYHBQPTMBT3B","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYHBQPTMBT3B55AP","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYHBQPTM","created_at":"2026-05-18T12:26:41.206345+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/RYHBQPTMBT3B55APBGOE4GDWN4","json":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4.json","graph_json":"https://pith.science/api/pith-number/RYHBQPTMBT3B55APBGOE4GDWN4/graph.json","events_json":"https://pith.science/api/pith-number/RYHBQPTMBT3B55APBGOE4GDWN4/events.json","paper":"https://pith.science/paper/RYHBQPTM"},"agent_actions":{"view_html":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4","download_json":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4.json","view_paper":"https://pith.science/paper/RYHBQPTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4418&json=true","fetch_graph":"https://pith.science/api/pith-number/RYHBQPTMBT3B55APBGOE4GDWN4/graph.json","fetch_events":"https://pith.science/api/pith-number/RYHBQPTMBT3B55APBGOE4GDWN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4/action/storage_attestation","attest_author":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4/action/author_attestation","sign_citation":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4/action/citation_signature","submit_replication":"https://pith.science/pith/RYHBQPTMBT3B55APBGOE4GDWN4/action/replication_record"}},"created_at":"2026-05-18T04:10:10.423112+00:00","updated_at":"2026-05-18T04:10:10.423112+00:00"}