{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6X2TAIJJ4C2A42FZYGTAYGXVVT","short_pith_number":"pith:6X2TAIJJ","schema_version":"1.0","canonical_sha256":"f5f5302129e0b40e68b9c1a60c1af5acf4076c0e976f22bbbcfd5d973a04321c","source":{"kind":"arxiv","id":"1512.09358","version":3},"attestation_state":"computed","paper":{"title":"Geometric Memory Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Wouter Kuijper","submitted_at":"2015-12-31T20:11:46Z","abstract_excerpt":"In this report we discuss the concepts of geometric memory align- ment, geometric memory allocation and geometric memory mapping. We introduce block trees as an efficient data structure for representing geo- metrically aligned block allocation states. We introduce niche maps as an efficient means to find the right place to allocate a chunk of a given size whilst maintaining good packing and avoiding fragmentation. We intro- duce ledging as a process to deal with chunk sizes that are not a power of two. We discuss using block trees for memory mapping in the context of virtual memory management."},"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":"1512.09358","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-31T20:11:46Z","cross_cats_sorted":[],"title_canon_sha256":"e74fe26a199b99fc4338df014475fdfae5279849d825a174659e593f04759c06","abstract_canon_sha256":"d711028ae5b3678abc539d36f311e50af6ceeb82b6603fe1e27ae37259a85f83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:29.029395Z","signature_b64":"Eczm9EhZ9L1LOrbsMKUTesIa5f4UAaO1P1mdQNZzRTv6yS+F1ZMYRKuyRC1nRaDCpsoLF2zLaFN9XYNAYFVbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5f5302129e0b40e68b9c1a60c1af5acf4076c0e976f22bbbcfd5d973a04321c","last_reissued_at":"2026-05-18T01:20:29.028908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:29.028908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Memory Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Wouter Kuijper","submitted_at":"2015-12-31T20:11:46Z","abstract_excerpt":"In this report we discuss the concepts of geometric memory align- ment, geometric memory allocation and geometric memory mapping. We introduce block trees as an efficient data structure for representing geo- metrically aligned block allocation states. We introduce niche maps as an efficient means to find the right place to allocate a chunk of a given size whilst maintaining good packing and avoiding fragmentation. We intro- duce ledging as a process to deal with chunk sizes that are not a power of two. We discuss using block trees for memory mapping in the context of virtual memory management."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09358","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":"1512.09358","created_at":"2026-05-18T01:20:29.028993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09358v3","created_at":"2026-05-18T01:20:29.028993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09358","created_at":"2026-05-18T01:20:29.028993+00:00"},{"alias_kind":"pith_short_12","alias_value":"6X2TAIJJ4C2A","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6X2TAIJJ4C2A42FZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6X2TAIJJ","created_at":"2026-05-18T12:29:07.941421+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/6X2TAIJJ4C2A42FZYGTAYGXVVT","json":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT.json","graph_json":"https://pith.science/api/pith-number/6X2TAIJJ4C2A42FZYGTAYGXVVT/graph.json","events_json":"https://pith.science/api/pith-number/6X2TAIJJ4C2A42FZYGTAYGXVVT/events.json","paper":"https://pith.science/paper/6X2TAIJJ"},"agent_actions":{"view_html":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT","download_json":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT.json","view_paper":"https://pith.science/paper/6X2TAIJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09358&json=true","fetch_graph":"https://pith.science/api/pith-number/6X2TAIJJ4C2A42FZYGTAYGXVVT/graph.json","fetch_events":"https://pith.science/api/pith-number/6X2TAIJJ4C2A42FZYGTAYGXVVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT/action/storage_attestation","attest_author":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT/action/author_attestation","sign_citation":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT/action/citation_signature","submit_replication":"https://pith.science/pith/6X2TAIJJ4C2A42FZYGTAYGXVVT/action/replication_record"}},"created_at":"2026-05-18T01:20:29.028993+00:00","updated_at":"2026-05-18T01:20:29.028993+00:00"}