{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7S4XZ4EBRPLNL3PZTXPEWQRDHQ","short_pith_number":"pith:7S4XZ4EB","canonical_record":{"source":{"id":"1409.2291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-08T11:10:45Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a0aab6286463c2b228770c738e0c52695dc22465d8252256bf6494e3a23c7dc8","abstract_canon_sha256":"d4087f1107858bfc4dd218e824dbfc7a9b0ebf3a1340ba3c36e09624ba690fae"},"schema_version":"1.0"},"canonical_sha256":"fcb97cf0818bd6d5edf99dde4b42233c10a278d56db256ec329876a4e12348f7","source":{"kind":"arxiv","id":"1409.2291","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2291","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2291v3","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2291","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"7S4XZ4EBRPLN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7S4XZ4EBRPLNL3PZ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7S4XZ4EB","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7S4XZ4EBRPLNL3PZTXPEWQRDHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-08T11:10:45Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a0aab6286463c2b228770c738e0c52695dc22465d8252256bf6494e3a23c7dc8","abstract_canon_sha256":"d4087f1107858bfc4dd218e824dbfc7a9b0ebf3a1340ba3c36e09624ba690fae"},"schema_version":"1.0"},"canonical_sha256":"fcb97cf0818bd6d5edf99dde4b42233c10a278d56db256ec329876a4e12348f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.543634Z","signature_b64":"R8tch7s+kfM+DzCm3EJRRhICKjeJlwBYRSyKVBzy4KsmjQAZeioyXeoETt0SI4342OOeJWoMb3WO4Ml09zkoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb97cf0818bd6d5edf99dde4b42233c10a278d56db256ec329876a4e12348f7","last_reissued_at":"2026-05-18T02:42:53.543201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.543201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2291","source_version":3,"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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ph2EwNdm5YMF1sni9SSZ0L27VbPTvMFC+Y5L/x7ch7/kn44NXL1Zfwfy/qoaWnDoo6+R7z9kP5lg8qYfeqZ6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:40:30.129604Z"},"content_sha256":"70fdf95551e3c27faf29febc5c9650e5fbb1fb195bee1d4b7c7f13b9c8ad736f","schema_version":"1.0","event_id":"sha256:70fdf95551e3c27faf29febc5c9650e5fbb1fb195bee1d4b7c7f13b9c8ad736f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7S4XZ4EBRPLNL3PZTXPEWQRDHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DS","authors_text":"Alexander K\\\"o{\\ss}ler, Andreas Pavlogiannis, Krishnendu Chatterjee, Ulrich Schmid","submitted_at":"2014-09-08T11:10:45Z","abstract_excerpt":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including $D^{over}$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2291","kind":"arxiv","version":3},"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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjdY99eGCVkimGHms/yhdoWUq92YLaR1dZ3kwlsBZtZFmAIQUSjAE2bY4m4hFMLgQOAmR7tosFJP2EtzUVDMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:40:30.129954Z"},"content_sha256":"c23e0dae2738483293797adb580f9f5ab8eed4efe81290c6e7b265ea10bb90e9","schema_version":"1.0","event_id":"sha256:c23e0dae2738483293797adb580f9f5ab8eed4efe81290c6e7b265ea10bb90e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ/bundle.json","state_url":"https://pith.science/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ/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-09T15:40:30Z","links":{"resolver":"https://pith.science/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ","bundle":"https://pith.science/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ/bundle.json","state":"https://pith.science/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7S4XZ4EBRPLNL3PZTXPEWQRDHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7S4XZ4EBRPLNL3PZTXPEWQRDHQ","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":"d4087f1107858bfc4dd218e824dbfc7a9b0ebf3a1340ba3c36e09624ba690fae","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-08T11:10:45Z","title_canon_sha256":"a0aab6286463c2b228770c738e0c52695dc22465d8252256bf6494e3a23c7dc8"},"schema_version":"1.0","source":{"id":"1409.2291","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2291","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2291v3","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2291","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"7S4XZ4EBRPLN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7S4XZ4EBRPLNL3PZ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7S4XZ4EB","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:c23e0dae2738483293797adb580f9f5ab8eed4efe81290c6e7b265ea10bb90e9","target":"graph","created_at":"2026-05-18T02:42:53Z","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":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including $D^{over}$,","authors_text":"Alexander K\\\"o{\\ss}ler, Andreas Pavlogiannis, Krishnendu Chatterjee, Ulrich Schmid","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-08T11:10:45Z","title":"A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2291","kind":"arxiv","version":3},"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:70fdf95551e3c27faf29febc5c9650e5fbb1fb195bee1d4b7c7f13b9c8ad736f","target":"record","created_at":"2026-05-18T02:42:53Z","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":"d4087f1107858bfc4dd218e824dbfc7a9b0ebf3a1340ba3c36e09624ba690fae","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-08T11:10:45Z","title_canon_sha256":"a0aab6286463c2b228770c738e0c52695dc22465d8252256bf6494e3a23c7dc8"},"schema_version":"1.0","source":{"id":"1409.2291","kind":"arxiv","version":3}},"canonical_sha256":"fcb97cf0818bd6d5edf99dde4b42233c10a278d56db256ec329876a4e12348f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcb97cf0818bd6d5edf99dde4b42233c10a278d56db256ec329876a4e12348f7","first_computed_at":"2026-05-18T02:42:53.543201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.543201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R8tch7s+kfM+DzCm3EJRRhICKjeJlwBYRSyKVBzy4KsmjQAZeioyXeoETt0SI4342OOeJWoMb3WO4Ml09zkoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.543634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2291","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70fdf95551e3c27faf29febc5c9650e5fbb1fb195bee1d4b7c7f13b9c8ad736f","sha256:c23e0dae2738483293797adb580f9f5ab8eed4efe81290c6e7b265ea10bb90e9"],"state_sha256":"bc565ae30d7355e2c705328ed633841f69284c22e6d8f98b49aa58f3328df3db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFlB20i0GRzS/gUU1Da+2PDIo/zQYD0lod5MD5q4lYm3q2GotIE5siljM6dD4s4ixx3ypOAbdf4dgxtrvuuBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:40:30.131937Z","bundle_sha256":"11474189f77089cf41792703d7824b4a3c4f96a4d01c11b345a9d370723e99e6"}}