{"as_of":"2026-08-05T16:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0748922ccf46436a9d48f2efa3e10a2e9e642a277b91dd55894d48bab4c5095c","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T15:22:47.089454Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2604.25400/citation-record","integrity":"/paper/2604.25400/integrity","json":"/paper/2604.25400/citation-record.json","paper":"/paper/2604.25400"},"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":"Mixing time bounds for graphlet random walks","venue":null,"work_id":"625867d3-df6c-4290-a278-b71dd2b71356","year":2019},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:b1e23b58736068ba526455b5ab140e3eb3acd397d94793c24468825c883d5845","observation_id":"271ea3aa-3a04-4396-ba85-75c01d5286cf","resolution":{"observed_at":"2026-05-27T03:28:45.882605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Ahmed, Nick G","venue":null,"work_id":"aec55878-b8a9-4262-9bb6-8457918600e4","year":2014},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:28ac830e64aa3615c702f113b214f2b140ee70b4405b21ef19c52aaa584ee3fb","observation_id":"65055ea7-8880-4737-a760-d82000e952e1","resolution":{"observed_at":"2026-05-27T03:28:45.789636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"D ensest subgraph in streaming and MapReduce","venue":null,"work_id":"515d870a-6b9c-4df6-b901-573a0bcd8401","year":2012},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:15c9193806b6ffa29ae43c455e99422aa374c20581f21bbbdb3a8e6e97a64d2d","observation_id":"a1064b87-0593-4efb-a840-d78b9fc3c68f","resolution":{"observed_at":"2026-05-27T03:28:45.773706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Sivakumar","venue":null,"work_id":"8d9e7bab-bef1-4093-9a53-0b3482156e17","year":2002},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:bf51406b6f2c96f2bd8c08dabe14d843d4508e2814c96ed554ff5585ead542c0","observation_id":"3bc9c191-340b-44a0-b6ce-2c4124fc3a7d","resolution":{"observed_at":"2026-05-27T03:28:45.880051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 semi-streaming algorithms for local triangle counting in massive graphs","venue":null,"work_id":"db879a47-8c7b-4812-9d9b-aaf4b481803e","year":2008},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:bbcdb58370a9fecd177c6bf209548a57c09ff6d7401d7c11513a14c243ff0ac4","observation_id":"84e55f63-b92e-41de-be20-d2f61345cdbd","resolution":{"observed_at":"2026-05-27T03:28:45.858981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Bera, Lior Gishboliner, Yevgeny Levanzov, C","venue":null,"work_id":"b6ae08a7-fa19-49ad-8f2c-208bb4d4460d","year":2022},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:f8db1709540c1f793b7e92a01d9ddc3f74d9fa7d48f9b44d92656fb7a6f02005","observation_id":"4c4a28ea-6b06-46ce-bf97-620a7eedad9b","resolution":{"observed_at":"2026-05-27T03:28:45.862503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Bhuiyan, Mahmudur Rahman, Mahmuda Rahman, a nd Mohammad Al Hasan","venue":null,"work_id":"4f9f1762-23a5-4bd6-b4ff-060954a1bf37","year":2012},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:c6159fba9f1772a43bebfb4d5cd9729328f82f8e8e5d4c57d20f19bfc56f526d","observation_id":"8d77694b-f8e9-4487-aba1-93d98eb9bb44","resolution":{"observed_at":"2026-05-27T03:28:45.754350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Hubert Chan, Qipeng Kuang, and Mauro Sozio","venue":null,"work_id":"4d2e3338-0de3-4882-bc5d-6eb732f58a42","year":2024},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:7a95b608b09ffe30331dc181d8fed47221ea57a499c828313484e9f9d000964c","observation_id":"8519d7c3-ed25-4d64-985d-22f0dca56057","resolution":{"observed_at":"2026-05-27T03:28:45.816125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 and near-optimal algorithms for sampling connected subgraphs","venue":null,"work_id":"925fec1c-349f-408e-a768-21ae076672cf","year":2021},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:4f8b32014d48b7fa02aa650487c51511cbd799e5dd593738a6c016f4b7cd5b17","observation_id":"6e25a352-52f2-48b6-99e9-47d5fa49db2d","resolution":{"observed_at":"2026-05-27T03:28:45.757784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 and near-optimal algorithms fo r sampling connected subgraphs","venue":null,"work_id":"793f5d1d-b933-4517-b723-81f6042758af","year":2021},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:3c7f3df1e73fa5e5e051b6da1aef2c3022676134ee44923ef7a5bbc633ee570a","observation_id":"9bf3bfff-dce1-4719-b3a2-6a5500488ba3","resolution":{"observed_at":"2026-05-27T03:28:45.779506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Faster algorithms for counting subgrap hs in sparse graphs","venue":null,"work_id":"50a4a470-edbc-4ba3-8018-2e617f18d584","year":2021},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:f142fbad2c2c7e5a02399b989d665044c5ca2a5f996b11d9b8d6cdb2f9d9ffef","observation_id":"78318adb-865b-469f-b7dd-aa4b62f98323","resolution":{"observed_at":"2026-05-27T03:28:45.825398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 and near-optimal algorithms fo r sampling small connected subgraphs","venue":null,"work_id":"ad6cd097-af7b-4124-a8ae-68d69c024693","year":2023},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:df74cc545785491b0a6d185867ee051f75c5c08fcb63f4c32edab02a5b663e35","observation_id":"e33c0079-6cbd-41dd-8582-0e2be192e8fb","resolution":{"observed_at":"2026-05-27T03:28:45.828716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 graphlets: Space vs time","venue":null,"work_id":"4bb9b351-08fb-4be5-b9a9-95161e9df653","year":2017},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:587709ca3edba2ea42876a28bee206fe461b1ee5998276c5442957d8d53a69a6","observation_id":"82dfcb3f-0f84-41ee-966d-5fb6c612e057","resolution":{"observed_at":"2026-05-27T03:28:45.764032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Motif counting beyond five nodes","venue":null,"work_id":"93f2aaa1-7fca-4202-beaa-73aaa59e492a","year":2018},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:25feba1c161554efefc837e50cd0126356220aa56df4dd550b2df7ad48b9e551","observation_id":"fafdcedd-5945-47f4-9f19-0a77a76c9e25","resolution":{"observed_at":"2026-05-27T03:28:45.766758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Motivo: Fast motif counting via succinct color coding and adaptive sampling","venue":null,"work_id":"746b0d1b-a431-4805-a33e-354fa26de9d4","year":2019},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:cdb617526e0f28387cdbf23f7c5cd269d2fce1f1cc86f36b2f43f90466ede126","observation_id":"efa26d6b-5574-4dc3-92ea-fb6c3a890d03","resolution":{"observed_at":"2026-05-27T03:28:45.812820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Faster motif counting via succinct color coding and adaptive sampling","venue":null,"work_id":"260159af-0a7c-4713-98f4-ee2a02c7906e","year":2021},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:8d64569c59cc1d7778428b7b9a542f92f4f9a3d780ff15355a7b89f1604444f3","observation_id":"f0fe8097-ce58-4a9d-a180-e49fe28faf36","resolution":{"observed_at":"2026-05-27T03:28:45.819323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Krishna Gummadi","venue":null,"work_id":"a0b65db9-dccb-43fb-8f5e-5064f71e1289","year":2010},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:47e3540da39c1ee497ea85d30a014153f325e72710f16a642a237b3be7225c30","observation_id":"80661791-3ab3-4d5e-9358-01672bd7d727","resolution":{"observed_at":"2026-05-27T03:28:45.809983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Kanj, and Ge Xia","venue":null,"work_id":"dbfe5e5b-d21c-48be-912c-fc65748f3925","year":2006},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:c6299ad9efc4b7610e34c90622c35fbc2beeeccb121bea1f63c537d96c80b506","observation_id":"15fcf228-8e13-40f6-bb55-4846f4608805","resolution":{"observed_at":"2026-05-27T03:28:45.865492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"cd6282d0-e210-4629-9014-0d55eb6ace1c","year":2016},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:a07eb4ff67f53ec7959f2986c720ff017581c623f171f917ea1b0670be20d71c","observation_id":"29f7e6e5-e470-40c8-9828-5a1c067407b8","resolution":{"observed_at":"2026-05-27T03:28:45.782688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Arboricity and su bgraph listing algorithms","venue":null,"work_id":"9c8495a1-945c-4c80-96d8-98b8e6b373b9","year":1985},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:89abd22be15bcdd83b8ba7cf7204f2c8c406de4dd74a80be48be3a4442456f9c","observation_id":"755b0162-202d-4e12-9059-872913711661","resolution":{"observed_at":"2026-05-27T03:28:45.841065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 graph problems in a semi-streaming model","venue":null,"work_id":"f8000486-82fd-402c-b6a7-f9c83cb11233","year":2005},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:4bd2327245e11fcfd9b355db5d7e163566f08728fb18d5d7b84ba5a01fc240d6","observation_id":"1c79f127-d85c-4144-8e4c-4f257bec1d34","resolution":{"observed_at":"2026-05-27T03:28:45.795853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Improved parallel algorithms for density-based network clustering","venue":null,"work_id":"926caf5d-583a-4d3e-ba3e-c100e60d7f7f","year":2019},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:2715e9e677a2dcfa4387a67ff23e0708422022015c295611b316594c69b58840","observation_id":"00af1537-0f76-4b83-a798-b3326cd5bb68","resolution":{"observed_at":"2026-05-27T03:28:45.877195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 efficient framework for clustered federated learning","venue":null,"work_id":"154c2b2e-7461-48af-8e7a-748cc1e89c13","year":2022},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:8730659ee4c5d57411c88cc4b15b7b245150cb83dd4151e5708f72294e841222","observation_id":"dfdccbac-21b6-4ce7-88f3-3490c8d079a3","resolution":{"observed_at":"2026-05-27T03:28:45.852899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Waddling random walk: Fast a nd accurate mining of motif statistics in large graphs","venue":null,"work_id":"490d8526-7c9d-4771-87cd-318ddd9fe45f","year":2016},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:57dd8115094f90988494f75b082f5fdc0d299754bb918b652ecfb3b1e4e74ce1","observation_id":"1d69313b-8630-43a4-8ccc-d90d1dc1812d","resolution":{"observed_at":"2026-05-27T03:28:45.847370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 generalizati on of sampling without replacement from a finite universe","venue":null,"work_id":"e829d3f6-9b07-4336-9e3e-4ef3c3df68bc","year":1952},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:cd96ead1bd16c2d3c6950b83a57ad32112d008e7a7a58538ae1beec328fc2365","observation_id":"9fd47c17-9d87-47c1-9113-f680e479787c","resolution":{"observed_at":"2026-05-27T03:28:45.804671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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 parameterised complex ity of counting connected subgraphs and graph motifs","venue":null,"work_id":"f4fa13ef-3fe1-4997-8a8c-f194e5f76b5c","year":2015},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:3d4a045dda49f94457abf137c86ac152b3d884a1fbb241b5e20385562ef1fef9","observation_id":"1a4f4dec-369f-4298-94e6-e4b1450cc86e","resolution":{"observed_at":"2026-05-27T03:28:45.770208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Seshadhri, and Ali Pinar","venue":null,"work_id":"d82eaf7b-f523-4e77-b214-acac04df85e3","year":2015},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:e8e0f6d5c83174790526cc2981ded216ca66c3814775a7229832296c680f3ffb","observation_id":"c9c778fc-251e-47e4-a2d8-0ba27a541b02","resolution":{"observed_at":"2026-05-27T03:28:45.801718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun","venue":null,"work_id":"20265c65-df55-4890-a73b-4d988c6df547","year":2012},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:a01d6db4f4dad9fc6810e408e89c310bbaaa66242c3af97c61b9610f95a86277","observation_id":"a84c8e46-fe49-4559-a0d5-9bb3064a54bf","resolution":{"observed_at":"2026-05-27T03:28:45.855981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"KONECT: the koblenz network collection","venue":null,"work_id":"bf17b897-cfdc-4c6e-b9ad-61ed68b5305c","year":2013},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:feeefbade893ad5708db27e4c5daa05a283945b2d3da42bc905aa5c00d1e04b0","observation_id":"3e92ccfe-c7c9-4362-a5ba-668758f04402","resolution":{"observed_at":"2026-05-27T03:28:45.799044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"f78c6379-eb09-4ba6-9a15-f59535e559d5","year":2010},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:235610b29527b0ecff7d92785c79146d4831a83d6b8e4cb663e9553762ff8060","observation_id":"04981a94-1357-4d63-bd66-2de0b621bb3c","resolution":{"observed_at":"2026-05-27T03:28:45.831772Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"c6a90d04-a777-4ed6-b607-23e73fa10def","year":2018},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:eba41b939940321b4cb343664bf51af636c93c1cd8f65aedc3b4b3b5f59daa12","observation_id":"32f783c9-ef5b-4f1d-9e89-e49cb53a14cf","resolution":{"observed_at":"2026-05-27T03:28:45.776358Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Improved mixing ti me for k-subgraph sampling","venue":null,"work_id":"b50ef271-cc0c-41b0-81e0-b1852c85298d","year":2020},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:db98e38dfdc98c411734d5f4948ed1ba336c5a75e8d9144e419da15b48402ed0","observation_id":"5e7b200a-2c21-43df-bda9-967506a8cc7d","resolution":{"observed_at":"2026-05-27T03:28:45.844361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Matula and Leland L","venue":null,"work_id":"f7fa37be-59e8-4734-8f64-998ea88f6e09","year":1983},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:cd89c96ea3c8159bf2b56662db725816f209d61d184d272b3e418894295deb0e","observation_id":"188c2f11-efbe-45df-beef-6548893d5c05","resolution":{"observed_at":"2026-05-27T03:28:45.748148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"d1702a84-e201-4b31-b0d9-13bc04a7adc8","year":2002},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:3ebd8bdb25360ac878f9b414127da1e601b8b2460e3dbfe67f4e79f150a8e720","observation_id":"80b140fd-e145-480c-a690-5ace836e6bd3","resolution":{"observed_at":"2026-05-27T03:28:45.834801Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Estimating graphlet statistics via lifting","venue":null,"work_id":"30e0c566-a182-4f4e-a83f-50c25444746d","year":2019},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:6bacce1afea05cda276ad310374376e356a5389a79c5d6af3633afd2e7fc6a95","observation_id":"204fc943-1228-44eb-b966-8e1ed76640ac","resolution":{"observed_at":"2026-05-27T03:28:45.837996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Pavan, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu","venue":null,"work_id":"982c8497-bd80-4f2b-8b68-b851186c46ef","year":2013},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:82ea32fd596443ebda22183bd13e6ee986815db44a8ab4282489329c622a0f1b","observation_id":"7a992d8f-0a12-4dd6-95ef-5a7e768bffde","resolution":{"observed_at":"2026-05-27T03:28:45.822271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Motif- matching based subgraph-level attentional convolutional network for graph classification","venue":null,"work_id":"8867c63f-6c96-46e4-a551-dfe54271bb7a","year":2020},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:1f15b190f67b45c4b4b8bdd06e9d40539956a6c2dfd18f02d1dccd1a7ed1ccfc","observation_id":"f61f05b9-eea0-4cb4-989a-2330a317370c","resolution":{"observed_at":"2026-05-27T03:28:45.792954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Finding network motifs using mcmc sampling","venue":null,"work_id":"89ee6033-6646-4bd2-8fd1-328c58064454","year":2015},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:b6b5187fe9e534875997b7f4a683706b94abd65761a973b21e168f367cf77619","observation_id":"a551f5d4-e167-4d67-a4df-bef2973f85a6","resolution":{"observed_at":"2026-05-27T03:28:45.868706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"C ¸ ataly¨ urek","venue":null,"work_id":"cf4793bc-f621-40b1-b8bc-22a26d784cdb","year":2013},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:2b83627a2a348555b6d8aa372864703e59b5527e14312bc16d354e0bf196d362","observation_id":"cefbb5b5-5664-4fec-b651-070cf2e94114","resolution":{"observed_at":"2026-05-27T03:28:45.751140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"4d206ac1-7744-4bdb-8500-180e3a834782","year":2009},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:90cbfb5771fa5c761be9f7a2607f18d02a4d3786952c31dd256ebc16730143f7","observation_id":"5e16c60e-9fa6-4da2-86ac-c5e3de19ac28","resolution":{"observed_at":"2026-05-27T03:28:45.786076Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Triest: Counting local and global triangles in fully dynamic streams with fixe d memory size","venue":null,"work_id":"02cc889a-12be-4e60-85a6-1d3d8dc4044b","year":2017},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:6f27e8fb2b0ef796d318792bb6d1ca8fdd21db7995f9324a715db9eb5db0ba19","observation_id":"a9d94fae-7038-484e-a1fc-6ab5bdf48489","resolution":{"observed_at":"2026-05-27T03:28:45.761147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"Tiere d sampling: An efficient method for approximate counting sparse motifs in massive graph stream s","venue":null,"work_id":"21d0ff6e-fcd6-4cc9-9a49-e8c9e84d5109","year":null},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:d7b048893d558c68209c16b315eab787273ce9a70ae7c82477e3c0c8b6ccbb2a","observation_id":"2b53ed97-042d-480c-9889-e02f7e61430b","resolution":{"observed_at":"2026-05-27T03:28:45.874462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"49d9b646-55c4-4e56-93ac-1983c09893dc","year":2017},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:26c272bf084c5eb081f17d6ef04042dae178cabefb40936c94861e4857cf487e","observation_id":"71c4385e-8597-4f77-9dfd-86e77435f5e4","resolution":{"observed_at":"2026-05-27T03:28:45.871590Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"9384ffbe-27d1-493a-bbcd-943787455b83","year":2019},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:0d8f5a76247639ae8b1117000c525f91e44a5e00f84987cb04d64046d6342a1e","observation_id":"4ec2f45d-5f98-4371-b2a3-e760da82aa41","resolution":{"observed_at":"2026-05-27T03:28:45.744884Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"a1ce9923-7d93-46e3-91c0-5180e2612ece","year":2014},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:0f026b2fc0ceea78b3e58ddc0ce5cb43b1c2f9124879e22a4fe23b94604340e0","observation_id":"a7cd5fea-27b2-42a1-ba7f-36c52d4beab6","resolution":{"observed_at":"2026-05-27T03:28:45.807083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":"ounter ApproxDD-ES","venue":null,"work_id":"413f8f52-40aa-48bb-b4e6-091cde4bc695","year":null},"citing_paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-07T15:22:47.089454Z"},"links":{"citing_paper":"/paper/2604.25400"},"observation_digest":"sha256:71b8d29f6bd6219beb41e90416d5dce90ee64bc36dd495123b2f5be4d02f007d","observation_id":"05c6b544-51e1-4b20-babd-e3ed05d5f4d3","resolution":{"observed_at":"2026-05-27T03:28:45.850260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.25400","last_updated":"2026-04-28T09:11:34Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T22:46:52.310587Z","submitted_at":"2026-04-28T09:11:34Z","title":"An Efficient Streaming Algorithm for Approximating Graphlet Distributions"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":38},"total_outbound_references":46},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2604.25400."}