{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MYLPFCFXIHIWZ7RZXMRIRFASDP","short_pith_number":"pith:MYLPFCFX","canonical_record":{"source":{"id":"1204.4467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T20:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"ad8a8038e40e730c26884ece50e9f4a002c972201d7088f50fd7e20c7eaaa187","abstract_canon_sha256":"e74e4e482e80e7c2483a0d7d91d89d8375d7536128f50acfd007ce1e890d7d63"},"schema_version":"1.0"},"canonical_sha256":"6616f288b741d16cfe39bb228894121bf07727745f5633966337a790b67ba890","source":{"kind":"arxiv","id":"1204.4467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4467","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4467v1","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4467","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"MYLPFCFXIHIW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MYLPFCFXIHIWZ7RZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MYLPFCFX","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MYLPFCFXIHIWZ7RZXMRIRFASDP","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T20:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"ad8a8038e40e730c26884ece50e9f4a002c972201d7088f50fd7e20c7eaaa187","abstract_canon_sha256":"e74e4e482e80e7c2483a0d7d91d89d8375d7536128f50acfd007ce1e890d7d63"},"schema_version":"1.0"},"canonical_sha256":"6616f288b741d16cfe39bb228894121bf07727745f5633966337a790b67ba890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:27.232731Z","signature_b64":"MZc/8WwL4qM/GGqiWXkYdjsP8VMPJLWoIIWXiSOXkWgnOAgozjFGimXo4rp5PYsTppypVMTj8ORiwPKVaUyjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6616f288b741d16cfe39bb228894121bf07727745f5633966337a790b67ba890","last_reissued_at":"2026-05-18T03:57:27.231938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:27.231938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4467","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-18T03:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6gj8Q1FCg2K5Cvz8yp6t57x66ckrfGyqQ5QYpk1Z2qFT25i/K3sQmkdm8IoFaEK/+J5FyFpa1uQtCJgkqWjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:42:58.087752Z"},"content_sha256":"29d5c718714ee439f16e9c28774232f01fe1acf33630bbe7ab725a9817138e27","schema_version":"1.0","event_id":"sha256:29d5c718714ee439f16e9c28774232f01fe1acf33630bbe7ab725a9817138e27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MYLPFCFXIHIWZ7RZXMRIRFASDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real-Time Stochastic Processing Networks with Concurrent Resource Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"I-Hong Hou, Rahul Singh","submitted_at":"2012-04-19T20:34:57Z","abstract_excerpt":"Stochastic Processing Networks (SPNs) can be used to model communication networks, manufacturing systems, service systems, etc. We consider a real-time SPN where tasks generate jobs with strict deadlines according to their traffic patterns. Each job requires the concurrent usage of some resources to be processed. The processing time of a job may be stochastic, and may not be known until the job completes. Finally, each task may require that some portion of its tasks to be completed on time.\n  In this paper, we study the problem of verifying whether it is feasible to fulfill the requirements of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4467","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-18T03:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8V7H06oxKetefzp2DIrB3l9vN8dpAXoUKJFPdlIFUyXqxpEnBvqjzjcEb+Pwn+sqV8LdkkVvoSQCZB+attGwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:42:58.088469Z"},"content_sha256":"c3fdf7b4d643070f7796fb5eae618bfd06af62f42467c7b40cf793807a628588","schema_version":"1.0","event_id":"sha256:c3fdf7b4d643070f7796fb5eae618bfd06af62f42467c7b40cf793807a628588"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP/bundle.json","state_url":"https://pith.science/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP/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-05-20T02:42:58Z","links":{"resolver":"https://pith.science/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP","bundle":"https://pith.science/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP/bundle.json","state":"https://pith.science/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYLPFCFXIHIWZ7RZXMRIRFASDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MYLPFCFXIHIWZ7RZXMRIRFASDP","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":"e74e4e482e80e7c2483a0d7d91d89d8375d7536128f50acfd007ce1e890d7d63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T20:34:57Z","title_canon_sha256":"ad8a8038e40e730c26884ece50e9f4a002c972201d7088f50fd7e20c7eaaa187"},"schema_version":"1.0","source":{"id":"1204.4467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4467","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4467v1","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4467","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"MYLPFCFXIHIW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MYLPFCFXIHIWZ7RZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MYLPFCFX","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:c3fdf7b4d643070f7796fb5eae618bfd06af62f42467c7b40cf793807a628588","target":"graph","created_at":"2026-05-18T03:57:27Z","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":"Stochastic Processing Networks (SPNs) can be used to model communication networks, manufacturing systems, service systems, etc. We consider a real-time SPN where tasks generate jobs with strict deadlines according to their traffic patterns. Each job requires the concurrent usage of some resources to be processed. The processing time of a job may be stochastic, and may not be known until the job completes. Finally, each task may require that some portion of its tasks to be completed on time.\n  In this paper, we study the problem of verifying whether it is feasible to fulfill the requirements of","authors_text":"I-Hong Hou, Rahul Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T20:34:57Z","title":"Real-Time Stochastic Processing Networks with Concurrent Resource Requirements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4467","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:29d5c718714ee439f16e9c28774232f01fe1acf33630bbe7ab725a9817138e27","target":"record","created_at":"2026-05-18T03:57:27Z","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":"e74e4e482e80e7c2483a0d7d91d89d8375d7536128f50acfd007ce1e890d7d63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T20:34:57Z","title_canon_sha256":"ad8a8038e40e730c26884ece50e9f4a002c972201d7088f50fd7e20c7eaaa187"},"schema_version":"1.0","source":{"id":"1204.4467","kind":"arxiv","version":1}},"canonical_sha256":"6616f288b741d16cfe39bb228894121bf07727745f5633966337a790b67ba890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6616f288b741d16cfe39bb228894121bf07727745f5633966337a790b67ba890","first_computed_at":"2026-05-18T03:57:27.231938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:27.231938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZc/8WwL4qM/GGqiWXkYdjsP8VMPJLWoIIWXiSOXkWgnOAgozjFGimXo4rp5PYsTppypVMTj8ORiwPKVaUyjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:27.232731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29d5c718714ee439f16e9c28774232f01fe1acf33630bbe7ab725a9817138e27","sha256:c3fdf7b4d643070f7796fb5eae618bfd06af62f42467c7b40cf793807a628588"],"state_sha256":"f055fee688de776faa321cc227eca8603087a21daaaf75ff56f7aca95a1d3a4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlHVvTaQRGafUcD2rI+RTL/h9yOC6DQoyd1e3PjHvg9y+OJoGmsNQn3ZSSumKJhq5pstBUs6tfGSDqo6yC/4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T02:42:58.092297Z","bundle_sha256":"817facd5e2be2aa0996a65aeffe6e845f370e5ba29f20508abfe70cf84b49f4e"}}