{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L7ZGWHHCLOSGD7TK2QQZBFRIYC","short_pith_number":"pith:L7ZGWHHC","schema_version":"1.0","canonical_sha256":"5ff26b1ce25ba461fe6ad421909628c09d1282b7e93dd2ece03c5b1e965ba99b","source":{"kind":"arxiv","id":"1404.2019","version":3},"attestation_state":"computed","paper":{"title":"Cost-oblivious storage reallocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman, Martin Farach-Colton, Michael A. Bender, S\\'andor P. Fekete, Seth Gilbert","submitted_at":"2014-04-08T06:37:46Z","abstract_excerpt":"Databases need to allocate and free blocks of storage on disk. Freed blocks introduce holes where no data is stored. Allocation systems attempt to reuse such deallocated regions in order to minimize the footprint on disk. If previously allocated blocks cannot be moved, the problem is called the memory allocation problem, which is known to have a logarithmic overhead in the footprint.\n  This paper defines the storage reallocation problem, where previously allocated blocks can be moved, or reallocated, but at some cost. The algorithms presented here are cost oblivious, in that they work for a br"},"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":"1404.2019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-08T06:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"6afdf3bc8965ef3ea8f75e166e9fb1749e5f044f4869b482bf87e32466878aa5","abstract_canon_sha256":"1b6cf69421698273f1347c02fb2ec6988b5032c6b7ac9d76f5308f530b1e13b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.576762Z","signature_b64":"j+Jxa3UkjrGClC0QPtUyPTTUWp60CpCdvy6iQEJ1ilVrvR5qncl1XGYBdp0ebnNHaBTeQAD3X6Aa5DjOeVHxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff26b1ce25ba461fe6ad421909628c09d1282b7e93dd2ece03c5b1e965ba99b","last_reissued_at":"2026-05-18T00:47:59.576165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.576165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost-oblivious storage reallocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman, Martin Farach-Colton, Michael A. Bender, S\\'andor P. Fekete, Seth Gilbert","submitted_at":"2014-04-08T06:37:46Z","abstract_excerpt":"Databases need to allocate and free blocks of storage on disk. Freed blocks introduce holes where no data is stored. Allocation systems attempt to reuse such deallocated regions in order to minimize the footprint on disk. If previously allocated blocks cannot be moved, the problem is called the memory allocation problem, which is known to have a logarithmic overhead in the footprint.\n  This paper defines the storage reallocation problem, where previously allocated blocks can be moved, or reallocated, but at some cost. The algorithms presented here are cost oblivious, in that they work for a br"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2019","kind":"arxiv","version":3},"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":"1404.2019","created_at":"2026-05-18T00:47:59.576262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2019v3","created_at":"2026-05-18T00:47:59.576262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2019","created_at":"2026-05-18T00:47:59.576262+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7ZGWHHCLOSG","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7ZGWHHCLOSGD7TK","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7ZGWHHC","created_at":"2026-05-18T12:28:35.611951+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/L7ZGWHHCLOSGD7TK2QQZBFRIYC","json":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC.json","graph_json":"https://pith.science/api/pith-number/L7ZGWHHCLOSGD7TK2QQZBFRIYC/graph.json","events_json":"https://pith.science/api/pith-number/L7ZGWHHCLOSGD7TK2QQZBFRIYC/events.json","paper":"https://pith.science/paper/L7ZGWHHC"},"agent_actions":{"view_html":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC","download_json":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC.json","view_paper":"https://pith.science/paper/L7ZGWHHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2019&json=true","fetch_graph":"https://pith.science/api/pith-number/L7ZGWHHCLOSGD7TK2QQZBFRIYC/graph.json","fetch_events":"https://pith.science/api/pith-number/L7ZGWHHCLOSGD7TK2QQZBFRIYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/action/storage_attestation","attest_author":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/action/author_attestation","sign_citation":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/action/citation_signature","submit_replication":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/action/replication_record"}},"created_at":"2026-05-18T00:47:59.576262+00:00","updated_at":"2026-05-18T00:47:59.576262+00:00"}