{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S2S4JLFBJWGFAJR3IX52CLNLDJ","short_pith_number":"pith:S2S4JLFB","canonical_record":{"source":{"id":"1512.01984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-12-07T11:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"0869967a616db4648e0141f6c3c6fbbd351c70201dfc96350ae4b0c204f9452a","abstract_canon_sha256":"56104235fc987bbb15a82068177491ca59e9a94bff195175b390e07f6a58083f"},"schema_version":"1.0"},"canonical_sha256":"96a5c4aca14d8c50263b45fba12dab1a5c93d906ecafb2154e954da3bba2d274","source":{"kind":"arxiv","id":"1512.01984","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01984","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01984v2","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01984","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"S2S4JLFBJWGF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S2S4JLFBJWGFAJR3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S2S4JLFB","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S2S4JLFBJWGFAJR3IX52CLNLDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-12-07T11:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"0869967a616db4648e0141f6c3c6fbbd351c70201dfc96350ae4b0c204f9452a","abstract_canon_sha256":"56104235fc987bbb15a82068177491ca59e9a94bff195175b390e07f6a58083f"},"schema_version":"1.0"},"canonical_sha256":"96a5c4aca14d8c50263b45fba12dab1a5c93d906ecafb2154e954da3bba2d274","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:18.313973Z","signature_b64":"d7n3Z+3gEd9/NcUogLNpeYNxV/rniHSStmfoMToE9jhmD0lGx9KoYRR+6XcJzwRvbjjGGPwA8XeOdamK2ogeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a5c4aca14d8c50263b45fba12dab1a5c93d906ecafb2154e954da3bba2d274","last_reissued_at":"2026-05-18T01:19:18.313524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:18.313524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01984","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:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1hyuEgc39BSRjSIfG9HnUjEa2xmDTMcVJAehGK4VVXiuRgNIP2MFHZIBD2ZFgVpVzzTS96UfojvsNHAUfAsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:13:36.718100Z"},"content_sha256":"f0879644c863ddeb523f67b4aa8d0793b0971feeea1796acca6c78c32381e6f3","schema_version":"1.0","event_id":"sha256:f0879644c863ddeb523f67b4aa8d0793b0971feeea1796acca6c78c32381e6f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S2S4JLFBJWGFAJR3IX52CLNLDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel and sequential reclaiming in multicore real-time global scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Andrea Parri, Giuseppe Lipari, Luca Abeni, Youcheng Sun","submitted_at":"2015-12-07T11:16:43Z","abstract_excerpt":"When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour of the others. However, strict budget enforcement can lead to inefficient use of the computational resources in the presence of tasks with variable workload. Many resource reclaiming algorithms have been proposed in the literature for single processor scheduling, but not enough work exists for global scheduling in multiprocessor systems. In this report, we propose two reclaiming algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01984","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:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSSstYjI1frAbqcRlGbvtCwntK+VVVJgF2gHTXo09KTRJnbOmOP58bptb+B23WwUeBliarne5x/ImnvrdwYEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:13:36.718730Z"},"content_sha256":"f86165526213a4c90e0e5c27142095b154865b2f4dc012dd2c2c7c32df04de59","schema_version":"1.0","event_id":"sha256:f86165526213a4c90e0e5c27142095b154865b2f4dc012dd2c2c7c32df04de59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ/bundle.json","state_url":"https://pith.science/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ/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-12T08:13:36Z","links":{"resolver":"https://pith.science/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ","bundle":"https://pith.science/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ/bundle.json","state":"https://pith.science/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2S4JLFBJWGFAJR3IX52CLNLDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S2S4JLFBJWGFAJR3IX52CLNLDJ","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":"56104235fc987bbb15a82068177491ca59e9a94bff195175b390e07f6a58083f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-12-07T11:16:43Z","title_canon_sha256":"0869967a616db4648e0141f6c3c6fbbd351c70201dfc96350ae4b0c204f9452a"},"schema_version":"1.0","source":{"id":"1512.01984","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01984","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01984v2","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01984","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"S2S4JLFBJWGF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S2S4JLFBJWGFAJR3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S2S4JLFB","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f86165526213a4c90e0e5c27142095b154865b2f4dc012dd2c2c7c32df04de59","target":"graph","created_at":"2026-05-18T01:19:18Z","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":"When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour of the others. However, strict budget enforcement can lead to inefficient use of the computational resources in the presence of tasks with variable workload. Many resource reclaiming algorithms have been proposed in the literature for single processor scheduling, but not enough work exists for global scheduling in multiprocessor systems. In this report, we propose two reclaiming algorithm","authors_text":"Andrea Parri, Giuseppe Lipari, Luca Abeni, Youcheng Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-12-07T11:16:43Z","title":"Parallel and sequential reclaiming in multicore real-time global scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01984","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:f0879644c863ddeb523f67b4aa8d0793b0971feeea1796acca6c78c32381e6f3","target":"record","created_at":"2026-05-18T01:19:18Z","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":"56104235fc987bbb15a82068177491ca59e9a94bff195175b390e07f6a58083f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-12-07T11:16:43Z","title_canon_sha256":"0869967a616db4648e0141f6c3c6fbbd351c70201dfc96350ae4b0c204f9452a"},"schema_version":"1.0","source":{"id":"1512.01984","kind":"arxiv","version":2}},"canonical_sha256":"96a5c4aca14d8c50263b45fba12dab1a5c93d906ecafb2154e954da3bba2d274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96a5c4aca14d8c50263b45fba12dab1a5c93d906ecafb2154e954da3bba2d274","first_computed_at":"2026-05-18T01:19:18.313524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:18.313524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d7n3Z+3gEd9/NcUogLNpeYNxV/rniHSStmfoMToE9jhmD0lGx9KoYRR+6XcJzwRvbjjGGPwA8XeOdamK2ogeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:18.313973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01984","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0879644c863ddeb523f67b4aa8d0793b0971feeea1796acca6c78c32381e6f3","sha256:f86165526213a4c90e0e5c27142095b154865b2f4dc012dd2c2c7c32df04de59"],"state_sha256":"14751caca0c7a6dc1bf137d69a214baa7fe9081561d25185c8af2dc1ccf5ee93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QnKeARS5FKkP0fknjuUjnZsLnczXLFtBb17vzu3AbfKDt0BaCZXGxCyfgC7dh4VPzI/MtEmrQXmkacAfvUHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:13:36.722050Z","bundle_sha256":"31ad4f495dca64bc3d777f0710d681514d62df3218afd38f23c89953b782c5d4"}}