{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LVOZIAA2Q6LZ6IQY6CD7L6PGUJ","short_pith_number":"pith:LVOZIAA2","canonical_record":{"source":{"id":"1402.3074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-13T10:07:06Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"a28278527669d9e0340651c59080c5c572f44159b81829ce63732ecf9ef40acf","abstract_canon_sha256":"9271104f4590b2fe539ac4ec481ea285ca0ff53ab08d5a05a5af766b3c821900"},"schema_version":"1.0"},"canonical_sha256":"5d5d94001a87979f2218f087f5f9e6a278a854bfc49869d21b2aab2122e5d17b","source":{"kind":"arxiv","id":"1402.3074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3074","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3074v1","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3074","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"pith_short_12","alias_value":"LVOZIAA2Q6LZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LVOZIAA2Q6LZ6IQY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LVOZIAA2","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LVOZIAA2Q6LZ6IQY6CD7L6PGUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-13T10:07:06Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"a28278527669d9e0340651c59080c5c572f44159b81829ce63732ecf9ef40acf","abstract_canon_sha256":"9271104f4590b2fe539ac4ec481ea285ca0ff53ab08d5a05a5af766b3c821900"},"schema_version":"1.0"},"canonical_sha256":"5d5d94001a87979f2218f087f5f9e6a278a854bfc49869d21b2aab2122e5d17b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:07.850832Z","signature_b64":"VvvSh4Yosj99d/bgOkItslz5ImXj+50X+9ttWRP+ZRxgGqJay+g205qZW25lNqfXCr9bHOS+RCuG+5LIIbOqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d5d94001a87979f2218f087f5f9e6a278a854bfc49869d21b2aab2122e5d17b","last_reissued_at":"2026-05-18T02:59:07.850091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:07.850091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3074","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-18T02:59:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sg6ujnlg54IdkiqqxH/9aIeKELH41a53XIMCavy5WGeI7gTcpwzacSojXzFE3lW8PrSgWOm+YdIJCvisCWvJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:54:02.718872Z"},"content_sha256":"eff7caf1bb64e0605b55e2d61dbc571da13f1590e92ace37e77ea34b139624aa","schema_version":"1.0","event_id":"sha256:eff7caf1bb64e0605b55e2d61dbc571da13f1590e92ace37e77ea34b139624aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LVOZIAA2Q6LZ6IQY6CD7L6PGUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Advantages of Network Coded Storage in Point-to-Multipoint Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, Neda Aboutorab, Parastoo Sadeghi, Ulric J. Ferner","submitted_at":"2014-02-13T10:07:06Z","abstract_excerpt":"We consider scheduling strategies for point-to-multipoint (PMP) storage area networks (SANs) that use network coded storage (NCS). In particular, we present a simple SAN system model, two server scheduling algorithms for PMP networks, and analytical expressions for internal and external blocking probability. We point to select scheduling advantages in NCS systems under normal operating conditions, where content requests can be temporarily denied owing to finite system capacity from drive I/O access or storage redundancy limitations. NCS can lead to improvements in throughput and blocking proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3074","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-18T02:59:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yh9pu+7xRA900neu3dQFDf9yvSnPdg+VZafsVUk+tjyoeZqjEcH2vRz5pE4ySvaxoPJD3D7MZecdVNY8sBlqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:54:02.719234Z"},"content_sha256":"4dfe571025e8ae8f3c4004ee810bb8c21485da4d4ca2cf9b864f464571bfa433","schema_version":"1.0","event_id":"sha256:4dfe571025e8ae8f3c4004ee810bb8c21485da4d4ca2cf9b864f464571bfa433"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ/bundle.json","state_url":"https://pith.science/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ/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-01T01:54:02Z","links":{"resolver":"https://pith.science/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ","bundle":"https://pith.science/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ/bundle.json","state":"https://pith.science/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVOZIAA2Q6LZ6IQY6CD7L6PGUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LVOZIAA2Q6LZ6IQY6CD7L6PGUJ","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":"9271104f4590b2fe539ac4ec481ea285ca0ff53ab08d5a05a5af766b3c821900","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-13T10:07:06Z","title_canon_sha256":"a28278527669d9e0340651c59080c5c572f44159b81829ce63732ecf9ef40acf"},"schema_version":"1.0","source":{"id":"1402.3074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3074","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3074v1","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3074","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"pith_short_12","alias_value":"LVOZIAA2Q6LZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LVOZIAA2Q6LZ6IQY","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LVOZIAA2","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:4dfe571025e8ae8f3c4004ee810bb8c21485da4d4ca2cf9b864f464571bfa433","target":"graph","created_at":"2026-05-18T02:59:07Z","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":"We consider scheduling strategies for point-to-multipoint (PMP) storage area networks (SANs) that use network coded storage (NCS). In particular, we present a simple SAN system model, two server scheduling algorithms for PMP networks, and analytical expressions for internal and external blocking probability. We point to select scheduling advantages in NCS systems under normal operating conditions, where content requests can be temporarily denied owing to finite system capacity from drive I/O access or storage redundancy limitations. NCS can lead to improvements in throughput and blocking proba","authors_text":"Muriel Medard, Neda Aboutorab, Parastoo Sadeghi, Ulric J. Ferner","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-13T10:07:06Z","title":"Scheduling Advantages of Network Coded Storage in Point-to-Multipoint Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3074","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:eff7caf1bb64e0605b55e2d61dbc571da13f1590e92ace37e77ea34b139624aa","target":"record","created_at":"2026-05-18T02:59:07Z","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":"9271104f4590b2fe539ac4ec481ea285ca0ff53ab08d5a05a5af766b3c821900","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-13T10:07:06Z","title_canon_sha256":"a28278527669d9e0340651c59080c5c572f44159b81829ce63732ecf9ef40acf"},"schema_version":"1.0","source":{"id":"1402.3074","kind":"arxiv","version":1}},"canonical_sha256":"5d5d94001a87979f2218f087f5f9e6a278a854bfc49869d21b2aab2122e5d17b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d5d94001a87979f2218f087f5f9e6a278a854bfc49869d21b2aab2122e5d17b","first_computed_at":"2026-05-18T02:59:07.850091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:07.850091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VvvSh4Yosj99d/bgOkItslz5ImXj+50X+9ttWRP+ZRxgGqJay+g205qZW25lNqfXCr9bHOS+RCuG+5LIIbOqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:07.850832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eff7caf1bb64e0605b55e2d61dbc571da13f1590e92ace37e77ea34b139624aa","sha256:4dfe571025e8ae8f3c4004ee810bb8c21485da4d4ca2cf9b864f464571bfa433"],"state_sha256":"a762989563cf925ced2f4be9ee1db73155e878d88bd9d848e8ecb114399d372b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rH2RSWixD8y/Pi56k6x5gRooupi2Lbc90rgLpyBgvPazMo+gPnC8trpqhQSRNpDL5jwZwss7vNj4JNmO67SCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:54:02.721413Z","bundle_sha256":"e4df88fa877f280341fd04a344b6c48e96d18edf3e80ad25478e90cb13b87a73"}}