{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DVED43FFT57KB3IH45RP3W4NWX","short_pith_number":"pith:DVED43FF","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"},"canonical_sha256":"1d483e6ca59f7ea0ed07e762fddb8db5eb981761c5b587fdc66cc119e4a97967","source":{"kind":"arxiv","id":"1801.00338","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00338","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00338v4","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00338","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"DVED43FFT57K","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVED43FFT57KB3IH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVED43FF","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DVED43FFT57KB3IH45RP3W4NWX","target":"record","payload":{"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"},"canonical_sha256":"1d483e6ca59f7ea0ed07e762fddb8db5eb981761c5b587fdc66cc119e4a97967","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"},"source_kind":"arxiv","source_id":"1801.00338","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TraS/bXUbuZZV/v0wyHEbxIw22koIwLKebpKMODgYSZqC/BsDmNk8RTeAc9j0ay+nU1SYAjiTb7X3JDWin2JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:38:37.685100Z"},"content_sha256":"cdf38150f97554ee83b6d4255c08607dd663a58c9bee5cef5dbb588957bd93ca","schema_version":"1.0","event_id":"sha256:cdf38150f97554ee83b6d4255c08607dd663a58c9bee5cef5dbb588957bd93ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DVED43FFT57KB3IH45RP3W4NWX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cxkixmFZozSMaUQQKdNvzp3T/f6dlSzKJV80E3xHLb4waXmITpz5hqZZDuMdpPneHJ9ObC7xKG6a6v7pbJBjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:38:37.685624Z"},"content_sha256":"3a17f0ab45fa9068dd2464266190aa29eac40069af4a6f2a68fb27a3e968eee1","schema_version":"1.0","event_id":"sha256:3a17f0ab45fa9068dd2464266190aa29eac40069af4a6f2a68fb27a3e968eee1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/bundle.json","state_url":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVED43FFT57KB3IH45RP3W4NWX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T17:38:37Z","links":{"resolver":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX","bundle":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/bundle.json","state":"https://pith.science/pith/DVED43FFT57KB3IH45RP3W4NWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVED43FFT57KB3IH45RP3W4NWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DVED43FFT57KB3IH45RP3W4NWX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ef09852bee760cd76b61c7c49d33d7eb3055495c3b693d2e9909f34d2d07187","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-31T18:55:45Z","title_canon_sha256":"0a6e7077e26012f080225282f114bb08c8358157700d914de20bddf5a8d433e3"},"schema_version":"1.0","source":{"id":"1801.00338","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00338","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00338v4","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00338","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"DVED43FFT57K","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVED43FFT57KB3IH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVED43FF","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:3a17f0ab45fa9068dd2464266190aa29eac40069af4a6f2a68fb27a3e968eee1","target":"graph","created_at":"2026-05-18T00:20:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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, ","authors_text":"Ahmet Erdem Sariyuce, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-31T18:55:45Z","title":"Butterfly Counting in Bipartite Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00338","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cdf38150f97554ee83b6d4255c08607dd663a58c9bee5cef5dbb588957bd93ca","target":"record","created_at":"2026-05-18T00:20:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8ef09852bee760cd76b61c7c49d33d7eb3055495c3b693d2e9909f34d2d07187","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-31T18:55:45Z","title_canon_sha256":"0a6e7077e26012f080225282f114bb08c8358157700d914de20bddf5a8d433e3"},"schema_version":"1.0","source":{"id":"1801.00338","kind":"arxiv","version":4}},"canonical_sha256":"1d483e6ca59f7ea0ed07e762fddb8db5eb981761c5b587fdc66cc119e4a97967","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d483e6ca59f7ea0ed07e762fddb8db5eb981761c5b587fdc66cc119e4a97967","first_computed_at":"2026-05-18T00:20:51.828467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:51.828467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NnKxWFN84DMUcFH/iPuud6ogfBxP2KFQKQVc1KQtRTA8TWCncPhnemey1NUR+gogH+ZAVqMdcyl5j+5SIneBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:51.828966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00338","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdf38150f97554ee83b6d4255c08607dd663a58c9bee5cef5dbb588957bd93ca","sha256:3a17f0ab45fa9068dd2464266190aa29eac40069af4a6f2a68fb27a3e968eee1"],"state_sha256":"6e1faf8b2fbedc300dead28f83596bc84f050475d8a38b5d3e5e7d64c695fcae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5yVa0FwHqAn5KKsyhobVPtllRV16Mck2mwfBI17qOf++84l0P3B2WX6fW4EO6rM6lK+etbXB4iBSUs7RV5XBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:38:37.688758Z","bundle_sha256":"920d0da96af8f661ff66a741414032280b3c0e58931eef207f56c047cf8d596c"}}