{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4RAXSYLY6QMP5IO6FHC62AX4ZB","short_pith_number":"pith:4RAXSYLY","canonical_record":{"source":{"id":"1503.09006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-03-31T11:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"fabac35aa436782c618d4b69bf9c17a3eee21ff7e6410f08ce794c2ce0711b39","abstract_canon_sha256":"4a9ac5c087b5d612aa4e22861ed217f587fac9666df2f0d923b6f87b82bbc59c"},"schema_version":"1.0"},"canonical_sha256":"e441796178f418fea1de29c5ed02fcc86680d18e43d1572c6dbd394933aa92ad","source":{"kind":"arxiv","id":"1503.09006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.09006","created_at":"2026-05-18T01:34:50Z"},{"alias_kind":"arxiv_version","alias_value":"1503.09006v2","created_at":"2026-05-18T01:34:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.09006","created_at":"2026-05-18T01:34:50Z"},{"alias_kind":"pith_short_12","alias_value":"4RAXSYLY6QMP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4RAXSYLY6QMP5IO6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4RAXSYLY","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4RAXSYLY6QMP5IO6FHC62AX4ZB","target":"record","payload":{"canonical_record":{"source":{"id":"1503.09006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-03-31T11:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"fabac35aa436782c618d4b69bf9c17a3eee21ff7e6410f08ce794c2ce0711b39","abstract_canon_sha256":"4a9ac5c087b5d612aa4e22861ed217f587fac9666df2f0d923b6f87b82bbc59c"},"schema_version":"1.0"},"canonical_sha256":"e441796178f418fea1de29c5ed02fcc86680d18e43d1572c6dbd394933aa92ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:50.142794Z","signature_b64":"aNck6AM6pLCuSjWeld/jfg1/KJxvVRv0+G94cIKp69tt2acSshwASXeFhtYToRXj4yjmx9uPHQL9OhKEuWaUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e441796178f418fea1de29c5ed02fcc86680d18e43d1572c6dbd394933aa92ad","last_reissued_at":"2026-05-18T01:34:50.142148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:50.142148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.09006","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-18T01:34:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tu1X5u4OLgjesfvQups2EQl8JxVI1TEszHbwtPH1XNiG9Th/uEOkAZwiW1Y/1rwREmuG+bh9xZ0wSddZfYcvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:20:02.942511Z"},"content_sha256":"24ee0818e6f2281a6fa4fe372d5a0dba74843a6db411b441abea8d9a2c8e969a","schema_version":"1.0","event_id":"sha256:24ee0818e6f2281a6fa4fe372d5a0dba74843a6db411b441abea8d9a2c8e969a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4RAXSYLY6QMP5IO6FHC62AX4ZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ana Sokolova, Christoph M. Kirsch, Martin Aigner, Michael Lippautz","submitted_at":"2015-03-31T11:36:46Z","abstract_excerpt":"We demonstrate that general-purpose memory allocation involving many threads on many cores can be done with high performance, multicore scalability, and low memory consumption. For this purpose, we have designed and implemented scalloc, a concurrent allocator that generally performs and scales in our experiments better than other allocators while using less memory, and is still competitive otherwise. The main ideas behind the design of scalloc are: uniform treatment of small and big objects through so-called virtual spans, efficiently and effectively reclaiming free memory through fast and sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.09006","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-18T01:34:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CGdUPysullPbD36cBVzpC0I18EFMERftvBG96Iq6Gp/EM96W4pCmXcxZIqxZwMT58+A4YDpVDJLtc6jbxAVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:20:02.942857Z"},"content_sha256":"eb466bdc4244d25e9e02f780be136b3be6b9fffe3ffc1685002cafa4ac75eacb","schema_version":"1.0","event_id":"sha256:eb466bdc4244d25e9e02f780be136b3be6b9fffe3ffc1685002cafa4ac75eacb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB/bundle.json","state_url":"https://pith.science/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB/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-02T12:20:02Z","links":{"resolver":"https://pith.science/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB","bundle":"https://pith.science/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB/bundle.json","state":"https://pith.science/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RAXSYLY6QMP5IO6FHC62AX4ZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4RAXSYLY6QMP5IO6FHC62AX4ZB","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":"4a9ac5c087b5d612aa4e22861ed217f587fac9666df2f0d923b6f87b82bbc59c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-03-31T11:36:46Z","title_canon_sha256":"fabac35aa436782c618d4b69bf9c17a3eee21ff7e6410f08ce794c2ce0711b39"},"schema_version":"1.0","source":{"id":"1503.09006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.09006","created_at":"2026-05-18T01:34:50Z"},{"alias_kind":"arxiv_version","alias_value":"1503.09006v2","created_at":"2026-05-18T01:34:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.09006","created_at":"2026-05-18T01:34:50Z"},{"alias_kind":"pith_short_12","alias_value":"4RAXSYLY6QMP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4RAXSYLY6QMP5IO6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4RAXSYLY","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:eb466bdc4244d25e9e02f780be136b3be6b9fffe3ffc1685002cafa4ac75eacb","target":"graph","created_at":"2026-05-18T01:34:50Z","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":"We demonstrate that general-purpose memory allocation involving many threads on many cores can be done with high performance, multicore scalability, and low memory consumption. For this purpose, we have designed and implemented scalloc, a concurrent allocator that generally performs and scales in our experiments better than other allocators while using less memory, and is still competitive otherwise. The main ideas behind the design of scalloc are: uniform treatment of small and big objects through so-called virtual spans, efficiently and effectively reclaiming free memory through fast and sca","authors_text":"Ana Sokolova, Christoph M. Kirsch, Martin Aigner, Michael Lippautz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-03-31T11:36:46Z","title":"Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through Large Virtual Memory and Global Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.09006","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:24ee0818e6f2281a6fa4fe372d5a0dba74843a6db411b441abea8d9a2c8e969a","target":"record","created_at":"2026-05-18T01:34:50Z","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":"4a9ac5c087b5d612aa4e22861ed217f587fac9666df2f0d923b6f87b82bbc59c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-03-31T11:36:46Z","title_canon_sha256":"fabac35aa436782c618d4b69bf9c17a3eee21ff7e6410f08ce794c2ce0711b39"},"schema_version":"1.0","source":{"id":"1503.09006","kind":"arxiv","version":2}},"canonical_sha256":"e441796178f418fea1de29c5ed02fcc86680d18e43d1572c6dbd394933aa92ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e441796178f418fea1de29c5ed02fcc86680d18e43d1572c6dbd394933aa92ad","first_computed_at":"2026-05-18T01:34:50.142148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:50.142148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aNck6AM6pLCuSjWeld/jfg1/KJxvVRv0+G94cIKp69tt2acSshwASXeFhtYToRXj4yjmx9uPHQL9OhKEuWaUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:50.142794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.09006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24ee0818e6f2281a6fa4fe372d5a0dba74843a6db411b441abea8d9a2c8e969a","sha256:eb466bdc4244d25e9e02f780be136b3be6b9fffe3ffc1685002cafa4ac75eacb"],"state_sha256":"150fdf3c207855123f6bc8259ea84acb4ff2e3dcbf600663edbd547b76a03b98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PssZ2a45827l/raZVCIvtI2CQ4IEEpza12iTgSCGF6UXwYQOHmwk1b3dUl0cJAZIMlKe+edx5MjrWFK9gItOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:20:02.944741Z","bundle_sha256":"6823f34bc4622c57bbd4c7268176b241ec5cbe9067e4327e6ff1f88abee94d8e"}}