{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SNZNKRCQ2AK7XUEKJMPCYMEPXB","short_pith_number":"pith:SNZNKRCQ","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"},"canonical_sha256":"9372d54450d015fbd08a4b1e2c308fb84631e59933cf28dd9f18f4618529ae9f","source":{"kind":"arxiv","id":"1509.01867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01867","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01867v1","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01867","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"pith_short_12","alias_value":"SNZNKRCQ2AK7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNZNKRCQ2AK7XUEK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNZNKRCQ","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SNZNKRCQ2AK7XUEKJMPCYMEPXB","target":"record","payload":{"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"},"canonical_sha256":"9372d54450d015fbd08a4b1e2c308fb84631e59933cf28dd9f18f4618529ae9f","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"},"source_kind":"arxiv","source_id":"1509.01867","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxC/CSqR3nWv2Lcchn64PEH8EfADIwXnPZsEguN3ikJ6iEfK9Yya+EsDi81WY0gIAPyIVWjFlwDANgS92/XTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:09:56.833787Z"},"content_sha256":"e7052b5ea862907bde996bd0ee8c368b524e5d294f7bcec913742a812fc34fac","schema_version":"1.0","event_id":"sha256:e7052b5ea862907bde996bd0ee8c368b524e5d294f7bcec913742a812fc34fac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SNZNKRCQ2AK7XUEKJMPCYMEPXB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHgtgZ1zPgk7v1oSvx6b0hK+ilMZDSrOlKRxkaLMGb4y/GCQ2IXJTuPitMNhMuvbJPT0bKNkJQvgx4gsA+iiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:09:56.834120Z"},"content_sha256":"19ae2455d42ac2454593ecbc7fe3e522cade6ea796f84129f83b66f3996f9e18","schema_version":"1.0","event_id":"sha256:19ae2455d42ac2454593ecbc7fe3e522cade6ea796f84129f83b66f3996f9e18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/bundle.json","state_url":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T13:09:56Z","links":{"resolver":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB","bundle":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/bundle.json","state":"https://pith.science/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNZNKRCQ2AK7XUEKJMPCYMEPXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SNZNKRCQ2AK7XUEKJMPCYMEPXB","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":"590604fcf58f141eba289dea1ab2742e07b15638672d9ecb3073ef8997da7ed3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-06T23:33:23Z","title_canon_sha256":"6d42eb117c3e821a8d9a2dfbe4071238d6effdf29d302a5b18ce82fbbab207fa"},"schema_version":"1.0","source":{"id":"1509.01867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01867","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01867v1","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01867","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"pith_short_12","alias_value":"SNZNKRCQ2AK7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNZNKRCQ2AK7XUEK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNZNKRCQ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:19ae2455d42ac2454593ecbc7fe3e522cade6ea796f84129f83b66f3996f9e18","target":"graph","created_at":"2026-05-18T01:33:50Z","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":"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.","authors_text":"Attila De\\'ak, Endre Cs\\'oka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-06T23:33:23Z","title":"A macro placer algorithm for chip design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01867","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:e7052b5ea862907bde996bd0ee8c368b524e5d294f7bcec913742a812fc34fac","target":"record","created_at":"2026-05-18T01:33:50Z","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":"590604fcf58f141eba289dea1ab2742e07b15638672d9ecb3073ef8997da7ed3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-06T23:33:23Z","title_canon_sha256":"6d42eb117c3e821a8d9a2dfbe4071238d6effdf29d302a5b18ce82fbbab207fa"},"schema_version":"1.0","source":{"id":"1509.01867","kind":"arxiv","version":1}},"canonical_sha256":"9372d54450d015fbd08a4b1e2c308fb84631e59933cf28dd9f18f4618529ae9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9372d54450d015fbd08a4b1e2c308fb84631e59933cf28dd9f18f4618529ae9f","first_computed_at":"2026-05-18T01:33:50.330536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:50.330536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sZz+gHczFneTTwT+c7DQA0SZDpu5VMlRGuANljkDp8kZNsNhYmWAYhxk0+Q0c8N7OZSdc9jSALQgNAnldNW7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:50.331326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7052b5ea862907bde996bd0ee8c368b524e5d294f7bcec913742a812fc34fac","sha256:19ae2455d42ac2454593ecbc7fe3e522cade6ea796f84129f83b66f3996f9e18"],"state_sha256":"b97e79eb84f522335f6c57dbe49b22d1ed31025c92fdd00e254e586e2ccdcc0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jgh8ypPdcfygTQwEyOJMXeJfe+jNEbKL3M0cNeYp/qRgUAN6Q+Cy7GUb+F9SU9fbF1XZ83HJlD9WfCFGf7O8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:09:56.836213Z","bundle_sha256":"19f6a60af0a5350272c67e024b157603051b9a8f8680bb2b2b3171d444cc6f34"}}