{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:ZJN4GG7D3KGQRBT3MJB3YGI3MK","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":"ecb2ecd966d4256cf117eeb02b13d1dd94e01c2601e4173ec287a07c5d7b7f2d","cross_cats_sorted":["cs.CG"],"license":"","primary_cat":"cs.DS","submitted_at":"2004-06-18T13:29:46Z","title_canon_sha256":"67f63670b93dd620e043ab13c446ee60835d76dd312027c4b00bc99f4333371d"},"schema_version":"1.0","source":{"id":"cs/0406035","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0406035","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0406035v3","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406035","created_at":"2026-05-18T00:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZJN4GG7D3KGQ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZJN4GG7D3KGQRBT3","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZJN4GG7D","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:14731dd65aa08c69ee66d13630a5975382d011f78602ac7e0a5db8cf8588df7f","target":"graph","created_at":"2026-05-18T00:58:56Z","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 describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of computational geometry, we derive a method that allows correct maintainance of free and occupied space of a set of n rectangular modules in optimal time Theta(n log n); previous approaches needed a time of O(n^2) for correct results and O(n) for heuristic results. We also show that finding an optimal feasible communication-conscious placement (which minimizes the total weighted Manhattan distance between the new mod","authors_text":"Ali Ahmadinia, Christophe Bobda, Jan van der Veen, Juergen Teich, Sandor Fekete","cross_cats":["cs.CG"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2004-06-18T13:29:46Z","title":"Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406035","kind":"arxiv","version":3},"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:cf982bccd45fa3ddbec1a195eccd7f2c6ef1b4118e51b627f50586950814081f","target":"record","created_at":"2026-05-18T00:58:56Z","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":"ecb2ecd966d4256cf117eeb02b13d1dd94e01c2601e4173ec287a07c5d7b7f2d","cross_cats_sorted":["cs.CG"],"license":"","primary_cat":"cs.DS","submitted_at":"2004-06-18T13:29:46Z","title_canon_sha256":"67f63670b93dd620e043ab13c446ee60835d76dd312027c4b00bc99f4333371d"},"schema_version":"1.0","source":{"id":"cs/0406035","kind":"arxiv","version":3}},"canonical_sha256":"ca5bc31be3da8d08867b6243bc191b628c34944717f6676adee08f842f0bdb30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca5bc31be3da8d08867b6243bc191b628c34944717f6676adee08f842f0bdb30","first_computed_at":"2026-05-18T00:58:56.360956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:56.360956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3u1mcljkTv3paTcDvT9mDfnDMjCMOqrZXDbzbnoltrHgH9Gm+t7Bzoqw5sWe7IGzr/T8JJftg2uiZ8D5gxpfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:56.361584Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0406035","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf982bccd45fa3ddbec1a195eccd7f2c6ef1b4118e51b627f50586950814081f","sha256:14731dd65aa08c69ee66d13630a5975382d011f78602ac7e0a5db8cf8588df7f"],"state_sha256":"75398d05c94f977fce220cf6ec006e13702e4fcf1155bfe6e8c47bed18ee26e1"}