{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EBRCYFVVYFFKBA4PGPLBZY7A2W","short_pith_number":"pith:EBRCYFVV","canonical_record":{"source":{"id":"1901.07070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T20:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"0ba6313ff7d67d5386ae830d95fab954cbaa063f7631a944870abf531ec0e344","abstract_canon_sha256":"9cf7019a2d124f00d7e2fa3f262326c9061e67ba38a2f060e174e896c3a7b62f"},"schema_version":"1.0"},"canonical_sha256":"20622c16b5c14aa0838f33d61ce3e0d59381728b9b9243af142fc6ef65e3ddbe","source":{"kind":"arxiv","id":"1901.07070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07070","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07070v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07070","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"EBRCYFVVYFFK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EBRCYFVVYFFKBA4P","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EBRCYFVV","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EBRCYFVVYFFKBA4PGPLBZY7A2W","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T20:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"0ba6313ff7d67d5386ae830d95fab954cbaa063f7631a944870abf531ec0e344","abstract_canon_sha256":"9cf7019a2d124f00d7e2fa3f262326c9061e67ba38a2f060e174e896c3a7b62f"},"schema_version":"1.0"},"canonical_sha256":"20622c16b5c14aa0838f33d61ce3e0d59381728b9b9243af142fc6ef65e3ddbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:48.250488Z","signature_b64":"uSvcQvCJDJ1mUuL4s3nFuIsk1WpQ9gwF2AKKGEogw7i4goVB2FtVHvTEECt+Cg+Wjp64TcsA0+TZ8JQUPq4gCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20622c16b5c14aa0838f33d61ce3e0d59381728b9b9243af142fc6ef65e3ddbe","last_reissued_at":"2026-05-17T23:55:48.249967Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:48.249967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07070","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-17T23:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCN9V8RRPkIixHr7WD7nBp5Gy3kseMY4NOkje9L0YQDFGu6xKiKYN6xm4c6HTRJSR5WDrfuI6RFLFrHuD7l/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:46:55.364167Z"},"content_sha256":"dcb978e4e42aaa524e7911a6c87e0517904f9a4e6cd28f9209d7681e660ac1e6","schema_version":"1.0","event_id":"sha256:dcb978e4e42aaa524e7911a6c87e0517904f9a4e6cd28f9209d7681e660ac1e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EBRCYFVVYFFKBA4PGPLBZY7A2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Artidoro Pagnoni, Thomas Lively, William Long","submitted_at":"2019-01-21T20:34:22Z","abstract_excerpt":"The Multiprocessor Scheduling Problem (MSP) is an NP-Complete problem with significant applications in computer and operations systems. We provide a survey of the wide array of polynomial-time approximation, heuristic, and meta-heuristic based algorithms that exist for solving MSP. We also implement Fujita's state-of-the-art Branch-and-Bound algorithm and evaluate the benefit of using Fujita's binary search bounding method instead of the Fernandez bound. We find that in fact Fujita's method does not offer any improvement over the Fernandez bound on our data set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07070","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-17T23:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S34BBSFVK6+QxwNVy71sBLnP93gNlBzZ99SYXNDNfiMCRc9Z/AUc/l62PFf1KG1v31ASnzMBS5dYwb3pP4YFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:46:55.364840Z"},"content_sha256":"5a302cf55e74c2c0b04616a67183b4f8d7f3e3f26e975b5c622846648fa90f38","schema_version":"1.0","event_id":"sha256:5a302cf55e74c2c0b04616a67183b4f8d7f3e3f26e975b5c622846648fa90f38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W/bundle.json","state_url":"https://pith.science/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W/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-10T02:46:55Z","links":{"resolver":"https://pith.science/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W","bundle":"https://pith.science/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W/bundle.json","state":"https://pith.science/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBRCYFVVYFFKBA4PGPLBZY7A2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EBRCYFVVYFFKBA4PGPLBZY7A2W","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":"9cf7019a2d124f00d7e2fa3f262326c9061e67ba38a2f060e174e896c3a7b62f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T20:34:22Z","title_canon_sha256":"0ba6313ff7d67d5386ae830d95fab954cbaa063f7631a944870abf531ec0e344"},"schema_version":"1.0","source":{"id":"1901.07070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07070","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07070v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07070","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"EBRCYFVVYFFK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EBRCYFVVYFFKBA4P","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EBRCYFVV","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:5a302cf55e74c2c0b04616a67183b4f8d7f3e3f26e975b5c622846648fa90f38","target":"graph","created_at":"2026-05-17T23:55:48Z","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":"The Multiprocessor Scheduling Problem (MSP) is an NP-Complete problem with significant applications in computer and operations systems. We provide a survey of the wide array of polynomial-time approximation, heuristic, and meta-heuristic based algorithms that exist for solving MSP. We also implement Fujita's state-of-the-art Branch-and-Bound algorithm and evaluate the benefit of using Fujita's binary search bounding method instead of the Fernandez bound. We find that in fact Fujita's method does not offer any improvement over the Fernandez bound on our data set.","authors_text":"Artidoro Pagnoni, Thomas Lively, William Long","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T20:34:22Z","title":"Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07070","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:dcb978e4e42aaa524e7911a6c87e0517904f9a4e6cd28f9209d7681e660ac1e6","target":"record","created_at":"2026-05-17T23:55:48Z","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":"9cf7019a2d124f00d7e2fa3f262326c9061e67ba38a2f060e174e896c3a7b62f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T20:34:22Z","title_canon_sha256":"0ba6313ff7d67d5386ae830d95fab954cbaa063f7631a944870abf531ec0e344"},"schema_version":"1.0","source":{"id":"1901.07070","kind":"arxiv","version":1}},"canonical_sha256":"20622c16b5c14aa0838f33d61ce3e0d59381728b9b9243af142fc6ef65e3ddbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20622c16b5c14aa0838f33d61ce3e0d59381728b9b9243af142fc6ef65e3ddbe","first_computed_at":"2026-05-17T23:55:48.249967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:48.249967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uSvcQvCJDJ1mUuL4s3nFuIsk1WpQ9gwF2AKKGEogw7i4goVB2FtVHvTEECt+Cg+Wjp64TcsA0+TZ8JQUPq4gCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:48.250488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcb978e4e42aaa524e7911a6c87e0517904f9a4e6cd28f9209d7681e660ac1e6","sha256:5a302cf55e74c2c0b04616a67183b4f8d7f3e3f26e975b5c622846648fa90f38"],"state_sha256":"d89b44ff6f56740ce2ecca1804eb761d713fc771728821b1384fd0d00e106635"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ClYWKv4B4X3mPFvReo2ZUpgGS41sLIw2Dq7uXebMFLpRm2qyS0Ajr039K6/ILMDhzL/r2fiB3G3TyaeptSucAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:46:55.370855Z","bundle_sha256":"608de0f86549682778c6bedb0129570a530d6c643dc597b001ae9d5e4e0a7225"}}