{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:43B32VZOVN64F6DX7QE3MS45P3","short_pith_number":"pith:43B32VZO","canonical_record":{"source":{"id":"1407.1239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-04T14:17:40Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"866556b2ebe22a0dde5dd80e09ade042d24a74e3fed5e5fad54c0a71128cd83c","abstract_canon_sha256":"11a85c5838fff96a15bed3955d822c47626a2e628ef97afe35bd9148124323b7"},"schema_version":"1.0"},"canonical_sha256":"e6c3bd572eab7dc2f877fc09b64b9d7ed6bd2bb771b4e56d418f9c4ede2659b4","source":{"kind":"arxiv","id":"1407.1239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1239","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1239v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1239","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"43B32VZOVN64","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43B32VZOVN64F6DX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43B32VZO","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:43B32VZOVN64F6DX7QE3MS45P3","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-04T14:17:40Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"866556b2ebe22a0dde5dd80e09ade042d24a74e3fed5e5fad54c0a71128cd83c","abstract_canon_sha256":"11a85c5838fff96a15bed3955d822c47626a2e628ef97afe35bd9148124323b7"},"schema_version":"1.0"},"canonical_sha256":"e6c3bd572eab7dc2f877fc09b64b9d7ed6bd2bb771b4e56d418f9c4ede2659b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.764114Z","signature_b64":"GtGi8U89d8jqv0rJMf3N7C9ItmbV6bSa0omBxws7V2bVTk7ldokBlGYPECgK+rFmPxMdPMB5Fmpp85rv3L09Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6c3bd572eab7dc2f877fc09b64b9d7ed6bd2bb771b4e56d418f9c4ede2659b4","last_reissued_at":"2026-05-18T02:28:47.763732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.763732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1239","source_version":2,"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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Uh/Pwp258licsaEa+NlvE+6Mf1JQ/VmnrLxLYsWVVh+YoQvvquCqr9fEXvJWcIgWWY43dckiudn0566X7lhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:09:55.104882Z"},"content_sha256":"290c4dab922c214bb2971a0d907239fcc852bc0049c680bfbb400915f095d36b","schema_version":"1.0","event_id":"sha256:290c4dab922c214bb2971a0d907239fcc852bc0049c680bfbb400915f095d36b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:43B32VZOVN64F6DX7QE3MS45P3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RepNet: Cutting Tail Latency in Data Center Networks with Flow Replication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"cs.NI","authors_text":"Hong Xu, Kai Chen, Shuhao Liu, Wei Bai, Zhiping Cai","submitted_at":"2014-07-04T14:17:40Z","abstract_excerpt":"Data center networks need to provide low latency, especially at the tail, as demanded by many interactive applications. To improve tail latency, existing approaches require modifications to switch hardware and/or end-host operating systems, making them difficult to be deployed. We present the design, implementation, and evaluation of RepNet, an application layer transport that can be deployed today. RepNet exploits the fact that only a few paths among many are congested at any moment in the network, and applies simple flow replication to mice flows to opportunistically use the less congested p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1239","kind":"arxiv","version":2},"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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMwGHkU+x4hbbScaUd0YswWYdT6Dr0bcA7s+pn+QXD3MAQL1Ls3cEEmbAr35Jl6U1zUhqaSk2jR6ykiXeUsRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:09:55.105343Z"},"content_sha256":"805495a7c41c0edaf03d8ddc2f8683e548ce37dfd50aaeb52d3b6fc788c7534f","schema_version":"1.0","event_id":"sha256:805495a7c41c0edaf03d8ddc2f8683e548ce37dfd50aaeb52d3b6fc788c7534f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43B32VZOVN64F6DX7QE3MS45P3/bundle.json","state_url":"https://pith.science/pith/43B32VZOVN64F6DX7QE3MS45P3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43B32VZOVN64F6DX7QE3MS45P3/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-05-27T01:09:55Z","links":{"resolver":"https://pith.science/pith/43B32VZOVN64F6DX7QE3MS45P3","bundle":"https://pith.science/pith/43B32VZOVN64F6DX7QE3MS45P3/bundle.json","state":"https://pith.science/pith/43B32VZOVN64F6DX7QE3MS45P3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43B32VZOVN64F6DX7QE3MS45P3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:43B32VZOVN64F6DX7QE3MS45P3","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":"11a85c5838fff96a15bed3955d822c47626a2e628ef97afe35bd9148124323b7","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-04T14:17:40Z","title_canon_sha256":"866556b2ebe22a0dde5dd80e09ade042d24a74e3fed5e5fad54c0a71128cd83c"},"schema_version":"1.0","source":{"id":"1407.1239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1239","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1239v2","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1239","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"43B32VZOVN64","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43B32VZOVN64F6DX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43B32VZO","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:805495a7c41c0edaf03d8ddc2f8683e548ce37dfd50aaeb52d3b6fc788c7534f","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"Data center networks need to provide low latency, especially at the tail, as demanded by many interactive applications. To improve tail latency, existing approaches require modifications to switch hardware and/or end-host operating systems, making them difficult to be deployed. We present the design, implementation, and evaluation of RepNet, an application layer transport that can be deployed today. RepNet exploits the fact that only a few paths among many are congested at any moment in the network, and applies simple flow replication to mice flows to opportunistically use the less congested p","authors_text":"Hong Xu, Kai Chen, Shuhao Liu, Wei Bai, Zhiping Cai","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-04T14:17:40Z","title":"RepNet: Cutting Tail Latency in Data Center Networks with Flow Replication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1239","kind":"arxiv","version":2},"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:290c4dab922c214bb2971a0d907239fcc852bc0049c680bfbb400915f095d36b","target":"record","created_at":"2026-05-18T02:28:47Z","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":"11a85c5838fff96a15bed3955d822c47626a2e628ef97afe35bd9148124323b7","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-04T14:17:40Z","title_canon_sha256":"866556b2ebe22a0dde5dd80e09ade042d24a74e3fed5e5fad54c0a71128cd83c"},"schema_version":"1.0","source":{"id":"1407.1239","kind":"arxiv","version":2}},"canonical_sha256":"e6c3bd572eab7dc2f877fc09b64b9d7ed6bd2bb771b4e56d418f9c4ede2659b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6c3bd572eab7dc2f877fc09b64b9d7ed6bd2bb771b4e56d418f9c4ede2659b4","first_computed_at":"2026-05-18T02:28:47.763732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.763732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtGi8U89d8jqv0rJMf3N7C9ItmbV6bSa0omBxws7V2bVTk7ldokBlGYPECgK+rFmPxMdPMB5Fmpp85rv3L09Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.764114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:290c4dab922c214bb2971a0d907239fcc852bc0049c680bfbb400915f095d36b","sha256:805495a7c41c0edaf03d8ddc2f8683e548ce37dfd50aaeb52d3b6fc788c7534f"],"state_sha256":"af384fd9cb4fc9d3c4625f86b34aea210dc7976ff4778c1cc0689573f70d7c99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7c+OLY1WwdiMxjf8z5asieIvoLGYAlxP0fzdBF6ONifEMWKco32WngUvCeXvW2d/EJ8PMvB3APyxF26j7/osCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:09:55.108454Z","bundle_sha256":"cd51caa22fca4785f4e80953ed2a2e45616b5b92c0a99fd911ad4ddfe9e52184"}}