{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2BYOWWM7A5TFC5EXO3XNIBTZMZ","short_pith_number":"pith:2BYOWWM7","schema_version":"1.0","canonical_sha256":"d070eb599f076651749776eed40679667d387f4107f3182bae6c1ce5c66e2846","source":{"kind":"arxiv","id":"2310.11886","version":1},"attestation_state":"computed","paper":{"title":"Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.SI","authors_text":"Jiaxi Pu, Xuan Zhou, Yanhao Wang, Yuchen Li","submitted_at":"2023-10-18T11:11:19Z","abstract_excerpt":"Temporal bipartite graphs are widely used to denote time-evolving relationships between two disjoint sets of nodes, such as customer-product interactions in E-commerce and user-group memberships in social networks. Temporal butterflies, $(2,2)$-bicliques that occur within a short period and in a prescribed order, are essential in modeling the structural and sequential patterns of such graphs. Counting the number of temporal butterflies is thus a fundamental task in analyzing temporal bipartite graphs. However, existing algorithms for butterfly counting on static bipartite graphs and motif coun"},"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":"2310.11886","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2023-10-18T11:11:19Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"8b1c290ab81b95363917281f69f31d470dc0f607effcc1798a6a8f8ace1d0e5c","abstract_canon_sha256":"ec3e5b6129ade1f7616b4c10168dd4c721ee6815fa14c0471f07a98779437c55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:13.577174Z","signature_b64":"8OoS7MHEydvvvSICsxZL80NqDV8MEPl2lTkgNWh9zPiDaXe2NmeRET2UC/oJ77+Twxdpi68Hb24mYPsSxUMYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d070eb599f076651749776eed40679667d387f4107f3182bae6c1ce5c66e2846","last_reissued_at":"2026-07-05T07:02:13.576710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:13.576710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.SI","authors_text":"Jiaxi Pu, Xuan Zhou, Yanhao Wang, Yuchen Li","submitted_at":"2023-10-18T11:11:19Z","abstract_excerpt":"Temporal bipartite graphs are widely used to denote time-evolving relationships between two disjoint sets of nodes, such as customer-product interactions in E-commerce and user-group memberships in social networks. Temporal butterflies, $(2,2)$-bicliques that occur within a short period and in a prescribed order, are essential in modeling the structural and sequential patterns of such graphs. Counting the number of temporal butterflies is thus a fundamental task in analyzing temporal bipartite graphs. However, existing algorithms for butterfly counting on static bipartite graphs and motif coun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11886","kind":"arxiv","version":1},"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/2310.11886/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":"2310.11886","created_at":"2026-07-05T07:02:13.576773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11886v1","created_at":"2026-07-05T07:02:13.576773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11886","created_at":"2026-07-05T07:02:13.576773+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BYOWWM7A5TF","created_at":"2026-07-05T07:02:13.576773+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BYOWWM7A5TFC5EX","created_at":"2026-07-05T07:02:13.576773+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BYOWWM7","created_at":"2026-07-05T07:02:13.576773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.11488","citing_title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ","json":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ.json","graph_json":"https://pith.science/api/pith-number/2BYOWWM7A5TFC5EXO3XNIBTZMZ/graph.json","events_json":"https://pith.science/api/pith-number/2BYOWWM7A5TFC5EXO3XNIBTZMZ/events.json","paper":"https://pith.science/paper/2BYOWWM7"},"agent_actions":{"view_html":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ","download_json":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ.json","view_paper":"https://pith.science/paper/2BYOWWM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11886&json=true","fetch_graph":"https://pith.science/api/pith-number/2BYOWWM7A5TFC5EXO3XNIBTZMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2BYOWWM7A5TFC5EXO3XNIBTZMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ/action/storage_attestation","attest_author":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ/action/author_attestation","sign_citation":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ/action/citation_signature","submit_replication":"https://pith.science/pith/2BYOWWM7A5TFC5EXO3XNIBTZMZ/action/replication_record"}},"created_at":"2026-07-05T07:02:13.576773+00:00","updated_at":"2026-07-05T07:02:13.576773+00:00"}