{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4TRQK4OVGUZKSJT37XGUC5YHJC","short_pith_number":"pith:4TRQK4OV","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"},"canonical_sha256":"e4e30571d53532a9267bfdcd41770748b8241c07f4d7c649512016fd05cafb16","source":{"kind":"arxiv","id":"1107.5645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5645","created_at":"2026-05-18T04:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5645v1","created_at":"2026-05-18T04:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5645","created_at":"2026-05-18T04:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"4TRQK4OVGUZK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4TRQK4OVGUZKSJT3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4TRQK4OV","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4TRQK4OVGUZKSJT37XGUC5YHJC","target":"record","payload":{"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"},"canonical_sha256":"e4e30571d53532a9267bfdcd41770748b8241c07f4d7c649512016fd05cafb16","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"},"source_kind":"arxiv","source_id":"1107.5645","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-18T04:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEjxI3mWPOna0DWK3h5VdiBXoz8A8Q0lU/39CwM3jsVTGUDELaRHAyPjq0E0mql9cdeSOHcnKZWRUkyXXGNoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:06:26.182267Z"},"content_sha256":"cc1dcf7dbf1510562ee5e66e03e13c62f9a884bdb233c364e6279606aad37997","schema_version":"1.0","event_id":"sha256:cc1dcf7dbf1510562ee5e66e03e13c62f9a884bdb233c364e6279606aad37997"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4TRQK4OVGUZKSJT37XGUC5YHJC","target":"graph","payload":{"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"},"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-18T04:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbc2K0vnRxWWKguylL06yCbtkMnWRXQqKGr1f2oEdMlN2cr5DC+Tmv6AEiVT+JknpNjzHmh6eso7Epk5L9A4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:06:26.182841Z"},"content_sha256":"dbe9c206c2c26bc70af03d2ec57cdf625f9a716743f06275931dce21f93ee78b","schema_version":"1.0","event_id":"sha256:dbe9c206c2c26bc70af03d2ec57cdf625f9a716743f06275931dce21f93ee78b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/bundle.json","state_url":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/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-06-07T02:06:26Z","links":{"resolver":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC","bundle":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/bundle.json","state":"https://pith.science/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TRQK4OVGUZKSJT37XGUC5YHJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4TRQK4OVGUZKSJT37XGUC5YHJC","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":"40761f78adba445f89320c2d0b541373862c104f51cdfbed81307d58dc6840c0","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T08:40:55Z","title_canon_sha256":"3d8dcb795eaab00816aeff43acaacf40680645de297510ba8c53921564daa6d8"},"schema_version":"1.0","source":{"id":"1107.5645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5645","created_at":"2026-05-18T04:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5645v1","created_at":"2026-05-18T04:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5645","created_at":"2026-05-18T04:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"4TRQK4OVGUZK","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4TRQK4OVGUZKSJT3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4TRQK4OV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:dbe9c206c2c26bc70af03d2ec57cdf625f9a716743f06275931dce21f93ee78b","target":"graph","created_at":"2026-05-18T04:16:41Z","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"},"paper":{"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.","authors_text":"Chi Wan Sung, Kenneth W. Shum, Quan Yu","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T08:40:55Z","title":"Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5645","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:cc1dcf7dbf1510562ee5e66e03e13c62f9a884bdb233c364e6279606aad37997","target":"record","created_at":"2026-05-18T04:16:41Z","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":"40761f78adba445f89320c2d0b541373862c104f51cdfbed81307d58dc6840c0","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T08:40:55Z","title_canon_sha256":"3d8dcb795eaab00816aeff43acaacf40680645de297510ba8c53921564daa6d8"},"schema_version":"1.0","source":{"id":"1107.5645","kind":"arxiv","version":1}},"canonical_sha256":"e4e30571d53532a9267bfdcd41770748b8241c07f4d7c649512016fd05cafb16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4e30571d53532a9267bfdcd41770748b8241c07f4d7c649512016fd05cafb16","first_computed_at":"2026-05-18T04:16:41.636177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:41.636177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQZips12yUGPS7zHNXji2WjjPp3rgL8Av6of2Cs/tOpiilYpH2ykROawyV5p6SoEFXBB7WaNusz8ASVNojmRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:41.637040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc1dcf7dbf1510562ee5e66e03e13c62f9a884bdb233c364e6279606aad37997","sha256:dbe9c206c2c26bc70af03d2ec57cdf625f9a716743f06275931dce21f93ee78b"],"state_sha256":"c8e20dbfb8fdd4f3a4f45da16b8d2a2539dc786d6b7a3c1e17595b59af988efe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoKv8s0HZETE3p07Xp5/HeMOE3F2C4pgahK/CV/pRdfvtfgkWJdYZRpAmFvOUwwp9g7v+/XyExTSfGA8KLPnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:06:26.185880Z","bundle_sha256":"4c89a8fa36e095b3ba6ca7fe89301cea50505c231e516b00e8fc4db75a647ca1"}}