Pith. sign in

Paper Citation Record · LEDGER

Sketching Intersection Profiles: A Simple Proof and Three Applications

As of 16 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-16T06:30:59.297886+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:0541c6a0688867a62579eb66ad5cded4d5f7aef324c678f00cc1705e511e4ffe

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:b4370d5d8c9f129710299580f923f3c46aa585def559fa85d959dfbfdaaf808e

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:e9ba99a1993396472d0385f78ca268b357ec7a78e58259870049ae3ee6506fa8

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:73e7e264d075b336ae09669921bf8bb29b9d0f263e8afc7fa4ee77837d70b9d8

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:c1aeee50b65e8b2b810d097eadc0251f0702549e80c1aba74c106184491502ce

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:7c299984e3249f12793d91a2cdf12a890dca6ee87d63369328d37c848f84fb9a

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:78f7afddcbbc89368d7f343302ebe510cb46ac9d8424b240487782517bfe3e5b

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:d6665c54bb25030be49f58bfb4195d306485bdc6b10ee2e6b79995044ac2811b

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:52b92d9cec60016acf499428c7fe804994fd78635ba5b4c70e53ce90b032ec9f

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:7ec664704302e4653bad23959f19a8522ddb72579f2d834752c98e1a9e89254d

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:02bee68bbfb25fb707e27a82fea8379a467e57c6e9d42f70570296358b9d8c76

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:0df7927c6015c0d0a7fae7656df275b7b3cef0d644f7f72c34a6199d2986294e

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:7a094806733c641e7cdf7a8456773b1b4c420bb5024b8b7942d696b426ee3c16

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:ccb5f79656efe43041cf673f7b5b77fd925354c2052d4abd10bdf1fde38c90f0

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:eda0457c0e6ee4d4b25ce3a60a0dff2c6cbe8e787eec6b916fd992fb17211eff

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:c661d64661d155e4a9fb95885245edc3bcfb058b4c9fd77a0fe925b5b0bd1888

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:489a7cef69bb1766d5736453b30266c45b4ccad81c5a27358fa8d6bbb2f34526

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:5acc2ccd8ea0f1fced08170f5eca389dfadfbbbbfd8a545ee7784bb7b393e98b

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:65eae014c4829b454c4008d1d51b159a8a68f384429f11920200c86a8f1802dd

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:c96f5674d176b3b61e3aaaf0ce9d0eaab9560227091e8e254fbf082621c735a9

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:29311b4f43021cb78beae5a6ce15d08b5a935857f98d1f694d0a841a2c439165

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:b37b7a2f279d77679147d777b822e82bdad4ff6695232e823e9c87c4fe47d42d

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:b0a4260e1f80154c2e198111d50355772ce38fa416382bdfba7d5fbf31832964

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:b9255268c5c4a783354f0b7f84da4244836a77bed580858d18926a5f348e4eaa

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:276e3f0647e58135f5a5b74986e2ba320f93b743c6b4e8b8425c55ced2ed5f21

Pith citing papers

No inbound Pith citation observations are available.