{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:44EPKUN5JAZGGPAIETQJ2BUNST","short_pith_number":"pith:44EPKUN5","canonical_record":{"source":{"id":"2507.19632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-25T18:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"7570b4e22db1850fdde2b1171a8d458ed3f687a5f033c2188d121a0cc4949f82","abstract_canon_sha256":"ad51140cb0b82aa52e43c7d9931409cdc668e0ae4a1b8a63c6d573a96e34142e"},"schema_version":"1.0"},"canonical_sha256":"e708f551bd4832633c0824e09d068d94f4e4b95f1b88d83b284abbe9bc802de0","source":{"kind":"arxiv","id":"2507.19632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19632","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19632v1","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19632","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"44EPKUN5JAZG","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"pith_short_16","alias_value":"44EPKUN5JAZGGPAI","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"pith_short_8","alias_value":"44EPKUN5","created_at":"2026-07-05T11:43:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:44EPKUN5JAZGGPAIETQJ2BUNST","target":"record","payload":{"canonical_record":{"source":{"id":"2507.19632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-25T18:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"7570b4e22db1850fdde2b1171a8d458ed3f687a5f033c2188d121a0cc4949f82","abstract_canon_sha256":"ad51140cb0b82aa52e43c7d9931409cdc668e0ae4a1b8a63c6d573a96e34142e"},"schema_version":"1.0"},"canonical_sha256":"e708f551bd4832633c0824e09d068d94f4e4b95f1b88d83b284abbe9bc802de0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:37.999080Z","signature_b64":"hlsoIj26uEoi9aqCNyyO1Q0MSnwqcuxUK+KykOSff1qa+qmToUWdtSAfvsqme9B3W3n1ewzN2lTCRwILR7Q2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e708f551bd4832633c0824e09d068d94f4e4b95f1b88d83b284abbe9bc802de0","last_reissued_at":"2026-07-05T11:43:37.998637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:37.998637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.19632","source_version":1,"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-05T11:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOKE52YKEtQg3jnPaKXn1kNGSkBfr/NqxLQseqcQor7NmZCZq71UMxx07oTUWyckz/steuthByOZqiB9iyrdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:45:06.956599Z"},"content_sha256":"6323afe5c5471e64bb224350a27dc554f73b29dd10f6250bf596a1597d181847","schema_version":"1.0","event_id":"sha256:6323afe5c5471e64bb224350a27dc554f73b29dd10f6250bf596a1597d181847"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:44EPKUN5JAZGGPAIETQJ2BUNST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yibin Zhao","submitted_at":"2025-07-25T18:59:47Z","abstract_excerpt":"Recent years have seen extensive research on directed graph sparsification. In this work, we initiate the study of fast fully dynamic spectral and cut sparsification algorithms for directed graphs.\n  We introduce a new notion of spectral sparsification called degree-balance preserving spectral approximation, which maintains the difference between the in-degree and out-degree of each vertex. The approximation error is measured with respect to the corresponding undirected Laplacian. This notion is equivalent to direct Eulerian spectral approximation when the input graph is Eulerian. Our algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19632","kind":"arxiv","version":1},"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/2507.19632/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-05T11:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlohUkAmyox28TotUddmbICS6CDO672o6PKAQ5nJwYCFULC9hHMFx7EyqUJX+i1P/IFTSip1KIY8vOTtdUUsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:45:06.957118Z"},"content_sha256":"c2be8ce8b31f862ef73d5fb9e42d49fb768e7ce53640d5983f0840be10ad2665","schema_version":"1.0","event_id":"sha256:c2be8ce8b31f862ef73d5fb9e42d49fb768e7ce53640d5983f0840be10ad2665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44EPKUN5JAZGGPAIETQJ2BUNST/bundle.json","state_url":"https://pith.science/pith/44EPKUN5JAZGGPAIETQJ2BUNST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44EPKUN5JAZGGPAIETQJ2BUNST/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-04T07:45:06Z","links":{"resolver":"https://pith.science/pith/44EPKUN5JAZGGPAIETQJ2BUNST","bundle":"https://pith.science/pith/44EPKUN5JAZGGPAIETQJ2BUNST/bundle.json","state":"https://pith.science/pith/44EPKUN5JAZGGPAIETQJ2BUNST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44EPKUN5JAZGGPAIETQJ2BUNST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:44EPKUN5JAZGGPAIETQJ2BUNST","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":"ad51140cb0b82aa52e43c7d9931409cdc668e0ae4a1b8a63c6d573a96e34142e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-25T18:59:47Z","title_canon_sha256":"7570b4e22db1850fdde2b1171a8d458ed3f687a5f033c2188d121a0cc4949f82"},"schema_version":"1.0","source":{"id":"2507.19632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19632","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19632v1","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19632","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"44EPKUN5JAZG","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"pith_short_16","alias_value":"44EPKUN5JAZGGPAI","created_at":"2026-07-05T11:43:37Z"},{"alias_kind":"pith_short_8","alias_value":"44EPKUN5","created_at":"2026-07-05T11:43:37Z"}],"graph_snapshots":[{"event_id":"sha256:c2be8ce8b31f862ef73d5fb9e42d49fb768e7ce53640d5983f0840be10ad2665","target":"graph","created_at":"2026-07-05T11:43:37Z","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/2507.19632/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent years have seen extensive research on directed graph sparsification. In this work, we initiate the study of fast fully dynamic spectral and cut sparsification algorithms for directed graphs.\n  We introduce a new notion of spectral sparsification called degree-balance preserving spectral approximation, which maintains the difference between the in-degree and out-degree of each vertex. The approximation error is measured with respect to the corresponding undirected Laplacian. This notion is equivalent to direct Eulerian spectral approximation when the input graph is Eulerian. Our algorith","authors_text":"Yibin Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-25T18:59:47Z","title":"Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19632","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:6323afe5c5471e64bb224350a27dc554f73b29dd10f6250bf596a1597d181847","target":"record","created_at":"2026-07-05T11:43:37Z","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":"ad51140cb0b82aa52e43c7d9931409cdc668e0ae4a1b8a63c6d573a96e34142e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-25T18:59:47Z","title_canon_sha256":"7570b4e22db1850fdde2b1171a8d458ed3f687a5f033c2188d121a0cc4949f82"},"schema_version":"1.0","source":{"id":"2507.19632","kind":"arxiv","version":1}},"canonical_sha256":"e708f551bd4832633c0824e09d068d94f4e4b95f1b88d83b284abbe9bc802de0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e708f551bd4832633c0824e09d068d94f4e4b95f1b88d83b284abbe9bc802de0","first_computed_at":"2026-07-05T11:43:37.998637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:37.998637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hlsoIj26uEoi9aqCNyyO1Q0MSnwqcuxUK+KykOSff1qa+qmToUWdtSAfvsqme9B3W3n1ewzN2lTCRwILR7Q2BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:37.999080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6323afe5c5471e64bb224350a27dc554f73b29dd10f6250bf596a1597d181847","sha256:c2be8ce8b31f862ef73d5fb9e42d49fb768e7ce53640d5983f0840be10ad2665"],"state_sha256":"749ba0617a633800f31f7afb14eb65e31ed682bf503724f95899035fca0e19d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s9N8Ddolf5USvkDvMkgJO2V85IcqH9QiXGbmahFxmT1o7Z8x0dqYvL65QEhojUUcVvJz+C/luxjmwjgRzNe4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T07:45:06.969925Z","bundle_sha256":"c100d96a71c417a92929c8f2e5c8451e5cca9b4bed456b2f19be4b4f0fef027e"}}