{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7BSA5YCA4O3ZZCJDB277EH7Y3O","short_pith_number":"pith:7BSA5YCA","canonical_record":{"source":{"id":"1711.00103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T20:47:39Z","cross_cats_sorted":[],"title_canon_sha256":"90345e1e5e4d12df17fadcb63011b6356173928892647b6f00f4461145799318","abstract_canon_sha256":"10fe5426a3d581e9114c835b807b1047f483f66b2620bef4abaa75e4a5bd8532"},"schema_version":"1.0"},"canonical_sha256":"f8640ee040e3b79c89230ebff21ff8dba3b805c526887abe8f949328f89b318a","source":{"kind":"arxiv","id":"1711.00103","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00103","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00103v2","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00103","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"pith_short_12","alias_value":"7BSA5YCA4O3Z","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7BSA5YCA4O3ZZCJD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7BSA5YCA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7BSA5YCA4O3ZZCJDB277EH7Y3O","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T20:47:39Z","cross_cats_sorted":[],"title_canon_sha256":"90345e1e5e4d12df17fadcb63011b6356173928892647b6f00f4461145799318","abstract_canon_sha256":"10fe5426a3d581e9114c835b807b1047f483f66b2620bef4abaa75e4a5bd8532"},"schema_version":"1.0"},"canonical_sha256":"f8640ee040e3b79c89230ebff21ff8dba3b805c526887abe8f949328f89b318a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:36.104715Z","signature_b64":"nyPznYEgkv2hOoMjc4f5gB9+E9KXzm6NQyjnZZXvNFXISHxFm1T5X9R4rxb+L9BG7MGRQd3JoHmPgsYZA/bUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8640ee040e3b79c89230ebff21ff8dba3b805c526887abe8f949328f89b318a","last_reissued_at":"2026-05-18T00:26:36.103981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:36.103981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00103","source_version":2,"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:26:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFbOlxAdITXolfCCGdcMXIv8h7XDlMoiZvMfVe8cjE3uFPuybR5qpuFdaMCCa6QOHNQLX9p/T5rBc+0FjYmGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:26:52.409072Z"},"content_sha256":"54d35b92ac6afb6f79829955d0902397ea3241a05db0c79ad477408936badaef","schema_version":"1.0","event_id":"sha256:54d35b92ac6afb6f79829955d0902397ea3241a05db0c79ad477408936badaef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7BSA5YCA4O3ZZCJDB277EH7Y3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Monotone Moldable Jobs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Land, Klaus Jansen","submitted_at":"2017-10-31T20:47:39Z","abstract_excerpt":"A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it. A moldable job is monotone if its work doesn't decrease for an increasing number of allotted processors. We consider the problem of scheduling monotone moldable jobs to minimize the makespan.\n  We argue that for certain compact input encodings a polynomial algorithm has a running time polynomial in n and log(m), where n is the number of jobs and m is the number of machines. We describe how monotony of jobs can be used to counteract the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00103","kind":"arxiv","version":2},"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:26:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4/YCW2KlJbjfA4fJ9+HfwvqCletsndsHdSU+IRwIyzvKHb1o+93dUkn9hJmADEY/43AXJIj9lEW3hQatfk1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:26:52.409766Z"},"content_sha256":"a4915476a636b0e8544e23bdb23be706bdba676db5eeaf3aad230ec3cb8ee606","schema_version":"1.0","event_id":"sha256:a4915476a636b0e8544e23bdb23be706bdba676db5eeaf3aad230ec3cb8ee606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O/bundle.json","state_url":"https://pith.science/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O/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-28T21:26:52Z","links":{"resolver":"https://pith.science/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O","bundle":"https://pith.science/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O/bundle.json","state":"https://pith.science/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BSA5YCA4O3ZZCJDB277EH7Y3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7BSA5YCA4O3ZZCJDB277EH7Y3O","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":"10fe5426a3d581e9114c835b807b1047f483f66b2620bef4abaa75e4a5bd8532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T20:47:39Z","title_canon_sha256":"90345e1e5e4d12df17fadcb63011b6356173928892647b6f00f4461145799318"},"schema_version":"1.0","source":{"id":"1711.00103","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00103","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00103v2","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00103","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"pith_short_12","alias_value":"7BSA5YCA4O3Z","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7BSA5YCA4O3ZZCJD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7BSA5YCA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a4915476a636b0e8544e23bdb23be706bdba676db5eeaf3aad230ec3cb8ee606","target":"graph","created_at":"2026-05-18T00:26:36Z","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":"A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it. A moldable job is monotone if its work doesn't decrease for an increasing number of allotted processors. We consider the problem of scheduling monotone moldable jobs to minimize the makespan.\n  We argue that for certain compact input encodings a polynomial algorithm has a running time polynomial in n and log(m), where n is the number of jobs and m is the number of machines. We describe how monotony of jobs can be used to counteract the","authors_text":"Felix Land, Klaus Jansen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T20:47:39Z","title":"Scheduling Monotone Moldable Jobs in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00103","kind":"arxiv","version":2},"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:54d35b92ac6afb6f79829955d0902397ea3241a05db0c79ad477408936badaef","target":"record","created_at":"2026-05-18T00:26:36Z","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":"10fe5426a3d581e9114c835b807b1047f483f66b2620bef4abaa75e4a5bd8532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T20:47:39Z","title_canon_sha256":"90345e1e5e4d12df17fadcb63011b6356173928892647b6f00f4461145799318"},"schema_version":"1.0","source":{"id":"1711.00103","kind":"arxiv","version":2}},"canonical_sha256":"f8640ee040e3b79c89230ebff21ff8dba3b805c526887abe8f949328f89b318a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8640ee040e3b79c89230ebff21ff8dba3b805c526887abe8f949328f89b318a","first_computed_at":"2026-05-18T00:26:36.103981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:36.103981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nyPznYEgkv2hOoMjc4f5gB9+E9KXzm6NQyjnZZXvNFXISHxFm1T5X9R4rxb+L9BG7MGRQd3JoHmPgsYZA/bUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:36.104715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00103","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54d35b92ac6afb6f79829955d0902397ea3241a05db0c79ad477408936badaef","sha256:a4915476a636b0e8544e23bdb23be706bdba676db5eeaf3aad230ec3cb8ee606"],"state_sha256":"addad1f86ff95b62b38b252738816d7e42dccc60ed9d50d7f6db27aba6e2e943"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18n9fUnMEKPCtE9wD4+2kYdFc8nOXlkmrdXHsQfi7ZRdPWINyhxXV5xQ43kfJ0JOFhyq8g7trYuFkYAlShnTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:26:52.413529Z","bundle_sha256":"544795a291d9aeb923a8e9296a1adf35e9905e6a8194627f0a26580941252fb7"}}