{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:EGUOK6ZLDYENOIWBSC4LL2OFC7","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":"ceed535d3f24d25a4682c8894cef9894b69fa66475a1121b9e82e058af3c93c7","cross_cats_sorted":[],"license":"","primary_cat":"cs.AR","submitted_at":"2005-03-24T12:36:07Z","title_canon_sha256":"c3ce4692501849a835638a6eb34b5d921998207e6219f2a11852cfb1d71611f9"},"schema_version":"1.0","source":{"id":"cs/0503066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0503066","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0503066v1","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0503066","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"EGUOK6ZLDYEN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"EGUOK6ZLDYENOIWB","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"EGUOK6ZL","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:2d43bba829c2e2aa55fd9c496af18770b38d284dcb8a9f9c292ff9c3d8b1b794","target":"graph","created_at":"2026-05-18T01:06:49Z","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":"Management of communication by on-line routing in new FPGAs with a large amount of logic resources and partial reconfigurability is a new challenging problem. A Network-on-Chip\n (NoC) typically uses packet routing mechanism, which has often unsafe data transfers, and network interface overhead. In this paper, circuit routing for such dynamic NoCs is investigated, and a practical 1-dimensional network with an efficient routing algorithm is proposed and implemented. Also, this concept has been extended to the 2-dimensional case. The implementation results show the low area overhead and high perf","authors_text":"Ali Ahmadinia, Christophe Bobda, Jan van der Veen, Ji Ding, Juergen Teich, Mateusz Majer, Sandor P. Fekete","cross_cats":[],"headline":"","license":"","primary_cat":"cs.AR","submitted_at":"2005-03-24T12:36:07Z","title":"A Practical Approach for Circuit Routing on Dynamic Reconfigurable Devices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0503066","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:979ddcc3e77b20831c5acf4749dc6357c0cfbb12134f25d490723ce0431e1116","target":"record","created_at":"2026-05-18T01:06:49Z","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":"ceed535d3f24d25a4682c8894cef9894b69fa66475a1121b9e82e058af3c93c7","cross_cats_sorted":[],"license":"","primary_cat":"cs.AR","submitted_at":"2005-03-24T12:36:07Z","title_canon_sha256":"c3ce4692501849a835638a6eb34b5d921998207e6219f2a11852cfb1d71611f9"},"schema_version":"1.0","source":{"id":"cs/0503066","kind":"arxiv","version":1}},"canonical_sha256":"21a8e57b2b1e08d722c190b8b5e9c517c8601c9c40b3f28061939ef6a9b20899","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21a8e57b2b1e08d722c190b8b5e9c517c8601c9c40b3f28061939ef6a9b20899","first_computed_at":"2026-05-18T01:06:49.151583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:49.151583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42xr5hkGEd7p6dH5wvIneUF5+nASShBBVSiJdd5pDxZvv3xv+OmxUQUb/tWpJEffJfeSYrywf7nIG7JFMEUhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:49.152223Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0503066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:979ddcc3e77b20831c5acf4749dc6357c0cfbb12134f25d490723ce0431e1116","sha256:2d43bba829c2e2aa55fd9c496af18770b38d284dcb8a9f9c292ff9c3d8b1b794"],"state_sha256":"4c03f34da0e102a3bcafa345c99073a13578afb6c4050be82afa164bf930415a"}