{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L7ZGWHHCLOSGD7TK2QQZBFRIYC","short_pith_number":"pith:L7ZGWHHC","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"},"canonical_sha256":"5ff26b1ce25ba461fe6ad421909628c09d1282b7e93dd2ece03c5b1e965ba99b","source":{"kind":"arxiv","id":"1404.2019","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2019","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2019v3","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2019","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"L7ZGWHHCLOSG","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L7ZGWHHCLOSGD7TK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L7ZGWHHC","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L7ZGWHHCLOSGD7TK2QQZBFRIYC","target":"record","payload":{"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"},"canonical_sha256":"5ff26b1ce25ba461fe6ad421909628c09d1282b7e93dd2ece03c5b1e965ba99b","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"},"source_kind":"arxiv","source_id":"1404.2019","source_version":3,"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:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZmH7+TLNzcKE7YY2Q8t9n0q2UkzuKbZmUR4RTryLcUETwsiu2XMr8DyT0z4Egjz2khCTyLGBOzR72kEmQUiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:20:23.022375Z"},"content_sha256":"2081d27fc12bd59317e752ca9f1696d3ea66a189bb78024898cf0e082681f0f6","schema_version":"1.0","event_id":"sha256:2081d27fc12bd59317e752ca9f1696d3ea66a189bb78024898cf0e082681f0f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L7ZGWHHCLOSGD7TK2QQZBFRIYC","target":"graph","payload":{"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"},"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:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIsAK3q5r1ATuNio5Id4RaSvjCIiwkBG6xFJV+cNmuZh2RyaKMQA4Da0exmvORbZwGUv4eUj0StdEB+VDUAiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:20:23.022734Z"},"content_sha256":"535d4a319941a697a51b4dceb5b76cf36bd5814696ac14d9c211eded884dfebf","schema_version":"1.0","event_id":"sha256:535d4a319941a697a51b4dceb5b76cf36bd5814696ac14d9c211eded884dfebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/bundle.json","state_url":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/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-28T09:20:23Z","links":{"resolver":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC","bundle":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/bundle.json","state":"https://pith.science/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7ZGWHHCLOSGD7TK2QQZBFRIYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L7ZGWHHCLOSGD7TK2QQZBFRIYC","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":"1b6cf69421698273f1347c02fb2ec6988b5032c6b7ac9d76f5308f530b1e13b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-08T06:37:46Z","title_canon_sha256":"6afdf3bc8965ef3ea8f75e166e9fb1749e5f044f4869b482bf87e32466878aa5"},"schema_version":"1.0","source":{"id":"1404.2019","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2019","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2019v3","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2019","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"L7ZGWHHCLOSG","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L7ZGWHHCLOSGD7TK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L7ZGWHHC","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:535d4a319941a697a51b4dceb5b76cf36bd5814696ac14d9c211eded884dfebf","target":"graph","created_at":"2026-05-18T00:47:59Z","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":"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","authors_text":"Jeremy T. Fineman, Martin Farach-Colton, Michael A. Bender, S\\'andor P. Fekete, Seth Gilbert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-08T06:37:46Z","title":"Cost-oblivious storage reallocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2019","kind":"arxiv","version":3},"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:2081d27fc12bd59317e752ca9f1696d3ea66a189bb78024898cf0e082681f0f6","target":"record","created_at":"2026-05-18T00:47:59Z","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":"1b6cf69421698273f1347c02fb2ec6988b5032c6b7ac9d76f5308f530b1e13b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-08T06:37:46Z","title_canon_sha256":"6afdf3bc8965ef3ea8f75e166e9fb1749e5f044f4869b482bf87e32466878aa5"},"schema_version":"1.0","source":{"id":"1404.2019","kind":"arxiv","version":3}},"canonical_sha256":"5ff26b1ce25ba461fe6ad421909628c09d1282b7e93dd2ece03c5b1e965ba99b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ff26b1ce25ba461fe6ad421909628c09d1282b7e93dd2ece03c5b1e965ba99b","first_computed_at":"2026-05-18T00:47:59.576165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:59.576165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j+Jxa3UkjrGClC0QPtUyPTTUWp60CpCdvy6iQEJ1ilVrvR5qncl1XGYBdp0ebnNHaBTeQAD3X6Aa5DjOeVHxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:59.576762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2019","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2081d27fc12bd59317e752ca9f1696d3ea66a189bb78024898cf0e082681f0f6","sha256:535d4a319941a697a51b4dceb5b76cf36bd5814696ac14d9c211eded884dfebf"],"state_sha256":"d8c0e18e0183ce22d446940401bd6c29b528315bf8e38db556b1f470c37f698c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSDYj2a0JFTUtWHfiNVucFeUGSFc8CYlR/H05C3GOObDGXgnTW5804ZvAYcOk7F1ViLr6VGDMgq2COJDWFhmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:20:23.025505Z","bundle_sha256":"ece85566430ed4f370ec360f2bfa1796220282065ff15607a181668b2987ad30"}}