{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:ZJN4GG7D3KGQRBT3MJB3YGI3MK","short_pith_number":"pith:ZJN4GG7D","schema_version":"1.0","canonical_sha256":"ca5bc31be3da8d08867b6243bc191b628c34944717f6676adee08f842f0bdb30","source":{"kind":"arxiv","id":"cs/0406035","version":3},"attestation_state":"computed","paper":{"title":"Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices","license":"","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Ali Ahmadinia, Christophe Bobda, Jan van der Veen, Juergen Teich, Sandor Fekete","submitted_at":"2004-06-18T13:29:46Z","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"},"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":"cs/0406035","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2004-06-18T13:29:46Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"67f63670b93dd620e043ab13c446ee60835d76dd312027c4b00bc99f4333371d","abstract_canon_sha256":"ecb2ecd966d4256cf117eeb02b13d1dd94e01c2601e4173ec287a07c5d7b7f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.361584Z","signature_b64":"3u1mcljkTv3paTcDvT9mDfnDMjCMOqrZXDbzbnoltrHgH9Gm+t7Bzoqw5sWe7IGzr/T8JJftg2uiZ8D5gxpfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca5bc31be3da8d08867b6243bc191b628c34944717f6676adee08f842f0bdb30","last_reissued_at":"2026-05-18T00:58:56.360956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.360956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices","license":"","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Ali Ahmadinia, Christophe Bobda, Jan van der Veen, Juergen Teich, Sandor Fekete","submitted_at":"2004-06-18T13:29:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406035","kind":"arxiv","version":3},"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":"cs/0406035","created_at":"2026-05-18T00:58:56.361046+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0406035v3","created_at":"2026-05-18T00:58:56.361046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406035","created_at":"2026-05-18T00:58:56.361046+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJN4GG7D3KGQ","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJN4GG7D3KGQRBT3","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJN4GG7D","created_at":"2026-05-18T12:25:52.687210+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/ZJN4GG7D3KGQRBT3MJB3YGI3MK","json":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK.json","graph_json":"https://pith.science/api/pith-number/ZJN4GG7D3KGQRBT3MJB3YGI3MK/graph.json","events_json":"https://pith.science/api/pith-number/ZJN4GG7D3KGQRBT3MJB3YGI3MK/events.json","paper":"https://pith.science/paper/ZJN4GG7D"},"agent_actions":{"view_html":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK","download_json":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK.json","view_paper":"https://pith.science/paper/ZJN4GG7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0406035&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJN4GG7D3KGQRBT3MJB3YGI3MK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJN4GG7D3KGQRBT3MJB3YGI3MK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK/action/storage_attestation","attest_author":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK/action/author_attestation","sign_citation":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK/action/citation_signature","submit_replication":"https://pith.science/pith/ZJN4GG7D3KGQRBT3MJB3YGI3MK/action/replication_record"}},"created_at":"2026-05-18T00:58:56.361046+00:00","updated_at":"2026-05-18T00:58:56.361046+00:00"}