{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3BPVZCDEGCJEK6GB4IWTQHED5S","short_pith_number":"pith:3BPVZCDE","canonical_record":{"source":{"id":"1602.05551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-17T19:56:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2a777c011700696a5c0f605e3edfb92b43e9dc8b58a034d68fc34d4debcbff02","abstract_canon_sha256":"9926f28adbbec84c41323a40b932781ab081ca4c12f58957e2bb4cef3a994b54"},"schema_version":"1.0"},"canonical_sha256":"d85f5c886430924578c1e22d381c83ec84122110e0c4510a01f01966dc83d413","source":{"kind":"arxiv","id":"1602.05551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05551","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05551v1","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05551","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"3BPVZCDEGCJE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3BPVZCDEGCJEK6GB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3BPVZCDE","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3BPVZCDEGCJEK6GB4IWTQHED5S","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-17T19:56:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2a777c011700696a5c0f605e3edfb92b43e9dc8b58a034d68fc34d4debcbff02","abstract_canon_sha256":"9926f28adbbec84c41323a40b932781ab081ca4c12f58957e2bb4cef3a994b54"},"schema_version":"1.0"},"canonical_sha256":"d85f5c886430924578c1e22d381c83ec84122110e0c4510a01f01966dc83d413","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.712858Z","signature_b64":"5QW/NXK/byNvoQ4/KPl5fj+qZAQCMOJc4b32J9q9/n1BkGJ9PpuV0Z6goDSnmnnwDCSHzK3rekBBquJhW4CpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85f5c886430924578c1e22d381c83ec84122110e0c4510a01f01966dc83d413","last_reissued_at":"2026-05-18T00:31:31.712430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.712430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05551","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-18T00:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHLEOfr2bDpf0c2v54hkFv4vA2fbWVzDnC4v1Bbqam77fvANei3iiCfGhSgZBuhY7RKtMsAHn19rHDaJMGolDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:54:22.023797Z"},"content_sha256":"8c4190882496d64dcb30f5c1d092d9523a9fb913b3b0f64821ba8e02b85d6ff8","schema_version":"1.0","event_id":"sha256:8c4190882496d64dcb30f5c1d092d9523a9fb913b3b0f64821ba8e02b85d6ff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3BPVZCDEGCJEK6GB4IWTQHED5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiated latency in data center networks with erasure coded files through traffic engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Tian Lan, Vaneet Aggarwal, Yih-Farn R. Chen, Yu Xiang","submitted_at":"2016-02-17T19:56:07Z","abstract_excerpt":"This paper proposes an algorithm to minimize weighted service latency for different classes of tenants (or service classes) in a data center network where erasure-coded files are stored on distributed disks/racks and access requests are scattered across the network. Due to limited bandwidth available at both top-of-the-rack and aggregation switches and tenants in different service classes need differentiated services, network bandwidth must be apportioned among different intra- and inter-rack data flows for different service classes in line with their traffic statistics. We formulate this prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05551","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-18T00:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuPeERIDVcYYygAn20OnBHIqYLbcxF8AIQc+hmO2s9XFlF2L70nqP4ZoQUbb0N+0r4l6L2Ty8RMcpyuHU/vyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:54:22.024137Z"},"content_sha256":"f523c7cf505343d3c9ef35f918363d3339a1a2633c91e6f18342ab2a9bae8204","schema_version":"1.0","event_id":"sha256:f523c7cf505343d3c9ef35f918363d3339a1a2633c91e6f18342ab2a9bae8204"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BPVZCDEGCJEK6GB4IWTQHED5S/bundle.json","state_url":"https://pith.science/pith/3BPVZCDEGCJEK6GB4IWTQHED5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BPVZCDEGCJEK6GB4IWTQHED5S/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-03T04:54:22Z","links":{"resolver":"https://pith.science/pith/3BPVZCDEGCJEK6GB4IWTQHED5S","bundle":"https://pith.science/pith/3BPVZCDEGCJEK6GB4IWTQHED5S/bundle.json","state":"https://pith.science/pith/3BPVZCDEGCJEK6GB4IWTQHED5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BPVZCDEGCJEK6GB4IWTQHED5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3BPVZCDEGCJEK6GB4IWTQHED5S","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":"9926f28adbbec84c41323a40b932781ab081ca4c12f58957e2bb4cef3a994b54","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-17T19:56:07Z","title_canon_sha256":"2a777c011700696a5c0f605e3edfb92b43e9dc8b58a034d68fc34d4debcbff02"},"schema_version":"1.0","source":{"id":"1602.05551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05551","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05551v1","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05551","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"3BPVZCDEGCJE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3BPVZCDEGCJEK6GB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3BPVZCDE","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f523c7cf505343d3c9ef35f918363d3339a1a2633c91e6f18342ab2a9bae8204","target":"graph","created_at":"2026-05-18T00:31:31Z","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":"This paper proposes an algorithm to minimize weighted service latency for different classes of tenants (or service classes) in a data center network where erasure-coded files are stored on distributed disks/racks and access requests are scattered across the network. Due to limited bandwidth available at both top-of-the-rack and aggregation switches and tenants in different service classes need differentiated services, network bandwidth must be apportioned among different intra- and inter-rack data flows for different service classes in line with their traffic statistics. We formulate this prob","authors_text":"Tian Lan, Vaneet Aggarwal, Yih-Farn R. Chen, Yu Xiang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-17T19:56:07Z","title":"Differentiated latency in data center networks with erasure coded files through traffic engineering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05551","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:8c4190882496d64dcb30f5c1d092d9523a9fb913b3b0f64821ba8e02b85d6ff8","target":"record","created_at":"2026-05-18T00:31:31Z","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":"9926f28adbbec84c41323a40b932781ab081ca4c12f58957e2bb4cef3a994b54","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-17T19:56:07Z","title_canon_sha256":"2a777c011700696a5c0f605e3edfb92b43e9dc8b58a034d68fc34d4debcbff02"},"schema_version":"1.0","source":{"id":"1602.05551","kind":"arxiv","version":1}},"canonical_sha256":"d85f5c886430924578c1e22d381c83ec84122110e0c4510a01f01966dc83d413","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d85f5c886430924578c1e22d381c83ec84122110e0c4510a01f01966dc83d413","first_computed_at":"2026-05-18T00:31:31.712430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:31.712430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5QW/NXK/byNvoQ4/KPl5fj+qZAQCMOJc4b32J9q9/n1BkGJ9PpuV0Z6goDSnmnnwDCSHzK3rekBBquJhW4CpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:31.712858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c4190882496d64dcb30f5c1d092d9523a9fb913b3b0f64821ba8e02b85d6ff8","sha256:f523c7cf505343d3c9ef35f918363d3339a1a2633c91e6f18342ab2a9bae8204"],"state_sha256":"130dcaa3d81026c189f2ae6fb141d7e78319ef17b4f7dd033a1f8369fcd71947"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5CaPvu4ygBSe+5CoR0Oh2LvU0BHQVpS14FEOvp7SoWJpVdxYyB5sbwqydo4JYgLfSZvFVpisnI6/TRVWJWZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:54:22.026079Z","bundle_sha256":"c71f6510082d655567632ed47fa3ed480e65fc9eedfb9a85eeed78da3b50dd04"}}