{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SRSNIEWR2CQJXHWDKYQKDFSJMV","short_pith_number":"pith:SRSNIEWR","schema_version":"1.0","canonical_sha256":"9464d412d1d0a09b9ec35620a196496575eec2dc26503f37f8ebd224ac853ebb","source":{"kind":"arxiv","id":"2211.11384","version":3},"attestation_state":"computed","paper":{"title":"Expander Decomposition in Dynamic Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Michael Kapralov, Mikhail Makarov","submitted_at":"2022-11-21T11:56:42Z","abstract_excerpt":"In this paper we initiate the study of expander decompositions of a graph $G=(V, E)$ in the streaming model of computation. The goal is to find a partitioning $\\mathcal{C}$ of vertices $V$ such that the subgraphs of $G$ induced by the clusters $C \\in \\mathcal{C}$ are good expanders, while the number of intercluster edges is small. Expander decompositions are classically constructed by a recursively applying balanced sparse cuts to the input graph. In this paper we give the first implementation of such a recursive sparsest cut process using small space in the dynamic streaming model.\n  Our main"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2211.11384","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T11:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"5fbe2c7930590c2f3b1e609177a07feaee0f46f0cf2463f6b3c6add0d9f6cf2e","abstract_canon_sha256":"6c99d49f96f41ef82182451a79f4839fdceae8c6afd314927eb18c510a915c1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:11.583834Z","signature_b64":"VcedxLVo+XHv4NUYziC2dYcePgMmxQWKAbodZCkiu9Fz8n4OAm9z6OZTyeRqP6mZdDupPWmGjbcUcAnv9/diDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9464d412d1d0a09b9ec35620a196496575eec2dc26503f37f8ebd224ac853ebb","last_reissued_at":"2026-07-05T06:37:11.583419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:11.583419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expander Decomposition in Dynamic Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Michael Kapralov, Mikhail Makarov","submitted_at":"2022-11-21T11:56:42Z","abstract_excerpt":"In this paper we initiate the study of expander decompositions of a graph $G=(V, E)$ in the streaming model of computation. The goal is to find a partitioning $\\mathcal{C}$ of vertices $V$ such that the subgraphs of $G$ induced by the clusters $C \\in \\mathcal{C}$ are good expanders, while the number of intercluster edges is small. Expander decompositions are classically constructed by a recursively applying balanced sparse cuts to the input graph. In this paper we give the first implementation of such a recursive sparsest cut process using small space in the dynamic streaming model.\n  Our main"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11384","kind":"arxiv","version":3},"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/2211.11384/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.11384","created_at":"2026-07-05T06:37:11.583476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.11384v3","created_at":"2026-07-05T06:37:11.583476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11384","created_at":"2026-07-05T06:37:11.583476+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRSNIEWR2CQJ","created_at":"2026-07-05T06:37:11.583476+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRSNIEWR2CQJXHWD","created_at":"2026-07-05T06:37:11.583476+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRSNIEWR","created_at":"2026-07-05T06:37:11.583476+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV","json":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV.json","graph_json":"https://pith.science/api/pith-number/SRSNIEWR2CQJXHWDKYQKDFSJMV/graph.json","events_json":"https://pith.science/api/pith-number/SRSNIEWR2CQJXHWDKYQKDFSJMV/events.json","paper":"https://pith.science/paper/SRSNIEWR"},"agent_actions":{"view_html":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV","download_json":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV.json","view_paper":"https://pith.science/paper/SRSNIEWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.11384&json=true","fetch_graph":"https://pith.science/api/pith-number/SRSNIEWR2CQJXHWDKYQKDFSJMV/graph.json","fetch_events":"https://pith.science/api/pith-number/SRSNIEWR2CQJXHWDKYQKDFSJMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/action/storage_attestation","attest_author":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/action/author_attestation","sign_citation":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/action/citation_signature","submit_replication":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/action/replication_record"}},"created_at":"2026-07-05T06:37:11.583476+00:00","updated_at":"2026-07-05T06:37:11.583476+00:00"}