Paper Citation Record · LEDGER

Near-Optimal Minimum Cuts in Hypergraphs at Scale

As of 21 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2504.19842.

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

pith.paper-citation-record.v1
2504.19842 v2

Coverage vector

measured 34 of 34 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:52:02.359103Z

measured 34 of 34 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+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

34 of 34 outbound references displayed

verified exact11
verified fuzzy3
unresolved17
parse uncertain0
malformed identifier0
metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 33abe141-88da-4653-b993-3bac24409a1e · outbound

This paper cites an unresolved cited work.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Unresolved cited work

Reference 1

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T05:52:03.470715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6ecc9816-8530-4ca6-a5a0-28582e8352bf · outbound

This paper cites T he SAT C ompetition 2014.

Near-Optimal Minimum Cuts in Hypergraphs at Scale T he SAT C ompetition 2014

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:52:03.526497Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 47870871-ad2f-4ca8-86dd-69decd28f3bd · outbound

This paper cites Higher-order organization of complex networks.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Higher-order organization of complex networks

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.178572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation baa1a618-015c-44e0-b7f2-5005c53f44ca · outbound

This paper cites M ining H idden C ommunity in H eterogeneous S ocial N etworks.

Near-Optimal Minimum Cuts in Hypergraphs at Scale M ining H idden C ommunity in H eterogeneous S ocial N etworks

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.185717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b9ecad0-e3aa-48b0-8594-2c39b92b0745 · outbound

This paper cites U mit V. C ataly \.

Near-Optimal Minimum Cuts in Hypergraphs at Scale U mit V. C ataly \

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.190882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 721e9df9-cc6a-4229-b5ee-edc3b9188f34 · outbound

This paper cites C omputing M inimum C uts in H ypergraphs.

Near-Optimal Minimum Cuts in Hypergraphs at Scale C omputing M inimum C uts in H ypergraphs

Reference 6

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.663937Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e33f793a-4a5d-470a-8a2e-367173900dc6 · outbound

This paper cites Davis and Yifan Hu.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Davis and Yifan Hu

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.202857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68c52535-4647-4511-bb9e-3479c47d40a0 · outbound

This paper cites Dolan and Jorge J.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Dolan and Jorge J

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.208513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a415397-7f1d-4773-9fd1-d30f8cd278e6 · outbound

This paper cites S calable H igh-quality H ypergraph P artitioning.

Near-Optimal Minimum Cuts in Hypergraphs at Scale S calable H igh-quality H ypergraph P artitioning

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.213428Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae62f6f0-3a73-4da3-9167-61033b2a0ce9 · outbound

This paper cites S calable S hared-memory H ypergraph P artitioning.

Near-Optimal Minimum Cuts in Hypergraphs at Scale S calable S hared-memory H ypergraph P artitioning

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.219113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95e61dd5-2417-4685-b759-02665a7a4d27 · outbound

This paper cites an unresolved cited work.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Unresolved cited work

Reference 11

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T05:52:03.240459Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5a96a100-f9f7-4c94-a723-21c71d822a11 · outbound

This paper cites A C lustering A lgorithm B ased on G raph C onnectivity.

Near-Optimal Minimum Cuts in Hypergraphs at Scale A C lustering A lgorithm B ased on G raph C onnectivity

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.230719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4fb434a-d0be-4119-9e0e-f38d28505c43 · outbound

This paper cites L abel P ropagation for H ypergraph P artitioning.

Near-Optimal Minimum Cuts in Hypergraphs at Scale L abel P ropagation for H ypergraph P artitioning

Reference 13

Resolution: verified exact; raw_fallback, observed 2026-08-16T05:52:03.172735Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ae4e23cf-c8f9-4bef-bad6-1102962067d7 · outbound

This paper cites S hared-memory E xact M inimum C uts.

Near-Optimal Minimum Cuts in Hypergraphs at Scale S hared-memory E xact M inimum C uts

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.243221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff51bfbd-5c76-499f-9d35-52e5b90792cd · outbound

This paper cites L ocal F low P artitioning for F aster E dge C onnectivity.

Near-Optimal Minimum Cuts in Hypergraphs at Scale L ocal F low P artitioning for F aster E dge C onnectivity

Reference 15

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.600564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 25d5f0fa-776d-453e-a91f-f3a7a3a195c2 · outbound

This paper cites an unresolved cited work.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Unresolved cited work

Reference 16

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T05:52:03.028576Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 80c99c4f-9cf6-495a-a677-dab17660085e · outbound

This paper cites an unresolved cited work.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Unresolved cited work

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.259748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc8bf595-5148-49a5-86ed-233ff4a943e6 · outbound

This paper cites Karger and Clifford Stein.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Karger and Clifford Stein

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.265108Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9c543ca-ce07-4e4e-834d-261b9cc16d97 · outbound

This paper cites M ultilevel H ypergraph P artitioning: A pplications in VLSI D omain.

Near-Optimal Minimum Cuts in Hypergraphs at Scale M ultilevel H ypergraph P artitioning: A pplications in VLSI D omain

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.269942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c2988ca-df75-4912-8192-90df6a2b0558 · outbound

This paper cites A S imple H ypergraph M in C ut A lgorithm.

Near-Optimal Minimum Cuts in Hypergraphs at Scale A S imple H ypergraph M in C ut A lgorithm

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:52:03.509023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8c8be42c-c3f7-40b8-a51b-3226c977c8cb · outbound

This paper cites Pemmaraju, and Vivek Sardeshmukh.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Pemmaraju, and Vivek Sardeshmukh

Reference 21

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.569605Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4ec67a26-9067-4c90-b045-d6114bb45942 · outbound

This paper cites A n I mproved M in-cut A lgonthm for P artitioning V L S I N etworks.

Near-Optimal Minimum Cuts in Hypergraphs at Scale A n I mproved M in-cut A lgonthm for P artitioning V L S I N etworks

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.289312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 345b8c8e-7137-4032-8764-7122b2c40b91 · outbound

This paper cites G raph A lgorithms , pages 47--135.

Near-Optimal Minimum Cuts in Hypergraphs at Scale G raph A lgorithms , pages 47--135

Reference 23

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.552587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7a028064-8999-4fcc-a583-bafc5bc4bc5f · outbound

This paper cites an unresolved cited work.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.301773Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7429bd8-b277-4d03-a4ed-1a73842e41bb · outbound

This paper cites C omputing E dge-connectivity in M ultigraphs and C apacitated G raphs.

Near-Optimal Minimum Cuts in Hypergraphs at Scale C omputing E dge-connectivity in M ultigraphs and C apacitated G raphs

Reference 25

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.524160Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ad18db38-aad4-4dff-a193-c0fa8a406199 · outbound

This paper cites I mplementing an E fficient M inimum C apacity C ut A lgorithm.

Near-Optimal Minimum Cuts in Hypergraphs at Scale I mplementing an E fficient M inimum C apacity C ut A lgorithm

Reference 26

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.506514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation cc1cb1f1-2dd1-403d-9afe-c2b43b8a8cd8 · outbound

This paper cites Padberg and G.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Padberg and G

Reference 27

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.489896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 73565d38-4f3c-4f08-ab99-894a325f2e58 · outbound

This paper cites A B ranch-and-cut A lgorithm for the R esolution of L arge-scale S ymmetric T raveling S alesman P roblems.

Near-Optimal Minimum Cuts in Hypergraphs at Scale A B ranch-and-cut A lgorithm for the R esolution of L arge-scale S ymmetric T raveling S alesman P roblems

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.327226Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0d45d69-c0d6-4b7c-927c-8d65254cdf1a · outbound

This paper cites M inimizing S ymmetric S ubmodular F unctions.

Near-Optimal Minimum Cuts in Hypergraphs at Scale M inimizing S ymmetric S ubmodular F unctions

Reference 29

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.461284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 67fe7fcd-b52d-4790-85ef-b420902fa16d · outbound

This paper cites N ear L inear T ime A lgorithm to D etect C ommunity S tructures in L arge-scale N etworks.

Near-Optimal Minimum Cuts in Hypergraphs at Scale N ear L inear T ime A lgorithm to D etect C ommunity S tructures in L arge-scale N etworks

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.338069Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01d50ff7-444d-43a2-808d-8f0cbe2037bb · outbound

This paper cites Colbourn.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Colbourn

Reference 31

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.424300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0a322420-c7ca-4283-b07d-3c48d09bf1c8 · outbound

This paper cites GNU P arallel: T he C ommand-line P ower T ool.

Near-Optimal Minimum Cuts in Hypergraphs at Scale GNU P arallel: T he C ommand-line P ower T ool

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:52:03.492068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4ab5af62-44cd-4ee6-be12-fa8990c68d8e · outbound

This paper cites Alpert, Cliff C.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Alpert, Cliff C

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-16T05:52:02.353405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2f5be77-ddc5-40d1-b92c-705980e09176 · outbound

This paper cites Wu and R.

Near-Optimal Minimum Cuts in Hypergraphs at Scale Wu and R

Reference 34

Resolution: verified exact; doi, observed 2026-08-16T05:52:02.404412Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.