{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IYWGJ3J3CZTWU53PPQG5LF2X56","short_pith_number":"pith:IYWGJ3J3","canonical_record":{"source":{"id":"1212.2778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-12T11:37:48Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"2cea3964d83818c160ebd53460f9ae91f7bdc92da3ddef5b3420b9b5f91c5887","abstract_canon_sha256":"b866cb0cd0a6880cb12f3aa22665f86ea369a56e808eebda0d422da947ccf3ed"},"schema_version":"1.0"},"canonical_sha256":"462c64ed3b16676a776f7c0dd59757efa9c6c081a1632b6a7d50b3faa547ff02","source":{"kind":"arxiv","id":"1212.2778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2778","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2778v1","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2778","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"IYWGJ3J3CZTW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IYWGJ3J3CZTWU53P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IYWGJ3J3","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IYWGJ3J3CZTWU53PPQG5LF2X56","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-12T11:37:48Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"2cea3964d83818c160ebd53460f9ae91f7bdc92da3ddef5b3420b9b5f91c5887","abstract_canon_sha256":"b866cb0cd0a6880cb12f3aa22665f86ea369a56e808eebda0d422da947ccf3ed"},"schema_version":"1.0"},"canonical_sha256":"462c64ed3b16676a776f7c0dd59757efa9c6c081a1632b6a7d50b3faa547ff02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:03.613387Z","signature_b64":"s82XreZjhd3DuVk4aLQIzar2q4K33MyZtqT+HvH2LSVjeRbwUNAcjMpxyhRzGJTdd+fN+GBoL0p3Dp6D+SFACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"462c64ed3b16676a776f7c0dd59757efa9c6c081a1632b6a7d50b3faa547ff02","last_reissued_at":"2026-05-17T23:42:03.612847Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:03.612847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2778","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-17T23:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfRJLTyCo7l8ShXtpQlhz+/AnRlN8fig31tiv0nIKXBf9N281z+8cZ2CQ3LQmVS7UDVs09tY/haK998gd67hBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:06:47.507147Z"},"content_sha256":"df70ba0d9d32afe22ca751aa7110512c06b908b6d33a1cf2f444baa788764151","schema_version":"1.0","event_id":"sha256:df70ba0d9d32afe22ca751aa7110512c06b908b6d33a1cf2f444baa788764151"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IYWGJ3J3CZTWU53PPQG5LF2X56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.DS","authors_text":"Alberto Marchetti-Spaccamela, Andreas Wiese, Sebastian Stiller, Vincenzo Bonifaci","submitted_at":"2012-12-12T11:37:48Z","abstract_excerpt":"A model has been proposed in [Baruah et al., in Proceedings of the IEEE Real-Time Systems Symposium 2012] for representing recurrent precedence-constrained tasks to be executed on multiprocessor platforms, where each recurrent task is modeled by a directed acyclic graph (DAG), a period, and a relative deadline. Each vertex of the DAG represents a sequential job, while the edges of the DAG represent precedence constraints between these jobs. All the jobs of the DAG are released simultaneously and have to be completed within some specified relative deadline. The task may release jobs in this man"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2778","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-17T23:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOeyFPDSIN0hkVKjHhPFTjmb3K+0ryI6Po00N7kCNLJYxBDaIWkaEakaAG5d/zjChJmoAYqHIbuAnpFMs4TWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:06:47.507507Z"},"content_sha256":"f5e44c4a16637b54b96dc20885832556d3d87ec58c3a9448518dc6130014b832","schema_version":"1.0","event_id":"sha256:f5e44c4a16637b54b96dc20885832556d3d87ec58c3a9448518dc6130014b832"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYWGJ3J3CZTWU53PPQG5LF2X56/bundle.json","state_url":"https://pith.science/pith/IYWGJ3J3CZTWU53PPQG5LF2X56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYWGJ3J3CZTWU53PPQG5LF2X56/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-01T11:06:47Z","links":{"resolver":"https://pith.science/pith/IYWGJ3J3CZTWU53PPQG5LF2X56","bundle":"https://pith.science/pith/IYWGJ3J3CZTWU53PPQG5LF2X56/bundle.json","state":"https://pith.science/pith/IYWGJ3J3CZTWU53PPQG5LF2X56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYWGJ3J3CZTWU53PPQG5LF2X56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IYWGJ3J3CZTWU53PPQG5LF2X56","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":"b866cb0cd0a6880cb12f3aa22665f86ea369a56e808eebda0d422da947ccf3ed","cross_cats_sorted":["cs.OS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-12T11:37:48Z","title_canon_sha256":"2cea3964d83818c160ebd53460f9ae91f7bdc92da3ddef5b3420b9b5f91c5887"},"schema_version":"1.0","source":{"id":"1212.2778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2778","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2778v1","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2778","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"IYWGJ3J3CZTW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IYWGJ3J3CZTWU53P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IYWGJ3J3","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:f5e44c4a16637b54b96dc20885832556d3d87ec58c3a9448518dc6130014b832","target":"graph","created_at":"2026-05-17T23:42:03Z","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":"A model has been proposed in [Baruah et al., in Proceedings of the IEEE Real-Time Systems Symposium 2012] for representing recurrent precedence-constrained tasks to be executed on multiprocessor platforms, where each recurrent task is modeled by a directed acyclic graph (DAG), a period, and a relative deadline. Each vertex of the DAG represents a sequential job, while the edges of the DAG represent precedence constraints between these jobs. All the jobs of the DAG are released simultaneously and have to be completed within some specified relative deadline. The task may release jobs in this man","authors_text":"Alberto Marchetti-Spaccamela, Andreas Wiese, Sebastian Stiller, Vincenzo Bonifaci","cross_cats":["cs.OS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-12T11:37:48Z","title":"Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2778","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:df70ba0d9d32afe22ca751aa7110512c06b908b6d33a1cf2f444baa788764151","target":"record","created_at":"2026-05-17T23:42:03Z","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":"b866cb0cd0a6880cb12f3aa22665f86ea369a56e808eebda0d422da947ccf3ed","cross_cats_sorted":["cs.OS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-12T11:37:48Z","title_canon_sha256":"2cea3964d83818c160ebd53460f9ae91f7bdc92da3ddef5b3420b9b5f91c5887"},"schema_version":"1.0","source":{"id":"1212.2778","kind":"arxiv","version":1}},"canonical_sha256":"462c64ed3b16676a776f7c0dd59757efa9c6c081a1632b6a7d50b3faa547ff02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"462c64ed3b16676a776f7c0dd59757efa9c6c081a1632b6a7d50b3faa547ff02","first_computed_at":"2026-05-17T23:42:03.612847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:03.612847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s82XreZjhd3DuVk4aLQIzar2q4K33MyZtqT+HvH2LSVjeRbwUNAcjMpxyhRzGJTdd+fN+GBoL0p3Dp6D+SFACA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:03.613387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df70ba0d9d32afe22ca751aa7110512c06b908b6d33a1cf2f444baa788764151","sha256:f5e44c4a16637b54b96dc20885832556d3d87ec58c3a9448518dc6130014b832"],"state_sha256":"520982cbc793462353f48495ddb982dd03707cd80e579eb7297a3db192dbc084"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45Oc59oT9TLd74VzWubeaQbYS1N1m/25m8K0h9vhVGwGwePqFCdOj56GluWYWS8vrTxP/yH9G2PKcpAuE5rcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:06:47.509519Z","bundle_sha256":"218bf2e1b971495683f88e708c387da2663968f9d4fbe8dfb3dbba9dfba35786"}}