{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:B6HIKOSTYSESRIMFY7YNCW73QF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1377b8b98967b6fa4995df79a2016f069d8a0f671a5d35540d93dc8cfb4a5b30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T14:39:16Z","title_canon_sha256":"9a3f44d72afcbe6081b372af4d9a0f4bb19a3d9e82b1c4a8ccbbc80d3730bb38"},"schema_version":"1.0","source":{"id":"2504.17615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.17615","created_at":"2026-07-05T10:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"2504.17615v1","created_at":"2026-07-05T10:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17615","created_at":"2026-07-05T10:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"B6HIKOSTYSES","created_at":"2026-07-05T10:53:32Z"},{"alias_kind":"pith_short_16","alias_value":"B6HIKOSTYSESRIMF","created_at":"2026-07-05T10:53:32Z"},{"alias_kind":"pith_short_8","alias_value":"B6HIKOST","created_at":"2026-07-05T10:53:32Z"}],"graph_snapshots":[{"event_id":"sha256:0c31a32198c0234c90890cf4690652f4279ed1a67fabc9f74705028ac3f0a9ad","target":"graph","created_at":"2026-07-05T10:53:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.17615/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The current landscape of balanced graph partitioning is divided into high-quality but expensive multilevel algorithms and cheaper approaches with linear running time, such as single-level algorithms and streaming algorithms. We demonstrate how to achieve the best of both worlds with a \\emph{linear time multilevel algorithm}. Multilevel algorithms construct a hierarchy of increasingly smaller graphs by repeatedly contracting clusters of nodes. Our approach preserves their distinct advantage, allowing refinement of the partition over multiple levels with increasing detail. At the same time, we u","authors_text":"Daniel Seemaier, Dominik Rosch, Lars Gottesb\\\"uren, Nikolai Maas, Peter Sanders","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T14:39:16Z","title":"Linear-Time Multilevel Graph Partitioning via Edge Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17615","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:34ea0fbb652c0660eff0e857d923b923f211313bb0872044f2a427d5951c6324","target":"record","created_at":"2026-07-05T10:53:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1377b8b98967b6fa4995df79a2016f069d8a0f671a5d35540d93dc8cfb4a5b30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-24T14:39:16Z","title_canon_sha256":"9a3f44d72afcbe6081b372af4d9a0f4bb19a3d9e82b1c4a8ccbbc80d3730bb38"},"schema_version":"1.0","source":{"id":"2504.17615","kind":"arxiv","version":1}},"canonical_sha256":"0f8e853a53c48928a185c7f0d15bfb8177dd149a3d4fe5b580909b3d921adea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f8e853a53c48928a185c7f0d15bfb8177dd149a3d4fe5b580909b3d921adea5","first_computed_at":"2026-07-05T10:53:32.739781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:32.739781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dk9pjsEHrGp9R5/p3neg7S0uJ0Sn/ChegHmR5JSYEem6VtLTvWX2/lQf7mpFOwyDAlNhhv70ztCUmTNGoAOmBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:32.740311Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.17615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ea0fbb652c0660eff0e857d923b923f211313bb0872044f2a427d5951c6324","sha256:0c31a32198c0234c90890cf4690652f4279ed1a67fabc9f74705028ac3f0a9ad"],"state_sha256":"03bd2b2c3e3720c4191c42ff738dc758dab33f410786bc3f32458651d10eaf7f"}