Pith. sign in

Paper Citation Record · LEDGER

Sketching Intersection Profiles: A Simple Proof and Three Applications

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2606.13182 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-27T05:14:56.480794Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

25 of 25 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved25
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b2ac73f3-a55a-4277-8cfc-11f1080bc9d6 · outbound

This paper cites Spectral sparsification and regret minimization beyond matrix multiplicative updates.

Sketching Intersection Profiles: A Simple Proof and Three Applications Spectral sparsification and regret minimization beyond matrix multiplicative updates

Reference 1

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:3d6ae46ad69fb32f09e665c2e6cd761b83583bcaebbb663b9fe83ada146313e7

Observation b8c6dd7a-0224-4297-abad-4a2be3e792d8 · outbound

This paper cites Learning with submodular functions: A convex optimization perspective.

Sketching Intersection Profiles: A Simple Proof and Three Applications Learning with submodular functions: A convex optimization perspective

Reference 2

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:e70a0a472436da126f6a8aa0b63afc2396510c4586fdc649a18def08c95c070f

Observation 9a207093-8ce3-4046-8410-6f0effc92de9 · outbound

This paper cites Sketching valuation functions.

Sketching Intersection Profiles: A Simple Proof and Three Applications Sketching valuation functions

Reference 3

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:71d8d8ad7fc6b48b94a09782076fb53524dd438c04e38a9cdcee4a5c9117ff65

Observation 05382cb1-4cb4-4e5f-bff7-c42e7f1ca8a8 · outbound

This paper cites an unresolved cited work.

Sketching Intersection Profiles: A Simple Proof and Three Applications Unresolved cited work

Reference 4

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:a8fbe2c9dd8c2552ed0c331ca8e6a0f3224133357d260ab3dbde308dd12a76ec

Observation 9d77abd7-c88b-4c24-b618-6268ee770048 · outbound

This paper cites an unresolved cited work.

Sketching Intersection Profiles: A Simple Proof and Three Applications Unresolved cited work

Reference 5

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:e6f8c5813868b102de559ebf8851eb272c4b72afb2c18692d174fa8cfe815274

Observation e1e6f213-feed-4f80-a1fd-2f46707e8b02 · outbound

This paper cites Almost optimal streaming algorithms for coverage problems.

Sketching Intersection Profiles: A Simple Proof and Three Applications Almost optimal streaming algorithms for coverage problems

Reference 6

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:ae9b6c5e51b4e6106105964f4caa9294f16ba2d996076ffad98beda21bda4111

Observation d91066aa-d116-454c-86df-1a00e9f56338 · outbound

This paper cites Spielman, and Nikhil Srivastava.

Sketching Intersection Profiles: A Simple Proof and Three Applications Spielman, and Nikhil Srivastava

Reference 7

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:28068f118694a8c17102b474e752935e7cadb59c597f1d6228644748b474e32c

Observation b3cb5a24-692c-4581-a690-34fb15437781 · outbound

This paper cites Approximating st minimum cuts in O (n^2) time.

Sketching Intersection Profiles: A Simple Proof and Three Applications Approximating st minimum cuts in O (n^2) time

Reference 8

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:44cd289b807eb93fb4ea40411179ae645733daccf901627958709a5ee1178296

Observation 36b0be2a-4570-460f-b8e7-7e149c6758d1 · outbound

This paper cites Optimal lower bounds for sketching graph cuts.

Sketching Intersection Profiles: A Simple Proof and Three Applications Optimal lower bounds for sketching graph cuts

Reference 9

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:59af7b126f2fecba364311ca3b51b7124518b9d06161dd69fb8a4968c79b80cd

Observation 3d160678-3334-4ee2-8e11-ba7e9ab9a7d9 · outbound

This paper cites Recognizing coverage functions.

Sketching Intersection Profiles: A Simple Proof and Three Applications Recognizing coverage functions

Reference 10

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:86eb08baebec9be642f22a52cc59359ba820edde0c6cc9b39ba2b731be5de472

Observation 1c8ad318-49a0-43b4-82e6-87b3ff009e63 · outbound

This paper cites Light RUM s.

Sketching Intersection Profiles: A Simple Proof and Three Applications Light RUM s

Reference 11

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:e3a52bd9a769c3a060ba209a42f6f605212c2d1810a9d4868804f73802a8d7c5

Observation 79323961-4cf2-42bc-818e-b6982ed46f9a · outbound

This paper cites Muthukrishnan.

Sketching Intersection Profiles: A Simple Proof and Three Applications Muthukrishnan

Reference 12

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:369cdedaac6425614eb7738b799a27ca24f7579ded08a88947127f8e7a883437

Observation ade2ac65-19b4-4bff-a90d-fff2d6e7f12e · outbound

This paper cites Concentration of Measure for the Analysis of Randomized Algorithms.

Sketching Intersection Profiles: A Simple Proof and Three Applications Concentration of Measure for the Analysis of Randomized Algorithms

Reference 13

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:f92212da922aa8c320a1750d9db3e8ab7d02eddf89b11ffab45480fa22cace4c

Observation 725d84f5-0c47-4600-86f3-839856679ce7 · outbound

This paper cites Learning coverage functions and private release of marginals.

Sketching Intersection Profiles: A Simple Proof and Three Applications Learning coverage functions and private release of marginals

Reference 14

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:14a2d6d787fd7ec504f852bfc7636c19f10e5d932f364e6d755e03221d65623a

Observation c6ea9c87-b90e-4416-bc05-d60de6c6cdb7 · outbound

This paper cites A B ayesian analysis of some nonparametric problems.

Sketching Intersection Profiles: A Simple Proof and Three Applications A B ayesian analysis of some nonparametric problems

Reference 15

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:ca53c30bdc16df82327d997292c53c2e1ac8909a243e50fc1c8489ed203524b2

Observation aa0d92d1-9d7a-41b8-a035-f8f4f17f331b · outbound

This paper cites Global min-cuts in RNC , and other ramifications of a simple min-cut algorithm.

Sketching Intersection Profiles: A Simple Proof and Three Applications Global min-cuts in RNC , and other ramifications of a simple min-cut algorithm

Reference 16

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:00feb7fccf16b129efd5de6013d2ee2231234695d62e5dda589087c8cb09a80f

Observation f2e3a1e4-e72a-4712-9c7f-da962c4ced6b · outbound

This paper cites Constructing linear-sized spectral sparsification in almost-linear time.

Sketching Intersection Profiles: A Simple Proof and Three Applications Constructing linear-sized spectral sparsification in almost-linear time

Reference 17

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:b57f6965b130972766709d05185a8cdab17f56cdead01c3386023fb8fd4d1df8

Observation 8200d950-307e-40b1-9ccd-16f70b657b19 · outbound

This paper cites Space lower bounds for itemset frequency sketches.

Sketching Intersection Profiles: A Simple Proof and Three Applications Space lower bounds for itemset frequency sketches

Reference 18

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:bc73d7ed66a2bb97f3be53e40e3943774e913cea5d9db66e6ddae4cdb74752d7

Observation d2f15615-0730-48c5-b16c-352bd434ca31 · outbound

This paper cites On the sub- G aussianity of the beta and D irichlet distributions.

Sketching Intersection Profiles: A Simple Proof and Three Applications On the sub- G aussianity of the beta and D irichlet distributions

Reference 19

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:49ea87e942170af38107554abe431b40cdb077f01bdc6d9935acf5a609957f60

Observation 52d30124-3bcb-4d43-b812-02878ebe18de · outbound

This paper cites Serfling.

Sketching Intersection Profiles: A Simple Proof and Three Applications Serfling

Reference 20

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:354e20dc2c9460ccf8481c7e9578a480338571bc93018d01edc60a20308de7d2

Observation bf6f75bc-65a6-422f-b7be-88156c17c640 · outbound

This paper cites Graph sparsification by effective resistances.

Sketching Intersection Profiles: A Simple Proof and Three Applications Graph sparsification by effective resistances

Reference 21

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:91350eb4f7113aafb13366762291b1e8442d18c73e98b15bd37ab6b42d7b1d93

Observation 055d5d70-384a-4713-b9c6-1920f3fcdc5e · outbound

This paper cites Spectral sparsification of graphs.

Sketching Intersection Profiles: A Simple Proof and Three Applications Spectral sparsification of graphs

Reference 22

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:1206a2cfe14f01e78ad155483313a8e7177efc6fe106ba947217bdf5b9de16c7

Observation 226fcdd9-034c-48cc-905f-e088ede3cf3a · outbound

This paper cites Discrete Choice Methods with Simulation.

Sketching Intersection Profiles: A Simple Proof and Three Applications Discrete Choice Methods with Simulation

Reference 23

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:6217f1f5f9ba53133abf96236287df7cb9f622fafff4044eeb806052f5678a69

Observation f906f7d0-a315-4301-bc15-7318b00b159a · outbound

This paper cites Learning interpretable decision rule sets: A submodular optimization approach.

Sketching Intersection Profiles: A Simple Proof and Three Applications Learning interpretable decision rule sets: A submodular optimization approach

Reference 24

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:be0b08d00daee76cb3fbbcbf17f7a479b1b43f1866f5b05575563c3de97aa64c

Observation bc8482ad-fa78-4ba4-8c5b-933a4926924f · outbound

This paper cites Approximate F_2 -Sketching of Valuation Functions.

Sketching Intersection Profiles: A Simple Proof and Three Applications Approximate F_2 -Sketching of Valuation Functions

Reference 25

Resolution
unresolved
no resolver link, observed 2026-06-27T05:14:56.480794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-06-27T05:14:56.480794Z digest=sha256:4a4332bb4af64136e6bf4d7f9fc56c48d9fc6899834f79b3be1a1d68bf1e68fd

Pith citing papers

No inbound Pith citation observations are available.