{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PPUM2DBLNLTTJ7ZYZA7KXL5VP5","short_pith_number":"pith:PPUM2DBL","canonical_record":{"source":{"id":"1007.4853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-07-27T23:47:58Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"05738c6473b06b203874eccccec9c6634e456a1b998fe5cbd203c9ce36093383","abstract_canon_sha256":"80d9816e55c8a548a70b4e04532013e7a5e626c8766ff92f8e4c3fed2dd62912"},"schema_version":"1.0"},"canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","source":{"kind":"arxiv","id":"1007.4853","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4853","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4853v2","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4853","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"PPUM2DBLNLTT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PPUM2DBLNLTTJ7ZY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PPUM2DBL","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PPUM2DBLNLTTJ7ZYZA7KXL5VP5","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-07-27T23:47:58Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"05738c6473b06b203874eccccec9c6634e456a1b998fe5cbd203c9ce36093383","abstract_canon_sha256":"80d9816e55c8a548a70b4e04532013e7a5e626c8766ff92f8e4c3fed2dd62912"},"schema_version":"1.0"},"canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:43.099667Z","signature_b64":"Yo0N7CWKRb0W3GCjo1GB6IIPbcWpajyZxTuzMuJg7Vu0/qWNxog+WEcYaWnHrFJo/+NFXj5bkcijQh8LLfrlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","last_reissued_at":"2026-05-18T04:42:43.099235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:43.099235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4853","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-18T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/Ask3tQ4hO3MyFbu3TQjN6Si6PBR7ZDA5esUPytDOpqS62J8Oe9ZQzDLHnlBvaRHJYbfLJ+i267f2sUR1s7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:06:16.249304Z"},"content_sha256":"54b04fec7e31aab73248a3288f8b304d6ce3c9732412555ed26c8132bc86effd","schema_version":"1.0","event_id":"sha256:54b04fec7e31aab73248a3288f8b304d6ce3c9732412555ed26c8132bc86effd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PPUM2DBLNLTTJ7ZYZA7KXL5VP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance bounds in wormhole routing, a network calculus approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.PF","authors_text":"Bruno Gaujal, Nadir Farhi","submitted_at":"2010-07-27T23:47:58Z","abstract_excerpt":"We present a model of performance bound calculus on feedforward networks where data packets are routed under wormhole routing discipline. We are interested in determining maximum end-to-end delays and backlogs of messages or packets going from a source node to a destination node, through a given virtual path in the network. Our objective here is to give a network calculus approach for calculating the performance bounds. First we propose a new concept of curves that we call packet curves. The curves permit to model constraints on packet lengths of a given data flow, when the lengths are allowed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4853","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-18T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hEOjXIkZYS0Gh3oG3ASQmsIzMWUV6ty02Ubfj7e0w7KC4IqJdXJVmuivKGLauFMhffDLpjLnNULhFRqXSWepCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:06:16.249706Z"},"content_sha256":"43add9e40785bc4b5b0cb69f1012ac992d892740eaf5c2276854a781052c12ff","schema_version":"1.0","event_id":"sha256:43add9e40785bc4b5b0cb69f1012ac992d892740eaf5c2276854a781052c12ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/bundle.json","state_url":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/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-23T08:06:16Z","links":{"resolver":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5","bundle":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/bundle.json","state":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PPUM2DBLNLTTJ7ZYZA7KXL5VP5","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":"80d9816e55c8a548a70b4e04532013e7a5e626c8766ff92f8e4c3fed2dd62912","cross_cats_sorted":["cs.NI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-07-27T23:47:58Z","title_canon_sha256":"05738c6473b06b203874eccccec9c6634e456a1b998fe5cbd203c9ce36093383"},"schema_version":"1.0","source":{"id":"1007.4853","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4853","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4853v2","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4853","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"PPUM2DBLNLTT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PPUM2DBLNLTTJ7ZY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PPUM2DBL","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:43add9e40785bc4b5b0cb69f1012ac992d892740eaf5c2276854a781052c12ff","target":"graph","created_at":"2026-05-18T04:42:43Z","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":"We present a model of performance bound calculus on feedforward networks where data packets are routed under wormhole routing discipline. We are interested in determining maximum end-to-end delays and backlogs of messages or packets going from a source node to a destination node, through a given virtual path in the network. Our objective here is to give a network calculus approach for calculating the performance bounds. First we propose a new concept of curves that we call packet curves. The curves permit to model constraints on packet lengths of a given data flow, when the lengths are allowed","authors_text":"Bruno Gaujal, Nadir Farhi","cross_cats":["cs.NI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-07-27T23:47:58Z","title":"Performance bounds in wormhole routing, a network calculus approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4853","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:54b04fec7e31aab73248a3288f8b304d6ce3c9732412555ed26c8132bc86effd","target":"record","created_at":"2026-05-18T04:42:43Z","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":"80d9816e55c8a548a70b4e04532013e7a5e626c8766ff92f8e4c3fed2dd62912","cross_cats_sorted":["cs.NI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-07-27T23:47:58Z","title_canon_sha256":"05738c6473b06b203874eccccec9c6634e456a1b998fe5cbd203c9ce36093383"},"schema_version":"1.0","source":{"id":"1007.4853","kind":"arxiv","version":2}},"canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","first_computed_at":"2026-05-18T04:42:43.099235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:43.099235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yo0N7CWKRb0W3GCjo1GB6IIPbcWpajyZxTuzMuJg7Vu0/qWNxog+WEcYaWnHrFJo/+NFXj5bkcijQh8LLfrlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:43.099667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4853","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54b04fec7e31aab73248a3288f8b304d6ce3c9732412555ed26c8132bc86effd","sha256:43add9e40785bc4b5b0cb69f1012ac992d892740eaf5c2276854a781052c12ff"],"state_sha256":"687d58250446abdad0958f223d08876b530b5283992f3ef0c339eebb615b5738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0hkcA8A4qiI61m/aMxhYQ4khUfXETHnAaoHZImPZO1xZpHWjSrxSApFtXjJFqU/gUVohaQrRT8YyL898G6FBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:06:16.251694Z","bundle_sha256":"f051b47d19bdcfc9abe88a8c3dfbaa4b370516f4b126e46531925d19f93b1ce9"}}