{"as_of":"2026-08-11T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb22f5fd2dd06bc089f94dcbde22f122cdb70b2b35f1324337233eb5f0c83a5e","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T22:14:51.175953Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.17732/citation-record","integrity":"/paper/2606.17732/integrity","json":"/paper/2606.17732/citation-record.json","paper":"/paper/2606.17732"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Link prediction via higher-order motif features","venue":null,"work_id":null,"year":2019},"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":1,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:9d1749043b782a5fc668159f9c4b5df9007494b68a15d25a8b11c364a51b6fd1","observation_id":"e4623492-0279-4ea3-a376-0b46b07ac8f9","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Ahmed, Jennifer Neville, and Ramana Rao Kompella","venue":null,"work_id":null,"year":2013},"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":2,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:86b13d3cf71232bc7a1dead2af249140c6d7114de157e44ace0ac7c94c757cf2","observation_id":"5c62d70a-ee14-4d0f-be56-3a8ae41a9b20","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"The space complexity of approxi- mating the frequency moments.J","venue":null,"work_id":null,"year":1999},"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":3,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:2812d31a948799cb85d15be0af622927141c367b32ff81afdb644d0c34f6cabb","observation_id":"8b7d552f-c8e8-41d8-916a-9d801f2d01b8","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling","venue":null,"work_id":null,"year":2019},"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":4,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:214efc01fe8c80656a20290796403863e283a53042105efcefb943fea41f1d99","observation_id":"1bc35b57-9e5d-4ba6-ae57-d5e0b1d55a47","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Bera and Amit Chakrabarti","venue":null,"work_id":null,"year":2017},"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":5,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:6078a4fc96ae0a368afe41b4e869f0c567d8977f6ab7bdd20fa94bb49be360ee","observation_id":"0db9ca2d-79a6-4eb8-ba86-8d906ee56fb4","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Bera and C","venue":null,"work_id":null,"year":2020},"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":6,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:149ab30324791fca7c63307c8414f2a87616203f7fe078997d84a3d637d4061b","observation_id":"1ffc9892-7624-4dc0-bdc0-73da980e5650","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Mining large networks with subgraph counting","venue":null,"work_id":null,"year":2008},"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":7,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:24fa07ca434c98f1cf1159000f29fe52eb0994802c3a498d005fa49f3a77a204","observation_id":"14cb2b65-3e47-446d-b798-06a5830d3442","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"How hard is counting triangles in the streaming model? InICALP (1), volume 7965 ofLecture Notes in Computer Science, pages 244–254","venue":null,"work_id":null,"year":2013},"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":8,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:c938afdf8a9e48677f38704d33ba66dfba2ca5bf567c3b6bbbf74e179c228986","observation_id":"d4474695-47bb-4b1e-bb6d-ab923033f8e4","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":null,"venue":null,"work_id":null,"year":1979},"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":9,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:e890d23a766ff661c7d6c648a5cf7cf983e683b430f540559f34c8f3c75feabb","observation_id":"9663494b-3100-4662-9524-b5452f39ecb4","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Stars, holes, or paths across your facebook friends: A graphlet-based characterization of many networks.Netw","venue":null,"work_id":null,"year":2019},"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":10,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:a221073f34c11a7e6e08faaf0052e37c71f807b4f79cfcbf57aca5b50ba81cab","observation_id":"88d89145-0e01-4cf0-854b-49f621b34343","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Arboricity and subgraph listing algorithms","venue":null,"work_id":null,"year":1985},"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":11,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:ad9e74155de223e4172c33131ee2cab114f14db1546cefc3ef804a36b34e1d3a","observation_id":"ca69cfdb-1099-4bfd-8630-40bad7a0fb2c","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Listing all maximal cliques in large sparse real-world graphs.ACM J","venue":null,"work_id":null,"year":2013},"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":12,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:88752bb18ffb46d55ac3aaf4f8958ab6230046d97453babf87ceb0665fb22215","observation_id":"924d0ddf-9c0f-46ad-81c1-651988a0a29c","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Approximately counting subgraphs in data streams","venue":null,"work_id":null,"year":2022},"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":13,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:0cfa5230ca19e2fbb9240b8493f2e056993a80158d94bbdfaaeb2ff8cb243b2d","observation_id":"4a2679ab-a5e7-49e0-9590-2b44b924f18e","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"An optimal algorithm for triangle counting in the stream","venue":null,"work_id":null,"year":2021},"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":14,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:e67f14e4513321708409b67ef7484b0b25959bc7a6f3408231e499cb3c2c396b","observation_id":"de43bea1-b358-4ccf-8fe2-d68fbc20f209","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"The complexity of counting cycles in the adjacency list streaming model","venue":null,"work_id":null,"year":2019},"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":15,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:7ba59f5b7e711f082664411cbafd0491c8fcd3bd64d71d698037045007bde9c6","observation_id":"6afe1792-97f2-4c67-ba0c-b1a2668be5c9","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"KONECT: the Koblenz network collection","venue":null,"work_id":null,"year":2013},"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":16,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:833a5733b01901947f1f2981597014ed9c22cad4626835957195de6b6d2ee993","observation_id":"88ae5712-9a83-44f6-aac7-ba8446e87c96","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.11818","last_updated":"2021-08-26T14:34:13Z","snapshot_observed_at":"2026-08-02T03:05:01.509081Z","submitted_at":"2021-08-26T14:34:13Z","title":"Understanding Money Trails of Suspicious Activities in a cryptocurrency-based Blockchain","version":1},"cited_work":{"arxiv_id":"2108.11818","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.11818","snapshot_observed_at":"2026-07-03T23:29:02.526950Z","title":"Understanding money trails of suspicious activities in a cryptocurrency-based blockchain.CoRR, abs/2108.11818, 2021","venue":null,"work_id":"2722f214-6c52-4fa3-9893-a56661bd53a5","year":2021},"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":17,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"cited_paper":"/paper/2108.11818","citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:dc0f7cba20e677b3e0c82308cc8e423c8fec62a82b98e5a67ddb03e701d52efa","observation_id":"35e7db77-18df-4d06-9dd5-693a42858610","resolution":{"observed_at":"2026-07-03T23:29:02.528705Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Approximately counting butterflies in large bipartite graph streams.IEEE Trans","venue":null,"work_id":null,"year":2022},"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":18,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:e217d974a80e4593314439c9c639c66c462ad1233c94644851158041d005e5e5","observation_id":"2628d853-74f2-4352-9d02-4211c417ed95","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams","venue":null,"work_id":null,"year":2015},"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":19,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:e4241f44480a356d007cab41477e86639b06e90f5d6848326f3e7ab2e0766737","observation_id":"a87ef0d5-1868-4d21-8ea2-43dab29a3e40","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Lind, Marta C","venue":null,"work_id":null,"year":2005},"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":20,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:f1768eb476a911190f10bf9d4b8c043a56d365fb8ee57624c25c4b62c7643d60","observation_id":"f7b55ec7-0de4-4349-b19c-9d144625e93e","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Four- Cycle Counting in Low-Degeneracy Graph Streams","venue":null,"work_id":null,"year":2026},"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":21,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:1930b6fb1734dc4ef68d25813c34b3bd6ac582735a303e2818de205832736cf0","observation_id":"3cf614cc-7868-4307-95da-2fccbc3548b8","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Near-optimal four-cycle counting in graph streams","venue":null,"work_id":null,"year":2026},"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":22,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:bf0c0e8b3d7d05a3b883da27052051f2f1ba839081385fcbd1ac848ae1c56bb0","observation_id":"0768a89f-6113-4c6b-8f3a-b32471516d01","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Triangle and four cycle counting in the data stream model","venue":null,"work_id":null,"year":2020},"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":23,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:02fcbca27cc9ab55a9903e14831037a34f082b2e6cc8284140777dfbd6f3da2d","observation_id":"7b377f78-c7e6-42d8-a4b8-e8f5bb095d45","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":null,"venue":null,"work_id":null,"year":2016},"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":24,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:ddb9c95850d9e69e9bb78db3a393148ad4ee9b1309123763b03f70b8370e9b96","observation_id":"78c8c900-9774-4806-bb0b-4fb39e4a3459","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","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":"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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.08313","last_updated":"2020-09-15T21:40:15Z","snapshot_observed_at":"2026-08-02T19:27:18.354891Z","submitted_at":"2020-09-15T21:40:15Z","title":"Social network analytics for supervised fraud detection in insurance","version":1},"cited_work":{"arxiv_id":"2009.08313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.08313","snapshot_observed_at":"2026-07-03T23:29:02.530224Z","title":"Social network analytics for super- vised fraud detection in insurance.CoRR, abs/2009.08313, 2020","venue":null,"work_id":"d9aa38ca-3757-4176-a050-e8d8755f13c3","year":2009},"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":26,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"cited_paper":"/paper/2009.08313","citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:c0f8ca8f5253d1da7a95e21edf7243c12f182eb4b93a6d6b2f8edf1e19fb9d80","observation_id":"4316807e-7f7e-4fcf-be80-81c97038de8f","resolution":{"observed_at":"2026-07-03T23:29:02.532143Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Counting butterflies in fully dynamic bipartite graph streams","venue":null,"work_id":null,"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":27,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:1c79f20656f14f4576a2ce842eda292ed44d8b16f87a927ca70b879d93129e75","observation_id":"48b57ac4-abf1-4994-b59e-46a20522c9b3","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Rossi and Nesreen K","venue":null,"work_id":null,"year":2015},"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":28,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:33b7dba480e7ea91d08ff0e9c892670af0033f32609f9d86ea6455ba76046ee4","observation_id":"cc7ab4a8-f9b3-481c-9eb8-d82b64e2a397","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Kleinberg, and Aneesh Sharma","venue":null,"work_id":null,"year":2017},"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":29,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:b7cf1574fb3ab49238c1ee11e521a84ee27bc3cc9c573a42d9ef0ccb1ddbd943","observation_id":"f3118931-b826-4fe8-9977-289b886f16ed","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"FLEET: butterfly estimation from a bipartite graph stream","venue":null,"work_id":null,"year":2019},"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":30,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:af3e281d43cf5911173b3a0846d0569fd5aa9edc98551dd138242fcfa7d8ec0b","observation_id":"914850d2-bcee-4320-992e-3c145d25ae93","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Tracking the trackers: A large-scale analysis of embedded web trackers","venue":null,"work_id":null,"year":2016},"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":31,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:80eebedf8f8120b90e29bc710bdb8a9899698eb36c7dba116ad6b043dd597f98","observation_id":"2f433f44-3411-42aa-bfbb-2fda1c99f533","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Tamer Özsu","venue":null,"work_id":null,"year":2022},"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":32,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:a787358ef7943b1583e56ddc6f45d24d556ca26cb7c57b957284eb9bda46bb41","observation_id":"d8950215-5538-479b-8526-1caaeb997327","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Patterns and anomalies in k-cores of real-world graphs with applications.Knowl","venue":null,"work_id":null,"year":2018},"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":33,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:fa54f5036f5e79b661f352facd88c32993daafd5eebc5ae6ba597fc345eecedf","observation_id":"a3270d6c-f153-48bc-b100-987c452910c8","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Lee, Yanick Charette, George Iosifidis, and Nicholas A","venue":null,"work_id":null,"year":2025},"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":34,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:bbe98e65bbb3338381a19672ca5b2334562d282c9d9bc4888e3bb41ab9d61dbf","observation_id":"9600c906-1d2e-443f-bc9f-c8a45d1ff41a","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Motifs in brain networks.PLoS Biology, 2(11):e369, 2004","venue":null,"work_id":null,"year":2004},"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":35,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:b6b097af5cad07efa64fa74d88cc8fb55d9ca25db57c589358ab7156c7229cfd","observation_id":"4a81b74f-45c0-45e9-8ec3-e30e2cb689c6","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Trièst: Counting local and global triangles in fully-dynamic streams with fixed memory size","venue":null,"work_id":null,"year":2016},"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":36,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:2b249be4cd4981276a8d255bbe3bf390e2f24aea16a81756c0320217f5dae9c6","observation_id":"00a1d69e-33c1-45bb-bfbb-7950e8968783","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"FABLE: approximate butterfly counting in bipartite graph stream with duplicate edges","venue":null,"work_id":null,"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":37,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:4850c8e7c0b0b04d3136fdf033802f8293574a76f9313abfff4623dbd07628c2","observation_id":"c8542853-4fa5-41ff-9cfa-0223909cd663","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:14:51.175953Z","title":"Random sampling with a reservoir.ACM Trans","venue":null,"work_id":null,"year":1985},"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":38,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:6beb01e9c64bcd9117c70cd2b2f85ef2c868dbbeb61cad60ea54eb609b223144","observation_id":"25fb52a8-4e03-42f1-9f88-5700a9d8d7ab","resolution":{"observed_at":"2026-06-26T22:14:51.175953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.13466","last_updated":"2020-07-27T12:12:21Z","snapshot_observed_at":"2026-07-06T09:42:04.413958Z","submitted_at":"2020-07-27T12:12:21Z","title":"Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming","version":1},"cited_work":{"arxiv_id":"2007.13466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.13466","snapshot_observed_at":"2026-07-03T23:29:02.533678Z","title":"Improved 3-pass algorithm for counting 4-cycles in arbitrary order streaming.CoRR, abs/2007.13466, 2020","venue":null,"work_id":"b1415a07-a967-48cf-99f0-ddd9ab85198d","year":2007},"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":39,"source":"pdf_text","source_observed_at":"2026-06-26T22:14:51.175953Z"},"links":{"cited_paper":"/paper/2007.13466","citing_paper":"/paper/2606.17732"},"observation_digest":"sha256:cddffe2e32d29782230ba2e4bb4310ecf1d2eb8851b4b3253973582ec2eb5750","observation_id":"6a3c1a0f-cb94-45d1-8d26-4b2c1e313010","resolution":{"observed_at":"2026-07-03T23:29:02.535612Z","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"}}],"paper":{"arxiv_id":"2606.17732","last_updated":"2026-06-16T09:49:45Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":39},"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 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2606.17732."}