{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JVUTYZB42X2VHZGXRJYLF7GA3X","short_pith_number":"pith:JVUTYZB4","canonical_record":{"source":{"id":"1604.08004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-04-27T10:08:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"55b52b7f505bd4073044ca8bdf09aa8792f5dbbb327210d389d5bfb3689485eb","abstract_canon_sha256":"0fccebe7126892fdc85f1383b372ceb6cffdf565b2640b00c8c43dc5198cef18"},"schema_version":"1.0"},"canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","source":{"kind":"arxiv","id":"1604.08004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08004","created_at":"2026-05-18T01:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08004v1","created_at":"2026-05-18T01:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08004","created_at":"2026-05-18T01:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"JVUTYZB42X2V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JVUTYZB42X2VHZGX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JVUTYZB4","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JVUTYZB42X2VHZGXRJYLF7GA3X","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-04-27T10:08:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"55b52b7f505bd4073044ca8bdf09aa8792f5dbbb327210d389d5bfb3689485eb","abstract_canon_sha256":"0fccebe7126892fdc85f1383b372ceb6cffdf565b2640b00c8c43dc5198cef18"},"schema_version":"1.0"},"canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:08.424611Z","signature_b64":"kh8CuRTtLMkZQk+sq8lcnkj//D+822099dFfohU+olxcvL4xttKasC0C0kzmfgQzhqD7nh4GzAezU+2yT3GZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","last_reissued_at":"2026-05-18T01:16:08.423977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:08.423977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08004","source_version":1,"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-18T01:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXBiBYYvlWVxtnmNaTv/qUuqkIVNIimPxQAVLmp0HNahozo8p7XRc9ziDnJJjtSjHJgZALeSc7fdpH42X473BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:47:28.105592Z"},"content_sha256":"4daf9053588082434afb3159c367a820367304d1baf15a1e074a95918024b321","schema_version":"1.0","event_id":"sha256:4daf9053588082434afb3159c367a820367304d1baf15a1e074a95918024b321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JVUTYZB42X2VHZGXRJYLF7GA3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Analytical Solution for Probabilistic Guarantees of Reservation Based Soft Real-Time Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Bernardo Villalba Fr\\'ias, Daniele Fontanelli, Luca Abeni, Luigi Palopoli","submitted_at":"2016-04-27T10:08:53Z","abstract_excerpt":"We show a methodology for the computation of the probability of deadline miss for a periodic real-time task scheduled by a resource reservation algorithm. We propose a modelling technique for the system that reduces the computation of such a probability to that of the steady state probability of an infinite state Discrete Time Markov Chain with a periodic structure. This structure is exploited to develop an efficient numeric solution where different accuracy/computation time trade-offs can be obtained by operating on the granularity of the model. More importantly we offer a closed form conserv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08004","kind":"arxiv","version":1},"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-18T01:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GA2jjHYJE+HdzT9GvNVNcarc8ysVzD1lzhNBvlkXj8ZMIiI6pLGB0FfPVllHUKKrZIiQVdL3AM5YE1FiXYW6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:47:28.106296Z"},"content_sha256":"bf62e6b04056a074a82bc3e649559e4f80a0ef4184a2292324bdb5dd46f409cc","schema_version":"1.0","event_id":"sha256:bf62e6b04056a074a82bc3e649559e4f80a0ef4184a2292324bdb5dd46f409cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/bundle.json","state_url":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/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-11T21:47:28Z","links":{"resolver":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X","bundle":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/bundle.json","state":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JVUTYZB42X2VHZGXRJYLF7GA3X","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":"0fccebe7126892fdc85f1383b372ceb6cffdf565b2640b00c8c43dc5198cef18","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-04-27T10:08:53Z","title_canon_sha256":"55b52b7f505bd4073044ca8bdf09aa8792f5dbbb327210d389d5bfb3689485eb"},"schema_version":"1.0","source":{"id":"1604.08004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08004","created_at":"2026-05-18T01:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08004v1","created_at":"2026-05-18T01:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08004","created_at":"2026-05-18T01:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"JVUTYZB42X2V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JVUTYZB42X2VHZGX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JVUTYZB4","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:bf62e6b04056a074a82bc3e649559e4f80a0ef4184a2292324bdb5dd46f409cc","target":"graph","created_at":"2026-05-18T01:16:08Z","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 show a methodology for the computation of the probability of deadline miss for a periodic real-time task scheduled by a resource reservation algorithm. We propose a modelling technique for the system that reduces the computation of such a probability to that of the steady state probability of an infinite state Discrete Time Markov Chain with a periodic structure. This structure is exploited to develop an efficient numeric solution where different accuracy/computation time trade-offs can be obtained by operating on the granularity of the model. More importantly we offer a closed form conserv","authors_text":"Bernardo Villalba Fr\\'ias, Daniele Fontanelli, Luca Abeni, Luigi Palopoli","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-04-27T10:08:53Z","title":"An Analytical Solution for Probabilistic Guarantees of Reservation Based Soft Real-Time Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08004","kind":"arxiv","version":1},"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:4daf9053588082434afb3159c367a820367304d1baf15a1e074a95918024b321","target":"record","created_at":"2026-05-18T01:16:08Z","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":"0fccebe7126892fdc85f1383b372ceb6cffdf565b2640b00c8c43dc5198cef18","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-04-27T10:08:53Z","title_canon_sha256":"55b52b7f505bd4073044ca8bdf09aa8792f5dbbb327210d389d5bfb3689485eb"},"schema_version":"1.0","source":{"id":"1604.08004","kind":"arxiv","version":1}},"canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","first_computed_at":"2026-05-18T01:16:08.423977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:08.423977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kh8CuRTtLMkZQk+sq8lcnkj//D+822099dFfohU+olxcvL4xttKasC0C0kzmfgQzhqD7nh4GzAezU+2yT3GZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:08.424611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4daf9053588082434afb3159c367a820367304d1baf15a1e074a95918024b321","sha256:bf62e6b04056a074a82bc3e649559e4f80a0ef4184a2292324bdb5dd46f409cc"],"state_sha256":"00da684b08d8cb68f6c9e68dd447d1ae6bf28a0dd7ef4121e2251080e8cea427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iam0bxQeswx+OKweewu++Au9jSBXkJX/8GgrblSe5Ci812MoFYmcEf7jbZv6VgvkUF1qdJ3VHCN5+RjaAXQ7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:47:28.110456Z","bundle_sha256":"6c003ea2362b0befb7862fa28507cd70aa1bf0910706e3b1d3761e17c6433b75"}}