{"as_of":"2026-08-20T16:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b498c75974d47f2aa1062beb8081f8c47e0284649bfedbe0092db23edf3a005c","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T05:29:18.121439Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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.13491/citation-record","integrity":"/paper/2606.13491/integrity","json":"/paper/2606.13491/citation-record.json","paper":"/paper/2606.13491"},"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:29:18.121439Z","title":"A fast and high quality multilevel scheme for partitioning irregular graphs,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:9e3326958d7cd6102eee776517d303b1d4e89c74ebfac7854de22235bcea398a","observation_id":"919449ec-66a3-4ddd-9fa8-debd378162f1","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Multi-level direct k-way hypergraph par- titioning with multiple constraints and fixed vertices,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:98dac2caf1073275167dd9eedc5544b975ddd0802d65d6fd244b6bd76e22eab9","observation_id":"97bbef8e-0971-4eb7-8bfd-548a48632984","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Finding good approximate vertex and edge partitions is NP-hard,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:5c9964b15495355a990d8f4ef99aad1974558d2fae12b8b06b2cdc6064dad63e","observation_id":"0537acf5-63d3-4872-876a-a6c46751869d","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"An efficient heuristic procedure for partitioning graphs,","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:293de2a0efc5ffe948943f68f265d0e8bb3941d109b6647996515ef6709104e4","observation_id":"e9c265a5-c1ec-4c44-8ffd-f18575d4c1b4","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Approximate hypergraph partitioning and appli- cations,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:cd4c1d4b04e7e88c03426afea3619d70277f9fa53aedf44dfe87a55573d3cfdf","observation_id":"0713dffa-2dac-48f6-8421-4d2f931905e5","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Minimum cuts and sparsification in hypergraphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:77d2839c5219f22b33b77f44a2dfb4cab4a4aab3318bdbd5cd62b80cc7e98850","observation_id":"00ddcc6c-7afd-465a-b8f4-745ab963ba29","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"A hypergraph partitioning model for profile minimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:2e958f36f5071e8c0e0bc7e582faa12279c1f15e159a84321c1228c4493273c8","observation_id":"56015bd0-b9a8-47e6-b4c4-90efa789a802","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"The Fiedler vector of a Laplacian tensor for hypergraph partitioning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:312c547b64a6072b1f7bf542760fc42f4b6d0ad24c71088214305370f6b8a07c","observation_id":"824456b5-2c46-4cb2-8034-3a8966afd9a4","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"High- quality hypergraph partitioning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:e3b22f05b54d5908b8cae688ffe27ae938027b1388c1593acec725f1513478e9","observation_id":"3451ae63-52e0-481e-949f-9a15c83637d6","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Multilevel hypergraph partitioning: Applications in VLSI domain,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:300b120ef31f870d1cff90b6dfdf78e737c4f81eb89e0e7483fb80f57d47d861","observation_id":"542c3fd2-ac36-4328-9057-44519b72849b","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"An improved min-cut algorithm for partitioning VLSI networks,","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:0783fe93b68665aa43b935e92ae4d176db8f02fff28b0998785f836c513c20a2","observation_id":"c92672a4-8914-4c5f-ad17-0b2190f54ebe","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Parallel hypergraph partitioning for scientific computing,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:872ffee5e0986364ddf3a6832a6258654bb03cd6eb81b2dea26a12dc72bd0a78","observation_id":"91099ac3-f23c-40d7-bbfa-2359f8bfbdb5","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Multilevel k-way hypergraph partitioning,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:903ec3cce5cc264f05d1ac08a1aedc725a6afdd4449b42a5c8e3bfc9b9242044","observation_id":"850da97e-baaf-4b19-b5a6-42a8db3872e7","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01378","last_updated":"2021-02-02T08:06:17Z","snapshot_observed_at":"2026-08-16T18:48:21.307215Z","submitted_at":"2021-02-02T08:06:17Z","title":"Multilevel Hypergraph Partitioning with Vertex Weights Revisited","version":1},"cited_work":{"arxiv_id":"2102.01378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.01378","snapshot_observed_at":"2026-06-27T05:30:35.655656Z","title":"Multilevel hypergraph partitioning with vertex weights revisited,","venue":null,"work_id":"49c0a990-2593-425d-be51-ca5bff869053","year":2021},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"cited_paper":"/paper/2102.01378","citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:6bc3dc1ec32277edd438dc6f467574b56c8019623ae1905822e455704c1d5ca6","observation_id":"a27ceeeb-366d-41df-a264-be0d21f30e9b","resolution":{"observed_at":"2026-06-27T05:30:35.657511Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:29:18.121439Z","title":"More recent advances in (hyper)graph partitioning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:a3c12138a5ce841ddac575940c8d633559a06be63b412a9313521b74c10a082d","observation_id":"6c5dde92-8ae6-4bae-aed6-1c66a4d27164","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Hypergraph-partitioning-based decomposition for par- allel sparse-matrix vector multiplication,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:6d2024eea39c37882890b5234060ee3f2659abbc2fbaab8267c6f740a8d3bb54","observation_id":"a39922ac-da3b-4435-a827-f34b6129862c","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Recent advances in graph partitioning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:e59c5c8edf8ede5dca41625b364b1fa0d152ecdee21314b7cdf8ab309320d305","observation_id":"4ba4af6b-0efe-44dd-ad08-fbf5af40e778","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Hypergraph partitioning for sparse matrix-matrix multiplication,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:1934b32e8e146a121ca1209e33aec1993f9d2640f7a47076a7ce82460740ad4c","observation_id":"248b2681-ca3d-45a9-a20d-e04b299c1a8e","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Hypergraph partitioning for multiple communication cost metrics: Model and methods,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:c56f0b3c232327825fe0a84d28445da29e8067773817d367cc7c4ae1fb026718","observation_id":"ca68947a-d52c-49dc-9573-c246c1d3a71e","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"UMPa: A Multi-objective, multi-level partitioner for communication minimization,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:42b292524b3a0a4ecf630dd3babf26830b21c265ff2cae130c842de5256f2003","observation_id":"09365cd6-6e1a-456f-bda5-69e0109a744f","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Blaspart: A deterministic parallel partitioner for balanced large-scale hypergraph partitioning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:15ce18c77a82aa34c9e23a56c5ad9aed57b84acabf0dd3b929a9e14f072b5534","observation_id":"ab520dd6-bcaa-43e9-8c10-4146167839d2","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Deterministic parallel hypergraph partitioning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:381a727a51ac26ba918814fae25389a90c3fd4548f4312e6d7654d5e18a150cf","observation_id":"7f2b4f9f-787a-4138-8ca7-b90503690046","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"A linear-time heuristic for improving network partitions,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:825040795715529297a63f8ba5ff73e6b61cb656175a590593b8593d4ccd20e0","observation_id":"32c22e40-2fc5-4e84-9c3f-546619252a60","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Hypergraph-partitioning-based online joint scheduling of tasks and data,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:4d83d0dd3de9f507f42de0266009be3f7596606627bbeeafdf114469da77be55","observation_id":"2273eec0-fbda-4ccd-9e5b-519082dc361e","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.20497","last_updated":"2026-05-19T21:04:20Z","snapshot_observed_at":"2026-08-16T12:39:18.754690Z","submitted_at":"2026-05-19T21:04:20Z","title":"Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints","version":1},"cited_work":{"arxiv_id":"2605.20497","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.20497","snapshot_observed_at":"2026-06-27T05:30:35.658057Z","title":"Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints","venue":"cs.DC","work_id":"5fbc8c63-5b86-4200-8863-ac4589745441","year":2026},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"cited_paper":"/paper/2605.20497","citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:9ae11d258dab475694d640dd611ab4fdf943a5082b042d69eee200122e6e5c00","observation_id":"a9cbacda-6986-4b83-9073-286361d2dc01","resolution":{"observed_at":"2026-06-27T05:30:35.659827Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:29:18.121439Z","title":"A parallel algorithm for multilevel k-way hypergraph partitioning,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:3292608afc80d032608e6c040e243187dcf16237a52a6a5105ac5b43eeef68dc","observation_id":"e28c7ada-d727-42b4-999b-2ee2d5100ffc","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Scalable shared-memory hypergraph partitioning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:6fe7057c3890cdf1e3113d3dcb4a682eaa874390f5d3f332909a83b25896db73","observation_id":"f8f2b17c-c040-47a0-a747-1759fc1d1ec1","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Social hash partitioner: A scalable distributed hypergraph partitioner,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:62a389a94d94552ba131b090f61e07cb5f67d2065452c3c263064ff0ecaedf48","observation_id":"99696fe1-dc2e-443e-8aa0-66f47340cd95","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Bipart: A parallel and deterministic hypergraph partitioner,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:2957852195b58deeaef72e184aceab36ba1b7e7ee9c40c086288035d1230f015","observation_id":"fa49760d-b7e3-4d08-9098-e54bf1a86984","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"PowerGraph: Distributed graph-parallel computation on natural graphs,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:8731c8e830db86dc6acd721399751bd6aea9580dadc7fb476ccb2f282b704bfe","observation_id":"e1274387-0852-4afd-a834-97e1669f9f6e","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Graph edge partitioning via neighborhood heuristic,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:10e1ecd460a70101abce435b6bbd11d8b957241422660f2f6b3860b0779a6681","observation_id":"76ddc697-c962-4a42-9231-76563b6258d4","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.07086","last_updated":"2020-01-20T12:52:00Z","snapshot_observed_at":"2026-08-10T17:32:33.231771Z","submitted_at":"2020-01-20T12:52:00Z","title":"2PS: High-Quality Edge Partitioning with Two-Phase Streaming","version":1},"cited_work":{"arxiv_id":"2001.07086","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.07086","snapshot_observed_at":"2026-06-27T05:30:35.654918Z","title":"2PS: High-quality edge partitioning with two-phase streaming,","venue":null,"work_id":"e527e141-5916-4cac-b08a-4b7eee8cbca8","year":2020},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"cited_paper":"/paper/2001.07086","citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:c30022b7b16a2257d0b02e9c1a2c5048339f39a851d6a3e542448dd912660865","observation_id":"2f237157-4e87-4a1b-bedd-bffb16ea3033","resolution":{"observed_at":"2026-06-27T05:30:35.656737Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:29:18.121439Z","title":"Balanced graph edge partition,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:c8079fd3a9daf4c8c10871fe6366626fb1361d63ba937e995430978c792c02f6","observation_id":"5627d76a-c717-41dc-9e45-6035239bb29d","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Distributed edge partitioning for trillion-edge graphs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:76a48c3d1017550a36005cfd6f1540b2eb2eddfcc772d5a0aff501146b2e5ecf","observation_id":"873bcd54-0e9f-4aea-aad4-b80422c0db0b","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07026","last_updated":"2021-01-18T12:06:00Z","snapshot_observed_at":"2026-08-17T00:01:57.422350Z","submitted_at":"2021-01-18T12:06:00Z","title":"Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling","version":1},"cited_work":{"arxiv_id":"2101.07026","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.07026","snapshot_observed_at":"2026-06-27T05:30:35.660937Z","title":"Time-efficient and high-quality graph partitioning for graph dynamic scaling,","venue":null,"work_id":"062ac186-eba6-43de-bc69-dade2ef95fc3","year":2021},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"cited_paper":"/paper/2101.07026","citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:77ead0ce9529b8d490f3012e5d33acfb4fa36279231a09e953a458fa8b06d057","observation_id":"72b8d276-d86d-4025-8b55-0113851ef848","resolution":{"observed_at":"2026-06-27T05:30:35.662769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:29:18.121439Z","title":"SAT-based optimal hypergraph partitioning with replication,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:849f4a1adc5b24951cdc196acb27cc14afe5a1eb25ffff0d10309220816107b9","observation_id":"51d38498-1886-4041-951e-b040825919f2","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Simulated annealing for edge partitioning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:c1ac7e0ab813c6f849f7614c0f6db6f44c639d315ffb887723a8a76297475383","observation_id":"3677c0b1-ebf1-49fe-9c26-f93bf472b5cc","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Hybrid edge partitioner: Partitioning large power-law graphs under memory constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:961b54d21d28bedae26bef462a2b2d512fd8a48c8882ead9b896913539ff79ae","observation_id":"879a58e7-51ca-4c99-98f1-315fd822a548","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Hepart: A balanced hypergraph par- titioning algorithm for big data applications,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:7d31e475e313ac2267d1af1ef10e3dfdaf42a15ac62ad3349671a8ab42ae20c4","observation_id":"abfbd522-8c53-4a8e-8b62-fd7b32736424","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Scalable edge partitioning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:9b62029da1eedb78978be69123ac3114de445cb992e0681f7cb5e157c6488d21","observation_id":"e9664d71-de9a-40ad-9f0a-e2f8bcee4406","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13861","last_updated":"2023-12-21T13:58:05Z","snapshot_observed_at":"2026-08-16T14:32:35.898173Z","submitted_at":"2023-12-21T13:58:05Z","title":"Graph partition method based on finite projective planes","version":1},"cited_work":{"arxiv_id":"2312.13861","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.13861","snapshot_observed_at":"2026-06-27T05:30:35.651817Z","title":"Graph partition method based on finite projective planes,","venue":null,"work_id":"28357931-fcbf-4e00-85ed-38d7c14523e0","year":2023},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"cited_paper":"/paper/2312.13861","citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:061692432a9d3e8e8f513e639e3327ba270c262d31c61849ff5855cd250a4130","observation_id":"631235fc-0264-4984-8f1c-3492349b466d","resolution":{"observed_at":"2026-06-27T05:30:35.653661Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:29:18.121439Z","title":"Hdrf: Stream-based par- titioning for power-law graphs,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:33a3eff4f1e7dd6638414050390e80c8698ba1ac4a5e5b17bd1893ad3806ebf9","observation_id":"37a7f647-259d-45bb-9626-3878508898ec","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Adwise: Adaptive window-based streaming edge partitioning for high- speed graph processing,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:b7e9842075b9f275501d6394740d2614c2591962bd790d6cccf99d8ebfe6f525","observation_id":"9298b8c4-a67a-4102-8060-c5e79b95aaba","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Cusp: A customizable streaming edge partitioner for distributed graph analytics,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:917b36ddd55ab8e511b1a00b82f6d71a20992a6c4ebfe5ed512a0fcb6823c41d","observation_id":"459d3387-ee05-4208-9c2c-24f91ab96b42","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Boosting vertex- cut partitioning for streaming graphs,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:d32f841d00475bc2dc937d0748a89caa1cc3d88067989a357321cc6e8139dc3c","observation_id":"593fc4fb-95b9-4d99-9b32-cebcbbf81eec","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Partitioning trillion edge graphs on edge devices,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:0f8426fb87701365e0a334898353e682270941b09b0c56cb7dba30ebd23e12cb","observation_id":"fe4b4dce-a963-4e2b-b9ab-1b73d1b162b4","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Buffered Streaming Edge Partitioning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:cc1f39bffa26b4ebf985ec4b00a57fbcb70634b8abbe8dd99e36ba8862e7377e","observation_id":"00f6087e-2b10-4dad-aca0-56bd64d55584","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Streaming balanced graph partitioning algorithms for random graphs,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:1c5cf1654552ccd701f23203d40ef4bb83bda2d3d22c230acfc9948e60f800a2","observation_id":"3d15a7b0-141f-4034-b8c9-08f1f0e289a3","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Open problems in (hyper)graph decomposition,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:b1b3d74acb9b7d2a34b197d1c9aaae9c56d49e11083950f33d1ee74b3fbebe2e","observation_id":"50105c66-b2d8-4251-afd8-f2516481e682","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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":"2601.05873","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:30:35.661376Z","title":"Universal and asymptot- ically optimal data and task allocation in distributed computing","venue":null,"work_id":"ae644199-3227-45c8-9104-6dab00cf778f","year":2026},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:94af366d86f8c42eb8da5bee51144d56e59a5e92f6c9eb5141da255e2ab832c8","observation_id":"c1a7dcee-524f-44c3-9dc6-c8bc7f7fe8e4","resolution":{"observed_at":"2026-06-27T05:30:35.663162Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:29:18.121439Z","title":"Order optimal task allocation in distributed computing via interweaved cliques,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:a6a0b1b19549d82c5688739114324b5efe377ec027aeb105a55c532b79cb5dd5","observation_id":"88af432e-fb97-4aa9-9487-b859f0dd9593","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Fundamental limits of caching,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:d9d221e9127726e1242120697d98c211fde1d2208aa5639e05ecf146efcfe38b","observation_id":"3b1bebc9-448c-45f6-9c36-12a96c9dfb03","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Maddah-Ali-Niesen scheme for multi- access coded caching,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:d6f32ceda8088bd1828e2f797a7c808353c16f45461181a065ba0307a9fc2545","observation_id":"44f54990-cc81-488a-b01c-4a4787d62801","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Coded caching with shared caches and private caches,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:992bb261b67e290789db5ffc31e0a74c53c0ad5fd15ddb36a660e27cb328bcc2","observation_id":"5834ec33-34e0-44fe-9f60-7e75fa8ea42f","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"A fundamental tradeoff between com- putation and communication in distributed computing,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:6991da1545606705ed022196e11d611de2e2663939471639acd9a6e49d0aba02","observation_id":"060c65a4-4b4b-4ef1-9f8e-815c5b9837e3","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Fundamental limits of combinatorial multi-access caching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:5936af17234f0fa9b2f8b9aacc9973d34d3d00ffb308c73d027b9f4793c047da","observation_id":"8ac3eec6-4c70-4047-adb7-a950c6adbe89","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Multi-access distributed computing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:1d5c2454f76326541a90527743058b501f9b5f8b9e241d5362ec57a021a3b16c","observation_id":"4f7fa45f-37a4-49f7-9295-5d006d48f87f","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Constructing hamiltonian decompositions of complete k-uniform hypergraphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:f9f0f0cae39248e1293b6fbb65e290972399d92965d7a1eda2d30c545cd4ed88","observation_id":"51824d3d-6340-475d-9978-8002bdb84790","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Mitzenmacher and E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:2874b3397943df3a9285fb0d77fa684e5f029584deab779230ec942c7b07816f","observation_id":"f9ccf923-4f40-4a9c-85b6-f8874ecb42a5","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","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:29:18.121439Z","title":"Alon and J","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T05:29:18.121439Z"},"links":{"citing_paper":"/paper/2606.13491"},"observation_digest":"sha256:5b5e29e0bff485c54de42aba48a8b40feaaf15c09e507fc412b8218b2bfa094c","observation_id":"74d6ab8f-305d-46ed-87c9-93eee995d99f","resolution":{"observed_at":"2026-06-27T05:29:18.121439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.13491","last_updated":"2026-06-11T15:39:55Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T02:21:56.575162Z","submitted_at":"2026-06-11T15:39:55Z","title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":60},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"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."}