{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OIUIZI6F566SZB4E4MTPEU4V36","short_pith_number":"pith:OIUIZI6F","canonical_record":{"source":{"id":"1809.04355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-12T10:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"50150d22ae2a3406a8d9789e3e1834de988eb241bab2da98d7eedb435d4c36d5","abstract_canon_sha256":"b7f359437e3fb30781b00fe98e2f4a157e180e87268ce77a626ae7c93fefeb2d"},"schema_version":"1.0"},"canonical_sha256":"72288ca3c5efbd2c8784e326f25395dfa78250f39400a00aed52735bf58aa4dd","source":{"kind":"arxiv","id":"1809.04355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04355","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04355v1","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04355","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"pith_short_12","alias_value":"OIUIZI6F566S","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OIUIZI6F566SZB4E","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OIUIZI6F","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OIUIZI6F566SZB4E4MTPEU4V36","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-12T10:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"50150d22ae2a3406a8d9789e3e1834de988eb241bab2da98d7eedb435d4c36d5","abstract_canon_sha256":"b7f359437e3fb30781b00fe98e2f4a157e180e87268ce77a626ae7c93fefeb2d"},"schema_version":"1.0"},"canonical_sha256":"72288ca3c5efbd2c8784e326f25395dfa78250f39400a00aed52735bf58aa4dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:52.630507Z","signature_b64":"mSt9qtHZOQpIy5Us9/42HJkgxPEhRewWo6oo4KEOulnJuENFJWrUUdUCX4IGkXRP1guHx02XYOXLbNKeiZkIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72288ca3c5efbd2c8784e326f25395dfa78250f39400a00aed52735bf58aa4dd","last_reissued_at":"2026-05-18T00:05:52.629718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:52.629718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04355","source_version":1,"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-18T00:05:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K7Ym1MIWB6iZZ8HXCcfRvTjIZhiVrukOvdoZWmNDto5Ww7GykadJq26iHqXpftTdtJLqIzjurBvrT1pXQ0FZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:05:51.197135Z"},"content_sha256":"14c80e3d1c10c987210e64d69997ed7c1def070a4377e0e9434bc2d35d62ad24","schema_version":"1.0","event_id":"sha256:14c80e3d1c10c987210e64d69997ed7c1def070a4377e0e9434bc2d35d62ad24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OIUIZI6F566SZB4E4MTPEU4V36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty","submitted_at":"2018-09-12T10:55:23Z","abstract_excerpt":"In real-time systems, in addition to the functional correctness recurrent tasks must fulfill timing constraints to ensure the correct behavior of the system. Partitioned scheduling is widely used in real-time systems, i.e., the tasks are statically assigned onto processors while ensuring that all timing constraints are met. The decision version of the problem, which is to check whether the deadline constraints of tasks can be satisfied on a given number of identical processors, has been known ${\\cal NP}$-complete in the strong sense. Several studies on this problem are based on approximations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04355","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"},"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-18T00:05:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgM+9w9mAzse1P2Er4dJHo7FzVicHH9PsdOk2qJXfUSqzD/uxw1ZuBw+kUKU8s9GFQhmsxWyYrASymt59aowBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:05:51.197872Z"},"content_sha256":"c3399f5a5952159edfae386db278d3f525459b06e283cc1a162523a4c0789c49","schema_version":"1.0","event_id":"sha256:c3399f5a5952159edfae386db278d3f525459b06e283cc1a162523a4c0789c49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIUIZI6F566SZB4E4MTPEU4V36/bundle.json","state_url":"https://pith.science/pith/OIUIZI6F566SZB4E4MTPEU4V36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIUIZI6F566SZB4E4MTPEU4V36/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-27T09:05:51Z","links":{"resolver":"https://pith.science/pith/OIUIZI6F566SZB4E4MTPEU4V36","bundle":"https://pith.science/pith/OIUIZI6F566SZB4E4MTPEU4V36/bundle.json","state":"https://pith.science/pith/OIUIZI6F566SZB4E4MTPEU4V36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIUIZI6F566SZB4E4MTPEU4V36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OIUIZI6F566SZB4E4MTPEU4V36","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":"b7f359437e3fb30781b00fe98e2f4a157e180e87268ce77a626ae7c93fefeb2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-12T10:55:23Z","title_canon_sha256":"50150d22ae2a3406a8d9789e3e1834de988eb241bab2da98d7eedb435d4c36d5"},"schema_version":"1.0","source":{"id":"1809.04355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04355","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04355v1","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04355","created_at":"2026-05-18T00:05:52Z"},{"alias_kind":"pith_short_12","alias_value":"OIUIZI6F566S","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OIUIZI6F566SZB4E","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OIUIZI6F","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:c3399f5a5952159edfae386db278d3f525459b06e283cc1a162523a4c0789c49","target":"graph","created_at":"2026-05-18T00:05:52Z","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":"In real-time systems, in addition to the functional correctness recurrent tasks must fulfill timing constraints to ensure the correct behavior of the system. Partitioned scheduling is widely used in real-time systems, i.e., the tasks are statically assigned onto processors while ensuring that all timing constraints are met. The decision version of the problem, which is to check whether the deadline constraints of tasks can be satisfied on a given number of identical processors, has been known ${\\cal NP}$-complete in the strong sense. Several studies on this problem are based on approximations ","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-12T10:55:23Z","title":"Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04355","kind":"arxiv","version":1},"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:14c80e3d1c10c987210e64d69997ed7c1def070a4377e0e9434bc2d35d62ad24","target":"record","created_at":"2026-05-18T00:05:52Z","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":"b7f359437e3fb30781b00fe98e2f4a157e180e87268ce77a626ae7c93fefeb2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-12T10:55:23Z","title_canon_sha256":"50150d22ae2a3406a8d9789e3e1834de988eb241bab2da98d7eedb435d4c36d5"},"schema_version":"1.0","source":{"id":"1809.04355","kind":"arxiv","version":1}},"canonical_sha256":"72288ca3c5efbd2c8784e326f25395dfa78250f39400a00aed52735bf58aa4dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72288ca3c5efbd2c8784e326f25395dfa78250f39400a00aed52735bf58aa4dd","first_computed_at":"2026-05-18T00:05:52.629718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:52.629718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSt9qtHZOQpIy5Us9/42HJkgxPEhRewWo6oo4KEOulnJuENFJWrUUdUCX4IGkXRP1guHx02XYOXLbNKeiZkIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:52.630507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14c80e3d1c10c987210e64d69997ed7c1def070a4377e0e9434bc2d35d62ad24","sha256:c3399f5a5952159edfae386db278d3f525459b06e283cc1a162523a4c0789c49"],"state_sha256":"35dc0119ce64a6ad1d5d555b27af8006c263d246ee91c6c495d862a22069bdf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"raEtDQ1owJAGikzQfocDiq3zkVlaCBp01qXzRq6gLR3mTBJi/Tfk7rxBIN9RIwj2HJQt6Nx0Gov43/dUXMSrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:05:51.202349Z","bundle_sha256":"ea8b52986bd2c0908dddd6108ed299eb57b7baf20fb759ec40df6475e3481fdf"}}