{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QS2FOLO6W66F2R5Q3N4RG76NE5","short_pith_number":"pith:QS2FOLO6","schema_version":"1.0","canonical_sha256":"84b4572ddeb7bc5d47b0db79137fcd2755af3b24d9e55ed9eeeb3e8d8bb544a9","source":{"kind":"arxiv","id":"1305.6864","version":1},"attestation_state":"computed","paper":{"title":"Resolution-aware network coded storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emina Soljanin, Muriel M\\'edard, Tong Wang, Ulric J. Ferner","submitted_at":"2013-05-29T16:52:44Z","abstract_excerpt":"In this paper, we show that coding can be used in storage area networks (SANs) to improve various quality of service metrics under normal SAN operating conditions, without requiring additional storage space. For our analysis, we develop a model which captures modern characteristics such as constrained I/O access bandwidth limitations. Using this model, we consider two important cases: single-resolution (SR) and multi-resolution (MR) systems. For SR systems, we use blocking probability as the quality of service metric and propose the network coded storage (NCS) scheme as a way to reduce blockin"},"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":"1305.6864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-29T16:52:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ca4261d0ff3cf8772aaf7ffa3edba0a6c5ec3cdf1faf44569facf78a6f8782e","abstract_canon_sha256":"5d03c68c2f71b1a71d3d2629cdbc5e2d8eb01c7aea62fb604576fa552ea418ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:17.755434Z","signature_b64":"ITK5i8L+HtrTQfOkppdUQ6pege3HV8sq2srGMJdIOqXAudaIG9AoTawGKcw3Dc8cgfuVjw12hGAunI0gD0FwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84b4572ddeb7bc5d47b0db79137fcd2755af3b24d9e55ed9eeeb3e8d8bb544a9","last_reissued_at":"2026-05-18T03:22:17.754863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:17.754863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolution-aware network coded storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emina Soljanin, Muriel M\\'edard, Tong Wang, Ulric J. Ferner","submitted_at":"2013-05-29T16:52:44Z","abstract_excerpt":"In this paper, we show that coding can be used in storage area networks (SANs) to improve various quality of service metrics under normal SAN operating conditions, without requiring additional storage space. For our analysis, we develop a model which captures modern characteristics such as constrained I/O access bandwidth limitations. Using this model, we consider two important cases: single-resolution (SR) and multi-resolution (MR) systems. For SR systems, we use blocking probability as the quality of service metric and propose the network coded storage (NCS) scheme as a way to reduce blockin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6864","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":"1305.6864","created_at":"2026-05-18T03:22:17.754946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6864v1","created_at":"2026-05-18T03:22:17.754946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6864","created_at":"2026-05-18T03:22:17.754946+00:00"},{"alias_kind":"pith_short_12","alias_value":"QS2FOLO6W66F","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QS2FOLO6W66F2R5Q","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QS2FOLO6","created_at":"2026-05-18T12:27:57.521954+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/QS2FOLO6W66F2R5Q3N4RG76NE5","json":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5.json","graph_json":"https://pith.science/api/pith-number/QS2FOLO6W66F2R5Q3N4RG76NE5/graph.json","events_json":"https://pith.science/api/pith-number/QS2FOLO6W66F2R5Q3N4RG76NE5/events.json","paper":"https://pith.science/paper/QS2FOLO6"},"agent_actions":{"view_html":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5","download_json":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5.json","view_paper":"https://pith.science/paper/QS2FOLO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6864&json=true","fetch_graph":"https://pith.science/api/pith-number/QS2FOLO6W66F2R5Q3N4RG76NE5/graph.json","fetch_events":"https://pith.science/api/pith-number/QS2FOLO6W66F2R5Q3N4RG76NE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5/action/storage_attestation","attest_author":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5/action/author_attestation","sign_citation":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5/action/citation_signature","submit_replication":"https://pith.science/pith/QS2FOLO6W66F2R5Q3N4RG76NE5/action/replication_record"}},"created_at":"2026-05-18T03:22:17.754946+00:00","updated_at":"2026-05-18T03:22:17.754946+00:00"}