{"as_of":"2026-08-11T17:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b541fbe087ad0ecae30679fec77c64f477374535d9fdcc9d2fc1050f6e2f660","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T07:21:24.896928Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:42:34.123815Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-03T23:29:02.537191Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11488","snapshot_observed_at":"2026-08-07T15:42:34.123815Z","title":"doi:10.48550/arXiv.2412.11488","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14126","last_updated":"2025-05-20T09:32:47Z","snapshot_observed_at":"2026-08-08T13:16:07.336017Z","submitted_at":"2025-05-20T09:32:47Z","title":"MAS-KCL: Knowledge component graph structure learning with large language model-based agentic workflow","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:34.123815Z"},"links":{"cited_paper":"/paper/2412.11488","citing_paper":"/paper/2505.14126"},"observation_digest":"sha256:df9e8fba8198237c2d09717ff05e2eea5ad5ef5a0f264e494ad49726715321b4","observation_id":"71163fef-608f-4054-ac4a-3ec380238970","resolution":{"observed_at":"2026-08-07T15:42:34.123815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11488","snapshot_observed_at":"2026-08-05T13:30:41.641693Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00674","last_updated":"2025-08-31T03:02:34Z","snapshot_observed_at":"2026-08-05T13:30:34.624486Z","submitted_at":"2025-08-31T03:02:34Z","title":"Triangle Counting in Hypergraph Streams: A Complete and Practical Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T13:30:41.641693Z"},"links":{"cited_paper":"/paper/2412.11488","citing_paper":"/paper/2509.00674"},"observation_digest":"sha256:40ee09fa2ecbb54e6c03217053dbc3162439eefef20dea697073b7c2c89f517d","observation_id":"389ca2d2-9b5c-45c9-8e67-8a6300a2a67c","resolution":{"observed_at":"2026-08-05T13:30:41.641693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"cited_work":{"arxiv_id":"2412.11488","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.11488","snapshot_observed_at":"2026-07-03T23:29:02.537191Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","venue":"cs.DS","work_id":"bdce4382-f358-46aa-b2e3-d1501511f3c3","year":2024},"citing_paper":{"arxiv_id":"2605.03603","last_updated":"2026-05-05T10:27:57Z","snapshot_observed_at":"2026-07-06T23:16:30.147006Z","submitted_at":"2026-05-05T10:27:57Z","title":"Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-05-07T14:24:11.621821Z"},"links":{"cited_paper":"/paper/2412.11488","citing_paper":"/paper/2605.03603"},"observation_digest":"sha256:86aae128cee53f352406171c23b47f41d3f559ba33f6df7256da02b793f960fb","observation_id":"02034a56-bde1-453a-9d35-3875645739df","resolution":{"observed_at":"2026-05-12T00:46:12.651022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"cited_work":{"arxiv_id":"2412.11488","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.11488","snapshot_observed_at":"2026-07-03T23:29:02.537191Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","venue":"cs.DS","work_id":"bdce4382-f358-46aa-b2e3-d1501511f3c3","year":2024},"citing_paper":{"arxiv_id":"2606.17732","last_updated":"2026-06-16T09:49:45Z","snapshot_observed_at":"2026-08-07T08:06:46.720099Z","submitted_at":"2026-06-16T09:49:45Z","title":"Four-Cycle Counting in Low-Degeneracy Graph Streams","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"cited_paper":"/paper/2412.11488","citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:34018aa5d6543b44de5f83e5e9031d2f4d0f3471e3ab4e215a9a1ab69f72d490","observation_id":"9dd6ca0b-c579-4a04-85a6-cbf4730add57","resolution":{"observed_at":"2026-07-03T23:29:02.538801Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.11488/citation-record","integrity":"/paper/2412.11488/integrity","json":"/paper/2412.11488/citation-record.json","paper":"/paper/2412.11488"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rectangle counting in large bipartite graphs","venue":null,"work_id":"04fbd479-2f38-488a-b366-44d3fc4fd917","year":2014},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:f5660c630e9df66eafb22fe5348c80630a774d023eec1d14854a30be92ab6599","observation_id":"71a8434d-739a-4ac9-9149-78a357f593cb","resolution":{"observed_at":"2026-05-23T08:27:45.379406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/comnet/cnx001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Measuring and modeling bipartite graphs with community structure","venue":"Journal of Complex Networks","work_id":"c4ee5976-199e-42fa-8dee-d379ddfc5c49","year":2017},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:14408d4b3fda2f88efe18b7ba2533cfee2680b05d3f11e8851a459b50cfec005","observation_id":"361368c1-ddeb-4c5e-a7ea-a1008e132625","resolution":{"observed_at":"2026-05-23T07:22:41.718475Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cycles and clustering in bipartite networks","venue":null,"work_id":"4be259d7-4cb7-4bef-b781-e4851bf3e454","year":2005},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:00bf2bd9cafb7f4ee1fb69b1183de4c1425484a4545dcc00334a851dbbdd7c23","observation_id":"0479d327-db90-4129-bc96-a634afea57cd","resolution":{"observed_at":"2026-05-23T08:27:45.357376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Small worlds among interlocking direc- tors: Network structure and distance in bipartite graphs","venue":null,"work_id":"c487617c-9094-443a-a1b1-efbeefd8af11","year":2004},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:99589034bea96f89436635aa0d8baa9c0c0235c4fd172344d9fa2b81b07829c8","observation_id":"5d07b9ed-7299-4b60-a6fa-8a07c7cb709f","resolution":{"observed_at":"2026-05-23T08:27:45.385233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Clustering coefficient and community structure of bipartite networks","venue":null,"work_id":"3d6b2a78-faab-46f3-a9c4-efd0187291b0","year":2008},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:28f34a98cd0f3be46f8cf6a40d8bbdc4646736380754209200de2fc0e1d68011","observation_id":"5515d04a-caff-4ade-bd73-5dd5320505fc","resolution":{"observed_at":"2026-05-23T08:27:45.395026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Alleviating the data sparsity problem of recommender systems by clustering nodes in bipartite networks","venue":null,"work_id":"350cdb16-422c-4f60-8af9-b7efd384b228","year":2020},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:a23ed3210d14189901fdddfefca65e4f1cb4b0d0510bcd7f9e6982588ab82f3b","observation_id":"cd043eed-6b89-4783-8517-22d3dea0fe47","resolution":{"observed_at":"2026-05-23T08:25:31.126999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bipartite graph partitioning and data clustering","venue":null,"work_id":"44850f99-c18f-4351-bc7d-fa30c728bc2b","year":2001},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:57e9347fd3068381a2e9eb42633ced663ebdc75310cabe58c3b383f69568c487","observation_id":"6c109806-b7ef-4e1b-b226-a3ce8918a3f1","resolution":{"observed_at":"2026-05-23T08:27:45.408603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal bipartite network clustering","venue":null,"work_id":"e77c70b6-e6a3-4ae7-9430-e0edd651e265","year":2020},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:44beb77a9e3b2dfa683142aa4fb332e9162bfd825426ad8635683ec25bb4b9e0","observation_id":"26f34b73-887b-4b89-b58e-74c65feeaa46","resolution":{"observed_at":"2026-05-23T08:25:31.113909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient bitruss decomposition for large-scale bipartite graphs","venue":null,"work_id":"ce063e4f-59c7-4f07-b25c-214f26b3aafc","year":2020},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:b227812eefa5746024feddd181aa05fa7cc7780279dd9896551c7fb1116df979","observation_id":"2bbbddf7-bd36-482e-ae33-ae393d2bb099","resolution":{"observed_at":"2026-05-23T08:27:45.342767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Community detection in bipartite network: a modified coarsening approach","venue":null,"work_id":"3cec1241-80f9-48da-956e-1d0a8d349a86","year":2017},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:e424ad7ed6ca4904b8ce2280118db1fa775a51f586b749c22d7091a868b8a239","observation_id":"2263bbc4-715a-4694-bea7-ba5ba4e89049","resolution":{"observed_at":"2026-05-23T08:27:45.436661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Searching personalized k- wing in bipartite graphs","venue":null,"work_id":"045fd36b-9a6a-4e5e-a464-879958ba8f95","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:d309ebc631c821aaf8aa587fed5213b9a7f5735cd1fcad3000a5844cb821ddc8","observation_id":"8178da12-9e23-4616-a428-373f4b7bded4","resolution":{"observed_at":"2026-05-23T08:25:31.107683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08628","last_updated":"2021-05-20T11:07:13Z","snapshot_observed_at":"2026-08-10T22:49:57.057875Z","submitted_at":"2021-05-14T09:21:38Z","title":"Butterfly-Core Community Search over Labeled Graphs","version":2},"cited_work":{"arxiv_id":"2105.08628","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.08628","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Butterfly- core community search over labeled graphs","venue":null,"work_id":"4fe13b3b-35e1-49f1-add6-15f6290efd2d","year":2021},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"cited_paper":"/paper/2105.08628","citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:bba7e01c1abcd815895d3fa7b56c79ae0039606cb1d1257a4a58852b27e2123c","observation_id":"ce0855ac-6cdd-4989-9d9e-ae8f9c0f916b","resolution":{"observed_at":"2026-05-23T07:22:43.112585Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed approaches to butterfly analysis on large dynamic bipartite graphs","venue":null,"work_id":"e19159ac-6b56-4b35-9fed-15b854a52af8","year":2022},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:bc266127e4f1b4da8f3f3e019952ceaee69708534022c1839633171b1e138979","observation_id":"f18443d4-96d3-49ee-9dfc-30eaaad8d1cd","resolution":{"observed_at":"2026-05-23T08:27:45.450698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Butterfly counting and bitruss de- composition on uncertain bipartite graphs","venue":null,"work_id":"818d3388-5fd1-419c-a9d8-519312a1dd4f","year":2023},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:5202e24889ec03a057326da156ebae4f6ed57a0e47077bd017f07224644ae566","observation_id":"c59ebcfb-4eec-424b-b2fe-021184d5b6f5","resolution":{"observed_at":"2026-05-23T08:27:45.367539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Butterfly counting in bipartite networks","venue":null,"work_id":"3aff7fab-0819-401e-8d75-7a8f895527e6","year":2018},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:3f22eeb7bb87b8ad37a1f5b50a9e4325d187181a587a764bb3e430e2fa69587a","observation_id":"40e32ffc-cb9a-4e5d-8fcb-f30d037cdebd","resolution":{"observed_at":"2026-05-23T08:25:31.074649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient load-balanced butterfly counting on gpu","venue":null,"work_id":"7135bdc4-ee90-4ad6-9e11-4adf2fd6d86f","year":2022},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:ee909f929602a44c97c0d47bab5eeee58d70e86a5ef3a59cf892bff05d93f107","observation_id":"23627254-5af1-4474-bcbd-6de5a1b4ce5a","resolution":{"observed_at":"2026-05-23T08:25:31.067192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions","venue":null,"work_id":"80bccadc-e974-45e9-8db8-374ec7565236","year":2021},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:e8a2343238c2d62edefdd276ea7bb15bb246edda58505c360f4e02ee2b8ac4b8","observation_id":"6d748213-5eee-41ef-846f-c65fade5b365","resolution":{"observed_at":"2026-05-23T08:27:45.444114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"I/o-efficient butterfly counting at scale","venue":null,"work_id":"d50abbca-dd70-4f37-8dec-3149756c7b0e","year":2023},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:91ce1fbd8ab2e31395d1ecfb962a2d9c13e47e575be37c785f4e093c4aaa22c7","observation_id":"a6109e73-4753-449d-91d7-f882955a26c8","resolution":{"observed_at":"2026-05-23T08:25:31.104618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A hybrid deep learning and modified butterfly optimization based feature selection for transaction credit card fraud detection","venue":null,"work_id":"3754a92c-6d40-4785-94fc-83644dca58e8","year":2022},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:a4bfa7c59af6d47f10774f42eace3aa74bce4f69b983c3cc0534a6477586f11d","observation_id":"cffb89a9-f8a9-4109-b180-61e44a4a5c39","resolution":{"observed_at":"2026-05-23T08:27:45.429991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fraud detection: Comparison of traditional methods, hybrid methods, monarch butterfly optimization, and temporal convo- lutional networks","venue":null,"work_id":"1c7dd333-2155-460e-ad6f-bf4cdb37b34c","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:ac5a00099a98d9922ad419fc95c6217ec413ebffb62438b169eeb00d6f80e202","observation_id":"c30b85f6-096c-4a25-bbf5-0453439602e0","resolution":{"observed_at":"2026-05-23T08:25:31.120208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Vertex priority based butterfly counting for large-scale bipartite networks","venue":null,"work_id":"a7390ffd-64b4-48e8-a506-e63e109d2174","year":2019},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:68ab4b319ef44880e2a2d31554ebaa4c998479953448e4578d7b92bbeeb3a308","observation_id":"4cf46305-248c-459c-a812-9979c1670eb7","resolution":{"observed_at":"2026-05-23T08:27:45.371122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parallel algorithms for butterfly computations","venue":null,"work_id":"4b5efb7e-81bb-47a8-9c14-36c3c747cb5b","year":2022},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:a8865ae0ee80c4b300b75f57eec772cdfcbfd36b2961c9db8a61f5c0623ca267","observation_id":"a6a300c1-c750-4e65-8102-c59639faf8fe","resolution":{"observed_at":"2026-05-23T08:25:31.123506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Families of butterfly counting algorithms for bipartite graphs","venue":null,"work_id":"7e969660-adb7-44a4-a468-49aaf2babcad","year":2022},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:f2ce6fa869b737d900fde515d1255d8c62be4232cc80090a89395bb1f8ab1224","observation_id":"351de2d3-662c-4f31-875d-067bb85a100d","resolution":{"observed_at":"2026-05-23T08:27:45.347896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parallelization of butterfly counting on hierarchical memory","venue":null,"work_id":"de40d3c2-8e06-4240-8d44-9cb452efea9f","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:135fecf7279256a340907715470840b7988faa53e27ec564ab379213ce59129b","observation_id":"95869d63-8b8a-4df9-bea3-1a96ad714d16","resolution":{"observed_at":"2026-05-23T08:25:31.116828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gpu-based butterfly counting","venue":null,"work_id":"ee03b88b-4d57-4ee9-871b-e2fc85e25b49","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:7c55f5c386c1746750fc62a67b60868873054b2918627542259a8d3ce43b2999","observation_id":"172a26e5-722c-4170-bcf9-abac7f90c2e2","resolution":{"observed_at":"2026-05-23T08:27:45.333695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Toward accurate butterfly counting with edge privacy preserving in bipartite networks","venue":null,"work_id":"c839d2a0-815e-4480-bb55-aea70f93a0fc","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:14089487bbc5187d4f41427afbb5dacc63c2b502d87009b7203f67dac5ddc8ad","observation_id":"a60c0695-09dc-409d-83bb-33a34b405db6","resolution":{"observed_at":"2026-05-23T08:25:31.071716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Butterfly counting over bipartite graphs with local differential privacy","venue":null,"work_id":"7875876b-b981-4b13-8f6e-6bbff1f87ea1","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:440cf0a2dc4c4110efa7420fc331e73acbc01c610f7221a54dbd400afc8cccd0","observation_id":"ff344891-d3f0-4415-8bc6-9baa801a712c","resolution":{"observed_at":"2026-05-23T08:27:45.400054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fleet: Butterfly estimation from a bipartite graph stream","venue":null,"work_id":"f1e788fa-ed82-43f7-9c04-05eec9346c3d","year":2019},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:70ab94908103f74256182bd0102d0b80b9358da4e2d81eb6820743f2f6c2644a","observation_id":"1ad4bf14-7d26-46ed-abaa-af6d6168081a","resolution":{"observed_at":"2026-05-23T08:25:31.097870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximately counting butterflies in large bipartite graph streams","venue":null,"work_id":"414ee82d-2964-4525-9b67-373610fef431","year":2021},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:e95daebdc384d65868a46ec5afc58e607b7de19fe055bce9ffb5e32f882ae33e","observation_id":"7ef20040-b511-4ab2-95d6-7f586503bb75","resolution":{"observed_at":"2026-05-23T08:27:45.416418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3495011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"sgrapp: Butterfly approximation in streaming graphs","venue":"ACM Transactions on Knowledge Discovery from Data","work_id":"a67d5e56-6282-4adc-b7fd-dfa53d48e661","year":2022},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:a056f822324376f651620b836cafb9906aa6699c39ce5de842e97aa958961622","observation_id":"0872e713-ff1a-4436-ae35-a4a294927710","resolution":{"observed_at":"2026-05-23T07:22:41.713777Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Counting butterflies in fully dynamic bipartite graph streams","venue":null,"work_id":"ea436b51-5c76-480a-94ee-3f55253a575a","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:e56362c6aea47e5fede0b156296735d674d6b8a11ef5e5ab06ded48ec09fa196","observation_id":"37b48cb3-4c8f-415e-b209-14d7413d4cfa","resolution":{"observed_at":"2026-05-23T08:25:31.094748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scalable approximate butterfly and bi-triangle counting for large bipartite networks","venue":null,"work_id":"bacf8f13-c998-48c1-8ac1-76002f20d59b","year":null},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:45b2948aacef09e79f48e8d9d0bf3148960c33bad7f49d1b44723c5f62046adc","observation_id":"56ac64b3-8e02-4b3a-af56-ff12be2fc0fc","resolution":{"observed_at":"2026-05-23T08:27:45.389511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3626753","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.1145/3626753","venue":"Proceedings of the ACM on Management of Data","work_id":"bb5e2fd0-a8bf-48d0-b75e-ad04a294cdfb","year":null},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:43c8f5dad4d29021cb72c4db151ff306fd0b08805f82164ee3c6d474047f0691","observation_id":"9001f1ee-07c2-46ed-873d-46c31e591cbc","resolution":{"observed_at":"2026-05-23T07:22:41.709170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11886","last_updated":"2023-10-18T11:11:19Z","snapshot_observed_at":"2026-08-11T17:08:20.502543Z","submitted_at":"2023-10-18T11:11:19Z","title":"Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs","version":1},"cited_work":{"arxiv_id":"2310.11886","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11886","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sampling algorithms for butterfly counting on temporal bipartite graphs","venue":null,"work_id":"57994942-9fec-4833-8e09-8fe9f67145d1","year":2023},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"cited_paper":"/paper/2310.11886","citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:41a30b3abcc31a14bd9bb99d63b70559f6d5389ac79bc11d4fe31e09204f63f1","observation_id":"7885628b-e185-4b91-bdaf-3fb6aed114b3","resolution":{"observed_at":"2026-05-23T07:22:43.107455Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scalable distributed stream join processing","venue":null,"work_id":"b284f5b3-75f5-421f-a718-ff1b90a1111b","year":2015},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:083f4d539ac6ae4bef024e28a19d8ff35e227b009c0522c10e166e6095e4a252","observation_id":"fbedb69c-5843-4cc5-8b93-ae77850afdfb","resolution":{"observed_at":"2026-05-23T08:27:45.455328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage","venue":null,"work_id":"0be6aefb-727d-41fb-ae65-4feb1120f52c","year":2017},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:c3261e50ea7f8934dcfa522eba30a9d08a9fb463f4ff80490c5f7af61e6be69e","observation_id":"fff29b05-e5d8-473b-b7f1-229cd63cca1f","resolution":{"observed_at":"2026-05-23T08:27:45.404517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Furl: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams","venue":null,"work_id":"7a7af7b7-a8fd-420a-b1a4-035604a0d3f1","year":2019},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:9685c0e5c0756b77e402507a56eaf022cd965c8d06561116aea5684b46202bac","observation_id":"5f44a20e-91e7-41ce-a23d-de50c0acfcc5","resolution":{"observed_at":"2026-05-23T08:25:31.130382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An adaptive query execution system for data integration","venue":null,"work_id":"2e405ad0-28b4-4e44-b737-d13e50661627","year":1999},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:d0e319f14b724b3f3f5ff624cac259ca0919ae112250d3f911031564eeb0f3ae","observation_id":"51b33ca4-f222-4b29-b9b7-3e3e5e0772d5","resolution":{"observed_at":"2026-05-23T08:25:31.078053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive duplicate detection using learnable string similarity measures","venue":null,"work_id":"e89aece7-aeb0-4a45-85ab-0fc4d77dff61","year":2003},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:da23a60479b06882d9cca7b8829cd022894fe3e295d99b8b173f63280288620f","observation_id":"01729126-1820-4e9e-90a1-884f28db3b7c","resolution":{"observed_at":"2026-05-23T08:27:45.424394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"What’s going on? learning communication rules in edge networks","venue":null,"work_id":"86540ec4-3e73-4a21-b2f6-636a88d88632","year":2008},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:59e096c7e8de8748e86be3b52fb86ae5bda11507df56df48d09b8fbc04fef599","observation_id":"e0f68b10-2ea7-41ff-ad8c-c8da35afd86f","resolution":{"observed_at":"2026-05-23T08:25:31.101791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The impact of duplicate orders on demand estimation and capacity investment","venue":null,"work_id":"70ab7b97-dc50-4096-9716-b9b278f5980a","year":2005},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:6a40b0b55059d03dacea0d8eebba9a59ec76040308039ed073986a450a353895","observation_id":"039f25b2-8f69-449f-9a16-00bc9dcdebf1","resolution":{"observed_at":"2026-05-23T08:27:45.338120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploring duplicate orders in a single-manufacturer multi-distributor supply chain","venue":null,"work_id":"4a4bc86e-d2ab-479d-9929-8d4d147af800","year":2014},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:ef91a21286f1defee2258fdf1ec0d5a8cbc180a25f42ab92aa599b37cfc0ee9d","observation_id":"31487855-8292-47a7-b47e-63010f62e2d9","resolution":{"observed_at":"2026-05-23T08:27:45.375100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fable: Approximate butterfly counting in bipartite graph stream with duplicate edges","venue":null,"work_id":"aaf749fc-5275-44d8-bd21-5c3e1b75df53","year":2024},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:b035a3d07cc70ffc03ddcc324f506329a43c0468b5b076dfe4897f1a16a4b4e5","observation_id":"9a0a2877-c9c5-4a87-90a0-35c81e6021cc","resolution":{"observed_at":"2026-05-23T08:25:31.085136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Counting distinct elements in a data stream","venue":null,"work_id":"0427a48d-1c99-46c6-af9f-d47502e345c4","year":2002},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:16942a495fc069c6476a3a4c99766f989e568bdbd0014d64e2c9dd026ea7f116","observation_id":"04136002-83c8-42a6-9639-c3867f6a80be","resolution":{"observed_at":"2026-05-23T08:27:45.412749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On synopses for distinct-value estimation under multiset operations","venue":null,"work_id":"2ad645e7-bf66-47ba-ba2b-f57a91f70373","year":2007},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:cef7f33d14a9bda5df3587b6bbac18096e0695c1be97813e702bdf183c3d8232","observation_id":"2bab1ea7-26b1-4f22-a990-719ef2a17aa6","resolution":{"observed_at":"2026-05-23T08:25:31.081820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm","venue":null,"work_id":"9d03d797-578f-4b15-b23a-d52c8b99422a","year":2007},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:b2c44cc24fe2d3d10d0de2090d455471e6f5400b3427116218494fca61f345c7","observation_id":"abe8b8f4-b2f6-41a7-aa1f-410f226446e5","resolution":{"observed_at":"2026-05-23T08:27:45.353286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Probabilistic counting algorithms for data base applications","venue":null,"work_id":"20b84b01-32bd-4b5e-a6cf-30b58ddb283d","year":1985},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:0cbad2e6dc7978f5132ce3248819d9d6fb7c96879213a67e394d171eb507a65e","observation_id":"93f93262-b396-454f-95ac-ab8331f867b7","resolution":{"observed_at":"2026-05-23T08:27:45.361128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Streamed approximate counting of distinct elements: Beating optimal batch methods","venue":null,"work_id":"66514e9d-296e-42fa-972d-fd82873229d7","year":2014},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:3e2aa4916ef7a66dd2e4741ceb687cd8d1ddfe1658c12bd5faa32256db45b27a","observation_id":"4bcf1908-7b1c-4c5a-930a-387953487058","resolution":{"observed_at":"2026-05-23T08:27:45.420301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient temporal butterfly counting and enumeration on temporal bipartite graphs","venue":null,"work_id":"251a0e10-ab3b-48e5-accc-2c132bbccf97","year":2023},"citing_paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-23T07:21:24.896928Z"},"links":{"citing_paper":"/paper/2412.11488"},"observation_digest":"sha256:ef1029047840e33db71a59dc36c9e3e92d07cc8a0ebd3e09f805fc074b9de015","observation_id":"8786290d-d114-47b6-885f-c3281b6ede4a","resolution":{"observed_at":"2026-05-23T08:25:31.110888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.11488","last_updated":"2026-04-26T04:42:23Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T20:07:32.814148Z","submitted_at":"2024-12-16T07:04:54Z","title":"Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":44},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 4 inbound Pith citation observations for arXiv:2412.11488."}