{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JSYFM2K4AGRZ4MLWVMJA6NOIQY","short_pith_number":"pith:JSYFM2K4","schema_version":"1.0","canonical_sha256":"4cb056695c01a39e3176ab120f35c886305d757bd02982e04f58acd8efc134c1","source":{"kind":"arxiv","id":"1212.0895","version":1},"attestation_state":"computed","paper":{"title":"The max-plus algebra approach in modelling of queueing networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Nikolai K. Krivulin","submitted_at":"2012-12-04T22:21:24Z","abstract_excerpt":"A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix. We show how the matrix may be calculated from the service time of customers in the general case, and give examples of matrices inherent in particular networks."},"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":"1212.0895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T22:21:24Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d22e2ddd824ce650fb2afa88ac701f6769e301aaa10a2b3a39d81f1e0153e2e2","abstract_canon_sha256":"17994a52151b8574613d09a63d8b95fb95fb091390e34e8a9379d44aa9b67265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:07.014110Z","signature_b64":"Z8JwuoZRBfWGAZectJXFhRDFEeiA+PndMw+8s+F1Fw74YNjIpciGvgHqhtef0EtSei9Ivs03F10nksY3lYPlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cb056695c01a39e3176ab120f35c886305d757bd02982e04f58acd8efc134c1","last_reissued_at":"2026-05-18T03:39:07.013481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:07.013481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The max-plus algebra approach in modelling of queueing networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Nikolai K. Krivulin","submitted_at":"2012-12-04T22:21:24Z","abstract_excerpt":"A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix. We show how the matrix may be calculated from the service time of customers in the general case, and give examples of matrices inherent in particular networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0895","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":"1212.0895","created_at":"2026-05-18T03:39:07.013571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0895v1","created_at":"2026-05-18T03:39:07.013571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0895","created_at":"2026-05-18T03:39:07.013571+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSYFM2K4AGRZ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSYFM2K4AGRZ4MLW","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSYFM2K4","created_at":"2026-05-18T12:27:11.947152+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/JSYFM2K4AGRZ4MLWVMJA6NOIQY","json":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY.json","graph_json":"https://pith.science/api/pith-number/JSYFM2K4AGRZ4MLWVMJA6NOIQY/graph.json","events_json":"https://pith.science/api/pith-number/JSYFM2K4AGRZ4MLWVMJA6NOIQY/events.json","paper":"https://pith.science/paper/JSYFM2K4"},"agent_actions":{"view_html":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY","download_json":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY.json","view_paper":"https://pith.science/paper/JSYFM2K4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0895&json=true","fetch_graph":"https://pith.science/api/pith-number/JSYFM2K4AGRZ4MLWVMJA6NOIQY/graph.json","fetch_events":"https://pith.science/api/pith-number/JSYFM2K4AGRZ4MLWVMJA6NOIQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/action/storage_attestation","attest_author":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/action/author_attestation","sign_citation":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/action/citation_signature","submit_replication":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/action/replication_record"}},"created_at":"2026-05-18T03:39:07.013571+00:00","updated_at":"2026-05-18T03:39:07.013571+00:00"}