{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7WLI3NIMN2PQT6VINZDSIQQS4Q","short_pith_number":"pith:7WLI3NIM","schema_version":"1.0","canonical_sha256":"fd968db50c6e9f09faa86e47244212e4234b648c6971145c78e6b3e3df09390e","source":{"kind":"arxiv","id":"1509.00249","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.00249","created_at":"2026-05-18T01:34:14.733161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00249v1","created_at":"2026-05-18T01:34:14.733161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00249","created_at":"2026-05-18T01:34:14.733161+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WLI3NIMN2PQ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WLI3NIMN2PQT6VI","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WLI3NIM","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q","json":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q.json","graph_json":"https://pith.science/api/pith-number/7WLI3NIMN2PQT6VINZDSIQQS4Q/graph.json","events_json":"https://pith.science/api/pith-number/7WLI3NIMN2PQT6VINZDSIQQS4Q/events.json","paper":"https://pith.science/paper/7WLI3NIM"},"agent_actions":{"view_html":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q","download_json":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q.json","view_paper":"https://pith.science/paper/7WLI3NIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00249&json=true","fetch_graph":"https://pith.science/api/pith-number/7WLI3NIMN2PQT6VINZDSIQQS4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/7WLI3NIMN2PQT6VINZDSIQQS4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/action/storage_attestation","attest_author":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/action/author_attestation","sign_citation":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/action/citation_signature","submit_replication":"https://pith.science/pith/7WLI3NIMN2PQT6VINZDSIQQS4Q/action/replication_record"}},"created_at":"2026-05-18T01:34:14.733161+00:00","updated_at":"2026-05-18T01:34:14.733161+00:00"}