{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DUHMYB3R5PSKMERCC2GUWUW4JO","short_pith_number":"pith:DUHMYB3R","canonical_record":{"source":{"id":"1501.07084","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-01-28T12:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"8e75647c1a53e44ceb2907fcc48666374616922d88683ce53911f332b5c24871","abstract_canon_sha256":"ab5e02efd2b74b770a98d9e14683e0801e7176d80d09ac6140de46f4c24d46a1"},"schema_version":"1.0"},"canonical_sha256":"1d0ecc0771ebe4a61222168d4b52dc4b88fbaedff8bc2b2ac199acc7d635c358","source":{"kind":"arxiv","id":"1501.07084","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07084","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07084v3","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07084","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"DUHMYB3R5PSK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUHMYB3R5PSKMERC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUHMYB3R","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DUHMYB3R5PSKMERCC2GUWUW4JO","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07084","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-01-28T12:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"8e75647c1a53e44ceb2907fcc48666374616922d88683ce53911f332b5c24871","abstract_canon_sha256":"ab5e02efd2b74b770a98d9e14683e0801e7176d80d09ac6140de46f4c24d46a1"},"schema_version":"1.0"},"canonical_sha256":"1d0ecc0771ebe4a61222168d4b52dc4b88fbaedff8bc2b2ac199acc7d635c358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.754956Z","signature_b64":"NLa3BU+dpngWBmHdDF6YlsbALuc7j11ckZkylFT8PfpL8naunnfgXvpMkMK1XqmjEwWF7C2QGbI/9Gpn4bmxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d0ecc0771ebe4a61222168d4b52dc4b88fbaedff8bc2b2ac199acc7d635c358","last_reissued_at":"2026-05-18T01:33:07.754577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.754577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07084","source_version":3,"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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKBdEyBv60FJQTNc+4pv0YcWeSygY/NbnkEbYI1uwPpVRW2+O4PZI102NiKumn6CilHPgauVX0KoJ/OVAv0zBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:45:13.303187Z"},"content_sha256":"e01b3f17dc1561275402a75bed36ee8375979e85b28b3054e13626c904448d47","schema_version":"1.0","event_id":"sha256:e01b3f17dc1561275402a75bed36ee8375979e85b28b3054e13626c904448d47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DUHMYB3R5PSKMERCC2GUWUW4JO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Cong Liu, Jian-Jia Chen, Wen-Hung Huang","submitted_at":"2015-01-28T12:38:20Z","abstract_excerpt":"To deal with a large variety of workloads in different application domains in real-time embedded systems, a number of expressive task models have been developed. For each individual task model, researchers tend to develop different types of techniques for deriving schedulability tests with different computation complexity and performance. In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real-time task models under any fixed-priority scheduling algorithm, on both uniprocessor and multiproce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07084","kind":"arxiv","version":3},"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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JXNvfbXfLpF2rPlKQG5+j/9RE1Ial5N0T4rpk/9PIjPx3qhji6h8XdiBXDcmrdVKFctWvBCZTXJ7yTDTP01fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:45:13.303905Z"},"content_sha256":"b8ffca2e829137d1a2b1298fe5efc150e531a45a4986953fca39d872ade2660d","schema_version":"1.0","event_id":"sha256:b8ffca2e829137d1a2b1298fe5efc150e531a45a4986953fca39d872ade2660d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUHMYB3R5PSKMERCC2GUWUW4JO/bundle.json","state_url":"https://pith.science/pith/DUHMYB3R5PSKMERCC2GUWUW4JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUHMYB3R5PSKMERCC2GUWUW4JO/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-05-31T15:45:13Z","links":{"resolver":"https://pith.science/pith/DUHMYB3R5PSKMERCC2GUWUW4JO","bundle":"https://pith.science/pith/DUHMYB3R5PSKMERCC2GUWUW4JO/bundle.json","state":"https://pith.science/pith/DUHMYB3R5PSKMERCC2GUWUW4JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUHMYB3R5PSKMERCC2GUWUW4JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DUHMYB3R5PSKMERCC2GUWUW4JO","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":"ab5e02efd2b74b770a98d9e14683e0801e7176d80d09ac6140de46f4c24d46a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-01-28T12:38:20Z","title_canon_sha256":"8e75647c1a53e44ceb2907fcc48666374616922d88683ce53911f332b5c24871"},"schema_version":"1.0","source":{"id":"1501.07084","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07084","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07084v3","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07084","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"DUHMYB3R5PSK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUHMYB3R5PSKMERC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUHMYB3R","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b8ffca2e829137d1a2b1298fe5efc150e531a45a4986953fca39d872ade2660d","target":"graph","created_at":"2026-05-18T01:33:07Z","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":"To deal with a large variety of workloads in different application domains in real-time embedded systems, a number of expressive task models have been developed. For each individual task model, researchers tend to develop different types of techniques for deriving schedulability tests with different computation complexity and performance. In this paper, we present a general schedulability analysis framework, namely the k2U framework, that can be potentially applied to analyze a large set of real-time task models under any fixed-priority scheduling algorithm, on both uniprocessor and multiproce","authors_text":"Cong Liu, Jian-Jia Chen, Wen-Hung Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-01-28T12:38:20Z","title":"k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07084","kind":"arxiv","version":3},"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:e01b3f17dc1561275402a75bed36ee8375979e85b28b3054e13626c904448d47","target":"record","created_at":"2026-05-18T01:33:07Z","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":"ab5e02efd2b74b770a98d9e14683e0801e7176d80d09ac6140de46f4c24d46a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-01-28T12:38:20Z","title_canon_sha256":"8e75647c1a53e44ceb2907fcc48666374616922d88683ce53911f332b5c24871"},"schema_version":"1.0","source":{"id":"1501.07084","kind":"arxiv","version":3}},"canonical_sha256":"1d0ecc0771ebe4a61222168d4b52dc4b88fbaedff8bc2b2ac199acc7d635c358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d0ecc0771ebe4a61222168d4b52dc4b88fbaedff8bc2b2ac199acc7d635c358","first_computed_at":"2026-05-18T01:33:07.754577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.754577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLa3BU+dpngWBmHdDF6YlsbALuc7j11ckZkylFT8PfpL8naunnfgXvpMkMK1XqmjEwWF7C2QGbI/9Gpn4bmxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.754956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07084","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e01b3f17dc1561275402a75bed36ee8375979e85b28b3054e13626c904448d47","sha256:b8ffca2e829137d1a2b1298fe5efc150e531a45a4986953fca39d872ade2660d"],"state_sha256":"78d19e98661c232b5d6c02840e4d2c0f47aa72d33611560e1eda8435eed8983c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FaxORugAIIMSgC/f+X3ov0I3octg66UCadfQ5jOoQ6wPMikp4ZVvjggjsry3a/V7SvIiy6NCT4/E8/fcQwWoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:45:13.308051Z","bundle_sha256":"608ef2aee20c2d991566ce3c2aecebaad9757d19e241b259028f2b7d01c91750"}}