{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AJWQVHTTBUMKIKU6FERMH7MT2C","short_pith_number":"pith:AJWQVHTT","schema_version":"1.0","canonical_sha256":"026d0a9e730d18a42a9e2922c3fd93d0bd48f413e3930d62fb0bfe12edde4521","source":{"kind":"arxiv","id":"1710.02821","version":2},"attestation_state":"computed","paper":{"title":"Capacity of Clustered Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Beongjun Choi, Jaekyun Moon, Jy-yong Sohn, Sung Whan Yoon","submitted_at":"2017-10-08T11:25:39Z","abstract_excerpt":"A new system model reflecting the clustered structure of distributed storage is suggested to investigate interplay between storage overhead and repair bandwidth as storage node failures occur. Large data centers with multiple racks/disks or local networks of storage devices (e.g. sensor network) are good applications of the suggested clustered model. In realistic scenarios involving clustered storage structures, repairing storage nodes using intact nodes residing in other clusters is more bandwidth-consuming than restoring nodes based on information from intra-cluster nodes. Therefore, it is i"},"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":"1710.02821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-08T11:25:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79cec00eb4a492bef5db81c2591802f622e813a1e04a7494aa3f58463d990078","abstract_canon_sha256":"20a78be62a6d407f8eff3485d3e2b75c400c5f97485a573b4bae853b28ec85be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:08.872910Z","signature_b64":"6P3FNXMl0qvFACxSVrmnGp5/AHGLAXC/6Ohx2a3k0m809vDijWOoXCZhLxGb09xt5447BgNASqmW1P18dhyeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"026d0a9e730d18a42a9e2922c3fd93d0bd48f413e3930d62fb0bfe12edde4521","last_reissued_at":"2026-05-18T00:17:08.872235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:08.872235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Clustered Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Beongjun Choi, Jaekyun Moon, Jy-yong Sohn, Sung Whan Yoon","submitted_at":"2017-10-08T11:25:39Z","abstract_excerpt":"A new system model reflecting the clustered structure of distributed storage is suggested to investigate interplay between storage overhead and repair bandwidth as storage node failures occur. Large data centers with multiple racks/disks or local networks of storage devices (e.g. sensor network) are good applications of the suggested clustered model. In realistic scenarios involving clustered storage structures, repairing storage nodes using intact nodes residing in other clusters is more bandwidth-consuming than restoring nodes based on information from intra-cluster nodes. Therefore, it is i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02821","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1710.02821","created_at":"2026-05-18T00:17:08.872386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02821v2","created_at":"2026-05-18T00:17:08.872386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02821","created_at":"2026-05-18T00:17:08.872386+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJWQVHTTBUMK","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJWQVHTTBUMKIKU6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJWQVHTT","created_at":"2026-05-18T12:31:05.417338+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/AJWQVHTTBUMKIKU6FERMH7MT2C","json":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C.json","graph_json":"https://pith.science/api/pith-number/AJWQVHTTBUMKIKU6FERMH7MT2C/graph.json","events_json":"https://pith.science/api/pith-number/AJWQVHTTBUMKIKU6FERMH7MT2C/events.json","paper":"https://pith.science/paper/AJWQVHTT"},"agent_actions":{"view_html":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C","download_json":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C.json","view_paper":"https://pith.science/paper/AJWQVHTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02821&json=true","fetch_graph":"https://pith.science/api/pith-number/AJWQVHTTBUMKIKU6FERMH7MT2C/graph.json","fetch_events":"https://pith.science/api/pith-number/AJWQVHTTBUMKIKU6FERMH7MT2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C/action/storage_attestation","attest_author":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C/action/author_attestation","sign_citation":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C/action/citation_signature","submit_replication":"https://pith.science/pith/AJWQVHTTBUMKIKU6FERMH7MT2C/action/replication_record"}},"created_at":"2026-05-18T00:17:08.872386+00:00","updated_at":"2026-05-18T00:17:08.872386+00:00"}