{"as_of":"2026-08-17T23:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59fb7c92ab063905c2da86925a2eef35e2f166552172651cb107e381d7c888ec","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:40:57.392604Z","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-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:46:26.827168Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-16T10:46:27.817048Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"cited_work":{"arxiv_id":"2504.12013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.12013","snapshot_observed_at":"2026-08-16T10:46:27.817048Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","venue":"cs.DC","work_id":"e080eb7d-8f6d-478c-898b-45f6236d379d","year":2025},"citing_paper":{"arxiv_id":"2504.17615","last_updated":"2025-04-24T14:39:16Z","snapshot_observed_at":"2026-08-16T10:33:02.323355Z","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T10:46:26.827168Z"},"links":{"cited_paper":"/paper/2504.12013","citing_paper":"/paper/2504.17615"},"observation_digest":"sha256:8347c00c8fe96845483d7b1672091d4e1a233f081d5143ce35eabeaff42e7c19","observation_id":"a72ef4a9-c73c-4d03-9859-e4e7758904ed","resolution":{"observed_at":"2026-08-16T10:46:27.821715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.12013/citation-record","integrity":"/paper/2504.12013/integrity","json":"/paper/2504.12013/citation-record.json","paper":"/paper/2504.12013"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.166023Z","title":"Engineering a Direct k- way Hypergraph Partitioning Algorithm","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.166023Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:e38c12a24ff21051c88f8c4614158a48d453988da51615b0b011be0217735af7","observation_id":"61b38500-5bae-4c4c-9952-193bd428b34a","resolution":{"observed_at":"2026-08-16T12:40:57.166023Z","resolver_source":null,"status":"malformed_identifier"},"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-16T12:40:58.599580Z","title":"High-Quality Shared-Memory Graph Parti- tioning","venue":null,"work_id":"e83acc3a-e17e-42e9-8a87-f6b65a086f1d","year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.170933Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:f9fdd48fc5154f02c10fd0e1d14a57f41bebe3ccdc37a5b3373fb529e8587328","observation_id":"76b1507d-2ccd-4e28-ad11-6e1f38f0d02b","resolution":{"observed_at":"2026-08-16T12:40:58.602960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.590285Z","title":"Alpert and Andrew B","venue":null,"work_id":"c8a5d7da-e60d-4e24-9632-1cd73bfdc6af","year":1995},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.178888Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:36b7e5377c4d4e31a4f6bdbe8dac32eea5c56b675a05dcd1375552e01bf07173","observation_id":"b09d9661-4afe-4c63-b28a-60636f3c2bbe","resolution":{"observed_at":"2026-08-16T12:40:58.593397Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.580662Z","title":"Lewis, Ana-Maria Oros-Peusquens, Nadim J","venue":null,"work_id":"10044210-92ac-477f-a819-ab7cdae5ddeb","year":2013},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.182947Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:b8cb6801bda3b112ae4ca79535ea008e42d0d39cb8a6fb808d38285c99ea6d39","observation_id":"5fa07bfa-fb57-4aa7-9342-161d0650e13e","resolution":{"observed_at":"2026-08-16T12:40:58.584223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.187222Z","title":"Bal- anced Graph Partitioning","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.187222Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8f92b80f07c70b3caea188225432881e7e8b135f7435c7823e6c26d063701c5a","observation_id":"b73d4fe9-f8bf-463c-bf77-0b22136ca071","resolution":{"observed_at":"2026-08-16T12:40:57.187222Z","resolver_source":null,"status":"malformed_identifier"},"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-16T12:40:58.571088Z","title":"Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner","venue":null,"work_id":"658c2124-18b8-4170-bf67-6f5fd34785de","year":2013},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.191163Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:41f3aa9e464fcf7ffebddbe0cc271f9ea76d5f42db410fe28d67e033a883ee2d","observation_id":"0cd7d068-ae7d-48e7-a70a-6f801ebb9cf4","resolution":{"observed_at":"2026-08-16T12:40:58.574670Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.195078Z","title":"Blelloch, and Julian Shun","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.195078Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:047ca6700efce7aea0c5f229c553393f4e2ed1e2a3dd6a5d7c0cbada5fdfddd6","observation_id":"3d482ec8-0719-4f0a-97d2-9fb2219e017b","resolution":{"observed_at":"2026-08-16T12:40:57.195078Z","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-16T12:40:58.560944Z","title":"The SAT Competition 2014","venue":null,"work_id":"373dc255-3952-43e5-bd81-fd110f193e96","year":2014},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.199483Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:f0a5d5930066faca9972e36fdd48568417a9deb075b7474d1a2660f074c75852","observation_id":"72a4f946-75b8-43d7-a91b-7e86a7b839e3","resolution":{"observed_at":"2026-08-16T12:40:58.564330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.203312Z","title":"Blelloch, Jeremy T","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.203312Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:57a6b2266a836d3e11c64570a5c846af42ad5937113cc26e3d0abc2a6eaa86b8","observation_id":"b858b614-ddce-43ca-b404-a24cf3824ff9","resolution":{"observed_at":"2026-08-16T12:40:57.203312Z","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-16T12:40:58.550592Z","title":"Parallel Programming Must Be Deterministic By Default","venue":null,"work_id":"ead94e91-6c1d-4f23-82c3-9c572eb79210","year":2009},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.207666Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:81a3bc03685c9da6412c2c0d762372ee68c4b5386a44012bbf2c5944985a3b76","observation_id":"637fd875-8c92-49b9-b9ff-2b441853efdd","resolution":{"observed_at":"2026-08-16T12:40:58.554149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.211408Z","title":"UbiCrawler: A Scalable Fully Distributed Web Crawler","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.211408Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:a48052cd247a0117b26849005495bfa0b406ad71d1f175369180035577227d06","observation_id":"61b5a04c-4881-430e-b002-7fbcddfa1fee","resolution":{"observed_at":"2026-08-16T12:40:57.211408Z","resolver_source":null,"status":"malformed_identifier"},"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-16T12:40:58.538887Z","title":"Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Com- pressing Social Networks","venue":null,"work_id":"b79c709c-e13f-429f-b014-55b53b9e47ca","year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.215050Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:d8498b941de7edfb3d35f657213e843cc63175f3cb2c2872797485c5fe1ee15a","observation_id":"1e710aa3-bb7b-40e4-aa1b-ceef7c10e73d","resolution":{"observed_at":"2026-08-16T12:40:58.543269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.222190Z","title":"The WebGraph Framework I: Compression Techniques","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.222190Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:1204fa788be4b06bfca3eb0be92fba7bf9ab7169e78967b9b949ad71e5147b74","observation_id":"1c680b59-3a17-44ec-8875-a12d6965facc","resolution":{"observed_at":"2026-08-16T12:40:57.222190Z","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-16T12:40:58.526848Z","title":"Recent Advances in Graph Partitioning","venue":null,"work_id":"d73a82e6-826d-4da7-a72e-e01ee00d3956","year":2016},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.225677Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:54b6ad674a84b8ff3ae63c72683420b713808fc1f015b317bc3864ec8aebdc48","observation_id":"b84ded01-ef2f-45f7-ab24-d92e68fd23c6","resolution":{"observed_at":"2026-08-16T12:40:58.530527Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.515994Z","title":"More Recent Ad- vances in (Hyper)Graph Partitioning","venue":null,"work_id":"0261f6e4-abe1-4477-9f22-2a2dd7b01a93","year":2023},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.229042Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:2c1825ac8597e4cdea24613cfb74ad3c591fc593ccf5488c88c8dc50f7826455","observation_id":"f3ff1a51-b9b5-42e7-8863-c580641fc1b9","resolution":{"observed_at":"2026-08-16T12:40:58.519626Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.232489Z","title":"PT- Scotch: A Tool for Efficient Parallel Graph Ordering","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.232489Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:a07e625ed14ee5546a9ff458b3f29b4eb81cf587a3e3a860f681451417c17c2f","observation_id":"efc2a7bd-3639-4dcb-a9c9-ffede6546603","resolution":{"observed_at":"2026-08-16T12:40:57.232489Z","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-16T12:40:57.236015Z","title":"Davis and Yifan Hu","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.236015Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:648c54bd42a7d73db8680ee8fcf91bc104330626e2c9282181699ba20a1589f3","observation_id":"a24765fa-809e-4fb1-80cb-35b6c206ea93","resolution":{"observed_at":"2026-08-16T12:40:57.236015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.16393","last_updated":"2021-02-02T15:43:57Z","snapshot_observed_at":"2026-08-10T12:42:41.155386Z","submitted_at":"2020-06-29T21:22:15Z","title":"COAX: Correlation-Aware Indexing on Multidimensional Data with Soft Functional Dependencies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16393","snapshot_observed_at":"2026-08-16T12:40:57.240511Z","title":"Devine, Erik G","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.240511Z"},"links":{"cited_paper":"/paper/2006.16393","citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:d7f930520b352d6e77b8fc2a370bfad63cc88962d8b401d92e7cf2503232a4ab","observation_id":"67d12201-c888-4ac9-8801-fc699faa6548","resolution":{"observed_at":"2026-08-16T12:40:57.240511Z","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-16T12:40:58.505370Z","title":"Dolan and Jorge J","venue":null,"work_id":"cba81a6f-cb6e-4c46-8da6-6bdb62cb1702","year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.244519Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:984d96834d9cfc6ddd9ca3a118e9c2758a86d0f2ef921375d09a91df8fa5e52f","observation_id":"cf245b11-3756-4858-bae0-614ea313203e","resolution":{"observed_at":"2026-08-16T12:40:58.508918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0263.80920","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:58.024895Z","title":"Fiduccia and Robert M","venue":null,"work_id":"87acae50-d080-41ac-a162-bcc830a38226","year":1982},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.253517Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8a29f2b597d2ff8991cb37c071df80907f9c85d0fb53725f3b476e86589ef858","observation_id":"3dd1edcb-90a7-40af-a203-d4c3b971c573","resolution":{"observed_at":"2026-08-16T12:40:58.030055Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.494431Z","title":"Gilbert, Kamesh Madduri, Erik G","venue":null,"work_id":"a9df6fb8-622d-477f-80d8-cb1933aad68f","year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.257824Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:1b72f584a829d78e94ab936227ae6080e00f62823d70dbfd30175ebab9a3978d","observation_id":"f098812e-4c9f-477f-a79a-46c92c7130c7","resolution":{"observed_at":"2026-08-16T12:40:58.498084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13194","last_updated":"2024-01-05T22:29:53Z","snapshot_observed_at":"2026-08-16T15:37:42.141311Z","submitted_at":"2023-04-25T23:26:09Z","title":"Jet: Multilevel Graph Partitioning on Graphics Processing Units","version":2},"cited_work":{"arxiv_id":"2304.13194","doi":"10.48550/arxiv.2304.13194","metadata_source":"pith","pith_arxiv_id":"2304.13194","snapshot_observed_at":"2026-08-17T00:16:13.690415Z","title":"Jet: Multilevel Graph Partitioning on Graphics Processing Units","venue":"cs.DC","work_id":"880129b6-f0aa-4484-9e30-1ba083b3bc19","year":2023},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.266074Z"},"links":{"cited_paper":"/paper/2304.13194","citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:fc7eb560e715e0a55fc1d20736e875a0fb741ff6113e5a2da41906a7ec964753","observation_id":"8b819aa5-15e6-430e-a854-8e3e6cce6e6e","resolution":{"observed_at":"2026-08-16T12:40:57.550535Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.484391Z","title":"Deter- ministic Parallel Hypergraph Partitioning","venue":null,"work_id":"5e1d758c-487a-494e-83bb-778f919a33b0","year":2022},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.270195Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:384bcc3708b76ac3116f837ae66a7c9327728a977c0e671b442f04acc9e749b6","observation_id":"b2732555-c907-49e6-9b18-f47688fc047c","resolution":{"observed_at":"2026-08-16T12:40:58.487921Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2019.52","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.531489Z","title":"Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm","venue":null,"work_id":"3fcc8d48-e6af-4e94-99dc-6f408237d9f3","year":2019},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.274889Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:dfe1d04cf44ba3ebb46257ade5c6b34e4364a4545bf99f646c17a0e512e24717","observation_id":"5c9817ee-5321-4329-8061-68a57182ff21","resolution":{"observed_at":"2026-08-16T12:40:57.535173Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.473802Z","title":"Scalable High- Quality Hypergraph Partitioning","venue":null,"work_id":"c5af0bac-8989-4d59-abfa-6631d53fac92","year":2024},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.279414Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8520630131193bc16ca7d211e838b5e7cb3f99ab0b84c54d05307a0e4ac5efee","observation_id":"e53259ea-3176-458b-931d-a0bcd534f096","resolution":{"observed_at":"2026-08-16T12:40:58.477336Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.sea.2022.5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.519910Z","title":"Parallel Flow-Based Hypergraph Partition- ing","venue":null,"work_id":"66c7bfeb-5ad2-4ee0-b91c-0cf0d9e570a1","year":2022},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.283064Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:fb9fc11c1c08b7d617ad79f929beb3fab1774550ce7d28ed244dc776f233575a","observation_id":"4ca17c32-1de8-46a4-a271-06deda85ef4b","resolution":{"observed_at":"2026-08-16T12:40:57.523817Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977042.11","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.508997Z","title":"Shared-Memory n-level Hy- pergraph Partitioning","venue":null,"work_id":"b9434437-e1d2-42c7-9156-10a5b2efa0a9","year":2022},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.287011Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:fe32a5c4c7b5fc5fb8ac5f6f5a1ecb967dbbe763a335f9bf1dd267d72c5e7b0f","observation_id":"34e7e659-f635-4cc4-b58e-826ae98489c9","resolution":{"observed_at":"2026-08-16T12:40:57.512620Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.463744Z","title":"Advanced Flow-Based Multilevel Hypergraph Partitioning","venue":null,"work_id":"b7b75f5d-44a0-479f-8d60-0cc633f9d8cf","year":2020},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.291023Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:cff2f76078c1805e2a91867f1a24bfc6c6bf42e65ea5decfad6c3cba4715130a","observation_id":"1cac6323-d7ac-46e0-8a8a-1b6c48637f06","resolution":{"observed_at":"2026-08-16T12:40:58.467421Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.294647Z","title":"Scalable Shared-Memory Hy- pergraph Partitioning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.294647Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:60a4fc9f5e9bc0d5b5dc11b2091c32f6c2e818cb96ff151197c507c368bca1a3","observation_id":"58b413eb-b094-4c1a-800f-6911c5d8a7e9","resolution":{"observed_at":"2026-08-16T12:40:57.294647Z","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-16T12:40:57.298147Z","title":"Deep Mul- tilevel Graph Partitioning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.298147Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:a07bcc2de38a7015a9c882ed793168d3975650fe25e802bf60ec81bc2c1f50ee","observation_id":"a5f8ee64-afe2-48bd-952b-e7c0b58a7ada","resolution":{"observed_at":"2026-08-16T12:40:57.298147Z","resolver_source":null,"status":"malformed_identifier"},"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-16T12:40:58.453353Z","title":"Graph Bi- section with Pareto-Optimization","venue":null,"work_id":"38bb2b6d-58af-4ef0-8c25-3b0dfd5533e4","year":2016},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.301892Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:251dcfe95edad09c7ab796b59666216b548ba7bfd1fc845f639472acabd5dc1f","observation_id":"6e3bb191-bf46-4713-918c-8fe66472b957","resolution":{"observed_at":"2026-08-16T12:40:58.456997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.443822Z","title":"A Mul- tilevel Algorithm for Partitioning Graphs","venue":null,"work_id":"90cb9459-7b1d-4714-8e7b-ec4ee2a99914","year":1993},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.306627Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:3c05b2efb486590dd8a84874d96b426f246752b18b1a05a746ec46f78c237519","observation_id":"e4d34074-9841-4e87-a592-f14fc7bfc4b6","resolution":{"observed_at":"2026-08-16T12:40:58.447232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3329872","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.482908Z","title":"Network Flow-Based Refinement for Multilevel Hy- pergraph Partitioning","venue":null,"work_id":"71b78719-1257-453b-ae7d-ff6f411fff8e","year":2019},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.310705Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8cc3642ca09d577ef8f4431ecc1f6b3502a11e412bba41e398e62922ca8365c3","observation_id":"0653a642-666c-4d6b-ad64-91b156460cfc","resolution":{"observed_at":"2026-08-16T12:40:57.488510Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.434056Z","title":"Improv- ing Coarsening Schemes for Hypergraph Partition- ing by Exploiting Community Structure","venue":null,"work_id":"c9408aec-2005-46b9-9528-9b09a2751cf5","year":2017},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.314231Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:eb7fdebe612f7fb24a2b246438993e5fe38454427e4c557c943f02c43d62368d","observation_id":"a9dda098-81b9-4f93-a80e-d32984918b6d","resolution":{"observed_at":"2026-08-16T12:40:58.437390Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.423309Z","title":"Engineering a Scalable High Quality Graph Partitioner","venue":null,"work_id":"3ba3ee59-48dc-4cf2-bfa0-c05ed41a72c8","year":2010},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.317964Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:e6740274012e331a1cc4355f4b8ced587a81e5862c5aa85280955ff2c6172916","observation_id":"b4e1146a-a109-4b76-91c4-75aef302a7d0","resolution":{"observed_at":"2026-08-16T12:40:58.427221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6709.96731","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.955598Z","title":"Steele Jr","venue":null,"work_id":"8eb95445-fe03-499c-9693-5659066ba784","year":1990},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.321479Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:c3ac9cf3c4c2b98c6356dc0009c2ce832eb6097e1812f7097bd9bdfb89800540","observation_id":"b33826e5-9c3a-4a21-aa97-00123915fbc5","resolution":{"observed_at":"2026-08-16T12:40:57.960552Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.325969Z","title":"Multilevel Hypergraph Parti- tioning: Applications in VLSI Domain","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.325969Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:6a65067a428f5f19c917dbc43026912b8a4b0f8f0845c11758c0e9706a9ddcbb","observation_id":"b5543978-1391-4779-8430-4fd4dab0796d","resolution":{"observed_at":"2026-08-16T12:40:57.325969Z","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-16T12:40:58.412886Z","title":"Multi- threaded Graph Partitioning","venue":null,"work_id":"7da47a0e-74d8-4c54-b81e-a2db4edd0f4f","year":2013},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.329541Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8e3ea766761c50997b93057ada28c0194efaebf0e70330fb9a249ab2fa55d4d9","observation_id":"3ff37aac-54bf-497e-9bf2-ab4cfb54079f","resolution":{"observed_at":"2026-08-16T12:40:58.416516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/mc.2006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.466091Z","title":null,"venue":null,"work_id":"c194b0a4-57a7-498b-93ad-d998f2011b09","year":2006},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.333223Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8656b7030a4ca9eb3750125f7495e38a6257d83425662c36a41585897f66f315","observation_id":"ad6657df-93bb-4c60-b8a8-5ad4038a4554","resolution":{"observed_at":"2026-08-16T12:40:57.469665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.401754Z","title":"Parallel Unconstrained Local Search for Partitioning Irregular Graphs","venue":null,"work_id":"9f1bb2fd-bf3e-4885-963a-f11686041bda","year":2024},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.338149Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:fbb207e8111a23ecb12e16b40a4f769c1bd5091bf9e32ae7fa42c2102bc6cbc1","observation_id":"0004d69e-1963-4f95-9fff-b7cdbfc19d05","resolution":{"observed_at":"2026-08-16T12:40:58.405479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.342181Z","title":"BiPart: A Parallel and Deter- ministic Multilevel Hypergraph Partitioner","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.342181Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:a6bb37c9bb1a8bb5ad940948daf24fb8921bc0a9d2b5d2c23598274ee076dcfa","observation_id":"6fd50d4f-994c-437d-a397-761249aed236","resolution":{"observed_at":"2026-08-16T12:40:57.342181Z","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-16T12:40:57.345659Z","title":"Growth of the Flickr Social Network","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.345659Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:b00bd68018b730a1ffed56ea454c9b67d7549f3f925a811a4e5ea37f1c6744f4","observation_id":"b0aee347-2fd0-4ebc-ba19-606bc819f54d","resolution":{"observed_at":"2026-08-16T12:40:57.345659Z","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-16T12:40:57.348894Z","title":"Papa and Igor L","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.348894Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:8fa51d289bed89f643a1461e3ac4c9b8b9914c41d6992c7cec1afd4d456524a2","observation_id":"c9e2ac28-fb7d-4304-b2ea-0dfdadf4e924","resolution":{"observed_at":"2026-08-16T12:40:57.348894Z","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-16T12:40:58.391206Z","title":"On the Structure of All Minimum Cuts in a Network and Applications","venue":null,"work_id":"b4f57d25-eded-4082-bdce-af8105d5c5ff","year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.353472Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:17eb0a4e199a8c8dec8ffed8d001885c73fa362de11b81c62ac0c5a09e458a88","observation_id":"dadfffad-2b6b-4a99-9ce2-5603a1a5340e","resolution":{"observed_at":"2026-08-16T12:40:58.394798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.360506Z","title":"Near Linear Time Algorithm to Detect Community Structures in Large-Scale Net- works","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.360506Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:b961582c1476030e400a7ac4e219028e47d17ed78d0e9a675d3cc955f69dd78a","observation_id":"d8feebb4-ec52-427a-8725-c05c139cd25f","resolution":{"observed_at":"2026-08-16T12:40:57.360506Z","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-16T12:40:58.380822Z","title":"Rossi and Nesreen K","venue":null,"work_id":"f1bffb71-1934-40b4-b51a-8e4eae726737","year":2015},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.363955Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:63332f564515c8113b630364c963358ae026dbadb4509631b0b535d8bec9d9a8","observation_id":"955fa29a-8257-4bb0-9418-9c39ae15c3f7","resolution":{"observed_at":"2026-08-16T12:40:58.384334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.367456Z","title":"Engineering Multilevel Graph Partitioning Algorithms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.367456Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:0b72464f91c3e8b7f2063c018c14d5779f9c319fb931f8f5afbfe79428cf6be6","observation_id":"d4ab139f-9708-407b-8716-084cd8c0319e","resolution":{"observed_at":"2026-08-16T12:40:57.367456Z","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-16T12:40:57.371117Z","title":"Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.371117Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:75d983eac71840301060db8d886781e90b177c79285559deac9a63bbe3427c04","observation_id":"2ce6c717-87db-49f1-b168-2ed2ffbd7713","resolution":{"observed_at":"2026-08-16T12:40:57.371117Z","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-16T12:40:57.374541Z","title":"High-Quality Hypergraph Partition- ing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.374541Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:39015492bc8b49badafc193ee1384e2cae14b0847030268907b4ca415e2ddd6e","observation_id":"3609cbca-df3d-4ad9-ab93-d1cdb6706b5f","resolution":{"observed_at":"2026-08-16T12:40:57.374541Z","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-16T12:40:58.368897Z","title":"Social Hash: An Assignment Framework for Optimizing Distributed Systems Operations on Social Networks","venue":null,"work_id":"ccb04105-d025-495c-b552-12cb6a5e6fbe","year":2016},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.377899Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:fe785f00a8253b8bd9d792eff06b235ab219f4afa263f558aba6ba98c9391428","observation_id":"89eab975-4104-457b-9a0c-4222584aae7d","resolution":{"observed_at":"2026-08-16T12:40:58.373924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:58.358269Z","title":"Simon and Shang-Hua Teng","venue":null,"work_id":"dbaf5ae1-3b15-4f27-aa21-77a365244fd5","year":1997},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.382118Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:0a36b780b4cc17b1a156c8c4cce71e67ed470b4296f68fe1e8eadcd05b9ebe56","observation_id":"e49d8c28-f1e0-4687-9072-b317461b4183","resolution":{"observed_at":"2026-08-16T12:40:58.361989Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.385652Z","title":"Alpert, Cliff C","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.385652Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:6a88d1e11089441b9ee0afbc26e02074ce27b267555790fc605417f59e374969","observation_id":"21239f6a-3325-44c7-8c80-faad44711ab6","resolution":{"observed_at":"2026-08-16T12:40:57.385652Z","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-319-08010-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"Char- acterizing Tweeting Behaviors of Sina Weibo Users via Public Data Streaming","venue":"Lecture notes in computer science","work_id":"52c46885-8b37-4d61-a645-2bf5c22fb140","year":2014},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.388996Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:1ab1c9dcfd76a66a77022926a55da5b94a66e3253e76ccc6db21cf716338dae0","observation_id":"ad31f09f-4381-4b4e-8669-2dcf52069064","resolution":{"observed_at":"2026-08-16T12:40:57.426944Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"records/1538662","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:40:57.660608Z","title":"Cataly¨ urek and Cevdet Aykanat","venue":null,"work_id":"fb84ff0d-a318-4a43-bc04-3ca3b9163a0f","year":1999},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.392604Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:f6ed1b2207d35d34791be20fd97c108b62f42bafe79adce4ee57df8bb8427de1","observation_id":"8ab550e5-d909-4694-a31d-93ed894e9f2a","resolution":{"observed_at":"2026-08-16T12:40:57.665962Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T12:40:57.356908Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.356908Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:f6d92a7b496e609750fd48cb8035122ff9a32139f79efae72a7207b73151de5b","observation_id":"2581d3dd-ecab-4649-bd31-a2b68c86f544","resolution":{"observed_at":"2026-08-16T12:40:57.356908Z","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-16T12:40:57.248497Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.248497Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:4cf85382ff2d61f1ff1f7bde6881ae94c68f28cb3cea6cd147f6c35dfecad558","observation_id":"7179bb36-6307-49e0-8089-0ec1f8374a70","resolution":{"observed_at":"2026-08-16T12:40:57.248497Z","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-16T12:40:57.218709Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.218709Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:119995fb2382f59feb7d984a12f8dc0cb6cf3041be16421a8a67fec70bbc2106","observation_id":"51a62139-a3c5-4311-9a96-fe7df65ba7cd","resolution":{"observed_at":"2026-08-16T12:40:57.218709Z","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-16T12:40:57.174840Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.174840Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:4b8a87cc3ac4eac3a0bc651112ff403aa166bb05421ea3689473ae454d9252ae","observation_id":"2a3b1b53-19a0-4ce0-a093-41268ffdb194","resolution":{"observed_at":"2026-08-16T12:40:57.174840Z","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-16T12:40:57.262337Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T12:40:57.262337Z"},"links":{"citing_paper":"/paper/2504.12013"},"observation_digest":"sha256:c2050b82cbce982dc4c5a0193427b2b86c6478f984df1c13903e0889f8b7b1c4","observation_id":"110c02d7-fe4c-46ec-a9ff-b91d4156df27","resolution":{"observed_at":"2026-08-16T12:40:57.262337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.12013","last_updated":"2025-05-12T13:49:43Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T12:38:17.993570Z","submitted_at":"2025-04-16T12:13:21Z","title":"Deterministic Parallel High-Quality Hypergraph Partitioning"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":14,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":21,"verified_exact":7,"verified_fuzzy":15},"total_outbound_references":59},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 1 inbound Pith citation observation for arXiv:2504.12013."}