{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:O7PPZ72LHW6DFMPN3Z2DFKOWF7","short_pith_number":"pith:O7PPZ72L","schema_version":"1.0","canonical_sha256":"77defcff4b3dbc32b1edde7432a9d62fffb115ceef54ec710d2d854632ec5dcb","source":{"kind":"arxiv","id":"2111.06225","version":2},"attestation_state":"computed","paper":{"title":"Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos","submitted_at":"2021-11-11T14:24:31Z","abstract_excerpt":"Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed simultaneously on multiple machines, occupying the same time interval on all these machines. We study a general version of this setting, in which the functions determining the joint processing speed of machines for a given job follow different discrete concavity assumptions (subadditivity, fractional subadditivity, submodularity, and matroid ranks). We show that under these assumptions the problem of scheduling mallea"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.06225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-11-11T14:24:31Z","cross_cats_sorted":[],"title_canon_sha256":"2a4552944d3b18062d9dd9b052a22927440dc19d5ab9f08be93855cf8abf49e5","abstract_canon_sha256":"1c477645885c1cc272b7de666f1626e72a94e7d90444c55917e822785989db76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:59.478535Z","signature_b64":"Riup8UiOz9NhzDBc09pgS/kP8IAbrjPldkRBjbxsMliKmkpCHApS4nGjj/uEJe8yg4YTfNRMjL41dM3SmlUaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77defcff4b3dbc32b1edde7432a9d62fffb115ceef54ec710d2d854632ec5dcb","last_reissued_at":"2026-07-05T04:08:59.477970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:59.477970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos","submitted_at":"2021-11-11T14:24:31Z","abstract_excerpt":"Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed simultaneously on multiple machines, occupying the same time interval on all these machines. We study a general version of this setting, in which the functions determining the joint processing speed of machines for a given job follow different discrete concavity assumptions (subadditivity, fractional subadditivity, submodularity, and matroid ranks). We show that under these assumptions the problem of scheduling mallea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06225","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.06225/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.06225","created_at":"2026-07-05T04:08:59.478026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06225v2","created_at":"2026-07-05T04:08:59.478026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06225","created_at":"2026-07-05T04:08:59.478026+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7PPZ72LHW6D","created_at":"2026-07-05T04:08:59.478026+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7PPZ72LHW6DFMPN","created_at":"2026-07-05T04:08:59.478026+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7PPZ72L","created_at":"2026-07-05T04:08:59.478026+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7","json":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7.json","graph_json":"https://pith.science/api/pith-number/O7PPZ72LHW6DFMPN3Z2DFKOWF7/graph.json","events_json":"https://pith.science/api/pith-number/O7PPZ72LHW6DFMPN3Z2DFKOWF7/events.json","paper":"https://pith.science/paper/O7PPZ72L"},"agent_actions":{"view_html":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7","download_json":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7.json","view_paper":"https://pith.science/paper/O7PPZ72L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06225&json=true","fetch_graph":"https://pith.science/api/pith-number/O7PPZ72LHW6DFMPN3Z2DFKOWF7/graph.json","fetch_events":"https://pith.science/api/pith-number/O7PPZ72LHW6DFMPN3Z2DFKOWF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7/action/storage_attestation","attest_author":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7/action/author_attestation","sign_citation":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7/action/citation_signature","submit_replication":"https://pith.science/pith/O7PPZ72LHW6DFMPN3Z2DFKOWF7/action/replication_record"}},"created_at":"2026-07-05T04:08:59.478026+00:00","updated_at":"2026-07-05T04:08:59.478026+00:00"}