{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V357KNMYNCEH7LSFALOV5PXTXQ","short_pith_number":"pith:V357KNMY","canonical_record":{"source":{"id":"2508.19898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-27T13:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"56c8353f83289b30d8305fc5505e0e12453304f8f03faf1e041cc2db5f8df350","abstract_canon_sha256":"f090d04a12097d3ba654ef157e2d6c4748da6669fee3d9a27223a4d8a9ff0741"},"schema_version":"1.0"},"canonical_sha256":"aefbf5359868887fae4502dd5ebef3bc07be1d56ad196588d10f805457653952","source":{"kind":"arxiv","id":"2508.19898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.19898","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"arxiv_version","alias_value":"2508.19898v2","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19898","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"pith_short_12","alias_value":"V357KNMYNCEH","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"pith_short_16","alias_value":"V357KNMYNCEH7LSF","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"pith_short_8","alias_value":"V357KNMY","created_at":"2026-06-29T01:14:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V357KNMYNCEH7LSFALOV5PXTXQ","target":"record","payload":{"canonical_record":{"source":{"id":"2508.19898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-27T13:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"56c8353f83289b30d8305fc5505e0e12453304f8f03faf1e041cc2db5f8df350","abstract_canon_sha256":"f090d04a12097d3ba654ef157e2d6c4748da6669fee3d9a27223a4d8a9ff0741"},"schema_version":"1.0"},"canonical_sha256":"aefbf5359868887fae4502dd5ebef3bc07be1d56ad196588d10f805457653952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:23.799231Z","signature_b64":"+gJFuoP7sWDlFyc0qZN0FSI3xREzQFF7fwNfCE5snKn0tjiIUxN3BzFuCXGJciDiJgEGv4ZGvUkneuW+ML31AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aefbf5359868887fae4502dd5ebef3bc07be1d56ad196588d10f805457653952","last_reissued_at":"2026-06-29T01:14:23.798775Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:23.798775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.19898","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:14:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4fi2AYwEhuPTThe/Al5FtqWrS4w9H7Wb+WSl47uvlD2ERKim+LmlUU36PfR0VuC6fKLr79rXy8s0xNuQqaKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:47:45.687132Z"},"content_sha256":"680928cd80b773e2af242b219d94e3e31e9f3fcdfaf75b8cd5a1417f3f1eff37","schema_version":"1.0","event_id":"sha256:680928cd80b773e2af242b219d94e3e31e9f3fcdfaf75b8cd5a1417f3f1eff37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V357KNMYNCEH7LSFALOV5PXTXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Sparsest Cut via Eigenvalue Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tijn de Vos, Yannic Maus","submitted_at":"2025-08-27T13:54:03Z","abstract_excerpt":"We give new, improved bounds for approximating the sparsest cut value or in other words the conductance $\\phi$ of a graph in the CONGEST model. As our main result, we present an algorithm running in $O(\\log^2 n/\\phi)$ rounds in which every vertex outputs a value $\\tilde \\phi$ satisfying $\\phi \\le \\tilde \\phi \\le \\sqrt{2.01\\phi}$. In most regimes, our algorithm improves significantly over the previously fastest algorithm for the problem [Chen, Meierhans, Probst Gutenberg, Saranurak; SODA 25]. Additionally, our result generalizes to $k$-way conductance. We obtain these results, by approximating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19898","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.19898/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:14:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHrCJlD6f6GkDTFc5Rdxdpnt/3wnd8WTQl+VpzTjZ/f3ASCKTy+wEfekI8TRRY4PKuXOYgKl4E6qYiQ94zirDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:47:45.687896Z"},"content_sha256":"91469e57f262779d8527cf6fb5abf7b32946ca33f863aa181013fc5a4d5b1cef","schema_version":"1.0","event_id":"sha256:91469e57f262779d8527cf6fb5abf7b32946ca33f863aa181013fc5a4d5b1cef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V357KNMYNCEH7LSFALOV5PXTXQ/bundle.json","state_url":"https://pith.science/pith/V357KNMYNCEH7LSFALOV5PXTXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V357KNMYNCEH7LSFALOV5PXTXQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T05:47:45Z","links":{"resolver":"https://pith.science/pith/V357KNMYNCEH7LSFALOV5PXTXQ","bundle":"https://pith.science/pith/V357KNMYNCEH7LSFALOV5PXTXQ/bundle.json","state":"https://pith.science/pith/V357KNMYNCEH7LSFALOV5PXTXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V357KNMYNCEH7LSFALOV5PXTXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V357KNMYNCEH7LSFALOV5PXTXQ","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":"f090d04a12097d3ba654ef157e2d6c4748da6669fee3d9a27223a4d8a9ff0741","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-27T13:54:03Z","title_canon_sha256":"56c8353f83289b30d8305fc5505e0e12453304f8f03faf1e041cc2db5f8df350"},"schema_version":"1.0","source":{"id":"2508.19898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.19898","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"arxiv_version","alias_value":"2508.19898v2","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19898","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"pith_short_12","alias_value":"V357KNMYNCEH","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"pith_short_16","alias_value":"V357KNMYNCEH7LSF","created_at":"2026-06-29T01:14:23Z"},{"alias_kind":"pith_short_8","alias_value":"V357KNMY","created_at":"2026-06-29T01:14:23Z"}],"graph_snapshots":[{"event_id":"sha256:91469e57f262779d8527cf6fb5abf7b32946ca33f863aa181013fc5a4d5b1cef","target":"graph","created_at":"2026-06-29T01:14:23Z","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/2508.19898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give new, improved bounds for approximating the sparsest cut value or in other words the conductance $\\phi$ of a graph in the CONGEST model. As our main result, we present an algorithm running in $O(\\log^2 n/\\phi)$ rounds in which every vertex outputs a value $\\tilde \\phi$ satisfying $\\phi \\le \\tilde \\phi \\le \\sqrt{2.01\\phi}$. In most regimes, our algorithm improves significantly over the previously fastest algorithm for the problem [Chen, Meierhans, Probst Gutenberg, Saranurak; SODA 25]. Additionally, our result generalizes to $k$-way conductance. We obtain these results, by approximating ","authors_text":"Tijn de Vos, Yannic Maus","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-27T13:54:03Z","title":"Distributed Sparsest Cut via Eigenvalue Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19898","kind":"arxiv","version":2},"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:680928cd80b773e2af242b219d94e3e31e9f3fcdfaf75b8cd5a1417f3f1eff37","target":"record","created_at":"2026-06-29T01:14:23Z","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":"f090d04a12097d3ba654ef157e2d6c4748da6669fee3d9a27223a4d8a9ff0741","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-27T13:54:03Z","title_canon_sha256":"56c8353f83289b30d8305fc5505e0e12453304f8f03faf1e041cc2db5f8df350"},"schema_version":"1.0","source":{"id":"2508.19898","kind":"arxiv","version":2}},"canonical_sha256":"aefbf5359868887fae4502dd5ebef3bc07be1d56ad196588d10f805457653952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aefbf5359868887fae4502dd5ebef3bc07be1d56ad196588d10f805457653952","first_computed_at":"2026-06-29T01:14:23.798775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-29T01:14:23.798775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+gJFuoP7sWDlFyc0qZN0FSI3xREzQFF7fwNfCE5snKn0tjiIUxN3BzFuCXGJciDiJgEGv4ZGvUkneuW+ML31AQ==","signature_status":"signed_v1","signed_at":"2026-06-29T01:14:23.799231Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.19898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:680928cd80b773e2af242b219d94e3e31e9f3fcdfaf75b8cd5a1417f3f1eff37","sha256:91469e57f262779d8527cf6fb5abf7b32946ca33f863aa181013fc5a4d5b1cef"],"state_sha256":"cba0dd4539478220fff458f0cf292908ca0226bcaeb96890a97b992a386d19f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dedV9qMVZ5LI0Kc/RctS0O0vLbatG0zQd3PbzIOEbC4laDNdtjc6WYPtsLzK8xBx32ArklcqbKUJ4dG4+YhbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:47:45.695892Z","bundle_sha256":"83af2aab6882c23fcdfdae7047a85ab315453614d507e94ef2785f5da335cac6"}}