{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H6W64PN5ETB5CKCIXU5WNSRL3F","short_pith_number":"pith:H6W64PN5","schema_version":"1.0","canonical_sha256":"3fadee3dbd24c3d12848bd3b66ca2bd9431b101fff21dba0d7a368f104665bb3","source":{"kind":"arxiv","id":"1812.00283","version":3},"attestation_state":"computed","paper":{"title":"Efficient Butterfly Counting for Large Bipartite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Kai Wang, Lu Qin, Wenjie Zhang, Xuemin Lin, Ying Zhang","submitted_at":"2018-12-01T23:19:53Z","abstract_excerpt":"Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive structure and plays a key role. In this paper, we study the problem of efficient counting the number of butterflies in bipartite networks. The most advanced techniques are based on enumerating wedges which is the dominant cost of counting butterflies. Nevertheless, the existing algorithms cannot efficiently handle large-scale bipartite networks. This becomes a bottleneck in large-scale applications. In this paper, in"},"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":"1812.00283","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-01T23:19:53Z","cross_cats_sorted":[],"title_canon_sha256":"f15258e4d861d318a439f4e81d912c3f6c4a7555a794d7c56faad0bac6a45e6b","abstract_canon_sha256":"175dc6fc55f92f66660be4096a74364a4cfb85e8c3ef8c8bcdbdafe3297f46e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:08.517544Z","signature_b64":"8NwKeB6Me8w9bVrEcGa/EqmPbioru3wkluFU/rJui84z+pr6lG9dCYd0GoohoiJw30DgbwHW9qh5fGyfYsjwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fadee3dbd24c3d12848bd3b66ca2bd9431b101fff21dba0d7a368f104665bb3","last_reissued_at":"2026-05-17T23:42:08.517059Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:08.517059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Butterfly Counting for Large Bipartite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Kai Wang, Lu Qin, Wenjie Zhang, Xuemin Lin, Ying Zhang","submitted_at":"2018-12-01T23:19:53Z","abstract_excerpt":"Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive structure and plays a key role. In this paper, we study the problem of efficient counting the number of butterflies in bipartite networks. The most advanced techniques are based on enumerating wedges which is the dominant cost of counting butterflies. Nevertheless, the existing algorithms cannot efficiently handle large-scale bipartite networks. This becomes a bottleneck in large-scale applications. In this paper, in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00283","kind":"arxiv","version":3},"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":"1812.00283","created_at":"2026-05-17T23:42:08.517134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00283v3","created_at":"2026-05-17T23:42:08.517134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00283","created_at":"2026-05-17T23:42:08.517134+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6W64PN5ETB5","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6W64PN5ETB5CKCI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6W64PN5","created_at":"2026-05-18T12:32:28.185984+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/H6W64PN5ETB5CKCIXU5WNSRL3F","json":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F.json","graph_json":"https://pith.science/api/pith-number/H6W64PN5ETB5CKCIXU5WNSRL3F/graph.json","events_json":"https://pith.science/api/pith-number/H6W64PN5ETB5CKCIXU5WNSRL3F/events.json","paper":"https://pith.science/paper/H6W64PN5"},"agent_actions":{"view_html":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F","download_json":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F.json","view_paper":"https://pith.science/paper/H6W64PN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00283&json=true","fetch_graph":"https://pith.science/api/pith-number/H6W64PN5ETB5CKCIXU5WNSRL3F/graph.json","fetch_events":"https://pith.science/api/pith-number/H6W64PN5ETB5CKCIXU5WNSRL3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F/action/storage_attestation","attest_author":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F/action/author_attestation","sign_citation":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F/action/citation_signature","submit_replication":"https://pith.science/pith/H6W64PN5ETB5CKCIXU5WNSRL3F/action/replication_record"}},"created_at":"2026-05-17T23:42:08.517134+00:00","updated_at":"2026-05-17T23:42:08.517134+00:00"}