{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MBOO3D5UNPQ45LEEAA7LJQ7VOA","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":"e317dd43a4a83930583dab97227a9e90a049d9c567f8456081b326b275870bf0","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T10:52:13Z","title_canon_sha256":"b93edb4ee762582484ee90ef189778a8e397c78dfef07b6648b7ad3c79ef7da0"},"schema_version":"1.0","source":{"id":"1112.1229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1229","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1229v2","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1229","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"MBOO3D5UNPQ4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBOO3D5UNPQ45LEE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBOO3D5U","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:553de753af0b81d6e0e4fce536e63e4f7e31fc9f4cd4d70a411dc6697fe4644b","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"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 ","authors_text":"Fabio Iannello, Osvaldo Simeone, Umberto Spagnolini","cross_cats":["cs.DS","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T10:52:13Z","title":"On the Optimal Scheduling of Independent, Symmetric and Time-Sensitive Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1229","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:0a6a58b3d4f9bed08c0a0e5bece97a611724fce57e4fb770faedc32f9abc18c6","target":"record","created_at":"2026-05-18T00:58:43Z","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":"e317dd43a4a83930583dab97227a9e90a049d9c567f8456081b326b275870bf0","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-06T10:52:13Z","title_canon_sha256":"b93edb4ee762582484ee90ef189778a8e397c78dfef07b6648b7ad3c79ef7da0"},"schema_version":"1.0","source":{"id":"1112.1229","kind":"arxiv","version":2}},"canonical_sha256":"605ced8fb46be1ceac84003eb4c3f57036db21b4893141b8eedc75e179d595a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"605ced8fb46be1ceac84003eb4c3f57036db21b4893141b8eedc75e179d595a7","first_computed_at":"2026-05-18T00:58:43.214282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.214282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JEVI5+xCeF5NyJMC44IBfv17TEbdkqYHAq1yLi2zFO1BJcfaUOg931IZ83Ww5LRHdUxlW3/kVzBKWuMap2jwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.214805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a6a58b3d4f9bed08c0a0e5bece97a611724fce57e4fb770faedc32f9abc18c6","sha256:553de753af0b81d6e0e4fce536e63e4f7e31fc9f4cd4d70a411dc6697fe4644b"],"state_sha256":"68b487e8b378bde2ecb8f98e1dfe64070be7b4a34d010d9b13eda1e63a535d9a"}