{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GC5NBCDBT6O3Y3DRX3IDGABWRC","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":"384011f6d8759471f648b1e1b3378f336fa8d439878f8c606ce11a3f7b6802b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-19T15:29:26Z","title_canon_sha256":"252f5b81a656a34344747f8cf6a1100a15389d36cc8c0bc3232bc205b49fd9db"},"schema_version":"1.0","source":{"id":"1507.05301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05301","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05301v1","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05301","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"GC5NBCDBT6O3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GC5NBCDBT6O3Y3DR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GC5NBCDB","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:5f88d6d58838e07f6426afba38aeaf2417d1bb1b46c3561412c4a1f81a1f8114","target":"graph","created_at":"2026-05-18T01:36:37Z","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":"This article provides a comparison of the successive lumping (SL) methodology with the popular lattice path counting algorithm in obtaining rate matrices for queueing models, satisfying the quasi birth and death structure. The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance for the same classical queueing models.\n  The main findings are: i) When both methods are applicable SL based algorithms outperform the lattice path counting algorithm (LPCA). ii) There are important classes of problems (e.g., models with (le","authors_text":"Floske M. Spieksma, Laurens C. Smit, Michael N. Katehakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-19T15:29:26Z","title":"A Comparative Analysis of the Successive Lumping and the Lattice Path Counting Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05301","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:23a58f93bf273193c2c0f22c0bdb5b45559ff21fdd2562bda98459df6d08fcf0","target":"record","created_at":"2026-05-18T01:36:37Z","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":"384011f6d8759471f648b1e1b3378f336fa8d439878f8c606ce11a3f7b6802b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-19T15:29:26Z","title_canon_sha256":"252f5b81a656a34344747f8cf6a1100a15389d36cc8c0bc3232bc205b49fd9db"},"schema_version":"1.0","source":{"id":"1507.05301","kind":"arxiv","version":1}},"canonical_sha256":"30bad088619f9dbc6c71bed0330036888686f763b466299a846727453cb445d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30bad088619f9dbc6c71bed0330036888686f763b466299a846727453cb445d1","first_computed_at":"2026-05-18T01:36:37.268457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:37.268457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NJCfbJjL6pB31iREZfTMVmM8YxTsQTI1OFp7YVBf9ivqJy89FO5u7Rx2HEpWR7unMUYlQlnBKA9t6xVzoX0mCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:37.269130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23a58f93bf273193c2c0f22c0bdb5b45559ff21fdd2562bda98459df6d08fcf0","sha256:5f88d6d58838e07f6426afba38aeaf2417d1bb1b46c3561412c4a1f81a1f8114"],"state_sha256":"a9f9fc280a3d234480e1f3eac4ccf6e5852c86cddff2c091a89251fdb2b4848a"}