{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DVED43FFT57KB3IH45RP3W4NWX","short_pith_number":"pith:DVED43FF","schema_version":"1.0","canonical_sha256":"1d483e6ca59f7ea0ed07e762fddb8db5eb981761c5b587fdc66cc119e4a97967","source":{"kind":"arxiv","id":"1801.00338","version":4},"attestation_state":"computed","paper":{"title":"Butterfly Counting in Bipartite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ahmet Erdem Sariyuce, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura","submitted_at":"2017-12-31T18:55:45Z","abstract_excerpt":"We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations. We focus on counting the number of occurrences of a \"butterfly\", a complete $2 \\times 2$ biclique, the simplest cohesive higher-order structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large real-world networks shows that our algorithms return accurate estimates within a few seconds, "},"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":"1801.00338","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-31T18:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"0a6e7077e26012f080225282f114bb08c8358157700d914de20bddf5a8d433e3","abstract_canon_sha256":"8ef09852bee760cd76b61c7c49d33d7eb3055495c3b693d2e9909f34d2d07187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:51.828966Z","signature_b64":"NnKxWFN84DMUcFH/iPuud6ogfBxP2KFQKQVc1KQtRTA8TWCncPhnemey1NUR+gogH+ZAVqMdcyl5j+5SIneBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d483e6ca59f7ea0ed07e762fddb8db5eb981761c5b587fdc66cc119e4a97967","last_reissued_at":"2026-05-18T00:20:51.828467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:51.828467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Butterfly Counting in Bipartite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ahmet Erdem Sariyuce, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura","submitted_at":"2017-12-31T18:55:45Z","abstract_excerpt":"We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations. We focus on counting the number of occurrences of a \"butterfly\", a complete $2 \\times 2$ biclique, the simplest cohesive higher-order structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large real-world networks shows that our algorithms return accurate estimates within a few seconds, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00338","kind":"arxiv","version":4},"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":"1801.00338","created_at":"2026-05-18T00:20:51.828549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00338v4","created_at":"2026-05-18T00:20:51.828549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00338","created_at":"2026-05-18T00:20:51.828549+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVED43FFT57K","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVED43FFT57KB3IH","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVED43FF","created_at":"2026-05-18T12:31:12.930513+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/DVED43FFT57KB3IH45RP3W4NWX","json":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX.json","graph_json":"https://pith.science/api/pith-number/DVED43FFT57KB3IH45RP3W4NWX/graph.json","events_json":"https://pith.science/api/pith-number/DVED43FFT57KB3IH45RP3W4NWX/events.json","paper":"https://pith.science/paper/DVED43FF"},"agent_actions":{"view_html":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX","download_json":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX.json","view_paper":"https://pith.science/paper/DVED43FF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00338&json=true","fetch_graph":"https://pith.science/api/pith-number/DVED43FFT57KB3IH45RP3W4NWX/graph.json","fetch_events":"https://pith.science/api/pith-number/DVED43FFT57KB3IH45RP3W4NWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/action/storage_attestation","attest_author":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/action/author_attestation","sign_citation":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/action/citation_signature","submit_replication":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/action/replication_record"}},"created_at":"2026-05-18T00:20:51.828549+00:00","updated_at":"2026-05-18T00:20:51.828549+00:00"}