Pith. sign in

Paper Citation Record · LEDGER

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling

As of 20 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2606.13491.

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

pith.paper-citation-record.v1
2606.13491 v1

Coverage vector

measured 60 of 60 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-27T05:29:18.121439Z

measured 60 of 60 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+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

60 of 60 outbound references displayed

  • verified exact6
  • verified fuzzy0
  • unresolved54
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 919449ec-66a3-4ddd-9fa8-debd378162f1 · outbound

This paper cites A fast and high quality multilevel scheme for partitioning irregular graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling A fast and high quality multilevel scheme for partitioning irregular graphs,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:9e3326958d7cd6102eee776517d303b1d4e89c74ebfac7854de22235bcea398a

Observation 97bbef8e-0971-4eb7-8bfd-548a48632984 · outbound

This paper cites Multi-level direct k-way hypergraph par- titioning with multiple constraints and fixed vertices,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Multi-level direct k-way hypergraph par- titioning with multiple constraints and fixed vertices,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:98dac2caf1073275167dd9eedc5544b975ddd0802d65d6fd244b6bd76e22eab9

Observation 0537acf5-63d3-4872-876a-a6c46751869d · outbound

This paper cites Finding good approximate vertex and edge partitions is NP-hard,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Finding good approximate vertex and edge partitions is NP-hard,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:5c9964b15495355a990d8f4ef99aad1974558d2fae12b8b06b2cdc6064dad63e

Observation e9c265a5-c1ec-4c44-8ffd-f18575d4c1b4 · outbound

This paper cites An efficient heuristic procedure for partitioning graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling An efficient heuristic procedure for partitioning graphs,

Reference 4

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:293de2a0efc5ffe948943f68f265d0e8bb3941d109b6647996515ef6709104e4

Observation 0713dffa-2dac-48f6-8421-4d2f931905e5 · outbound

This paper cites Approximate hypergraph partitioning and appli- cations,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Approximate hypergraph partitioning and appli- cations,

Reference 5

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:cd4c1d4b04e7e88c03426afea3619d70277f9fa53aedf44dfe87a55573d3cfdf

Observation 00ddcc6c-7afd-465a-b8f4-745ab963ba29 · outbound

This paper cites Minimum cuts and sparsification in hypergraphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Minimum cuts and sparsification in hypergraphs,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:77d2839c5219f22b33b77f44a2dfb4cab4a4aab3318bdbd5cd62b80cc7e98850

Observation 56015bd0-b9a8-47e6-b4c4-90efa789a802 · outbound

This paper cites A hypergraph partitioning model for profile minimization,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling A hypergraph partitioning model for profile minimization,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:2e958f36f5071e8c0e0bc7e582faa12279c1f15e159a84321c1228c4493273c8

Observation 824456b5-2c46-4cb2-8034-3a8966afd9a4 · outbound

This paper cites The Fiedler vector of a Laplacian tensor for hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling The Fiedler vector of a Laplacian tensor for hypergraph partitioning,

Reference 8

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:312c547b64a6072b1f7bf542760fc42f4b6d0ad24c71088214305370f6b8a07c

Observation 3451ae63-52e0-481e-949f-9a15c83637d6 · outbound

This paper cites High- quality hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling High- quality hypergraph partitioning,

Reference 9

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:e3b22f05b54d5908b8cae688ffe27ae938027b1388c1593acec725f1513478e9

Observation 542c3fd2-ac36-4328-9057-44519b72849b · outbound

This paper cites Multilevel hypergraph partitioning: Applications in VLSI domain,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Multilevel hypergraph partitioning: Applications in VLSI domain,

Reference 10

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:300b120ef31f870d1cff90b6dfdf78e737c4f81eb89e0e7483fb80f57d47d861

Observation c92672a4-8914-4c5f-ad17-0b2190f54ebe · outbound

This paper cites An improved min-cut algorithm for partitioning VLSI networks,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling An improved min-cut algorithm for partitioning VLSI networks,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:0783fe93b68665aa43b935e92ae4d176db8f02fff28b0998785f836c513c20a2

Observation 91099ac3-f23c-40d7-bbfa-2359f8bfbdb5 · outbound

This paper cites Parallel hypergraph partitioning for scientific computing,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Parallel hypergraph partitioning for scientific computing,

Reference 12

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:872ffee5e0986364ddf3a6832a6258654bb03cd6eb81b2dea26a12dc72bd0a78

Observation 850da97e-baaf-4b19-b5a6-42a8db3872e7 · outbound

This paper cites Multilevel k-way hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Multilevel k-way hypergraph partitioning,

Reference 13

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:903ec3cce5cc264f05d1ac08a1aedc725a6afdd4449b42a5c8e3bfc9b9242044

Observation a27ceeeb-366d-41df-a264-be0d21f30e9b · outbound

This paper cites Multilevel Hypergraph Partitioning with Vertex Weights Revisited.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Multilevel Hypergraph Partitioning with Vertex Weights Revisited

Reference 14

Resolution
verified exact
arxiv_id, observed 2026-06-27T05:30:35.657511Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:6bc3dc1ec32277edd438dc6f467574b56c8019623ae1905822e455704c1d5ca6

Observation 6c5dde92-8ae6-4bae-aed6-1c66a4d27164 · outbound

This paper cites More recent advances in (hyper)graph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling More recent advances in (hyper)graph partitioning,

Reference 15

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:a3c12138a5ce841ddac575940c8d633559a06be63b412a9313521b74c10a082d

Observation a39922ac-da3b-4435-a827-f34b6129862c · outbound

This paper cites Hypergraph-partitioning-based decomposition for par- allel sparse-matrix vector multiplication,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hypergraph-partitioning-based decomposition for par- allel sparse-matrix vector multiplication,

Reference 16

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:6d2024eea39c37882890b5234060ee3f2659abbc2fbaab8267c6f740a8d3bb54

Observation 4ba4af6b-0efe-44dd-ad08-fbf5af40e778 · outbound

This paper cites Recent advances in graph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Recent advances in graph partitioning,

Reference 17

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:e59c5c8edf8ede5dca41625b364b1fa0d152ecdee21314b7cdf8ab309320d305

Observation 248b2681-ca3d-45a9-a20d-e04b299c1a8e · outbound

This paper cites Hypergraph partitioning for sparse matrix-matrix multiplication,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hypergraph partitioning for sparse matrix-matrix multiplication,

Reference 18

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:1934b32e8e146a121ca1209e33aec1993f9d2640f7a47076a7ce82460740ad4c

Observation ca68947a-d52c-49dc-9573-c246c1d3a71e · outbound

This paper cites Hypergraph partitioning for multiple communication cost metrics: Model and methods,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hypergraph partitioning for multiple communication cost metrics: Model and methods,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:c56f0b3c232327825fe0a84d28445da29e8067773817d367cc7c4ae1fb026718

Observation 09365cd6-6e1a-456f-bda5-69e0109a744f · outbound

This paper cites UMPa: A Multi-objective, multi-level partitioner for communication minimization,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling UMPa: A Multi-objective, multi-level partitioner for communication minimization,

Reference 20

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:42b292524b3a0a4ecf630dd3babf26830b21c265ff2cae130c842de5256f2003

Observation ab520dd6-bcaa-43e9-8c10-4146167839d2 · outbound

This paper cites Blaspart: A deterministic parallel partitioner for balanced large-scale hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Blaspart: A deterministic parallel partitioner for balanced large-scale hypergraph partitioning,

Reference 21

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:15ce18c77a82aa34c9e23a56c5ad9aed57b84acabf0dd3b929a9e14f072b5534

Observation 7f2b4f9f-787a-4138-8ca7-b90503690046 · outbound

This paper cites Deterministic parallel hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Deterministic parallel hypergraph partitioning,

Reference 22

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:381a727a51ac26ba918814fae25389a90c3fd4548f4312e6d7654d5e18a150cf

Observation 32c22e40-2fc5-4e84-9c3f-546619252a60 · outbound

This paper cites A linear-time heuristic for improving network partitions,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling A linear-time heuristic for improving network partitions,

Reference 23

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:825040795715529297a63f8ba5ff73e6b61cb656175a590593b8593d4ccd20e0

Observation 2273eec0-fbda-4ccd-9e5b-519082dc361e · outbound

This paper cites Hypergraph-partitioning-based online joint scheduling of tasks and data,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hypergraph-partitioning-based online joint scheduling of tasks and data,

Reference 24

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:4d83d0dd3de9f507f42de0266009be3f7596606627bbeeafdf114469da77be55

Observation a9cbacda-6986-4b83-9073-286361d2dc01 · outbound

This paper cites Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-06-27T05:30:35.659827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:9ae11d258dab475694d640dd611ab4fdf943a5082b042d69eee200122e6e5c00

Observation e28c7ada-d727-42b4-999b-2ee2d5100ffc · outbound

This paper cites A parallel algorithm for multilevel k-way hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling A parallel algorithm for multilevel k-way hypergraph partitioning,

Reference 26

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:3292608afc80d032608e6c040e243187dcf16237a52a6a5105ac5b43eeef68dc

Observation f8f2b17c-c040-47a0-a747-1759fc1d1ec1 · outbound

This paper cites Scalable shared-memory hypergraph partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Scalable shared-memory hypergraph partitioning,

Reference 27

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:6fe7057c3890cdf1e3113d3dcb4a682eaa874390f5d3f332909a83b25896db73

Observation 99696fe1-dc2e-443e-8aa0-66f47340cd95 · outbound

This paper cites Social hash partitioner: A scalable distributed hypergraph partitioner,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Social hash partitioner: A scalable distributed hypergraph partitioner,

Reference 28

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:62a389a94d94552ba131b090f61e07cb5f67d2065452c3c263064ff0ecaedf48

Observation fa49760d-b7e3-4d08-9098-e54bf1a86984 · outbound

This paper cites Bipart: A parallel and deterministic hypergraph partitioner,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Bipart: A parallel and deterministic hypergraph partitioner,

Reference 29

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:2957852195b58deeaef72e184aceab36ba1b7e7ee9c40c086288035d1230f015

Observation e1274387-0852-4afd-a834-97e1669f9f6e · outbound

This paper cites PowerGraph: Distributed graph-parallel computation on natural graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling PowerGraph: Distributed graph-parallel computation on natural graphs,

Reference 30

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:8731c8e830db86dc6acd721399751bd6aea9580dadc7fb476ccb2f282b704bfe

Observation 76ddc697-c962-4a42-9231-76563b6258d4 · outbound

This paper cites Graph edge partitioning via neighborhood heuristic,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Graph edge partitioning via neighborhood heuristic,

Reference 31

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:10e1ecd460a70101abce435b6bbd11d8b957241422660f2f6b3860b0779a6681

Observation 2f237157-4e87-4a1b-bedd-bffb16ea3033 · outbound

This paper cites 2PS: High-Quality Edge Partitioning with Two-Phase Streaming.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling 2PS: High-Quality Edge Partitioning with Two-Phase Streaming

Reference 32

Resolution
verified exact
arxiv_id, observed 2026-06-27T05:30:35.656737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:c30022b7b16a2257d0b02e9c1a2c5048339f39a851d6a3e542448dd912660865

Observation 5627d76a-c717-41dc-9e45-6035239bb29d · outbound

This paper cites Balanced graph edge partition,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Balanced graph edge partition,

Reference 33

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:c8079fd3a9daf4c8c10871fe6366626fb1361d63ba937e995430978c792c02f6

Observation 873bcd54-0e9f-4aea-aad4-b80422c0db0b · outbound

This paper cites Distributed edge partitioning for trillion-edge graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Distributed edge partitioning for trillion-edge graphs,

Reference 34

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:76a48c3d1017550a36005cfd6f1540b2eb2eddfcc772d5a0aff501146b2e5ecf

Observation 72b8d276-d86d-4025-8b55-0113851ef848 · outbound

This paper cites Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling

Reference 35

Resolution
verified exact
arxiv_id, observed 2026-06-27T05:30:35.662769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:77ead0ce9529b8d490f3012e5d33acfb4fa36279231a09e953a458fa8b06d057

Observation 51d38498-1886-4041-951e-b040825919f2 · outbound

This paper cites SAT-based optimal hypergraph partitioning with replication,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling SAT-based optimal hypergraph partitioning with replication,

Reference 36

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:849f4a1adc5b24951cdc196acb27cc14afe5a1eb25ffff0d10309220816107b9

Observation 3677c0b1-ebf1-49fe-9c26-f93bf472b5cc · outbound

This paper cites Simulated annealing for edge partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Simulated annealing for edge partitioning,

Reference 37

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:c1ac7e0ab813c6f849f7614c0f6db6f44c639d315ffb887723a8a76297475383

Observation 879a58e7-51ca-4c99-98f1-315fd822a548 · outbound

This paper cites Hybrid edge partitioner: Partitioning large power-law graphs under memory constraints,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hybrid edge partitioner: Partitioning large power-law graphs under memory constraints,

Reference 38

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:961b54d21d28bedae26bef462a2b2d512fd8a48c8882ead9b896913539ff79ae

Observation abfbd522-8c53-4a8e-8b62-fd7b32736424 · outbound

This paper cites Hepart: A balanced hypergraph par- titioning algorithm for big data applications,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hepart: A balanced hypergraph par- titioning algorithm for big data applications,

Reference 39

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:7d31e475e313ac2267d1af1ef10e3dfdaf42a15ac62ad3349671a8ab42ae20c4

Observation e9664d71-de9a-40ad-9f0a-e2f8bcee4406 · outbound

This paper cites Scalable edge partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Scalable edge partitioning,

Reference 40

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:9b62029da1eedb78978be69123ac3114de445cb992e0681f7cb5e157c6488d21

Observation 631235fc-0264-4984-8f1c-3492349b466d · outbound

This paper cites Graph partition method based on finite projective planes.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Graph partition method based on finite projective planes

Reference 41

Resolution
verified exact
arxiv_id, observed 2026-06-27T05:30:35.653661Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:061692432a9d3e8e8f513e639e3327ba270c262d31c61849ff5855cd250a4130

Observation 37a7f647-259d-45bb-9626-3878508898ec · outbound

This paper cites Hdrf: Stream-based par- titioning for power-law graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Hdrf: Stream-based par- titioning for power-law graphs,

Reference 42

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:33a3eff4f1e7dd6638414050390e80c8698ba1ac4a5e5b17bd1893ad3806ebf9

Observation 9298b8c4-a67a-4102-8060-c5e79b95aaba · outbound

This paper cites Adwise: Adaptive window-based streaming edge partitioning for high- speed graph processing,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Adwise: Adaptive window-based streaming edge partitioning for high- speed graph processing,

Reference 43

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:b7e9842075b9f275501d6394740d2614c2591962bd790d6cccf99d8ebfe6f525

Observation 459d3387-ee05-4208-9c2c-24f91ab96b42 · outbound

This paper cites Cusp: A customizable streaming edge partitioner for distributed graph analytics,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Cusp: A customizable streaming edge partitioner for distributed graph analytics,

Reference 44

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:917b36ddd55ab8e511b1a00b82f6d71a20992a6c4ebfe5ed512a0fcb6823c41d

Observation 593fc4fb-95b9-4d99-9b32-cebcbbf81eec · outbound

This paper cites Boosting vertex- cut partitioning for streaming graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Boosting vertex- cut partitioning for streaming graphs,

Reference 45

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:d32f841d00475bc2dc937d0748a89caa1cc3d88067989a357321cc6e8139dc3c

Observation fe4b4dce-a963-4e2b-b9ab-1b73d1b162b4 · outbound

This paper cites Partitioning trillion edge graphs on edge devices,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Partitioning trillion edge graphs on edge devices,

Reference 46

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:0f8426fb87701365e0a334898353e682270941b09b0c56cb7dba30ebd23e12cb

Observation 00f6087e-2b10-4dad-aca0-56bd64d55584 · outbound

This paper cites Buffered Streaming Edge Partitioning,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Buffered Streaming Edge Partitioning,

Reference 47

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:cc1f39bffa26b4ebf985ec4b00a57fbcb70634b8abbe8dd99e36ba8862e7377e

Observation 3d15a7b0-141f-4034-b8c9-08f1f0e289a3 · outbound

This paper cites Streaming balanced graph partitioning algorithms for random graphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Streaming balanced graph partitioning algorithms for random graphs,

Reference 48

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:1c5cf1654552ccd701f23203d40ef4bb83bda2d3d22c230acfc9948e60f800a2

Observation 50105c66-b2d8-4251-afd8-f2516481e682 · outbound

This paper cites Open problems in (hyper)graph decomposition,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Open problems in (hyper)graph decomposition,

Reference 49

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:b1b3d74acb9b7d2a34b197d1c9aaae9c56d49e11083950f33d1ee74b3fbebe2e

Observation c1a7dcee-524f-44c3-9dc6-c8bc7f7fe8e4 · outbound

This paper cites Universal and asymptot- ically optimal data and task allocation in distributed computing.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Universal and asymptot- ically optimal data and task allocation in distributed computing

Reference 50

Resolution
verified exact
arxiv_id, observed 2026-06-27T05:30:35.663162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:94af366d86f8c42eb8da5bee51144d56e59a5e92f6c9eb5141da255e2ab832c8

Observation 88af432e-fb97-4aa9-9487-b859f0dd9593 · outbound

This paper cites Order optimal task allocation in distributed computing via interweaved cliques,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Order optimal task allocation in distributed computing via interweaved cliques,

Reference 51

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:a6a0b1b19549d82c5688739114324b5efe377ec027aeb105a55c532b79cb5dd5

Observation 3b1bebc9-448c-45f6-9c36-12a96c9dfb03 · outbound

This paper cites Fundamental limits of caching,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Fundamental limits of caching,

Reference 52

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:d9d221e9127726e1242120697d98c211fde1d2208aa5639e05ecf146efcfe38b

Observation 44f54990-cc81-488a-b01c-4a4787d62801 · outbound

This paper cites Maddah-Ali-Niesen scheme for multi- access coded caching,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Maddah-Ali-Niesen scheme for multi- access coded caching,

Reference 53

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:d6f32ceda8088bd1828e2f797a7c808353c16f45461181a065ba0307a9fc2545

Observation 5834ec33-34e0-44fe-9f60-7e75fa8ea42f · outbound

This paper cites Coded caching with shared caches and private caches,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Coded caching with shared caches and private caches,

Reference 54

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:992bb261b67e290789db5ffc31e0a74c53c0ad5fd15ddb36a660e27cb328bcc2

Observation 060c65a4-4b4b-4ef1-9f8e-815c5b9837e3 · outbound

This paper cites A fundamental tradeoff between com- putation and communication in distributed computing,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling A fundamental tradeoff between com- putation and communication in distributed computing,

Reference 55

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:6991da1545606705ed022196e11d611de2e2663939471639acd9a6e49d0aba02

Observation 8ac3eec6-4c70-4047-adb7-a950c6adbe89 · outbound

This paper cites Fundamental limits of combinatorial multi-access caching,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Fundamental limits of combinatorial multi-access caching,

Reference 56

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:5936af17234f0fa9b2f8b9aacc9973d34d3d00ffb308c73d027b9f4793c047da

Observation 4f7fa45f-37a4-49f7-9295-5d006d48f87f · outbound

This paper cites Multi-access distributed computing,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Multi-access distributed computing,

Reference 57

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:1d5c2454f76326541a90527743058b501f9b5f8b9e241d5362ec57a021a3b16c

Observation 51824d3d-6340-475d-9978-8002bdb84790 · outbound

This paper cites Constructing hamiltonian decompositions of complete k-uniform hypergraphs,.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Constructing hamiltonian decompositions of complete k-uniform hypergraphs,

Reference 58

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:f9f0f0cae39248e1293b6fbb65e290972399d92965d7a1eda2d30c545cd4ed88

Observation f9ccf923-4f40-4a9c-85b6-f8874ecb42a5 · outbound

This paper cites Mitzenmacher and E.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Mitzenmacher and E

Reference 59

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:2874b3397943df3a9285fb0d77fa684e5f029584deab779230ec942c7b07816f

Observation 74d6ab8f-305d-46ed-87c9-93eee995d99f · outbound

This paper cites Alon and J.

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling Alon and J

Reference 60

Resolution
unresolved
no resolver link, observed 2026-06-27T05:29:18.121439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-06-27T05:29:18.121439Z digest=sha256:5b5e29e0bff485c54de42aba48a8b40feaaf15c09e507fc412b8218b2bfa094c

Pith citing papers

No inbound Pith citation observations are available.