{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SNZNKRCQ2AK7XUEKJMPCYMEPXB","short_pith_number":"pith:SNZNKRCQ","schema_version":"1.0","canonical_sha256":"9372d54450d015fbd08a4b1e2c308fb84631e59933cf28dd9f18f4618529ae9f","source":{"kind":"arxiv","id":"1509.01867","version":1},"attestation_state":"computed","paper":{"title":"A macro placer algorithm for chip design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Attila De\\'ak, Endre Cs\\'oka","submitted_at":"2015-09-06T23:33:23Z","abstract_excerpt":"There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be placed without overlaps in order to minimize the total length of wires. We present a heuristic algorithm which utilizes a special data structure for representing two dimensional stepfunctions. This results in fast integral computation and function modification over rectangles. Our heuristics, especially our data structure for two-dimensional functions, may be useful in other applications, as well."},"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":"1509.01867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-06T23:33:23Z","cross_cats_sorted":[],"title_canon_sha256":"6d42eb117c3e821a8d9a2dfbe4071238d6effdf29d302a5b18ce82fbbab207fa","abstract_canon_sha256":"590604fcf58f141eba289dea1ab2742e07b15638672d9ecb3073ef8997da7ed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:50.331326Z","signature_b64":"sZz+gHczFneTTwT+c7DQA0SZDpu5VMlRGuANljkDp8kZNsNhYmWAYhxk0+Q0c8N7OZSdc9jSALQgNAnldNW7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9372d54450d015fbd08a4b1e2c308fb84631e59933cf28dd9f18f4618529ae9f","last_reissued_at":"2026-05-18T01:33:50.330536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:50.330536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A macro placer algorithm for chip design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Attila De\\'ak, Endre Cs\\'oka","submitted_at":"2015-09-06T23:33:23Z","abstract_excerpt":"There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be placed without overlaps in order to minimize the total length of wires. We present a heuristic algorithm which utilizes a special data structure for representing two dimensional stepfunctions. This results in fast integral computation and function modification over rectangles. Our heuristics, especially our data structure for two-dimensional functions, may be useful in other applications, as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01867","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":"1509.01867","created_at":"2026-05-18T01:33:50.330679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01867v1","created_at":"2026-05-18T01:33:50.330679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01867","created_at":"2026-05-18T01:33:50.330679+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNZNKRCQ2AK7","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNZNKRCQ2AK7XUEK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNZNKRCQ","created_at":"2026-05-18T12:29:42.218222+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/SNZNKRCQ2AK7XUEKJMPCYMEPXB","json":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB.json","graph_json":"https://pith.science/api/pith-number/SNZNKRCQ2AK7XUEKJMPCYMEPXB/graph.json","events_json":"https://pith.science/api/pith-number/SNZNKRCQ2AK7XUEKJMPCYMEPXB/events.json","paper":"https://pith.science/paper/SNZNKRCQ"},"agent_actions":{"view_html":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB","download_json":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB.json","view_paper":"https://pith.science/paper/SNZNKRCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01867&json=true","fetch_graph":"https://pith.science/api/pith-number/SNZNKRCQ2AK7XUEKJMPCYMEPXB/graph.json","fetch_events":"https://pith.science/api/pith-number/SNZNKRCQ2AK7XUEKJMPCYMEPXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/action/storage_attestation","attest_author":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/action/author_attestation","sign_citation":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/action/citation_signature","submit_replication":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/action/replication_record"}},"created_at":"2026-05-18T01:33:50.330679+00:00","updated_at":"2026-05-18T01:33:50.330679+00:00"}