{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QHJLYJ5CQ6GVMM3TVAEAFSRZAP","short_pith_number":"pith:QHJLYJ5C","schema_version":"1.0","canonical_sha256":"81d2bc27a2878d563373a80802ca3903c8e4a935ffb185e1ef06e9fa1ec56f88","source":{"kind":"arxiv","id":"2605.27620","version":1},"attestation_state":"computed","paper":{"title":"Bounded Priority-Aware Locking for Real-Time Kernels","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Richard West, Shriram Raja","submitted_at":"2026-05-26T19:38:43Z","abstract_excerpt":"A real-time multicore system requires delay bounds on access to shared resources. These resources include the kernel, which has potentially many non-preemptible critical sections guarded by one or more different synchronization primitives. While primitives such as FIFO locks bound the waiting time to enter a critical section, they do not distinguish the importance of individual tasks competing for shared resource access. To address this, we consider a priority-aware spinlock, which reduces the average delay of more important tasks while maintaining a worst-case bound on lock waiting time. We 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":"2605.27620","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.OS","submitted_at":"2026-05-26T19:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"2f3d9de160c5d72f04c87e424a4d2ce938ad92a5738dde21dbf69352d848a207","abstract_canon_sha256":"f07474fadcd660be2cf1f2701bab531a5caef53addd323884078d675ab6e5db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:44.415527Z","signature_b64":"JYpJRo7InHy6AYJNu8wqxuj2zfKhrxS9j6l3TL4T7JZL28ynmzQ2zrn+g38iakIVvoggQdCOna6Nc22UAWVlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81d2bc27a2878d563373a80802ca3903c8e4a935ffb185e1ef06e9fa1ec56f88","last_reissued_at":"2026-05-28T01:04:44.414954Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:44.414954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Priority-Aware Locking for Real-Time Kernels","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Richard West, Shriram Raja","submitted_at":"2026-05-26T19:38:43Z","abstract_excerpt":"A real-time multicore system requires delay bounds on access to shared resources. These resources include the kernel, which has potentially many non-preemptible critical sections guarded by one or more different synchronization primitives. While primitives such as FIFO locks bound the waiting time to enter a critical section, they do not distinguish the importance of individual tasks competing for shared resource access. To address this, we consider a priority-aware spinlock, which reduces the average delay of more important tasks while maintaining a worst-case bound on lock waiting time. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27620","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.27620/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.27620","created_at":"2026-05-28T01:04:44.415026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27620v1","created_at":"2026-05-28T01:04:44.415026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27620","created_at":"2026-05-28T01:04:44.415026+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHJLYJ5CQ6GV","created_at":"2026-05-28T01:04:44.415026+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHJLYJ5CQ6GVMM3T","created_at":"2026-05-28T01:04:44.415026+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHJLYJ5C","created_at":"2026-05-28T01:04:44.415026+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/QHJLYJ5CQ6GVMM3TVAEAFSRZAP","json":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP.json","graph_json":"https://pith.science/api/pith-number/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/graph.json","events_json":"https://pith.science/api/pith-number/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/events.json","paper":"https://pith.science/paper/QHJLYJ5C"},"agent_actions":{"view_html":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP","download_json":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP.json","view_paper":"https://pith.science/paper/QHJLYJ5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27620&json=true","fetch_graph":"https://pith.science/api/pith-number/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/graph.json","fetch_events":"https://pith.science/api/pith-number/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/action/storage_attestation","attest_author":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/action/author_attestation","sign_citation":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/action/citation_signature","submit_replication":"https://pith.science/pith/QHJLYJ5CQ6GVMM3TVAEAFSRZAP/action/replication_record"}},"created_at":"2026-05-28T01:04:44.415026+00:00","updated_at":"2026-05-28T01:04:44.415026+00:00"}