{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SU2FK7SMOOMRFLX3OR3LGFNCJF","short_pith_number":"pith:SU2FK7SM","canonical_record":{"source":{"id":"2605.20897","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T08:37:40Z","cross_cats_sorted":[],"title_canon_sha256":"93f4dc2236f84f670da9c3290f58143551753ce4ad1cb8dfc11171d31964e0cf","abstract_canon_sha256":"7fa5dfff6baf47e452ee4bb7d1c9cb7a8e2f713fde1f8e5e3d53d7c0ceab93dd"},"schema_version":"1.0"},"canonical_sha256":"9534557e4c739912aefb7476b315a2495d98f8162edbb75913e9ce8dd66bc129","source":{"kind":"arxiv","id":"2605.20897","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20897","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20897v1","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20897","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"SU2FK7SMOOMR","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"SU2FK7SMOOMRFLX3","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"SU2FK7SM","created_at":"2026-05-21T01:05:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SU2FK7SMOOMRFLX3OR3LGFNCJF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20897","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T08:37:40Z","cross_cats_sorted":[],"title_canon_sha256":"93f4dc2236f84f670da9c3290f58143551753ce4ad1cb8dfc11171d31964e0cf","abstract_canon_sha256":"7fa5dfff6baf47e452ee4bb7d1c9cb7a8e2f713fde1f8e5e3d53d7c0ceab93dd"},"schema_version":"1.0"},"canonical_sha256":"9534557e4c739912aefb7476b315a2495d98f8162edbb75913e9ce8dd66bc129","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:26.910804Z","signature_b64":"IF4mqcLPgQNSrYQvsm6f7nwI09R757yey6netXmDpdg+zS5xMQpSUuzH/L9gkH1QLmZGWqbhTX+7vAwJOMDjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9534557e4c739912aefb7476b315a2495d98f8162edbb75913e9ce8dd66bc129","last_reissued_at":"2026-05-21T01:05:26.910128Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:26.910128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20897","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-05-21T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBT/JOZRy6QDjuXh5p0Uns52d4kMrRDg+9350kLo+//rmVpLmHfr9Q1SJf067Uq2q3x0a8QFBS1D6hTe1hWgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:40:58.351941Z"},"content_sha256":"7914d3c1ededf8ce0a685a6627aa03fb7490e43b212ba558f7771a7ff33e6e27","schema_version":"1.0","event_id":"sha256:7914d3c1ededf8ce0a685a6627aa03fb7490e43b212ba558f7771a7ff33e6e27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SU2FK7SMOOMRFLX3OR3LGFNCJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Creating Robust and Fair Graph Structures for Connectivity and Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kushagra Chatterjee","submitted_at":"2026-05-20T08:37:40Z","abstract_excerpt":"Graph algorithms are central to large-scale applications such as navigation systems, social networks, and data analysis platforms. This thesis studies two important challenges in such systems: robustness to failures and fairness in clustering outcomes. In the first part, we investigate fault-tolerant reachability preservers in directed graphs. We present the first non-trivial constructions of dual fault-tolerant pairwise reachability preservers that remain resilient to two edge or vertex failures, achieving a sparse construction of size $O(n^{4/3}|\\mathcal{P}|^{1/3})$.\n  In the second part, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20897","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/2605.20897/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-05-21T01:05:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AGKCCpx2+lHLf7vjn3aXboS7WiMDuBgl/JJlYhTHSV9wbGQUd93JqZOTK4PHcyalmUCmD6QquTbJjhvr8j9YDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:40:58.352745Z"},"content_sha256":"5670fc4460a6872c24167de07182b2908d312508cf30020df8814228cbb3457d","schema_version":"1.0","event_id":"sha256:5670fc4460a6872c24167de07182b2908d312508cf30020df8814228cbb3457d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/bundle.json","state_url":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/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-05-23T15:40:58Z","links":{"resolver":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF","bundle":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/bundle.json","state":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SU2FK7SMOOMRFLX3OR3LGFNCJF","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":"7fa5dfff6baf47e452ee4bb7d1c9cb7a8e2f713fde1f8e5e3d53d7c0ceab93dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T08:37:40Z","title_canon_sha256":"93f4dc2236f84f670da9c3290f58143551753ce4ad1cb8dfc11171d31964e0cf"},"schema_version":"1.0","source":{"id":"2605.20897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20897","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20897v1","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20897","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"pith_short_12","alias_value":"SU2FK7SMOOMR","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"pith_short_16","alias_value":"SU2FK7SMOOMRFLX3","created_at":"2026-05-21T01:05:26Z"},{"alias_kind":"pith_short_8","alias_value":"SU2FK7SM","created_at":"2026-05-21T01:05:26Z"}],"graph_snapshots":[{"event_id":"sha256:5670fc4460a6872c24167de07182b2908d312508cf30020df8814228cbb3457d","target":"graph","created_at":"2026-05-21T01:05:26Z","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/2605.20897/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph algorithms are central to large-scale applications such as navigation systems, social networks, and data analysis platforms. This thesis studies two important challenges in such systems: robustness to failures and fairness in clustering outcomes. In the first part, we investigate fault-tolerant reachability preservers in directed graphs. We present the first non-trivial constructions of dual fault-tolerant pairwise reachability preservers that remain resilient to two edge or vertex failures, achieving a sparse construction of size $O(n^{4/3}|\\mathcal{P}|^{1/3})$.\n  In the second part, we","authors_text":"Kushagra Chatterjee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T08:37:40Z","title":"Creating Robust and Fair Graph Structures for Connectivity and Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20897","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:7914d3c1ededf8ce0a685a6627aa03fb7490e43b212ba558f7771a7ff33e6e27","target":"record","created_at":"2026-05-21T01:05:26Z","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":"7fa5dfff6baf47e452ee4bb7d1c9cb7a8e2f713fde1f8e5e3d53d7c0ceab93dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T08:37:40Z","title_canon_sha256":"93f4dc2236f84f670da9c3290f58143551753ce4ad1cb8dfc11171d31964e0cf"},"schema_version":"1.0","source":{"id":"2605.20897","kind":"arxiv","version":1}},"canonical_sha256":"9534557e4c739912aefb7476b315a2495d98f8162edbb75913e9ce8dd66bc129","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9534557e4c739912aefb7476b315a2495d98f8162edbb75913e9ce8dd66bc129","first_computed_at":"2026-05-21T01:05:26.910128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:26.910128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IF4mqcLPgQNSrYQvsm6f7nwI09R757yey6netXmDpdg+zS5xMQpSUuzH/L9gkH1QLmZGWqbhTX+7vAwJOMDjAQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:26.910804Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7914d3c1ededf8ce0a685a6627aa03fb7490e43b212ba558f7771a7ff33e6e27","sha256:5670fc4460a6872c24167de07182b2908d312508cf30020df8814228cbb3457d"],"state_sha256":"be21fc1e9c88a177df05f46bac6d143021b1d1811a5c8cfc2d63b87aaf01a108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6CXUwblmi3NgVKb4FWjd5U6D7MEKiDW7UGI2ze31JxY2gAtrpyZkqpsADcYKYArtwXkpJhu35dHe5A7jnTiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:40:58.357376Z","bundle_sha256":"cede7295bb3f1830af80f03ab96e84e3ab8605414f49037291bdc06ab07e3be0"}}