{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SKFFOK6F7HZKUSALPR3N7N3MD5","short_pith_number":"pith:SKFFOK6F","schema_version":"1.0","canonical_sha256":"928a572bc5f9f2aa480b7c76dfb76c1f5582db13de44807f242e12bc277a2ca3","source":{"kind":"arxiv","id":"1402.2462","version":1},"attestation_state":"computed","paper":{"title":"Floorplanning and Topology Generation for Application-Specific Network-on-Chip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bei Yu, Satoshi Goto, Sheqin Dong, Song Chen","submitted_at":"2014-02-11T11:57:04Z","abstract_excerpt":"Network-on-chip (NoC) architectures have been proposed as a promising alternative to classical bus-based communication architectures. In this paper, we propose a two phases framework to solve application-specific NoCs topology generation problem. At floorplanning phase, we carry out partition driven floorplanning. At post-floorplanning phase, a heuristic method and a min-cost max-flow algorithm is used to insert switches and network interfaces. Finally, we allocate paths to minimize power consumption. The experimental results show our algorithm is effective for power saving."},"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":"1402.2462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2014-02-11T11:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"f22522d051f84b24b2c0c4465ca08ec2d7a726b21144f184e9e98c5ab989ef30","abstract_canon_sha256":"1ea590b297049dd9f499daebee37a960dc50cb3c07dbb32c83f0807ed6031fcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:19.696494Z","signature_b64":"oDs+oSx71JQ97y7JaXXAKqaxg/FANPW2a77Xz3OZjjQEy8c3nRP3FyOd6HDD9CoEOiiF/uNp6vxUcY5fTgqLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"928a572bc5f9f2aa480b7c76dfb76c1f5582db13de44807f242e12bc277a2ca3","last_reissued_at":"2026-05-18T02:59:19.695584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:19.695584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Floorplanning and Topology Generation for Application-Specific Network-on-Chip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bei Yu, Satoshi Goto, Sheqin Dong, Song Chen","submitted_at":"2014-02-11T11:57:04Z","abstract_excerpt":"Network-on-chip (NoC) architectures have been proposed as a promising alternative to classical bus-based communication architectures. In this paper, we propose a two phases framework to solve application-specific NoCs topology generation problem. At floorplanning phase, we carry out partition driven floorplanning. At post-floorplanning phase, a heuristic method and a min-cost max-flow algorithm is used to insert switches and network interfaces. Finally, we allocate paths to minimize power consumption. The experimental results show our algorithm is effective for power saving."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2462","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":"1402.2462","created_at":"2026-05-18T02:59:19.695734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2462v1","created_at":"2026-05-18T02:59:19.695734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2462","created_at":"2026-05-18T02:59:19.695734+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKFFOK6F7HZK","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKFFOK6F7HZKUSAL","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKFFOK6F","created_at":"2026-05-18T12:28:49.207871+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/SKFFOK6F7HZKUSALPR3N7N3MD5","json":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5.json","graph_json":"https://pith.science/api/pith-number/SKFFOK6F7HZKUSALPR3N7N3MD5/graph.json","events_json":"https://pith.science/api/pith-number/SKFFOK6F7HZKUSALPR3N7N3MD5/events.json","paper":"https://pith.science/paper/SKFFOK6F"},"agent_actions":{"view_html":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5","download_json":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5.json","view_paper":"https://pith.science/paper/SKFFOK6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2462&json=true","fetch_graph":"https://pith.science/api/pith-number/SKFFOK6F7HZKUSALPR3N7N3MD5/graph.json","fetch_events":"https://pith.science/api/pith-number/SKFFOK6F7HZKUSALPR3N7N3MD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5/action/storage_attestation","attest_author":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5/action/author_attestation","sign_citation":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5/action/citation_signature","submit_replication":"https://pith.science/pith/SKFFOK6F7HZKUSALPR3N7N3MD5/action/replication_record"}},"created_at":"2026-05-18T02:59:19.695734+00:00","updated_at":"2026-05-18T02:59:19.695734+00:00"}