{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PTCJQWVAKMR42ZKANMLGHHLZU6","short_pith_number":"pith:PTCJQWVA","canonical_record":{"source":{"id":"1610.00017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-30T20:01:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bea217a961857d80e15feda086b917e3940cc5ae5f82c8974e712dc768f7a79f","abstract_canon_sha256":"1b96f771e34c8a19b6a9d68bfe63bf592689372ed07741dfa3cea458a36ebac8"},"schema_version":"1.0"},"canonical_sha256":"7cc4985aa05323cd65406b16639d79a7877f9d10cb8af3222ddebb72bbbffaea","source":{"kind":"arxiv","id":"1610.00017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00017","created_at":"2026-05-18T00:53:24Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00017v2","created_at":"2026-05-18T00:53:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00017","created_at":"2026-05-18T00:53:24Z"},{"alias_kind":"pith_short_12","alias_value":"PTCJQWVAKMR4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PTCJQWVAKMR42ZKA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PTCJQWVA","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PTCJQWVAKMR42ZKANMLGHHLZU6","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-30T20:01:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bea217a961857d80e15feda086b917e3940cc5ae5f82c8974e712dc768f7a79f","abstract_canon_sha256":"1b96f771e34c8a19b6a9d68bfe63bf592689372ed07741dfa3cea458a36ebac8"},"schema_version":"1.0"},"canonical_sha256":"7cc4985aa05323cd65406b16639d79a7877f9d10cb8af3222ddebb72bbbffaea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:24.205175Z","signature_b64":"wzknJUENFjMRvJ9t/InNcQFA/QkdjZOhpIsnZmep/g3FWL1WnvE3EpuLhuA8P9xb6Sx+h1+sFBJkK6nx9bn3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cc4985aa05323cd65406b16639d79a7877f9d10cb8af3222ddebb72bbbffaea","last_reissued_at":"2026-05-18T00:53:24.204630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:24.204630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00017","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-18T00:53:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1gPaNgYAo+4jXlnwWGua6J0IX09vX7ci+qzHgmqAcUf9UTqgp51QyL53o9aRZ4KX7AflO8SIW2aQXUh7jxfuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:48:58.565214Z"},"content_sha256":"653b0c6dbca198ac52b2d188d87d530ef8a644144189e578655a2c0fa83ee6db","schema_version":"1.0","event_id":"sha256:653b0c6dbca198ac52b2d188d87d530ef8a644144189e578655a2c0fa83ee6db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PTCJQWVAKMR42ZKANMLGHHLZU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Latency of Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francois Gagnon, Minh Au","submitted_at":"2016-09-30T20:01:25Z","abstract_excerpt":"In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are treated from an information theoretic perspective. By defining the latency as the time required to make decisions, we prove that if short messages can be transmitted in parallel Gaussian channels, for example, via orthogonal frequency-division multiplexing (OFDM)-like signals, there exists an optimal low-latency strategy for every code. This can be achieved v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00017","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-18T00:53:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4OykXkDm1gXKB1yfJI2suuuXzv55uJsprDVq1X/NpLwuBxWQKYtNy6d7R/l9DrUBmZqEq1GMQs0Xf7bgaXzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:48:58.565839Z"},"content_sha256":"60d0d94410f1453f05683263276c934656c2199317d4182c3576c7de1b973356","schema_version":"1.0","event_id":"sha256:60d0d94410f1453f05683263276c934656c2199317d4182c3576c7de1b973356"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTCJQWVAKMR42ZKANMLGHHLZU6/bundle.json","state_url":"https://pith.science/pith/PTCJQWVAKMR42ZKANMLGHHLZU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTCJQWVAKMR42ZKANMLGHHLZU6/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-05T00:48:58Z","links":{"resolver":"https://pith.science/pith/PTCJQWVAKMR42ZKANMLGHHLZU6","bundle":"https://pith.science/pith/PTCJQWVAKMR42ZKANMLGHHLZU6/bundle.json","state":"https://pith.science/pith/PTCJQWVAKMR42ZKANMLGHHLZU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTCJQWVAKMR42ZKANMLGHHLZU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PTCJQWVAKMR42ZKANMLGHHLZU6","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":"1b96f771e34c8a19b6a9d68bfe63bf592689372ed07741dfa3cea458a36ebac8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-30T20:01:25Z","title_canon_sha256":"bea217a961857d80e15feda086b917e3940cc5ae5f82c8974e712dc768f7a79f"},"schema_version":"1.0","source":{"id":"1610.00017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00017","created_at":"2026-05-18T00:53:24Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00017v2","created_at":"2026-05-18T00:53:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00017","created_at":"2026-05-18T00:53:24Z"},{"alias_kind":"pith_short_12","alias_value":"PTCJQWVAKMR4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PTCJQWVAKMR42ZKA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PTCJQWVA","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:60d0d94410f1453f05683263276c934656c2199317d4182c3576c7de1b973356","target":"graph","created_at":"2026-05-18T00:53:24Z","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":"In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are treated from an information theoretic perspective. By defining the latency as the time required to make decisions, we prove that if short messages can be transmitted in parallel Gaussian channels, for example, via orthogonal frequency-division multiplexing (OFDM)-like signals, there exists an optimal low-latency strategy for every code. This can be achieved v","authors_text":"Francois Gagnon, Minh Au","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-30T20:01:25Z","title":"On Optimal Latency of Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00017","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:653b0c6dbca198ac52b2d188d87d530ef8a644144189e578655a2c0fa83ee6db","target":"record","created_at":"2026-05-18T00:53:24Z","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":"1b96f771e34c8a19b6a9d68bfe63bf592689372ed07741dfa3cea458a36ebac8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-30T20:01:25Z","title_canon_sha256":"bea217a961857d80e15feda086b917e3940cc5ae5f82c8974e712dc768f7a79f"},"schema_version":"1.0","source":{"id":"1610.00017","kind":"arxiv","version":2}},"canonical_sha256":"7cc4985aa05323cd65406b16639d79a7877f9d10cb8af3222ddebb72bbbffaea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cc4985aa05323cd65406b16639d79a7877f9d10cb8af3222ddebb72bbbffaea","first_computed_at":"2026-05-18T00:53:24.204630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:24.204630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wzknJUENFjMRvJ9t/InNcQFA/QkdjZOhpIsnZmep/g3FWL1WnvE3EpuLhuA8P9xb6Sx+h1+sFBJkK6nx9bn3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:24.205175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:653b0c6dbca198ac52b2d188d87d530ef8a644144189e578655a2c0fa83ee6db","sha256:60d0d94410f1453f05683263276c934656c2199317d4182c3576c7de1b973356"],"state_sha256":"08fd55c1f88d90a49ebb9670b83463d222fd41e011a00266c182c22b5013f1c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQh52sgF/y46TNLNvapHTaBrKPqs2/raaijlaBP2c5d13Q0ksmtDBqTQPK2QwoDc9m0Bn8vrrM6CwephV1psBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:48:58.569526Z","bundle_sha256":"fb0062ed82c57c26d16dd6c2d94a26717454a1a784bac6cc7a97f854664cbc5c"}}