{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LTDPRGMENLPINRSZR2FKZ75AJQ","short_pith_number":"pith:LTDPRGME","schema_version":"1.0","canonical_sha256":"5cc6f899846ade86c6598e8aacffa04c1a9cca7a3f40534bee0ba7724da93ec7","source":{"kind":"arxiv","id":"1210.6019","version":1},"attestation_state":"computed","paper":{"title":"Using max-algebra linear models in the representation of queueing systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikolai K. Krivulin","submitted_at":"2012-10-22T19:52:00Z","abstract_excerpt":"The application of the max-algebra to describe queueing systems by both linear scalar and vector equations is discussed. It is shown that these equations may be handled using ordinary algebraic manipulations. Examples of solving the equations representing the $G/G/1$ queue and queues in tandem are also presented."},"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.6019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-22T19:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"3c2ebaa2f691fd2c1d236a7690420575c57e5f8a3dd554e0a49682b9b19383f3","abstract_canon_sha256":"1c0999749313394455473a84ddf89376fb646624249a8b81ffd5e7a9cb3b8c9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:34.480563Z","signature_b64":"p0bLpiOaBpaHW8EXhahr9PYLFpzZPKDgRW6j0qk3eqH9DU57c4jLnOAMJ/R+0yx8rTWazGPwoSWJKuWFmyxBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cc6f899846ade86c6598e8aacffa04c1a9cca7a3f40534bee0ba7724da93ec7","last_reissued_at":"2026-05-18T03:42:34.479869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:34.479869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using max-algebra linear models in the representation of queueing systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikolai K. Krivulin","submitted_at":"2012-10-22T19:52:00Z","abstract_excerpt":"The application of the max-algebra to describe queueing systems by both linear scalar and vector equations is discussed. It is shown that these equations may be handled using ordinary algebraic manipulations. Examples of solving the equations representing the $G/G/1$ queue and queues in tandem are also presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6019","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.6019","created_at":"2026-05-18T03:42:34.479967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6019v1","created_at":"2026-05-18T03:42:34.479967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6019","created_at":"2026-05-18T03:42:34.479967+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTDPRGMENLPI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTDPRGMENLPINRSZ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTDPRGME","created_at":"2026-05-18T12:27:14.488303+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/LTDPRGMENLPINRSZR2FKZ75AJQ","json":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ.json","graph_json":"https://pith.science/api/pith-number/LTDPRGMENLPINRSZR2FKZ75AJQ/graph.json","events_json":"https://pith.science/api/pith-number/LTDPRGMENLPINRSZR2FKZ75AJQ/events.json","paper":"https://pith.science/paper/LTDPRGME"},"agent_actions":{"view_html":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ","download_json":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ.json","view_paper":"https://pith.science/paper/LTDPRGME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6019&json=true","fetch_graph":"https://pith.science/api/pith-number/LTDPRGMENLPINRSZR2FKZ75AJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LTDPRGMENLPINRSZR2FKZ75AJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ/action/storage_attestation","attest_author":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ/action/author_attestation","sign_citation":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ/action/citation_signature","submit_replication":"https://pith.science/pith/LTDPRGMENLPINRSZR2FKZ75AJQ/action/replication_record"}},"created_at":"2026-05-18T03:42:34.479967+00:00","updated_at":"2026-05-18T03:42:34.479967+00:00"}