{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7E4JGY6MMKRVRENNEK4QKSNFLH","short_pith_number":"pith:7E4JGY6M","canonical_record":{"source":{"id":"1012.5330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-24T01:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"c949c33c5266792510503f620e9544430f0ce95230d331ad1eaa1e2d6c772fe9","abstract_canon_sha256":"772040e97d42dd00e5be1730b7b6ec4296ecf218b1548878d770a8fff25151b8"},"schema_version":"1.0"},"canonical_sha256":"f9389363cc62a35891ad22b90549a559d7e24c4c7258983eb6fabe99053ec908","source":{"kind":"arxiv","id":"1012.5330","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5330","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5330v2","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5330","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"7E4JGY6MMKRV","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7E4JGY6MMKRVRENN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7E4JGY6M","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7E4JGY6MMKRVRENNEK4QKSNFLH","target":"record","payload":{"canonical_record":{"source":{"id":"1012.5330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-24T01:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"c949c33c5266792510503f620e9544430f0ce95230d331ad1eaa1e2d6c772fe9","abstract_canon_sha256":"772040e97d42dd00e5be1730b7b6ec4296ecf218b1548878d770a8fff25151b8"},"schema_version":"1.0"},"canonical_sha256":"f9389363cc62a35891ad22b90549a559d7e24c4c7258983eb6fabe99053ec908","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:33.566022Z","signature_b64":"oGVVnnankmy58GaJOXbWHrEiVchCq/z2KbW0sjprkx2bvw9ocb12+ZZ863CWqF84GnER5pfBqQ9BVAZE63rwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9389363cc62a35891ad22b90549a559d7e24c4c7258983eb6fabe99053ec908","last_reissued_at":"2026-05-18T04:08:33.565503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:33.565503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.5330","source_version":2,"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-18T04:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4YvB/oO92f05bvonSzR99vOAKku1rPlnbe3PHnBm3VKaNP95gfMIv1b/gvczI0cMC4qeIzN5JTAGl2T9P1wDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:31:35.345626Z"},"content_sha256":"1bac9854ff464063a35b65e929153ac637302007d8c6a4b536f7e2b3e12256c0","schema_version":"1.0","event_id":"sha256:1bac9854ff464063a35b65e929153ac637302007d8c6a4b536f7e2b3e12256c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7E4JGY6MMKRVRENNEK4QKSNFLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No-Break Dynamic Defragmentation of Reconfigurable Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Tessars, Dirk Koch, Jan C. van der Veen, Josef Angermeier, Juergen Teich, Nils Schweer, Sandor Fekete, Tom Kamphans","submitted_at":"2010-12-24T01:16:08Z","abstract_excerpt":"We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs. Our method is based on dynamic relocation of module positions during runtime, with only very little reconfiguration overhead; the objective is to maximize the length of contiguous free space that is available for new modules. We describe a number of algorithmic aspects of good defragmentation, and present an optimization method based on tabu search. Experimental r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5330","kind":"arxiv","version":2},"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-18T04:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kQb+VHbNwNusVHURQoaXmgS6Pl26qu+YgMj8Yvec7+zF7NwZKOSnMSz2Y4aE44xQ3JdmFf62YUErsrLfWdHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:31:35.345982Z"},"content_sha256":"c936a142df6d342cdf64ca9ef572d2cedc2fbb84225236089c9d19eb013fee0a","schema_version":"1.0","event_id":"sha256:c936a142df6d342cdf64ca9ef572d2cedc2fbb84225236089c9d19eb013fee0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7E4JGY6MMKRVRENNEK4QKSNFLH/bundle.json","state_url":"https://pith.science/pith/7E4JGY6MMKRVRENNEK4QKSNFLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7E4JGY6MMKRVRENNEK4QKSNFLH/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-01T04:31:35Z","links":{"resolver":"https://pith.science/pith/7E4JGY6MMKRVRENNEK4QKSNFLH","bundle":"https://pith.science/pith/7E4JGY6MMKRVRENNEK4QKSNFLH/bundle.json","state":"https://pith.science/pith/7E4JGY6MMKRVRENNEK4QKSNFLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7E4JGY6MMKRVRENNEK4QKSNFLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7E4JGY6MMKRVRENNEK4QKSNFLH","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":"772040e97d42dd00e5be1730b7b6ec4296ecf218b1548878d770a8fff25151b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-24T01:16:08Z","title_canon_sha256":"c949c33c5266792510503f620e9544430f0ce95230d331ad1eaa1e2d6c772fe9"},"schema_version":"1.0","source":{"id":"1012.5330","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5330","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5330v2","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5330","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"7E4JGY6MMKRV","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7E4JGY6MMKRVRENN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7E4JGY6M","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:c936a142df6d342cdf64ca9ef572d2cedc2fbb84225236089c9d19eb013fee0a","target":"graph","created_at":"2026-05-18T04:08:33Z","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 propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with inhomogeneities found in commonly used FPGAs. Our method is based on dynamic relocation of module positions during runtime, with only very little reconfiguration overhead; the objective is to maximize the length of contiguous free space that is available for new modules. We describe a number of algorithmic aspects of good defragmentation, and present an optimization method based on tabu search. Experimental r","authors_text":"Christopher Tessars, Dirk Koch, Jan C. van der Veen, Josef Angermeier, Juergen Teich, Nils Schweer, Sandor Fekete, Tom Kamphans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-24T01:16:08Z","title":"No-Break Dynamic Defragmentation of Reconfigurable Devices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5330","kind":"arxiv","version":2},"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:1bac9854ff464063a35b65e929153ac637302007d8c6a4b536f7e2b3e12256c0","target":"record","created_at":"2026-05-18T04:08:33Z","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":"772040e97d42dd00e5be1730b7b6ec4296ecf218b1548878d770a8fff25151b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-24T01:16:08Z","title_canon_sha256":"c949c33c5266792510503f620e9544430f0ce95230d331ad1eaa1e2d6c772fe9"},"schema_version":"1.0","source":{"id":"1012.5330","kind":"arxiv","version":2}},"canonical_sha256":"f9389363cc62a35891ad22b90549a559d7e24c4c7258983eb6fabe99053ec908","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9389363cc62a35891ad22b90549a559d7e24c4c7258983eb6fabe99053ec908","first_computed_at":"2026-05-18T04:08:33.565503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:33.565503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oGVVnnankmy58GaJOXbWHrEiVchCq/z2KbW0sjprkx2bvw9ocb12+ZZ863CWqF84GnER5pfBqQ9BVAZE63rwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:33.566022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5330","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bac9854ff464063a35b65e929153ac637302007d8c6a4b536f7e2b3e12256c0","sha256:c936a142df6d342cdf64ca9ef572d2cedc2fbb84225236089c9d19eb013fee0a"],"state_sha256":"69000f997c789663e7afb6902919aea51c57d792473340166268c2c204152795"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaJIp6iBfDsKAHKcsJAgqX4JoTrC38eSHsFQsNN8wEGfHh8uKSFgIhjA+HlBIeg7CVOKvTVw63M2HrGusRhOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:31:35.348231Z","bundle_sha256":"2298d416cda1984c4b7c6d105aa349f1018aa62b170270823482afdfbb8b559a"}}