{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SU2FK7SMOOMRFLX3OR3LGFNCJF","short_pith_number":"pith:SU2FK7SM","schema_version":"1.0","canonical_sha256":"9534557e4c739912aefb7476b315a2495d98f8162edbb75913e9ce8dd66bc129","source":{"kind":"arxiv","id":"2605.20897","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.20897","created_at":"2026-05-21T01:05:26.910218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20897v1","created_at":"2026-05-21T01:05:26.910218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20897","created_at":"2026-05-21T01:05:26.910218+00:00"},{"alias_kind":"pith_short_12","alias_value":"SU2FK7SMOOMR","created_at":"2026-05-21T01:05:26.910218+00:00"},{"alias_kind":"pith_short_16","alias_value":"SU2FK7SMOOMRFLX3","created_at":"2026-05-21T01:05:26.910218+00:00"},{"alias_kind":"pith_short_8","alias_value":"SU2FK7SM","created_at":"2026-05-21T01:05:26.910218+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/SU2FK7SMOOMRFLX3OR3LGFNCJF","json":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF.json","graph_json":"https://pith.science/api/pith-number/SU2FK7SMOOMRFLX3OR3LGFNCJF/graph.json","events_json":"https://pith.science/api/pith-number/SU2FK7SMOOMRFLX3OR3LGFNCJF/events.json","paper":"https://pith.science/paper/SU2FK7SM"},"agent_actions":{"view_html":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF","download_json":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF.json","view_paper":"https://pith.science/paper/SU2FK7SM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20897&json=true","fetch_graph":"https://pith.science/api/pith-number/SU2FK7SMOOMRFLX3OR3LGFNCJF/graph.json","fetch_events":"https://pith.science/api/pith-number/SU2FK7SMOOMRFLX3OR3LGFNCJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/action/storage_attestation","attest_author":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/action/author_attestation","sign_citation":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/action/citation_signature","submit_replication":"https://pith.science/pith/SU2FK7SMOOMRFLX3OR3LGFNCJF/action/replication_record"}},"created_at":"2026-05-21T01:05:26.910218+00:00","updated_at":"2026-05-21T01:05:26.910218+00:00"}