{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SOSRUBQ4MCZ6D6IRWEDR7YE3FO","short_pith_number":"pith:SOSRUBQ4","schema_version":"1.0","canonical_sha256":"93a51a061c60b3e1f911b1071fe09b2bbde0f9fcde93ce1db7607ab6adb8440d","source":{"kind":"arxiv","id":"1210.6378","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.6378","created_at":"2026-05-18T03:42:25.023792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6378v1","created_at":"2026-05-18T03:42:25.023792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6378","created_at":"2026-05-18T03:42:25.023792+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOSRUBQ4MCZ6","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOSRUBQ4MCZ6D6IR","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOSRUBQ4","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO","json":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO.json","graph_json":"https://pith.science/api/pith-number/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/graph.json","events_json":"https://pith.science/api/pith-number/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/events.json","paper":"https://pith.science/paper/SOSRUBQ4"},"agent_actions":{"view_html":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO","download_json":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO.json","view_paper":"https://pith.science/paper/SOSRUBQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6378&json=true","fetch_graph":"https://pith.science/api/pith-number/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/graph.json","fetch_events":"https://pith.science/api/pith-number/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/action/storage_attestation","attest_author":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/action/author_attestation","sign_citation":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/action/citation_signature","submit_replication":"https://pith.science/pith/SOSRUBQ4MCZ6D6IRWEDR7YE3FO/action/replication_record"}},"created_at":"2026-05-18T03:42:25.023792+00:00","updated_at":"2026-05-18T03:42:25.023792+00:00"}