{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AZM7JGH7Z7TSCYOEJGNPYTOJFM","short_pith_number":"pith:AZM7JGH7","schema_version":"1.0","canonical_sha256":"0659f498ffcfe72161c4499afc4dc92b0236a1cab63d2718b093eb7ce4b29165","source":{"kind":"arxiv","id":"1211.6778","version":1},"attestation_state":"computed","paper":{"title":"Efficient parallel algorithms for tandem queueing system simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.NA","authors_text":"Nikolai K. Krivulin, Sergei M. Ermakov","submitted_at":"2012-11-28T23:04:55Z","abstract_excerpt":"Parallel algorithms designed for simulation and performance evaluation of single-server tandem queueing systems with both infinite and finite buffers are presented. The algorithms exploit a simple computational procedure based on recursive equations as a representation of system dynamics. A brief analysis of the performance of the algorithms are given to show that they 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":"1211.6778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-28T23:04:55Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"633439d494be6bc5e3370fb610714d0e8510ded9b667ed440d815cf116c950f9","abstract_canon_sha256":"490bca3e2452bf75bdf130a512025bde507197b08b208b5ebd0aab591483f5c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:43.035301Z","signature_b64":"w70yjjhQ73+LfDdh6JZ9IGccSoloicWX/kyzskRA5UWn+JGsZTzsBk4A+VMtyWRUUq/E9rNIIr0N4IRXW2TOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0659f498ffcfe72161c4499afc4dc92b0236a1cab63d2718b093eb7ce4b29165","last_reissued_at":"2026-05-18T03:39:43.034813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:43.034813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient parallel algorithms for tandem queueing system simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.NA","authors_text":"Nikolai K. Krivulin, Sergei M. Ermakov","submitted_at":"2012-11-28T23:04:55Z","abstract_excerpt":"Parallel algorithms designed for simulation and performance evaluation of single-server tandem queueing systems with both infinite and finite buffers are presented. The algorithms exploit a simple computational procedure based on recursive equations as a representation of system dynamics. A brief analysis of the performance of the algorithms are given to show that they involve low time and memory requirements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6778","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":"1211.6778","created_at":"2026-05-18T03:39:43.034890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6778v1","created_at":"2026-05-18T03:39:43.034890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6778","created_at":"2026-05-18T03:39:43.034890+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZM7JGH7Z7TS","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZM7JGH7Z7TSCYOE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZM7JGH7","created_at":"2026-05-18T12:26:58.693483+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/AZM7JGH7Z7TSCYOEJGNPYTOJFM","json":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM.json","graph_json":"https://pith.science/api/pith-number/AZM7JGH7Z7TSCYOEJGNPYTOJFM/graph.json","events_json":"https://pith.science/api/pith-number/AZM7JGH7Z7TSCYOEJGNPYTOJFM/events.json","paper":"https://pith.science/paper/AZM7JGH7"},"agent_actions":{"view_html":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM","download_json":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM.json","view_paper":"https://pith.science/paper/AZM7JGH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6778&json=true","fetch_graph":"https://pith.science/api/pith-number/AZM7JGH7Z7TSCYOEJGNPYTOJFM/graph.json","fetch_events":"https://pith.science/api/pith-number/AZM7JGH7Z7TSCYOEJGNPYTOJFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM/action/storage_attestation","attest_author":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM/action/author_attestation","sign_citation":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM/action/citation_signature","submit_replication":"https://pith.science/pith/AZM7JGH7Z7TSCYOEJGNPYTOJFM/action/replication_record"}},"created_at":"2026-05-18T03:39:43.034890+00:00","updated_at":"2026-05-18T03:39:43.034890+00:00"}