{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YIOZJZDBDX7WEKKKBGXVCCFWV3","short_pith_number":"pith:YIOZJZDB","canonical_record":{"source":{"id":"1804.03436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T10:25:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"67742e377460395601493949db723c1dedb81a032175518b90a5d298ec06626a","abstract_canon_sha256":"e050f34dbc7c3c69b635498ff01303c03f6f9fe6146c584aa8a4a54bfb3b3c85"},"schema_version":"1.0"},"canonical_sha256":"c21d94e4611dff62294a09af5108b6aefefafe37fa52125e1e21ca2094b6e02b","source":{"kind":"arxiv","id":"1804.03436","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03436","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03436v2","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03436","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"YIOZJZDBDX7W","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIOZJZDBDX7WEKKK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIOZJZDB","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YIOZJZDBDX7WEKKKBGXVCCFWV3","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T10:25:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"67742e377460395601493949db723c1dedb81a032175518b90a5d298ec06626a","abstract_canon_sha256":"e050f34dbc7c3c69b635498ff01303c03f6f9fe6146c584aa8a4a54bfb3b3c85"},"schema_version":"1.0"},"canonical_sha256":"c21d94e4611dff62294a09af5108b6aefefafe37fa52125e1e21ca2094b6e02b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:36.312791Z","signature_b64":"drDbIDJNKNxAhvw5e/rH/f/qwOl0mCsMpSNWs9UGqFJzanxYT6OgkwUZ85IYWPIXCdkpjgM+8bpzjkVi4ma2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c21d94e4611dff62294a09af5108b6aefefafe37fa52125e1e21ca2094b6e02b","last_reissued_at":"2026-05-18T00:15:36.312104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:36.312104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03436","source_version":2,"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:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQB2oedY9e/y7mY2rAYqpSO3Kb0uEdJ1qct4y3jm8TrvrfCM34hti7rtJ5hqk801TDmHjD+Syc/R8tmuYxYfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:55:45.359415Z"},"content_sha256":"56e21e1ab0db1f68d45c070ae83875d15065ae911efbbeec0ceecdec110e6014","schema_version":"1.0","event_id":"sha256:56e21e1ab0db1f68d45c070ae83875d15065ae911efbbeec0ceecdec110e6014"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YIOZJZDBDX7WEKKKBGXVCCFWV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Non-blocking Buddy System for Scalable Memory Allocation on Multi-core Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alessandro Pellegrini, Andrea Scarselli, Francesco Quaglia, Mauro Ianni, Romolo Marotta","submitted_at":"2018-04-10T10:25:16Z","abstract_excerpt":"Common implementations of core memory allocation components, like the Linux buddy system, handle concurrent allocation/release requests by synchronizing threads via spin-locks. This approach is clearly not prone to scale with large thread counts, a problem that has been addressed in the literature by introducing layered allocation services or replicating the core allocators-the bottom most ones within the layered architecture. Both these solutions tend to reduce the pressure of actual concurrent accesses to each individual core allocator. In this article we explore an alternative approach to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03436","kind":"arxiv","version":2},"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:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWZH3qIq5vmxz7IO0Ac90EXe+wqMXV7p1qFTOu/qite5KAxs54svK/eXYxLZftxYp5DgiGVZeeosTxhBSkPKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:55:45.359768Z"},"content_sha256":"e763f1329fa1587d22e90172fe4ca209f3a4c291ef4f22151e0291d9cb46d25e","schema_version":"1.0","event_id":"sha256:e763f1329fa1587d22e90172fe4ca209f3a4c291ef4f22151e0291d9cb46d25e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3/bundle.json","state_url":"https://pith.science/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3/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-06-03T03:55:45Z","links":{"resolver":"https://pith.science/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3","bundle":"https://pith.science/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3/bundle.json","state":"https://pith.science/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIOZJZDBDX7WEKKKBGXVCCFWV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YIOZJZDBDX7WEKKKBGXVCCFWV3","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":"e050f34dbc7c3c69b635498ff01303c03f6f9fe6146c584aa8a4a54bfb3b3c85","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T10:25:16Z","title_canon_sha256":"67742e377460395601493949db723c1dedb81a032175518b90a5d298ec06626a"},"schema_version":"1.0","source":{"id":"1804.03436","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03436","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03436v2","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03436","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"YIOZJZDBDX7W","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIOZJZDBDX7WEKKK","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIOZJZDB","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:e763f1329fa1587d22e90172fe4ca209f3a4c291ef4f22151e0291d9cb46d25e","target":"graph","created_at":"2026-05-18T00:15:36Z","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":"Common implementations of core memory allocation components, like the Linux buddy system, handle concurrent allocation/release requests by synchronizing threads via spin-locks. This approach is clearly not prone to scale with large thread counts, a problem that has been addressed in the literature by introducing layered allocation services or replicating the core allocators-the bottom most ones within the layered architecture. Both these solutions tend to reduce the pressure of actual concurrent accesses to each individual core allocator. In this article we explore an alternative approach to s","authors_text":"Alessandro Pellegrini, Andrea Scarselli, Francesco Quaglia, Mauro Ianni, Romolo Marotta","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T10:25:16Z","title":"A Non-blocking Buddy System for Scalable Memory Allocation on Multi-core Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03436","kind":"arxiv","version":2},"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:56e21e1ab0db1f68d45c070ae83875d15065ae911efbbeec0ceecdec110e6014","target":"record","created_at":"2026-05-18T00:15:36Z","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":"e050f34dbc7c3c69b635498ff01303c03f6f9fe6146c584aa8a4a54bfb3b3c85","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-10T10:25:16Z","title_canon_sha256":"67742e377460395601493949db723c1dedb81a032175518b90a5d298ec06626a"},"schema_version":"1.0","source":{"id":"1804.03436","kind":"arxiv","version":2}},"canonical_sha256":"c21d94e4611dff62294a09af5108b6aefefafe37fa52125e1e21ca2094b6e02b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c21d94e4611dff62294a09af5108b6aefefafe37fa52125e1e21ca2094b6e02b","first_computed_at":"2026-05-18T00:15:36.312104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:36.312104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"drDbIDJNKNxAhvw5e/rH/f/qwOl0mCsMpSNWs9UGqFJzanxYT6OgkwUZ85IYWPIXCdkpjgM+8bpzjkVi4ma2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:36.312791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03436","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56e21e1ab0db1f68d45c070ae83875d15065ae911efbbeec0ceecdec110e6014","sha256:e763f1329fa1587d22e90172fe4ca209f3a4c291ef4f22151e0291d9cb46d25e"],"state_sha256":"c44d2a8ce1442db3905e6202f98e7e40ebd4f5793c8053fe72224c86b27df1ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TZO2HZ9eISA5RQD69cXtGJSLOSjOuTpqGHOCMvyoWGC5Y/4h180aKIR/spsu4tznYsiZFFa8RI4jKucivjDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:55:45.362051Z","bundle_sha256":"e525507d7f545cbac83edcdf2b1039b496addf627aaf8896a4cf04e60f9b86de"}}