{"as_of":"2026-08-04T14:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0195039a89ce34d1e63e0615ed6934eda9b2c4df196a3f089929bb764fab38d","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T05:14:56.480794Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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.13182/citation-record","integrity":"/paper/2606.13182/integrity","json":"/paper/2606.13182/citation-record.json","paper":"/paper/2606.13182"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:14:56.480794Z","title":"Spectral sparsification and regret minimization beyond matrix multiplicative updates","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:3d6ae46ad69fb32f09e665c2e6cd761b83583bcaebbb663b9fe83ada146313e7","observation_id":"b2ac73f3-a55a-4277-8cfc-11f1080bc9d6","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Learning with submodular functions: A convex optimization perspective","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:e70a0a472436da126f6a8aa0b63afc2396510c4586fdc649a18def08c95c070f","observation_id":"b8c6dd7a-0224-4297-abad-4a2be3e792d8","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Sketching valuation functions","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:71d8d8ad7fc6b48b94a09782076fb53524dd438c04e38a9cdcee4a5c9117ff65","observation_id":"9a207093-8ce3-4046-8410-6f0effc92de9","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:a8fbe2c9dd8c2552ed0c331ca8e6a0f3224133357d260ab3dbde308dd12a76ec","observation_id":"05382cb1-4cb4-4e5f-bff7-c42e7f1ca8a8","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:e6f8c5813868b102de559ebf8851eb272c4b72afb2c18692d174fa8cfe815274","observation_id":"9d77abd7-c88b-4c24-b618-6268ee770048","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Almost optimal streaming algorithms for coverage problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:ae9b6c5e51b4e6106105964f4caa9294f16ba2d996076ffad98beda21bda4111","observation_id":"e1e6f213-feed-4f80-a1fd-2f46707e8b02","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Spielman, and Nikhil Srivastava","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:28068f118694a8c17102b474e752935e7cadb59c597f1d6228644748b474e32c","observation_id":"d91066aa-d116-454c-86df-1a00e9f56338","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Approximating st minimum cuts in O (n^2) time","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:44cd289b807eb93fb4ea40411179ae645733daccf901627958709a5ee1178296","observation_id":"b3cb5a24-692c-4581-a690-34fb15437781","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Optimal lower bounds for sketching graph cuts","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:59af7b126f2fecba364311ca3b51b7124518b9d06161dd69fb8a4968c79b80cd","observation_id":"36b0be2a-4570-460f-b8e7-7e149c6758d1","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Recognizing coverage functions","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:86eb08baebec9be642f22a52cc59359ba820edde0c6cc9b39ba2b731be5de472","observation_id":"3d160678-3334-4ee2-8e11-ba7e9ab9a7d9","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Light RUM s","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:e3a52bd9a769c3a060ba209a42f6f605212c2d1810a9d4868804f73802a8d7c5","observation_id":"1c8ad318-49a0-43b4-82e6-87b3ff009e63","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Muthukrishnan","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:369cdedaac6425614eb7738b799a27ca24f7579ded08a88947127f8e7a883437","observation_id":"79323961-4cf2-42bc-818e-b6982ed46f9a","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Concentration of Measure for the Analysis of Randomized Algorithms","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:f92212da922aa8c320a1750d9db3e8ab7d02eddf89b11ffab45480fa22cace4c","observation_id":"ade2ac65-19b4-4bff-a90d-fff2d6e7f12e","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Learning coverage functions and private release of marginals","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:14a2d6d787fd7ec504f852bfc7636c19f10e5d932f364e6d755e03221d65623a","observation_id":"725d84f5-0c47-4600-86f3-839856679ce7","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"A B ayesian analysis of some nonparametric problems","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:ca53c30bdc16df82327d997292c53c2e1ac8909a243e50fc1c8489ed203524b2","observation_id":"c6ea9c87-b90e-4416-bc05-d60de6c6cdb7","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Global min-cuts in RNC , and other ramifications of a simple min-cut algorithm","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:00feb7fccf16b129efd5de6013d2ee2231234695d62e5dda589087c8cb09a80f","observation_id":"aa0d92d1-9d7a-41b8-a035-f8f4f17f331b","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Constructing linear-sized spectral sparsification in almost-linear time","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:b57f6965b130972766709d05185a8cdab17f56cdead01c3386023fb8fd4d1df8","observation_id":"f2e3a1e4-e72a-4712-9c7f-da962c4ced6b","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Space lower bounds for itemset frequency sketches","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:bc73d7ed66a2bb97f3be53e40e3943774e913cea5d9db66e6ddae4cdb74752d7","observation_id":"8200d950-307e-40b1-9ccd-16f70b657b19","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"On the sub- G aussianity of the beta and D irichlet distributions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:49ea87e942170af38107554abe431b40cdb077f01bdc6d9935acf5a609957f60","observation_id":"d2f15615-0730-48c5-b16c-352bd434ca31","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Serfling","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:354e20dc2c9460ccf8481c7e9578a480338571bc93018d01edc60a20308de7d2","observation_id":"52d30124-3bcb-4d43-b812-02878ebe18de","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Graph sparsification by effective resistances","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:91350eb4f7113aafb13366762291b1e8442d18c73e98b15bd37ab6b42d7b1d93","observation_id":"bf6f75bc-65a6-422f-b7be-88156c17c640","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Spectral sparsification of graphs","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:1206a2cfe14f01e78ad155483313a8e7177efc6fe106ba947217bdf5b9de16c7","observation_id":"055d5d70-384a-4713-b9c6-1920f3fcdc5e","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Discrete Choice Methods with Simulation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:6217f1f5f9ba53133abf96236287df7cb9f622fafff4044eeb806052f5678a69","observation_id":"226fcdd9-034c-48cc-905f-e088ede3cf3a","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Learning interpretable decision rule sets: A submodular optimization approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:be0b08d00daee76cb3fbbcbf17f7a479b1b43f1866f5b05575563c3de97aa64c","observation_id":"f906f7d0-a315-4301-bc15-7318b00b159a","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","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-27T05:14:56.480794Z","title":"Approximate F_2 -Sketching of Valuation Functions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T05:14:56.480794Z"},"links":{"citing_paper":"/paper/2606.13182"},"observation_digest":"sha256:4a4332bb4af64136e6bf4d7f9fc56c48d9fc6899834f79b3be1a1d68bf1e68fd","observation_id":"bc8482ad-fa78-4ba4-8c5b-933a4926924f","resolution":{"observed_at":"2026-06-27T05:14:56.480794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.13182","last_updated":"2026-06-11T10:50:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-01T08:56:51.607190Z","submitted_at":"2026-06-11T10:50:45Z","title":"Sketching Intersection Profiles: A Simple Proof and Three Applications"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2606.13182."}