{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KNGOSFGQALH2ZCKKSWTEZUPWF6","short_pith_number":"pith:KNGOSFGQ","schema_version":"1.0","canonical_sha256":"534ce914d002cfac894a95a64cd1f62f84684ea75d1efb1b5c228b58d9690a6d","source":{"kind":"arxiv","id":"1404.1830","version":1},"attestation_state":"computed","paper":{"title":"Concurrency and Scalability versus Fragmentation and Compaction with Compact-fit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ana Sokolova, Christoph M. Kirsch, Hannes Payer, Harald R\\\"ock, Silviu S. Craciunas","submitted_at":"2014-04-07T16:07:54Z","abstract_excerpt":"We study, formally and experimentally, the trade-off in temporal and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap management system Compact-fit (CF). The key property of CF is that temporal and spatial overhead can be bounded, related, and predicted in constant time through the notion of partial and incremental compaction. Partial compaction determines the maximally tolerated degree of memory fragmentation. Incremental compaction of objects, introduced here, determines the maximal amount of memory involved in any, logically atomic, p"},"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.1830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-04-07T16:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"d50579ba97fcc1786dfaab52de3bad4f2eb1b249b6effa1c234f208fc1cc3fa6","abstract_canon_sha256":"da9635fbe6581d44254882804c3c3e897c3963b030bc4f67f823350fd72414e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:40.102646Z","signature_b64":"BK3jgJG6Vw6Q6E/PkDKFDrwsExlSLlHwErTWvi0wAN6zVUBd/JVPNtKvO204ReD4i1YIbVceBPVHM1ShR7/VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"534ce914d002cfac894a95a64cd1f62f84684ea75d1efb1b5c228b58d9690a6d","last_reissued_at":"2026-05-18T02:54:40.102253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:40.102253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concurrency and Scalability versus Fragmentation and Compaction with Compact-fit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ana Sokolova, Christoph M. Kirsch, Hannes Payer, Harald R\\\"ock, Silviu S. Craciunas","submitted_at":"2014-04-07T16:07:54Z","abstract_excerpt":"We study, formally and experimentally, the trade-off in temporal and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap management system Compact-fit (CF). The key property of CF is that temporal and spatial overhead can be bounded, related, and predicted in constant time through the notion of partial and incremental compaction. Partial compaction determines the maximally tolerated degree of memory fragmentation. Incremental compaction of objects, introduced here, determines the maximal amount of memory involved in any, logically atomic, p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1830","kind":"arxiv","version":1},"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.1830","created_at":"2026-05-18T02:54:40.102307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1830v1","created_at":"2026-05-18T02:54:40.102307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1830","created_at":"2026-05-18T02:54:40.102307+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNGOSFGQALH2","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNGOSFGQALH2ZCKK","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNGOSFGQ","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/KNGOSFGQALH2ZCKKSWTEZUPWF6","json":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6.json","graph_json":"https://pith.science/api/pith-number/KNGOSFGQALH2ZCKKSWTEZUPWF6/graph.json","events_json":"https://pith.science/api/pith-number/KNGOSFGQALH2ZCKKSWTEZUPWF6/events.json","paper":"https://pith.science/paper/KNGOSFGQ"},"agent_actions":{"view_html":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6","download_json":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6.json","view_paper":"https://pith.science/paper/KNGOSFGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1830&json=true","fetch_graph":"https://pith.science/api/pith-number/KNGOSFGQALH2ZCKKSWTEZUPWF6/graph.json","fetch_events":"https://pith.science/api/pith-number/KNGOSFGQALH2ZCKKSWTEZUPWF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6/action/storage_attestation","attest_author":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6/action/author_attestation","sign_citation":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6/action/citation_signature","submit_replication":"https://pith.science/pith/KNGOSFGQALH2ZCKKSWTEZUPWF6/action/replication_record"}},"created_at":"2026-05-18T02:54:40.102307+00:00","updated_at":"2026-05-18T02:54:40.102307+00:00"}