{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SOSRUBQ4MCZ6D6IRWEDR7YE3FO","short_pith_number":"pith:SOSRUBQ4","canonical_record":{"source":{"id":"1210.6378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T20:46:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b4d76605f681b746102ec97fdfad93a15c935f299e424246bda5b8761abfbe75","abstract_canon_sha256":"496370b822d7956b1f6a92e3dadc264eee2a0cc697f77a3b2f526bff305532f1"},"schema_version":"1.0"},"canonical_sha256":"93a51a061c60b3e1f911b1071fe09b2bbde0f9fcde93ce1db7607ab6adb8440d","source":{"kind":"arxiv","id":"1210.6378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6378","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6378v1","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6378","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"SOSRUBQ4MCZ6","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SOSRUBQ4MCZ6D6IR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SOSRUBQ4","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SOSRUBQ4MCZ6D6IRWEDR7YE3FO","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T20:46:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b4d76605f681b746102ec97fdfad93a15c935f299e424246bda5b8761abfbe75","abstract_canon_sha256":"496370b822d7956b1f6a92e3dadc264eee2a0cc697f77a3b2f526bff305532f1"},"schema_version":"1.0"},"canonical_sha256":"93a51a061c60b3e1f911b1071fe09b2bbde0f9fcde93ce1db7607ab6adb8440d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:25.024351Z","signature_b64":"NnshhT3tqVPvDGpI7FXCC6iq6GhxtyNI2lSYVem36b0Gs1yzbs2FvMC9vOxT82RsCBYg+KTT+9HOWKKN38yuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a51a061c60b3e1f911b1071fe09b2bbde0f9fcde93ce1db7607ab6adb8440d","last_reissued_at":"2026-05-18T03:42:25.023695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:25.023695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6378","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:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0+dOV2RuBg7Y2fAtRawZYoWeTHLCd9tp4H9HAVBiKngbqUJJop0aOD8z8yU59vuoa8i9EIBlAB1gB1oEk2TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:32:52.562289Z"},"content_sha256":"05cbf6a6f64ddda8d2b81ce1ada27a3fb02206a38ee20477db783f000e50ed58","schema_version":"1.0","event_id":"sha256:05cbf6a6f64ddda8d2b81ce1ada27a3fb02206a38ee20477db783f000e50ed58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SOSRUBQ4MCZ6D6IRWEDR7YE3FO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithms for tandem queueing system simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.NA","authors_text":"Nikolai K. Krivulin, Sergei M. Ermakov","submitted_at":"2012-10-23T20:46:56Z","abstract_excerpt":"Serial and parallel algorithms for simulation of tandem queueing systems with infinite buffers are presented, and their performance is examined. It is shown that the algorithms which are based on a simple computational procedure involve low time and memory requirements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6378","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:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLk3WcM7Oh7xA9TDyufa3VhTCWMShESqE80hs8nl2vSoTG4Fu5Hi6URLkhNh156jXzv2W+2onbJTzKzOheXvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:32:52.562657Z"},"content_sha256":"3fc2a028fcc8784dc9738bc49a607be16bb6d00accba0701542eba6352286aec","schema_version":"1.0","event_id":"sha256:3fc2a028fcc8784dc9738bc49a607be16bb6d00accba0701542eba6352286aec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/bundle.json","state_url":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/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-25T02:32:52Z","links":{"resolver":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO","bundle":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/bundle.json","state":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SOSRUBQ4MCZ6D6IRWEDR7YE3FO","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":"496370b822d7956b1f6a92e3dadc264eee2a0cc697f77a3b2f526bff305532f1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T20:46:56Z","title_canon_sha256":"b4d76605f681b746102ec97fdfad93a15c935f299e424246bda5b8761abfbe75"},"schema_version":"1.0","source":{"id":"1210.6378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6378","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6378v1","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6378","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"SOSRUBQ4MCZ6","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SOSRUBQ4MCZ6D6IR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SOSRUBQ4","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:3fc2a028fcc8784dc9738bc49a607be16bb6d00accba0701542eba6352286aec","target":"graph","created_at":"2026-05-18T03:42:25Z","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":"Serial and parallel algorithms for simulation of tandem queueing systems with infinite buffers are presented, and their performance is examined. It is shown that the algorithms which are based on a simple computational procedure involve low time and memory requirements.","authors_text":"Nikolai K. Krivulin, Sergei M. Ermakov","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T20:46:56Z","title":"Efficient algorithms for tandem queueing system simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6378","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:05cbf6a6f64ddda8d2b81ce1ada27a3fb02206a38ee20477db783f000e50ed58","target":"record","created_at":"2026-05-18T03:42:25Z","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":"496370b822d7956b1f6a92e3dadc264eee2a0cc697f77a3b2f526bff305532f1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T20:46:56Z","title_canon_sha256":"b4d76605f681b746102ec97fdfad93a15c935f299e424246bda5b8761abfbe75"},"schema_version":"1.0","source":{"id":"1210.6378","kind":"arxiv","version":1}},"canonical_sha256":"93a51a061c60b3e1f911b1071fe09b2bbde0f9fcde93ce1db7607ab6adb8440d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93a51a061c60b3e1f911b1071fe09b2bbde0f9fcde93ce1db7607ab6adb8440d","first_computed_at":"2026-05-18T03:42:25.023695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:25.023695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NnshhT3tqVPvDGpI7FXCC6iq6GhxtyNI2lSYVem36b0Gs1yzbs2FvMC9vOxT82RsCBYg+KTT+9HOWKKN38yuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:25.024351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05cbf6a6f64ddda8d2b81ce1ada27a3fb02206a38ee20477db783f000e50ed58","sha256:3fc2a028fcc8784dc9738bc49a607be16bb6d00accba0701542eba6352286aec"],"state_sha256":"e6f5b5b3caa7d58075da77213f8698b2a0640ee0d4a12951f6bc5cb882689885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/Z5uGfy6mf8AdI1npWTVo7Q6obPEGjFELQxQf4U6ZUfCOrwujjXr1cebHripFiLtPAGCc5iS+LFOlhdCbjlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:32:52.564608Z","bundle_sha256":"2500795071e29e80318d9970508f676883e43bb121b0868eeaf970e60ccdfa22"}}