{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FH5HPEV3BVWZWMD3YQKMNWZ6R5","short_pith_number":"pith:FH5HPEV3","canonical_record":{"source":{"id":"1706.05867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-19T10:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"ccb474532400dec3d11e34d5443b99d1f095659ec9b064d7a09abd5390a39242","abstract_canon_sha256":"4f8ed3c6c2c521b05ecae4de24aecf6314a46fd511c103db58fb83c38497d4c5"},"schema_version":"1.0"},"canonical_sha256":"29fa7792bb0d6d9b307bc414c6db3e8f69f959131a5ee0787fada478a59341d3","source":{"kind":"arxiv","id":"1706.05867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05867","created_at":"2026-05-18T00:40:52Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05867v1","created_at":"2026-05-18T00:40:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05867","created_at":"2026-05-18T00:40:52Z"},{"alias_kind":"pith_short_12","alias_value":"FH5HPEV3BVWZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FH5HPEV3BVWZWMD3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FH5HPEV3","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FH5HPEV3BVWZWMD3YQKMNWZ6R5","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-19T10:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"ccb474532400dec3d11e34d5443b99d1f095659ec9b064d7a09abd5390a39242","abstract_canon_sha256":"4f8ed3c6c2c521b05ecae4de24aecf6314a46fd511c103db58fb83c38497d4c5"},"schema_version":"1.0"},"canonical_sha256":"29fa7792bb0d6d9b307bc414c6db3e8f69f959131a5ee0787fada478a59341d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:52.564961Z","signature_b64":"T13/VsJ36q2y5fIRlfRY+aNj/x5jqKWCXmUn70eop7B/0MVa9Ie0Onw7amP2Lrg2wYUnGsMUepVRTM96aNLeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29fa7792bb0d6d9b307bc414c6db3e8f69f959131a5ee0787fada478a59341d3","last_reissued_at":"2026-05-18T00:40:52.564227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:52.564227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05867","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:40:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSDpES0SO6rMhvv8o3ZjXDXsV3aDQJxjDopm+aXvFm22GnOfixsK7F4LVocQG1kAmUFIEWEidsE9sfD0p+NTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:22:09.552717Z"},"content_sha256":"3aaa33a0745e5024db57ee88d0809176a5df15d9868be2cb885df0679f2fa432","schema_version":"1.0","event_id":"sha256:3aaa33a0745e5024db57ee88d0809176a5df15d9868be2cb885df0679f2fa432"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FH5HPEV3BVWZWMD3YQKMNWZ6R5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deadline-Aware Multipath Communication: An Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Adrian Perrig, Laurent Chuat, Yih-Chun Hu","submitted_at":"2017-06-19T10:24:51Z","abstract_excerpt":"Multipath communication not only allows improved throughput but can also be used to leverage different path characteristics to best fulfill each application's objective. In particular, certain delay-sensitive applications, such as real time voice and video communications, can usually withstand packet loss and aim to maximize throughput while keeping latency at a reasonable level. In such a context, one hard problem is to determine along which path the data should be transmitted or retransmitted. In this paper, we formulate this problem as a linear optimization, show bounds on the performance t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05867","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:40:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5SyZ+begYfhsZy4n8KaIKUlUpOHb8oOo8NMTMgfN09ikmDlcVu4pkbky7Gxv0H11SY2iNwj/K5+an2ps6jpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:22:09.553064Z"},"content_sha256":"c7144e6c63f452e0329b55d99b13bd864779d392e95d99885f431c1d807146e1","schema_version":"1.0","event_id":"sha256:c7144e6c63f452e0329b55d99b13bd864779d392e95d99885f431c1d807146e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5/bundle.json","state_url":"https://pith.science/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5/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-28T08:22:09Z","links":{"resolver":"https://pith.science/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5","bundle":"https://pith.science/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5/bundle.json","state":"https://pith.science/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FH5HPEV3BVWZWMD3YQKMNWZ6R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FH5HPEV3BVWZWMD3YQKMNWZ6R5","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":"4f8ed3c6c2c521b05ecae4de24aecf6314a46fd511c103db58fb83c38497d4c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-19T10:24:51Z","title_canon_sha256":"ccb474532400dec3d11e34d5443b99d1f095659ec9b064d7a09abd5390a39242"},"schema_version":"1.0","source":{"id":"1706.05867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05867","created_at":"2026-05-18T00:40:52Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05867v1","created_at":"2026-05-18T00:40:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05867","created_at":"2026-05-18T00:40:52Z"},{"alias_kind":"pith_short_12","alias_value":"FH5HPEV3BVWZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FH5HPEV3BVWZWMD3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FH5HPEV3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:c7144e6c63f452e0329b55d99b13bd864779d392e95d99885f431c1d807146e1","target":"graph","created_at":"2026-05-18T00:40:52Z","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":"Multipath communication not only allows improved throughput but can also be used to leverage different path characteristics to best fulfill each application's objective. In particular, certain delay-sensitive applications, such as real time voice and video communications, can usually withstand packet loss and aim to maximize throughput while keeping latency at a reasonable level. In such a context, one hard problem is to determine along which path the data should be transmitted or retransmitted. In this paper, we formulate this problem as a linear optimization, show bounds on the performance t","authors_text":"Adrian Perrig, Laurent Chuat, Yih-Chun Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-19T10:24:51Z","title":"Deadline-Aware Multipath Communication: An Optimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05867","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:3aaa33a0745e5024db57ee88d0809176a5df15d9868be2cb885df0679f2fa432","target":"record","created_at":"2026-05-18T00:40:52Z","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":"4f8ed3c6c2c521b05ecae4de24aecf6314a46fd511c103db58fb83c38497d4c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-06-19T10:24:51Z","title_canon_sha256":"ccb474532400dec3d11e34d5443b99d1f095659ec9b064d7a09abd5390a39242"},"schema_version":"1.0","source":{"id":"1706.05867","kind":"arxiv","version":1}},"canonical_sha256":"29fa7792bb0d6d9b307bc414c6db3e8f69f959131a5ee0787fada478a59341d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29fa7792bb0d6d9b307bc414c6db3e8f69f959131a5ee0787fada478a59341d3","first_computed_at":"2026-05-18T00:40:52.564227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:52.564227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T13/VsJ36q2y5fIRlfRY+aNj/x5jqKWCXmUn70eop7B/0MVa9Ie0Onw7amP2Lrg2wYUnGsMUepVRTM96aNLeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:52.564961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aaa33a0745e5024db57ee88d0809176a5df15d9868be2cb885df0679f2fa432","sha256:c7144e6c63f452e0329b55d99b13bd864779d392e95d99885f431c1d807146e1"],"state_sha256":"438f2b8f4eb417215681c7f4f2f0a2ee5c8ba26a45d2fe291cbacd87c9b42b6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEU2uQDjULfxE7h5ttr3a9nalhgvsNrL/Z7SWU/xOuNJseXCdEJyrMFX5SuAU5cTatVM/NUMvv5wZyzDtHcgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:22:09.555132Z","bundle_sha256":"f66b6036702f79688bbc90b15690d8141e31e2e7a9aad501f2469458c13899b5"}}