{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QXNR3N7T66TJ2SFIEKUPLRYFEG","short_pith_number":"pith:QXNR3N7T","canonical_record":{"source":{"id":"1704.04857","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PF","submitted_at":"2017-04-17T03:20:13Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"e4fefc4ed609c64a674e9a031c5e19e60fb84696832cd4108f4800637e96facf","abstract_canon_sha256":"239679694d9ce6ad4f70e006820801e9af74963eb0679c570bed57c0c988b564"},"schema_version":"1.0"},"canonical_sha256":"85db1db7f3f7a69d48a822a8f5c70521a0e98fd5ece6b41fdd73e5692aacb126","source":{"kind":"arxiv","id":"1704.04857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04857","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04857v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04857","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"QXNR3N7T66TJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXNR3N7T66TJ2SFI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXNR3N7T","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QXNR3N7T66TJ2SFIEKUPLRYFEG","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04857","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PF","submitted_at":"2017-04-17T03:20:13Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"e4fefc4ed609c64a674e9a031c5e19e60fb84696832cd4108f4800637e96facf","abstract_canon_sha256":"239679694d9ce6ad4f70e006820801e9af74963eb0679c570bed57c0c988b564"},"schema_version":"1.0"},"canonical_sha256":"85db1db7f3f7a69d48a822a8f5c70521a0e98fd5ece6b41fdd73e5692aacb126","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:17.578205Z","signature_b64":"jLSINyWkjVbNQHmpUtSM7erj85QJzYBLJswfsElm/IUANa41Ca/y3NrHZnemfLltTD5kTz+gAzWT8mEQWVC+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85db1db7f3f7a69d48a822a8f5c70521a0e98fd5ece6b41fdd73e5692aacb126","last_reissued_at":"2026-05-18T00:46:17.577670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:17.577670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04857","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:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZkqj/ErO6aJSY+90MRRWJ4t2NAzBz911XYm6BB6TpTs6C9wthA01EODDMdJfV0IPSVfuH0DJDuMTY2vie0TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:17.953660Z"},"content_sha256":"3cb966861c7b19a5b0b7d6f27ea6581038d06c671e489a8713005015e6e3c982","schema_version":"1.0","event_id":"sha256:3cb966861c7b19a5b0b7d6f27ea6581038d06c671e489a8713005015e6e3c982"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QXNR3N7T66TJ2SFIEKUPLRYFEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Han Deng, I-Hong Hou","submitted_at":"2017-04-17T03:20:13Z","abstract_excerpt":"It has been shown that it is impossible to achieve both stringent end-to-end deadline and reliability guarantees in a large network without having complete information of all future packet arrivals. In order to maintain desirable performance in the presence of uncertainty of future packet arrivals, common practice is to add redundancy by increasing link capacities. This paper studies the amount of capacity needed to provide stringent performance guarantees. We propose a low-complexity online algorithm and prove that it only requires a small amount of redundancy to guarantee both end-to-end dea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04857","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:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoUo9tojl4aR0MgJk4Ybl425/tZwBsaY7/aYhzyJ03iqzsNryT91Niyi8GcrnqgbtFIHQJNTNdpP1XVJ9KubBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:17.954011Z"},"content_sha256":"f00bf571682ae3f277da67e5bd1c68ec8bc767f9bd4c988130a8fb90eeb8ac2c","schema_version":"1.0","event_id":"sha256:f00bf571682ae3f277da67e5bd1c68ec8bc767f9bd4c988130a8fb90eeb8ac2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG/bundle.json","state_url":"https://pith.science/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG/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-03T08:54:17Z","links":{"resolver":"https://pith.science/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG","bundle":"https://pith.science/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG/bundle.json","state":"https://pith.science/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXNR3N7T66TJ2SFIEKUPLRYFEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QXNR3N7T66TJ2SFIEKUPLRYFEG","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":"239679694d9ce6ad4f70e006820801e9af74963eb0679c570bed57c0c988b564","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PF","submitted_at":"2017-04-17T03:20:13Z","title_canon_sha256":"e4fefc4ed609c64a674e9a031c5e19e60fb84696832cd4108f4800637e96facf"},"schema_version":"1.0","source":{"id":"1704.04857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04857","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04857v1","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04857","created_at":"2026-05-18T00:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"QXNR3N7T66TJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXNR3N7T66TJ2SFI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXNR3N7T","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:f00bf571682ae3f277da67e5bd1c68ec8bc767f9bd4c988130a8fb90eeb8ac2c","target":"graph","created_at":"2026-05-18T00:46:17Z","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":"It has been shown that it is impossible to achieve both stringent end-to-end deadline and reliability guarantees in a large network without having complete information of all future packet arrivals. In order to maintain desirable performance in the presence of uncertainty of future packet arrivals, common practice is to add redundancy by increasing link capacities. This paper studies the amount of capacity needed to provide stringent performance guarantees. We propose a low-complexity online algorithm and prove that it only requires a small amount of redundancy to guarantee both end-to-end dea","authors_text":"Han Deng, I-Hong Hou","cross_cats":["cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PF","submitted_at":"2017-04-17T03:20:13Z","title":"On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04857","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:3cb966861c7b19a5b0b7d6f27ea6581038d06c671e489a8713005015e6e3c982","target":"record","created_at":"2026-05-18T00:46:17Z","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":"239679694d9ce6ad4f70e006820801e9af74963eb0679c570bed57c0c988b564","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PF","submitted_at":"2017-04-17T03:20:13Z","title_canon_sha256":"e4fefc4ed609c64a674e9a031c5e19e60fb84696832cd4108f4800637e96facf"},"schema_version":"1.0","source":{"id":"1704.04857","kind":"arxiv","version":1}},"canonical_sha256":"85db1db7f3f7a69d48a822a8f5c70521a0e98fd5ece6b41fdd73e5692aacb126","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85db1db7f3f7a69d48a822a8f5c70521a0e98fd5ece6b41fdd73e5692aacb126","first_computed_at":"2026-05-18T00:46:17.577670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:17.577670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLSINyWkjVbNQHmpUtSM7erj85QJzYBLJswfsElm/IUANa41Ca/y3NrHZnemfLltTD5kTz+gAzWT8mEQWVC+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:17.578205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cb966861c7b19a5b0b7d6f27ea6581038d06c671e489a8713005015e6e3c982","sha256:f00bf571682ae3f277da67e5bd1c68ec8bc767f9bd4c988130a8fb90eeb8ac2c"],"state_sha256":"10577f23936f6595bea8499f3d43d24c36d03f06603551818dfac657b0b1f07a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlDob8w8ob5W2+XyLu+JKg0srU1EKr9TKnJJ+bRFJUCr7upoJC3kfWICgkF+DOwnmtNHpa/yuzZfx+DGNjNtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:54:17.956067Z","bundle_sha256":"f2e5ee78ec6709eae5dc2e14cb42e43ce8186f60050b984ac74b0084beee71c3"}}