{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B5HEPDTYFA42CY524LZZRCPM3G","short_pith_number":"pith:B5HEPDTY","canonical_record":{"source":{"id":"1505.04693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-18T15:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"547ca1d024d0352b4faf96747fc5ff8e6794f70016722606b198f67b8c0bc85b","abstract_canon_sha256":"219f4a973c88b4b3db504e5c79d988f29574f63d8bae95c3b5731d65de80f69d"},"schema_version":"1.0"},"canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","source":{"kind":"arxiv","id":"1505.04693","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04693","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04693v3","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04693","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"B5HEPDTYFA42","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B5HEPDTYFA42CY52","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B5HEPDTY","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B5HEPDTYFA42CY524LZZRCPM3G","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-18T15:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"547ca1d024d0352b4faf96747fc5ff8e6794f70016722606b198f67b8c0bc85b","abstract_canon_sha256":"219f4a973c88b4b3db504e5c79d988f29574f63d8bae95c3b5731d65de80f69d"},"schema_version":"1.0"},"canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.836102Z","signature_b64":"ML2ezSJLxg08J8rTYmOWJci07vS85ufmf9cGBGmqWSOv9RcZLgW97ibA25x81ALpNelvg5k6A/h4NzTsgcOoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","last_reissued_at":"2026-05-18T01:12:01.835756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.835756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04693","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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SvRmRriDHVbuF/mD12Zzxmz6WQVKWXU/sgNrbzURWQxpN+CNpIsNuRrLekwQrZytkHEuovL/7EOLWtlZF/xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:06.156360Z"},"content_sha256":"9e8febf9292d7d0704a5c7cb3c112f17384fbc657729527f57cd2ad0c1b1015f","schema_version":"1.0","event_id":"sha256:9e8febf9292d7d0704a5c7cb3c112f17384fbc657729527f57cd2ad0c1b1015f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B5HEPDTYFA42CY524LZZRCPM3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian-Jia Chen","submitted_at":"2015-05-18T15:54:58Z","abstract_excerpt":"Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors $4-\\frac{2}{M}$ and $3-\\frac{1}{M}$ for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where $M$ is the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04693","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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4V+EV3m9wBvQ9C1X3hOE8mU+Y8Gpsoc7sk7NJ2waNJbQkkt8d3wWMHzVU07PCgoRgaef2eGUKjXYXa4tDCPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:06.156706Z"},"content_sha256":"62afd4babe99412a44701b3198d1e38d85a9648b9eb44fc58527972ac4f03a41","schema_version":"1.0","event_id":"sha256:62afd4babe99412a44701b3198d1e38d85a9648b9eb44fc58527972ac4f03a41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/bundle.json","state_url":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5HEPDTYFA42CY524LZZRCPM3G/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-01T15:55:06Z","links":{"resolver":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G","bundle":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/bundle.json","state":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5HEPDTYFA42CY524LZZRCPM3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B5HEPDTYFA42CY524LZZRCPM3G","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":"219f4a973c88b4b3db504e5c79d988f29574f63d8bae95c3b5731d65de80f69d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-18T15:54:58Z","title_canon_sha256":"547ca1d024d0352b4faf96747fc5ff8e6794f70016722606b198f67b8c0bc85b"},"schema_version":"1.0","source":{"id":"1505.04693","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04693","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04693v3","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04693","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"B5HEPDTYFA42","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B5HEPDTYFA42CY52","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B5HEPDTY","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:62afd4babe99412a44701b3198d1e38d85a9648b9eb44fc58527972ac4f03a41","target":"graph","created_at":"2026-05-18T01:12:01Z","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":"Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors $4-\\frac{2}{M}$ and $3-\\frac{1}{M}$ for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where $M$ is the num","authors_text":"Jian-Jia Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-18T15:54:58Z","title":"Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04693","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:9e8febf9292d7d0704a5c7cb3c112f17384fbc657729527f57cd2ad0c1b1015f","target":"record","created_at":"2026-05-18T01:12:01Z","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":"219f4a973c88b4b3db504e5c79d988f29574f63d8bae95c3b5731d65de80f69d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-18T15:54:58Z","title_canon_sha256":"547ca1d024d0352b4faf96747fc5ff8e6794f70016722606b198f67b8c0bc85b"},"schema_version":"1.0","source":{"id":"1505.04693","kind":"arxiv","version":3}},"canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","first_computed_at":"2026-05-18T01:12:01.835756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:01.835756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ML2ezSJLxg08J8rTYmOWJci07vS85ufmf9cGBGmqWSOv9RcZLgW97ibA25x81ALpNelvg5k6A/h4NzTsgcOoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:01.836102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04693","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e8febf9292d7d0704a5c7cb3c112f17384fbc657729527f57cd2ad0c1b1015f","sha256:62afd4babe99412a44701b3198d1e38d85a9648b9eb44fc58527972ac4f03a41"],"state_sha256":"29508eb4339b1cee797f16e20dee6609fd90da4a5c230954890848ab81654106"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6u224I4qcibkuPt60PcmQfvbzC4gXV3L/9+CY5nSSvO4pJ0brE1I73+fOvuSA1EV6W6VqYsufy2wjPgS7rFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:06.158671Z","bundle_sha256":"af2423289cf1368d74bf8efbaf1694e9115372653f5dacc3857bf3df9d68da3a"}}