{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3T277QHFMTU37BDYVMXY5HSE6T","short_pith_number":"pith:3T277QHF","schema_version":"1.0","canonical_sha256":"dcf5ffc0e564e9bf8478ab2f8e9e44f4f0b71c8b6e726b451dce08ec7d59c613","source":{"kind":"arxiv","id":"1101.5407","version":1},"attestation_state":"computed","paper":{"title":"Maintaining Arrays of Contiguous Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael A. Bender, Nils Schweer, S\\'andor P. Fekete, Tom Kamphans","submitted_at":"2011-01-27T22:48:51Z","abstract_excerpt":"In this paper we consider methods for dynamically storing a set of different objects (\"modules\") in a physical array. Each module requires one free contiguous subinterval in order to be placed. Items are inserted or removed, resulting in a fragmented layout that makes it harder to insert further modules. It is possible to relocate modules, one at a time, to another free subinterval that is contiguous and does not overlap with the current location of the module. These constraints clearly distinguish our problem from classical memory allocation. We present a number of algorithmic results, includ"},"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":"1101.5407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-27T22:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"73f335dd98167f847e9aebdb80831981288d9560c76c5b8846b29decb1918b89","abstract_canon_sha256":"7d5dd260fdae435b75faf4aa31917fd8cb65631aefd5785caa27f431d5205227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:35.069979Z","signature_b64":"Tc2nqLYDqJIZ3Qy3186HvyErrm762nB8AUuCZqQFuh9p9wW5be8OQC9Mvt7SndsSRkLy5yecIsBS4ECLFg6TAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf5ffc0e564e9bf8478ab2f8e9e44f4f0b71c8b6e726b451dce08ec7d59c613","last_reissued_at":"2026-05-18T04:30:35.069487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:35.069487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maintaining Arrays of Contiguous Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael A. Bender, Nils Schweer, S\\'andor P. Fekete, Tom Kamphans","submitted_at":"2011-01-27T22:48:51Z","abstract_excerpt":"In this paper we consider methods for dynamically storing a set of different objects (\"modules\") in a physical array. Each module requires one free contiguous subinterval in order to be placed. Items are inserted or removed, resulting in a fragmented layout that makes it harder to insert further modules. It is possible to relocate modules, one at a time, to another free subinterval that is contiguous and does not overlap with the current location of the module. These constraints clearly distinguish our problem from classical memory allocation. We present a number of algorithmic results, includ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5407","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":"1101.5407","created_at":"2026-05-18T04:30:35.069556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5407v1","created_at":"2026-05-18T04:30:35.069556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5407","created_at":"2026-05-18T04:30:35.069556+00:00"},{"alias_kind":"pith_short_12","alias_value":"3T277QHFMTU3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3T277QHFMTU37BDY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3T277QHF","created_at":"2026-05-18T12:26:20.644004+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/3T277QHFMTU37BDYVMXY5HSE6T","json":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T.json","graph_json":"https://pith.science/api/pith-number/3T277QHFMTU37BDYVMXY5HSE6T/graph.json","events_json":"https://pith.science/api/pith-number/3T277QHFMTU37BDYVMXY5HSE6T/events.json","paper":"https://pith.science/paper/3T277QHF"},"agent_actions":{"view_html":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T","download_json":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T.json","view_paper":"https://pith.science/paper/3T277QHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5407&json=true","fetch_graph":"https://pith.science/api/pith-number/3T277QHFMTU37BDYVMXY5HSE6T/graph.json","fetch_events":"https://pith.science/api/pith-number/3T277QHFMTU37BDYVMXY5HSE6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T/action/storage_attestation","attest_author":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T/action/author_attestation","sign_citation":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T/action/citation_signature","submit_replication":"https://pith.science/pith/3T277QHFMTU37BDYVMXY5HSE6T/action/replication_record"}},"created_at":"2026-05-18T04:30:35.069556+00:00","updated_at":"2026-05-18T04:30:35.069556+00:00"}