{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZYTYYZPBAHAS36KHXV2FVHXJBQ","short_pith_number":"pith:ZYTYYZPB","canonical_record":{"source":{"id":"1506.00204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T08:52:34Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7fc900e8400badd3a612dcd17df09123537ae4a97ceafd1cf4a31de530e13fd4","abstract_canon_sha256":"0f2a6c3969bed85cddea03cefeaa769e01282f0c55ae8fa72ed161ce0f72cac0"},"schema_version":"1.0"},"canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","source":{"kind":"arxiv","id":"1506.00204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00204","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00204v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00204","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZYTYYZPBAHAS","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZYTYYZPBAHAS36KH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZYTYYZPB","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZYTYYZPBAHAS36KHXV2FVHXJBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T08:52:34Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7fc900e8400badd3a612dcd17df09123537ae4a97ceafd1cf4a31de530e13fd4","abstract_canon_sha256":"0f2a6c3969bed85cddea03cefeaa769e01282f0c55ae8fa72ed161ce0f72cac0"},"schema_version":"1.0"},"canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.211960Z","signature_b64":"zJmnlTVVvxbNkDTjHTbmg0Bly3PHaddiquj4tg8s24J+EYSN/bR63qiGsobBJk5GfiwjVtSfEotPLLmOHAZPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","last_reissued_at":"2026-05-18T01:59:55.211497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.211497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00204","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFww1wugTilMQmmCWazK7bhcQtbFb9H9toE/2Go6IQ2B3jwXh0rcG3MDp0hXm2D3Wk2uyVi3/NIQDvZMoXR1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:29.096897Z"},"content_sha256":"bd636b3811993ba86518c63bc73bc86a9e76133990fd15c196b5ff296c5353bd","schema_version":"1.0","event_id":"sha256:bd636b3811993ba86518c63bc73bc86a9e76133990fd15c196b5ff296c5353bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZYTYYZPBAHAS36KHXV2FVHXJBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Packet Scheduling in Network on Chip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Ge Li, Mingyu Yan, Wei Yang, Xiao Lv, Zhuang Wang","submitted_at":"2015-05-31T08:52:34Z","abstract_excerpt":"Interconnection networks of parallel systems are used for servicing traf- fic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm regulating the access to that channel plays a key role in ensur- ing that each flow obtains the required quality of service. Fairness is a highly desirable property for a scheduling algorithm. We show that using the Relative Fairness Bound as a fairness measure may lead to decrease in throughput and increase in latency. We propose an alternative metric to evaluat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00204","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCKZ5PrMRr+c+tCcCy9ecHHAUtmJXauy3dCAvCXJ7qJy1WNj1VWs5NKLNDtzAtRSdkcy2nEly0jRODoejvd1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:29.097246Z"},"content_sha256":"a0d2a2177b267087db7fc807b2cd9bfd1402d53fbea96c5e469b4a74cb2cd8c1","schema_version":"1.0","event_id":"sha256:a0d2a2177b267087db7fc807b2cd9bfd1402d53fbea96c5e469b4a74cb2cd8c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/bundle.json","state_url":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/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-05T16:39:29Z","links":{"resolver":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ","bundle":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/bundle.json","state":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZYTYYZPBAHAS36KHXV2FVHXJBQ","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":"0f2a6c3969bed85cddea03cefeaa769e01282f0c55ae8fa72ed161ce0f72cac0","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T08:52:34Z","title_canon_sha256":"7fc900e8400badd3a612dcd17df09123537ae4a97ceafd1cf4a31de530e13fd4"},"schema_version":"1.0","source":{"id":"1506.00204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00204","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00204v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00204","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZYTYYZPBAHAS","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZYTYYZPBAHAS36KH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZYTYYZPB","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:a0d2a2177b267087db7fc807b2cd9bfd1402d53fbea96c5e469b4a74cb2cd8c1","target":"graph","created_at":"2026-05-18T01:59:55Z","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":"Interconnection networks of parallel systems are used for servicing traf- fic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm regulating the access to that channel plays a key role in ensur- ing that each flow obtains the required quality of service. Fairness is a highly desirable property for a scheduling algorithm. We show that using the Relative Fairness Bound as a fairness measure may lead to decrease in throughput and increase in latency. We propose an alternative metric to evaluat","authors_text":"Ge Li, Mingyu Yan, Wei Yang, Xiao Lv, Zhuang Wang","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T08:52:34Z","title":"Fair Packet Scheduling in Network on Chip"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00204","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:bd636b3811993ba86518c63bc73bc86a9e76133990fd15c196b5ff296c5353bd","target":"record","created_at":"2026-05-18T01:59:55Z","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":"0f2a6c3969bed85cddea03cefeaa769e01282f0c55ae8fa72ed161ce0f72cac0","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T08:52:34Z","title_canon_sha256":"7fc900e8400badd3a612dcd17df09123537ae4a97ceafd1cf4a31de530e13fd4"},"schema_version":"1.0","source":{"id":"1506.00204","kind":"arxiv","version":1}},"canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","first_computed_at":"2026-05-18T01:59:55.211497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:55.211497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zJmnlTVVvxbNkDTjHTbmg0Bly3PHaddiquj4tg8s24J+EYSN/bR63qiGsobBJk5GfiwjVtSfEotPLLmOHAZPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:55.211960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd636b3811993ba86518c63bc73bc86a9e76133990fd15c196b5ff296c5353bd","sha256:a0d2a2177b267087db7fc807b2cd9bfd1402d53fbea96c5e469b4a74cb2cd8c1"],"state_sha256":"a3b048fffd90f13dcd177d96cdae81e72d7d3858cfd51c92f1e0deb7e5bc4b5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnGGQx9kSrnZzdyme+4FaOQnAzNvzThJYZDFJ7ZLrqCmrZWOBiEZB4ymPU+q0LVrzpoqXTPCMVVbx/+SA22TCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:39:29.099481Z","bundle_sha256":"b0975348aa69a8488c8084f865f3c5be501e3800c04219c7d3e0bd4a92958ccf"}}