{"as_of":"2026-08-21T14:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df8f5c73e662b96e3e02750dccec2de89b7a49c2e5bc01d8b021f6271d0a3729","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:52:02.359103Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2504.19842/citation-record","integrity":"/paper/2504.19842/integrity","json":"/paper/2504.19842/citation-record.json","paper":"/paper/2504.19842"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4535.27454","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.457289Z","title":null,"venue":null,"work_id":"cf8a86ac-8ca3-4d09-b2f4-bd8ba8f19e37","year":1998},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.165269Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:aabd41080de11ee5167ec0c90a47f1b138834df6d20cf1156d376dfcb7ee48a6","observation_id":"33abe141-88da-4653-b993-3bac24409a1e","resolution":{"observed_at":"2026-08-16T05:52:03.470715Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.520774Z","title":"T he SAT C ompetition 2014","venue":null,"work_id":"7f7402e8-5044-4541-aa65-28077e18fd69","year":2014},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.173241Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:ddd11ee5ffe2a0f0e318c50248835a78746be08300d37018875801ed0dfbc9fc","observation_id":"6ecc9816-8530-4ca6-a5a0-28582e8352bf","resolution":{"observed_at":"2026-08-16T05:52:03.526497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.08447","last_updated":"2016-12-26T21:50:42Z","snapshot_observed_at":"2026-08-14T21:23:40.901149Z","submitted_at":"2016-12-26T21:50:42Z","title":"Higher-order organization of complex networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.08447","snapshot_observed_at":"2026-08-16T05:52:02.178572Z","title":"Benson, David F","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.178572Z"},"links":{"cited_paper":"/paper/1612.08447","citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:9763ea389df940c6cb0657dc50322d2291f6f86375088f9a53c63ba19066beae","observation_id":"47870871-ad2f-4ca8-86dd-69decd28f3bd","resolution":{"observed_at":"2026-08-16T05:52:02.178572Z","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-08-16T05:52:02.185717Z","title":"M ining H idden C ommunity in H eterogeneous S ocial N etworks","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.185717Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:136f4fa35770fca2197086ca72f1ab08b9b7574fbc91a0288bd760f45c59e294","observation_id":"baa1a618-015c-44e0-b7f2-5005c53f44ca","resolution":{"observed_at":"2026-08-16T05:52:02.185717Z","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-08-16T05:52:02.190882Z","title":"U mit V. C ataly \\","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.190882Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:c36c0241aed9513b387ce743650e1995dcc1fb7dd43e3574e84da45748823e4a","observation_id":"2b9ecad0-e3aa-48b0-8594-2c39b92b0745","resolution":{"observed_at":"2026-08-16T05:52:02.190882Z","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":"10.1137/1.9781611974782.70","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:02.659001Z","title":"C omputing M inimum C uts in H ypergraphs","venue":null,"work_id":"29955fe3-7f21-4e29-9121-ea033002bc04","year":2017},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.196771Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:5dd34f1b6b3405af080560e096dc62a27ac01ff155a09128f8e7869292692b52","observation_id":"721e9df9-cc6a-4229-b5ee-edc3b9188f34","resolution":{"observed_at":"2026-08-16T05:52:02.663937Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.202857Z","title":"Davis and Yifan Hu","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.202857Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:c6e1d577fed7cf53b9cd68522c4534b1c58eabc5f52561f6ec2dce81858ec51b","observation_id":"e33f793a-4a5d-470a-8a2e-367173900dc6","resolution":{"observed_at":"2026-08-16T05:52:02.202857Z","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-08-16T05:52:02.208513Z","title":"Dolan and Jorge J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.208513Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:f5d8fdc8d907f1ce3527085c2e96ea7040ea0a793634f24a7953bff92bbaee07","observation_id":"68c52535-4647-4511-bb9e-3479c47d40a0","resolution":{"observed_at":"2026-08-16T05:52:02.208513Z","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-08-16T05:52:02.213428Z","title":"S calable H igh-quality H ypergraph P artitioning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.213428Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:32dfaebc0a689d914714d4d21635a32366324dbd7c8bb9cb536b5adae85ce8cb","observation_id":"8a415397-7f1d-4773-9fd1-d30f8cd278e6","resolution":{"observed_at":"2026-08-16T05:52:02.213428Z","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-08-16T05:52:02.219113Z","title":"S calable S hared-memory H ypergraph P artitioning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.219113Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:11d0e99bf8b43d1db33244db08d73466b06b76d507e789a7c1a1a7773f406f3a","observation_id":"ae62f6f0-3a73-4da3-9167-61033b2a0ce9","resolution":{"observed_at":"2026-08-16T05:52:02.219113Z","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":"9404.13943","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.232448Z","title":null,"venue":null,"work_id":"f28f9f2c-e689-4449-ad33-a22cd0026865","year":1992},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.225082Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:70ab60b1e5a1b2e7a3da21f3e45fc53b3f0b7fa93f68f0a762af0b1f6571be17","observation_id":"95e61dd5-2417-4685-b759-02665a7a4d27","resolution":{"observed_at":"2026-08-16T05:52:03.240459Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.230719Z","title":"A C lustering A lgorithm B ased on G raph C onnectivity","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.230719Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:cd44ee85e5251cadc90f7fe69f5e40490f36f4313a40b817a5f84370573100e1","observation_id":"5a96a100-f9f7-4c94-a723-21c71d822a11","resolution":{"observed_at":"2026-08-16T05:52:02.230719Z","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":"ir/1000063","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.163940Z","title":"L abel P ropagation for H ypergraph P artitioning","venue":null,"work_id":"26724390-99f2-49bc-9101-8e7e1d2ba9bc","year":2015},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.237734Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:14f704933360cdfd51d783cbabbddcd7c2fedf11129337f666ad79198bc50a2b","observation_id":"f4fb434a-d0be-4119-9e0e-f38d28505c43","resolution":{"observed_at":"2026-08-16T05:52:03.172735Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.243221Z","title":"S hared-memory E xact M inimum C uts","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.243221Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:4c2afb229f2bdf2f6dd1592454dcf1dd986ee79234bbc3c5253aea1bfcb6ecdb","observation_id":"ae4e23cf-c8f9-4bef-bad6-1102962067d7","resolution":{"observed_at":"2026-08-16T05:52:02.243221Z","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":"10.1137/1.9781611974782.125","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:02.595373Z","title":"L ocal F low P artitioning for F aster E dge C onnectivity","venue":null,"work_id":"4931cad4-7ce5-4194-a8e8-86177fa18135","year":2017},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.248243Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:4dbc536ae554e54365d4f8c5e56300d5f8801965c9f8c241f46bc54e131c0792","observation_id":"ff51bfbd-5c76-499f-9d35-52e5b90792cd","resolution":{"observed_at":"2026-08-16T05:52:02.600564Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5058.22506","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.019553Z","title":null,"venue":null,"work_id":"163f8525-db83-405a-899a-d1b5c5e51559","year":1995},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.253229Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:8e2cc7c5787d68540bbd608144cde838cb0101e2e6964c580b6006d42a42e856","observation_id":"25d5f0fa-776d-453e-a91f-f3a7a3a195c2","resolution":{"observed_at":"2026-08-16T05:52:03.028576Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.259748Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.259748Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:25e4ce1df2bf04116cab437f698973c8af40e912d070a5f696f0f13d987452f3","observation_id":"80c99c4f-9cf6-495a-a677-dab17660085e","resolution":{"observed_at":"2026-08-16T05:52:02.259748Z","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-08-16T05:52:02.265108Z","title":"Karger and Clifford Stein","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.265108Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:2cd8415b70008b2e3541f031988488dbfd0980dd1007f2e76dcc0785d6eb7b19","observation_id":"bc8bf595-5148-49a5-86ed-233ff4a943e6","resolution":{"observed_at":"2026-08-16T05:52:02.265108Z","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-08-16T05:52:02.269942Z","title":"M ultilevel H ypergraph P artitioning: A pplications in VLSI D omain","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.269942Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:0b22ef32d8b20d708f76a4eed0f68dd482980d28c5ea8e021f23c67d19d65bc3","observation_id":"d9c543ca-ce07-4e4e-834d-261b9cc16d97","resolution":{"observed_at":"2026-08-16T05:52:02.269942Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.503501Z","title":"A S imple H ypergraph M in C ut A lgorithm","venue":null,"work_id":"f0e9f29b-46cb-429d-bdad-b064a5f8e34b","year":1996},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.279153Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:fb113a34174398b83176c4920dda66ff7ef02e42f2a4a9c2019df7f2f598d087","observation_id":"0c2988ca-df75-4912-8192-90df6a2b0558","resolution":{"observed_at":"2026-08-16T05:52:03.509023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-35668-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"Pemmaraju, and Vivek Sardeshmukh","venue":"Lecture notes in computer science","work_id":"2d5d9b58-b300-4eb9-8c4e-616231015db1","year":2013},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.284066Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:c2c148f0dab66d075f429dcba2bea88b0a5c7726ebe28ad7c8e762d4c77d6047","observation_id":"8c8be42c-c3f7-40b8-a51b-3226c977c8cb","resolution":{"observed_at":"2026-08-16T05:52:02.569605Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.289312Z","title":"A n I mproved M in-cut A lgonthm for P artitioning V L S I N etworks","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.289312Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:cecbfbe666a7a95b720abbf719c699ed74c9d5d1ef7b0979bd188297467bf5f6","observation_id":"4ec67a26-9067-4c90-b045-d6114bb45942","resolution":{"observed_at":"2026-08-16T05:52:02.289312Z","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":"10.1007/978-3-322-92106-2_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"G raph A lgorithms , pages 47--135","venue":null,"work_id":"fd0cd722-d408-479b-983d-a47ac8290dce","year":1990},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.294952Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:e2e7dff8e3da30fc60338900172389a1871c4d98ba8bbf4d708c59831e751117","observation_id":"345b8c8e-7137-4032-8764-7122b2c40b91","resolution":{"observed_at":"2026-08-16T05:52:02.552587Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.301773Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.301773Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:c30ed829f37ed658aaaa94f3049cbd71c1873bb19de6f1154f2cf46b7bd920a9","observation_id":"7a028064-8999-4fcc-a583-bafc5bc4bc5f","resolution":{"observed_at":"2026-08-16T05:52:02.301773Z","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":"10.1137/0405004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:02.517869Z","title":"C omputing E dge-connectivity in M ultigraphs and C apacitated G raphs","venue":null,"work_id":"04f03521-d225-416b-8905-10f0719aadb3","year":1992},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.308326Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:c2cbb5ae3e318216a4f3d701f84d32809983c6b653075c3356d360bc9536360f","observation_id":"e7429bd8-b277-4d03-a4ed-1a73842e41bb","resolution":{"observed_at":"2026-08-16T05:52:02.524160Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01582226","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"I mplementing an E fficient M inimum C apacity C ut A lgorithm","venue":"Mathematical Programming","work_id":"44800d2a-6bba-4361-ba0c-daccb23ea89c","year":1994},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.316406Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:ba6897bb28a5e7b0974c0c414e4f1b6be9b8d6290414e5c85c83895752bafed6","observation_id":"ad18db38-aad4-4dff-a193-c0fa8a406199","resolution":{"observed_at":"2026-08-16T05:52:02.506514Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01580850","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Padberg and G","venue":"Mathematical Programming","work_id":"ed86391e-9e6a-490d-8385-cbeb16dc0f46","year":1990},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.321912Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:7443bfdb3d2842fac5aca7c11a122662d85fd5856283f32bc1ea84750b9184ab","observation_id":"cc1cb1f1-2dd1-403d-9afe-c2b43b8a8cd8","resolution":{"observed_at":"2026-08-16T05:52:02.489896Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.327226Z","title":"A B ranch-and-cut A lgorithm for the R esolution of L arge-scale S ymmetric T raveling S alesman P roblems","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.327226Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:4b2c00048a04315ec831e0697d9bf2866a54bb936c21e94fa3f139711f73f460","observation_id":"73565d38-4f3c-4f08-ab99-894a325f2e58","resolution":{"observed_at":"2026-08-16T05:52:02.327226Z","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":"10.1007/bf01585863","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"M inimizing S ymmetric S ubmodular F unctions","venue":"Mathematical Programming","work_id":"d1a0f220-91d2-44d6-8b37-bf540b5c12ee","year":1998},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.332175Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:255a403619038dc4003a943b43972952efe61fe389e45f5f9c48cb74acf61d67","observation_id":"a0d45d69-c0d6-4b7c-927c-8d65254cdf1a","resolution":{"observed_at":"2026-08-16T05:52:02.461284Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.338069Z","title":"N ear L inear T ime A lgorithm to D etect C ommunity S tructures in L arge-scale N etworks","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.338069Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:1d08adab56127227b043fa0b98b18940ec55fb3f33535e8c363e68e3cc95fdef","observation_id":"67fe7fcd-b52d-4790-85ef-b420902fa16d","resolution":{"observed_at":"2026-08-16T05:52:02.338069Z","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":"10.1007/bf02592076","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Colbourn","venue":"Mathematical Programming","work_id":"955bbf1d-2462-4871-812e-91118be64d3d","year":1987},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.343190Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:11aeec2bc94b317d3df9a6c2e6b30ba6a379bbc14a1555b4503b6c622237532f","observation_id":"01d50ff7-444d-43a2-808d-8f0cbe2037bb","resolution":{"observed_at":"2026-08-16T05:52:02.424300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:03.485863Z","title":"GNU P arallel: T he C ommand-line P ower T ool","venue":null,"work_id":"e7db2540-7479-4119-8382-153149a07a53","year":2011},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.348076Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:68fc2cf5cb203f856bdc9c50e52821ebab5700e433d62f4669a274f21ac28c0d","observation_id":"0a322420-c7ca-4283-b07d-3c48d09bf1c8","resolution":{"observed_at":"2026-08-16T05:52:03.492068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08-16T05:52:02.353405Z","title":"Alpert, Cliff C","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.353405Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:8a7267f880a9c58a8ea89e6584eae628fb68248a99197c6aba4cc11119a5ed5d","observation_id":"4ab5af62-44cd-4ee6-be12-fa8990c68d8e","resolution":{"observed_at":"2026-08-16T05:52:02.353405Z","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":"10.1109/34.244673","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:52:02.398198Z","title":"Wu and R","venue":null,"work_id":"77ced7b7-4846-41c7-a2b5-7d8fc1b0cff5","year":1993},"citing_paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T05:52:02.359103Z"},"links":{"citing_paper":"/paper/2504.19842"},"observation_digest":"sha256:4b71308f1dad7f6d8f52f7a80805d531105d68b7a8c68576712d8d600e104320","observation_id":"e2f5be77-ddc5-40d1-b92c-705980e09176","resolution":{"observed_at":"2026-08-16T05:52:02.404412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.19842","last_updated":"2025-04-30T10:05:18Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T05:39:47.909183Z","submitted_at":"2025-04-28T14:41:51Z","title":"Near-Optimal Minimum Cuts in Hypergraphs at Scale"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":17,"verified_exact":11,"verified_fuzzy":3},"total_outbound_references":34},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2504.19842."}