{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MBOO3D5UNPQ45LEEAA7LJQ7VOA","short_pith_number":"pith:MBOO3D5U","schema_version":"1.0","canonical_sha256":"605ced8fb46be1ceac84003eb4c3f57036db21b4893141b8eedc75e179d595a7","source":{"kind":"arxiv","id":"1112.1229","version":2},"attestation_state":"computed","paper":{"title":"On the Optimal Scheduling of Independent, Symmetric and Time-Sensitive Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SY"],"primary_cat":"math.OC","authors_text":"Fabio Iannello, Osvaldo Simeone, Umberto Spagnolini","submitted_at":"2011-12-06T10:52:13Z","abstract_excerpt":"Consider a discrete-time system in which a centralized controller (CC) is tasked with assigning at each time interval (or slot) K resources (or servers) to K out of M>=K nodes. When assigned a server, a node can execute a task. The tasks are independently generated at each node by stochastically symmetric and memoryless random processes and stored in a finite-capacity task queue. Moreover, they are time-sensitive in the sense that within each slot there is a non-zero probability that a task expires before being scheduled. The scheduling problem is tackled with the aim of maximizing the number "},"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":"1112.1229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T10:52:13Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"b93edb4ee762582484ee90ef189778a8e397c78dfef07b6648b7ad3c79ef7da0","abstract_canon_sha256":"e317dd43a4a83930583dab97227a9e90a049d9c567f8456081b326b275870bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.214805Z","signature_b64":"JEVI5+xCeF5NyJMC44IBfv17TEbdkqYHAq1yLi2zFO1BJcfaUOg931IZ83Ww5LRHdUxlW3/kVzBKWuMap2jwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"605ced8fb46be1ceac84003eb4c3f57036db21b4893141b8eedc75e179d595a7","last_reissued_at":"2026-05-18T00:58:43.214282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.214282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimal Scheduling of Independent, Symmetric and Time-Sensitive Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SY"],"primary_cat":"math.OC","authors_text":"Fabio Iannello, Osvaldo Simeone, Umberto Spagnolini","submitted_at":"2011-12-06T10:52:13Z","abstract_excerpt":"Consider a discrete-time system in which a centralized controller (CC) is tasked with assigning at each time interval (or slot) K resources (or servers) to K out of M>=K nodes. When assigned a server, a node can execute a task. The tasks are independently generated at each node by stochastically symmetric and memoryless random processes and stored in a finite-capacity task queue. Moreover, they are time-sensitive in the sense that within each slot there is a non-zero probability that a task expires before being scheduled. The scheduling problem is tackled with the aim of maximizing the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1229","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.1229","created_at":"2026-05-18T00:58:43.214378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1229v2","created_at":"2026-05-18T00:58:43.214378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1229","created_at":"2026-05-18T00:58:43.214378+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBOO3D5UNPQ4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBOO3D5UNPQ45LEE","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBOO3D5U","created_at":"2026-05-18T12:26:34.985390+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/MBOO3D5UNPQ45LEEAA7LJQ7VOA","json":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA.json","graph_json":"https://pith.science/api/pith-number/MBOO3D5UNPQ45LEEAA7LJQ7VOA/graph.json","events_json":"https://pith.science/api/pith-number/MBOO3D5UNPQ45LEEAA7LJQ7VOA/events.json","paper":"https://pith.science/paper/MBOO3D5U"},"agent_actions":{"view_html":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA","download_json":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA.json","view_paper":"https://pith.science/paper/MBOO3D5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1229&json=true","fetch_graph":"https://pith.science/api/pith-number/MBOO3D5UNPQ45LEEAA7LJQ7VOA/graph.json","fetch_events":"https://pith.science/api/pith-number/MBOO3D5UNPQ45LEEAA7LJQ7VOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA/action/storage_attestation","attest_author":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA/action/author_attestation","sign_citation":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA/action/citation_signature","submit_replication":"https://pith.science/pith/MBOO3D5UNPQ45LEEAA7LJQ7VOA/action/replication_record"}},"created_at":"2026-05-18T00:58:43.214378+00:00","updated_at":"2026-05-18T00:58:43.214378+00:00"}