{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:SRSNIEWR2CQJXHWDKYQKDFSJMV","short_pith_number":"pith:SRSNIEWR","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"},"canonical_sha256":"9464d412d1d0a09b9ec35620a196496575eec2dc26503f37f8ebd224ac853ebb","source":{"kind":"arxiv","id":"2211.11384","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11384","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11384v3","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11384","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"SRSNIEWR2CQJ","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"pith_short_16","alias_value":"SRSNIEWR2CQJXHWD","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"pith_short_8","alias_value":"SRSNIEWR","created_at":"2026-07-05T06:37:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:SRSNIEWR2CQJXHWDKYQKDFSJMV","target":"record","payload":{"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"},"canonical_sha256":"9464d412d1d0a09b9ec35620a196496575eec2dc26503f37f8ebd224ac853ebb","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"},"source_kind":"arxiv","source_id":"2211.11384","source_version":3,"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-07-05T06:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIVHZjy4392SBdRYFq9IZCACy+/16qSM0Rotgn/R4lXaroTCmFeRu1keXL7ggyKOlrHMrDRYxD0XzGhTu+ZtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:51:44.461901Z"},"content_sha256":"d061a8805a47c818a53f12edbb79641f9c84f358a257957d39eacb29a077b80f","schema_version":"1.0","event_id":"sha256:d061a8805a47c818a53f12edbb79641f9c84f358a257957d39eacb29a077b80f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:SRSNIEWR2CQJXHWDKYQKDFSJMV","target":"graph","payload":{"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"},"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-07-05T06:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvlO+JUKoDX3YIbv0n0+cjPfybUyKC2TvywTFHo1rV7Vm5A6NwJTQ8XXxp2e/GnYZ+SDtg5fnuxPBce0PjbJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:51:44.462425Z"},"content_sha256":"e3ace7269d462e1b9b34f096198242fe50dc41b94cb67da3fbe6ff1a75fa656d","schema_version":"1.0","event_id":"sha256:e3ace7269d462e1b9b34f096198242fe50dc41b94cb67da3fbe6ff1a75fa656d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/bundle.json","state_url":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/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-15T15:51:44Z","links":{"resolver":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV","bundle":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/bundle.json","state":"https://pith.science/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRSNIEWR2CQJXHWDKYQKDFSJMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SRSNIEWR2CQJXHWDKYQKDFSJMV","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":"6c99d49f96f41ef82182451a79f4839fdceae8c6afd314927eb18c510a915c1f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T11:56:42Z","title_canon_sha256":"5fbe2c7930590c2f3b1e609177a07feaee0f46f0cf2463f6b3c6add0d9f6cf2e"},"schema_version":"1.0","source":{"id":"2211.11384","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11384","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11384v3","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11384","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"SRSNIEWR2CQJ","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"pith_short_16","alias_value":"SRSNIEWR2CQJXHWD","created_at":"2026-07-05T06:37:11Z"},{"alias_kind":"pith_short_8","alias_value":"SRSNIEWR","created_at":"2026-07-05T06:37:11Z"}],"graph_snapshots":[{"event_id":"sha256:e3ace7269d462e1b9b34f096198242fe50dc41b94cb67da3fbe6ff1a75fa656d","target":"graph","created_at":"2026-07-05T06:37:11Z","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/2211.11384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arnold Filtser, Michael Kapralov, Mikhail Makarov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T11:56:42Z","title":"Expander Decomposition in Dynamic Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11384","kind":"arxiv","version":3},"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:d061a8805a47c818a53f12edbb79641f9c84f358a257957d39eacb29a077b80f","target":"record","created_at":"2026-07-05T06:37:11Z","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":"6c99d49f96f41ef82182451a79f4839fdceae8c6afd314927eb18c510a915c1f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-21T11:56:42Z","title_canon_sha256":"5fbe2c7930590c2f3b1e609177a07feaee0f46f0cf2463f6b3c6add0d9f6cf2e"},"schema_version":"1.0","source":{"id":"2211.11384","kind":"arxiv","version":3}},"canonical_sha256":"9464d412d1d0a09b9ec35620a196496575eec2dc26503f37f8ebd224ac853ebb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9464d412d1d0a09b9ec35620a196496575eec2dc26503f37f8ebd224ac853ebb","first_computed_at":"2026-07-05T06:37:11.583419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:37:11.583419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VcedxLVo+XHv4NUYziC2dYcePgMmxQWKAbodZCkiu9Fz8n4OAm9z6OZTyeRqP6mZdDupPWmGjbcUcAnv9/diDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:37:11.583834Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.11384","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d061a8805a47c818a53f12edbb79641f9c84f358a257957d39eacb29a077b80f","sha256:e3ace7269d462e1b9b34f096198242fe50dc41b94cb67da3fbe6ff1a75fa656d"],"state_sha256":"6ccaa170cfd9d7e6dcf054832971ab0d859bb688d42575381f8e8b7f00090f2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAuwy59DUEt2yfxnnmW/cewiBg0kUAOubdcngcuRgeRABn+8bbkvtjTBKxuz+4pcB0k3RtGkWwAUSgYV9Pp7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:51:44.466511Z","bundle_sha256":"6ff64f18e4df4e5408ce1ff128a711ab92dafe592fa4913e1feca3966f2b504d"}}