{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KBTO4UYXOB4BKOEQHITGCL55JP","short_pith_number":"pith:KBTO4UYX","schema_version":"1.0","canonical_sha256":"5066ee531770781538903a26612fbd4beadb7d1ac10fad1a66fc1be51588f676","source":{"kind":"arxiv","id":"2508.11863","version":1},"attestation_state":"computed","paper":{"title":"On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NI","math.IT","math.OC"],"primary_cat":"cs.SI","authors_text":"Eray Can Elumar, Mansi Sood, Osman Yagan","submitted_at":"2025-08-16T01:29:16Z","abstract_excerpt":"In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliable connectivity. Sparsity ensures communication overhead remains low, while reliable connectivity is tied to reliable communication and inference on decentralized data reservoirs and computational resources. A class of network models called random K-out graphs appear widely as a heuristic to balance connectivity and sparsity, especially in settings with limited trust, e.g., privacy-preserving aggregation of networked "},"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":"2508.11863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-08-16T01:29:16Z","cross_cats_sorted":["cs.IT","cs.LG","cs.NI","math.IT","math.OC"],"title_canon_sha256":"309d862cfb3e9a2d5dd5a15736f3a8571bfc16a1dffd7b2516df274bc443fc9a","abstract_canon_sha256":"6e564d3da82cef79cf1bf4a4c4cb3a8766633aa9140cd2ca13d86729cc44d3dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:55.871297Z","signature_b64":"kemOIRsJuSpsJS/4T7UseAIgbzJ9CWA+a6pqnkiqZ+K5/c+oeh+EVF81y3bgRi9QVCBEoPYUM7bWUI+zNwdGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5066ee531770781538903a26612fbd4beadb7d1ac10fad1a66fc1be51588f676","last_reissued_at":"2026-07-05T11:54:55.870723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:55.870723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NI","math.IT","math.OC"],"primary_cat":"cs.SI","authors_text":"Eray Can Elumar, Mansi Sood, Osman Yagan","submitted_at":"2025-08-16T01:29:16Z","abstract_excerpt":"In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliable connectivity. Sparsity ensures communication overhead remains low, while reliable connectivity is tied to reliable communication and inference on decentralized data reservoirs and computational resources. A class of network models called random K-out graphs appear widely as a heuristic to balance connectivity and sparsity, especially in settings with limited trust, e.g., privacy-preserving aggregation of networked "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11863","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/2508.11863/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":"2508.11863","created_at":"2026-07-05T11:54:55.870792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.11863v1","created_at":"2026-07-05T11:54:55.870792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11863","created_at":"2026-07-05T11:54:55.870792+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBTO4UYXOB4B","created_at":"2026-07-05T11:54:55.870792+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBTO4UYXOB4BKOEQ","created_at":"2026-07-05T11:54:55.870792+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBTO4UYX","created_at":"2026-07-05T11:54:55.870792+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/KBTO4UYXOB4BKOEQHITGCL55JP","json":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP.json","graph_json":"https://pith.science/api/pith-number/KBTO4UYXOB4BKOEQHITGCL55JP/graph.json","events_json":"https://pith.science/api/pith-number/KBTO4UYXOB4BKOEQHITGCL55JP/events.json","paper":"https://pith.science/paper/KBTO4UYX"},"agent_actions":{"view_html":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP","download_json":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP.json","view_paper":"https://pith.science/paper/KBTO4UYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.11863&json=true","fetch_graph":"https://pith.science/api/pith-number/KBTO4UYXOB4BKOEQHITGCL55JP/graph.json","fetch_events":"https://pith.science/api/pith-number/KBTO4UYXOB4BKOEQHITGCL55JP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP/action/storage_attestation","attest_author":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP/action/author_attestation","sign_citation":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP/action/citation_signature","submit_replication":"https://pith.science/pith/KBTO4UYXOB4BKOEQHITGCL55JP/action/replication_record"}},"created_at":"2026-07-05T11:54:55.870792+00:00","updated_at":"2026-07-05T11:54:55.870792+00:00"}