{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7WLI3NIMN2PQT6VINZDSIQQS4Q","short_pith_number":"pith:7WLI3NIM","canonical_record":{"source":{"id":"1509.00249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-01T12:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"f3431d0b69ddc80081053c1474bf3709d9b2211c1f3ad4198bd3c32c05e28eb5","abstract_canon_sha256":"57219358726d8fc1bfc71b69cb29b8534f9ffb0166d338ecf3373c08818c48e5"},"schema_version":"1.0"},"canonical_sha256":"fd968db50c6e9f09faa86e47244212e4234b648c6971145c78e6b3e3df09390e","source":{"kind":"arxiv","id":"1509.00249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00249","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00249v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00249","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"7WLI3NIMN2PQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7WLI3NIMN2PQT6VI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7WLI3NIM","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7WLI3NIMN2PQT6VINZDSIQQS4Q","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-01T12:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"f3431d0b69ddc80081053c1474bf3709d9b2211c1f3ad4198bd3c32c05e28eb5","abstract_canon_sha256":"57219358726d8fc1bfc71b69cb29b8534f9ffb0166d338ecf3373c08818c48e5"},"schema_version":"1.0"},"canonical_sha256":"fd968db50c6e9f09faa86e47244212e4234b648c6971145c78e6b3e3df09390e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.733674Z","signature_b64":"LOaSDFyujffMd0VVK8d6c0rCmt3kPAofSLgeo+BPLmzyHuL3oQ3OsS49I/Vt0Nt5GuPCJjQ3hEbwK9oFsmf6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd968db50c6e9f09faa86e47244212e4234b648c6971145c78e6b3e3df09390e","last_reissued_at":"2026-05-18T01:34:14.733058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.733058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00249","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:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlgFEusYPLo23thkzEeatoYkuz291DcjpUHJhFh8MXhTZeECmqexxbsgNu8iteMaB2Vr7WfH5YHuTHbj9vvnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:35:10.188088Z"},"content_sha256":"48da6faac09b8c96fa41ccbdc3335fea0e021adace32543ae7ae3572fdec5026","schema_version":"1.0","event_id":"sha256:48da6faac09b8c96fa41ccbdc3335fea0e021adace32543ae7ae3572fdec5026"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7WLI3NIMN2PQT6VINZDSIQQS4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Network-on-Chip Design with Guaranteed QoS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Guy Even, Yaniv Fais","submitted_at":"2015-09-01T12:17:27Z","abstract_excerpt":"We present algorithms that design NoCs with guaranteed quality of service. Given a topology, a mapping of tasks to processing elements, and traffic requirements between the tasks, the algorithm computes the interconnection widths, a detailed static routing, and a periodic scheduling. No headers, control messages, or acknowledgments are required. The algorithm employs fractional Multi-Commodity Flow (MCF) that determines the widths of the interconnections as well as the routes of the flits. The MCF is rounded to a periodic TDM schedule which is translated to local periodic control of switches a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00249","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:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TASqdLsjNRp84Jd20LuAksLwrVXH4jjXIFJWlh7uHXG79ZROgHrJPatiM6yzmQwWPJ9CnnmaFqeLkcBuwc0+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:35:10.188464Z"},"content_sha256":"66fc586c032276e5db45e6b3cbd39eb8bfef168c06574c3ed66ac38551ba8529","schema_version":"1.0","event_id":"sha256:66fc586c032276e5db45e6b3cbd39eb8bfef168c06574c3ed66ac38551ba8529"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/bundle.json","state_url":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/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-25T10:35:10Z","links":{"resolver":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q","bundle":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/bundle.json","state":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7WLI3NIMN2PQT6VINZDSIQQS4Q","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":"57219358726d8fc1bfc71b69cb29b8534f9ffb0166d338ecf3373c08818c48e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-01T12:17:27Z","title_canon_sha256":"f3431d0b69ddc80081053c1474bf3709d9b2211c1f3ad4198bd3c32c05e28eb5"},"schema_version":"1.0","source":{"id":"1509.00249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00249","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00249v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00249","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"7WLI3NIMN2PQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7WLI3NIMN2PQT6VI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7WLI3NIM","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:66fc586c032276e5db45e6b3cbd39eb8bfef168c06574c3ed66ac38551ba8529","target":"graph","created_at":"2026-05-18T01:34:14Z","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 algorithms that design NoCs with guaranteed quality of service. Given a topology, a mapping of tasks to processing elements, and traffic requirements between the tasks, the algorithm computes the interconnection widths, a detailed static routing, and a periodic scheduling. No headers, control messages, or acknowledgments are required. The algorithm employs fractional Multi-Commodity Flow (MCF) that determines the widths of the interconnections as well as the routes of the flits. The MCF is rounded to a periodic TDM schedule which is translated to local periodic control of switches a","authors_text":"Guy Even, Yaniv Fais","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-01T12:17:27Z","title":"Algorithms for Network-on-Chip Design with Guaranteed QoS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00249","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:48da6faac09b8c96fa41ccbdc3335fea0e021adace32543ae7ae3572fdec5026","target":"record","created_at":"2026-05-18T01:34:14Z","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":"57219358726d8fc1bfc71b69cb29b8534f9ffb0166d338ecf3373c08818c48e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-01T12:17:27Z","title_canon_sha256":"f3431d0b69ddc80081053c1474bf3709d9b2211c1f3ad4198bd3c32c05e28eb5"},"schema_version":"1.0","source":{"id":"1509.00249","kind":"arxiv","version":1}},"canonical_sha256":"fd968db50c6e9f09faa86e47244212e4234b648c6971145c78e6b3e3df09390e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd968db50c6e9f09faa86e47244212e4234b648c6971145c78e6b3e3df09390e","first_computed_at":"2026-05-18T01:34:14.733058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:14.733058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOaSDFyujffMd0VVK8d6c0rCmt3kPAofSLgeo+BPLmzyHuL3oQ3OsS49I/Vt0Nt5GuPCJjQ3hEbwK9oFsmf6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:14.733674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48da6faac09b8c96fa41ccbdc3335fea0e021adace32543ae7ae3572fdec5026","sha256:66fc586c032276e5db45e6b3cbd39eb8bfef168c06574c3ed66ac38551ba8529"],"state_sha256":"bf03a70d6632c7ccaf11e34bb7c0d44bb9e77fa1cb4ffcd024bbc5c08e56d575"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BX5lxw9QAkNx8QqIifIlKG2bM3QDVud9M9rRsSC5eTcfyW3uWVPaZ9L2ECKZaAdmqtDGp2oCHySx0qFOuew9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:35:10.190537Z","bundle_sha256":"a04430ffca681b6b9a8facbdcf734e6ff904a01ff7a554f7bff03a02a1a61904"}}