{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4MVV4BZ4ETYV6MSP3H4IJXZSRI","short_pith_number":"pith:4MVV4BZ4","canonical_record":{"source":{"id":"1702.07696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T18:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"e1feafaaa736c0559d911b1d2d8bad936610426cb3afdc8aba22b746fb8867ce","abstract_canon_sha256":"f27653e8b8333ab4d177ccbaadc00bb6c3a81d76449f6152085146fd642214e1"},"schema_version":"1.0"},"canonical_sha256":"e32b5e073c24f15f324fd9f884df328a1457a7e215e14dec712ae10f24afe3d7","source":{"kind":"arxiv","id":"1702.07696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07696","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07696v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07696","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"4MVV4BZ4ETYV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4MVV4BZ4ETYV6MSP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4MVV4BZ4","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4MVV4BZ4ETYV6MSP3H4IJXZSRI","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T18:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"e1feafaaa736c0559d911b1d2d8bad936610426cb3afdc8aba22b746fb8867ce","abstract_canon_sha256":"f27653e8b8333ab4d177ccbaadc00bb6c3a81d76449f6152085146fd642214e1"},"schema_version":"1.0"},"canonical_sha256":"e32b5e073c24f15f324fd9f884df328a1457a7e215e14dec712ae10f24afe3d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.468194Z","signature_b64":"xpxItx3ij75+qwP20fntZTE5ocwrfp2za46wMzSCTRorF1O6O7VrIwW3nAIp3fQFoWIh4+tG/i0yOeBx946kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32b5e073c24f15f324fd9f884df328a1457a7e215e14dec712ae10f24afe3d7","last_reissued_at":"2026-05-18T00:50:02.467559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.467559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07696","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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHCQyUGio1ucfiLqKqkF5QaPo++UA6WQmQDZpkkWGiGNEvbKEx05GMUCf/cus0jPo44wmCTLhvEYBWwZxdkxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:12:58.098912Z"},"content_sha256":"cdcb29cea10025bfde2e07059d1025fed24efc03de75851d47c9c07d20091996","schema_version":"1.0","event_id":"sha256:cdcb29cea10025bfde2e07059d1025fed24efc03de75851d47c9c07d20091996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4MVV4BZ4ETYV6MSP3H4IJXZSRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Scheffer, Jan-Marc Reinhardt, S\\'andor P. Fekete","submitted_at":"2017-02-24T18:30:03Z","abstract_excerpt":"In the presence of dynamic insertions and deletions into a partially reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of developing efficient approaches to dynamic defragmentation and reallocation. One key aspect is to develop efficient algorithms and data structures that exploit the two-dimensional geometry of a chip, instead of just one. We propose a new method for this task, based on the fractal structure of a quadtree, which allows dynamic segmentation of the chip area, along with dynamically adjusting the necessary communication infrastructure. We describe a num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07696","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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfEpDkJn0OQJtiSnBxiExqvUZb0bbelvml/rlf68XCSG2H3WgKhZdF1QJB0Beh7Kxx7tjzdtsP4QbsJ1r4VxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:12:58.099645Z"},"content_sha256":"dd3426726775b0f50a561c5a7fe35afd694bd6c48cc2e17afab1cb003842f664","schema_version":"1.0","event_id":"sha256:dd3426726775b0f50a561c5a7fe35afd694bd6c48cc2e17afab1cb003842f664"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI/bundle.json","state_url":"https://pith.science/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI/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-05-29T15:12:58Z","links":{"resolver":"https://pith.science/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI","bundle":"https://pith.science/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI/bundle.json","state":"https://pith.science/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MVV4BZ4ETYV6MSP3H4IJXZSRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4MVV4BZ4ETYV6MSP3H4IJXZSRI","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":"f27653e8b8333ab4d177ccbaadc00bb6c3a81d76449f6152085146fd642214e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T18:30:03Z","title_canon_sha256":"e1feafaaa736c0559d911b1d2d8bad936610426cb3afdc8aba22b746fb8867ce"},"schema_version":"1.0","source":{"id":"1702.07696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07696","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07696v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07696","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"4MVV4BZ4ETYV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4MVV4BZ4ETYV6MSP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4MVV4BZ4","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:dd3426726775b0f50a561c5a7fe35afd694bd6c48cc2e17afab1cb003842f664","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"In the presence of dynamic insertions and deletions into a partially reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of developing efficient approaches to dynamic defragmentation and reallocation. One key aspect is to develop efficient algorithms and data structures that exploit the two-dimensional geometry of a chip, instead of just one. We propose a new method for this task, based on the fractal structure of a quadtree, which allows dynamic segmentation of the chip area, along with dynamically adjusting the necessary communication infrastructure. We describe a num","authors_text":"Christian Scheffer, Jan-Marc Reinhardt, S\\'andor P. Fekete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T18:30:03Z","title":"An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07696","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:cdcb29cea10025bfde2e07059d1025fed24efc03de75851d47c9c07d20091996","target":"record","created_at":"2026-05-18T00:50:02Z","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":"f27653e8b8333ab4d177ccbaadc00bb6c3a81d76449f6152085146fd642214e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T18:30:03Z","title_canon_sha256":"e1feafaaa736c0559d911b1d2d8bad936610426cb3afdc8aba22b746fb8867ce"},"schema_version":"1.0","source":{"id":"1702.07696","kind":"arxiv","version":1}},"canonical_sha256":"e32b5e073c24f15f324fd9f884df328a1457a7e215e14dec712ae10f24afe3d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e32b5e073c24f15f324fd9f884df328a1457a7e215e14dec712ae10f24afe3d7","first_computed_at":"2026-05-18T00:50:02.467559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.467559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xpxItx3ij75+qwP20fntZTE5ocwrfp2za46wMzSCTRorF1O6O7VrIwW3nAIp3fQFoWIh4+tG/i0yOeBx946kAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.468194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdcb29cea10025bfde2e07059d1025fed24efc03de75851d47c9c07d20091996","sha256:dd3426726775b0f50a561c5a7fe35afd694bd6c48cc2e17afab1cb003842f664"],"state_sha256":"24e66f3bad2e9a0ae74a0da70a5a648237454612f75270f912f8cb2a3b51bc52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NHlVdWQLqj7VKe9Jdpa+CxO6KFL6s6VpbPXu+9RH/ymJDA0tFk9PF6bzIAjTUdtvWCpm6njFLvaSL+kzHu3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:12:58.103172Z","bundle_sha256":"752fc97c8b15ea27dc3948539222f604ede96a1d74cab19bd29879902d0bac77"}}