{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4TRQK4OVGUZKSJT37XGUC5YHJC","short_pith_number":"pith:4TRQK4OV","schema_version":"1.0","canonical_sha256":"e4e30571d53532a9267bfdcd41770748b8241c07f4d7c649512016fd05cafb16","source":{"kind":"arxiv","id":"1107.5645","version":1},"attestation_state":"computed","paper":{"title":"Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Chi Wan Sung, Kenneth W. Shum, Quan Yu","submitted_at":"2011-07-28T08:40:55Z","abstract_excerpt":"In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the feasible region of the storage capacities of the nodes can be determined. The storage cost minimization can then be reduced to a linear programming problem, which can be readily solved. Moreover, the tradeoff between storage cost and repair-bandwidth is established."},"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":"1107.5645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T08:40:55Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"3d8dcb795eaab00816aeff43acaacf40680645de297510ba8c53921564daa6d8","abstract_canon_sha256":"40761f78adba445f89320c2d0b541373862c104f51cdfbed81307d58dc6840c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:41.637040Z","signature_b64":"XQZips12yUGPS7zHNXji2WjjPp3rgL8Av6of2Cs/tOpiilYpH2ykROawyV5p6SoEFXBB7WaNusz8ASVNojmRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e30571d53532a9267bfdcd41770748b8241c07f4d7c649512016fd05cafb16","last_reissued_at":"2026-05-18T04:16:41.636177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:41.636177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Chi Wan Sung, Kenneth W. Shum, Quan Yu","submitted_at":"2011-07-28T08:40:55Z","abstract_excerpt":"In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the feasible region of the storage capacities of the nodes can be determined. The storage cost minimization can then be reduced to a linear programming problem, which can be readily solved. Moreover, the tradeoff between storage cost and repair-bandwidth is established."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5645","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":""},"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":"1107.5645","created_at":"2026-05-18T04:16:41.636285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5645v1","created_at":"2026-05-18T04:16:41.636285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5645","created_at":"2026-05-18T04:16:41.636285+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TRQK4OVGUZK","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TRQK4OVGUZKSJT3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TRQK4OV","created_at":"2026-05-18T12:26:20.644004+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/4TRQK4OVGUZKSJT37XGUC5YHJC","json":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC.json","graph_json":"https://pith.science/api/pith-number/4TRQK4OVGUZKSJT37XGUC5YHJC/graph.json","events_json":"https://pith.science/api/pith-number/4TRQK4OVGUZKSJT37XGUC5YHJC/events.json","paper":"https://pith.science/paper/4TRQK4OV"},"agent_actions":{"view_html":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC","download_json":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC.json","view_paper":"https://pith.science/paper/4TRQK4OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5645&json=true","fetch_graph":"https://pith.science/api/pith-number/4TRQK4OVGUZKSJT37XGUC5YHJC/graph.json","fetch_events":"https://pith.science/api/pith-number/4TRQK4OVGUZKSJT37XGUC5YHJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/action/storage_attestation","attest_author":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/action/author_attestation","sign_citation":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/action/citation_signature","submit_replication":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/action/replication_record"}},"created_at":"2026-05-18T04:16:41.636285+00:00","updated_at":"2026-05-18T04:16:41.636285+00:00"}