{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OVWFPTF4HPFDMKPTB363F4TOV7","short_pith_number":"pith:OVWFPTF4","schema_version":"1.0","canonical_sha256":"756c57ccbc3bca3629f30efdb2f26eafee85002d4287cdd0542cffd02b2fbe82","source":{"kind":"arxiv","id":"1401.3172","version":1},"attestation_state":"computed","paper":{"title":"An iterative merging placement algorithm for the fixed-outline floorplanning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chumin Li, Kun He, Pengli Ji","submitted_at":"2014-01-14T13:07:19Z","abstract_excerpt":"Given a set of rectangular modules with fixed area and variable dimensions, and a fixed rectangular circuit. The placement of Fixed-Outline Floorplanning with Soft Modules (FOFSM) aims to determine the dimensions and position of each module on the circuit. We present a two-stage Iterative Merging Placement (IMP) algorithm for the FOFSM with zero deadspace constraint. The first stage iteratively merges two modules with the least area into a composite module to achieve a final composite module, and builds up a slicing tree in a bottom-up hierarchy. The second stage recursively determines the rel"},"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":"1401.3172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-14T13:07:19Z","cross_cats_sorted":[],"title_canon_sha256":"a5cdfb282d4ded09c9db565966d709ba836fd08171591f8080413b9fcd8c25d7","abstract_canon_sha256":"3b1842b9d9b5d8657f30914ced09887b32e511379fa68456323f83e26d92ff0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:19.433577Z","signature_b64":"hCORgXgs+Mk8R8WYO+T8plpTiqyjZwWxV3lq0zXT8Uq5cE24RLwrkIZYt0ykpNJ+u2CDRM7wl+1KYNZRUPkKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756c57ccbc3bca3629f30efdb2f26eafee85002d4287cdd0542cffd02b2fbe82","last_reissued_at":"2026-05-18T03:02:19.432735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:19.432735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An iterative merging placement algorithm for the fixed-outline floorplanning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chumin Li, Kun He, Pengli Ji","submitted_at":"2014-01-14T13:07:19Z","abstract_excerpt":"Given a set of rectangular modules with fixed area and variable dimensions, and a fixed rectangular circuit. The placement of Fixed-Outline Floorplanning with Soft Modules (FOFSM) aims to determine the dimensions and position of each module on the circuit. We present a two-stage Iterative Merging Placement (IMP) algorithm for the FOFSM with zero deadspace constraint. The first stage iteratively merges two modules with the least area into a composite module to achieve a final composite module, and builds up a slicing tree in a bottom-up hierarchy. The second stage recursively determines the rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3172","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":"1401.3172","created_at":"2026-05-18T03:02:19.432871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3172v1","created_at":"2026-05-18T03:02:19.432871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3172","created_at":"2026-05-18T03:02:19.432871+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVWFPTF4HPFD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVWFPTF4HPFDMKPT","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVWFPTF4","created_at":"2026-05-18T12:28:43.426989+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/OVWFPTF4HPFDMKPTB363F4TOV7","json":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7.json","graph_json":"https://pith.science/api/pith-number/OVWFPTF4HPFDMKPTB363F4TOV7/graph.json","events_json":"https://pith.science/api/pith-number/OVWFPTF4HPFDMKPTB363F4TOV7/events.json","paper":"https://pith.science/paper/OVWFPTF4"},"agent_actions":{"view_html":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7","download_json":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7.json","view_paper":"https://pith.science/paper/OVWFPTF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3172&json=true","fetch_graph":"https://pith.science/api/pith-number/OVWFPTF4HPFDMKPTB363F4TOV7/graph.json","fetch_events":"https://pith.science/api/pith-number/OVWFPTF4HPFDMKPTB363F4TOV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7/action/storage_attestation","attest_author":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7/action/author_attestation","sign_citation":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7/action/citation_signature","submit_replication":"https://pith.science/pith/OVWFPTF4HPFDMKPTB363F4TOV7/action/replication_record"}},"created_at":"2026-05-18T03:02:19.432871+00:00","updated_at":"2026-05-18T03:02:19.432871+00:00"}