{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JSYFM2K4AGRZ4MLWVMJA6NOIQY","short_pith_number":"pith:JSYFM2K4","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"},"canonical_sha256":"4cb056695c01a39e3176ab120f35c886305d757bd02982e04f58acd8efc134c1","source":{"kind":"arxiv","id":"1212.0895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0895","created_at":"2026-05-18T03:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0895v1","created_at":"2026-05-18T03:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0895","created_at":"2026-05-18T03:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"JSYFM2K4AGRZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JSYFM2K4AGRZ4MLW","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JSYFM2K4","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JSYFM2K4AGRZ4MLWVMJA6NOIQY","target":"record","payload":{"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"},"canonical_sha256":"4cb056695c01a39e3176ab120f35c886305d757bd02982e04f58acd8efc134c1","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"},"source_kind":"arxiv","source_id":"1212.0895","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEHkZu1BzUQXcIFc1CzFvFzi36sK5XL2qiX/K+O2Wu019makq1Ul+QyGqCi4cKGDAO3T+weYqPbEeFV4QKW3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:42:54.748009Z"},"content_sha256":"4122d20a4f68de045c9a0b8660710fdcd3ed9e0d5a682e77bf51f6629178eb24","schema_version":"1.0","event_id":"sha256:4122d20a4f68de045c9a0b8660710fdcd3ed9e0d5a682e77bf51f6629178eb24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JSYFM2K4AGRZ4MLWVMJA6NOIQY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PkQTKnNtmID2B/GsqMubEmZ/NMVwWzucT3d35ISbhzuHmVUYvL5mUssJvjvrwB9oPYntGAFWRt/U5/zyYf/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:42:54.748366Z"},"content_sha256":"67eb5dd0db7c10a4073c46af07ab156b5f47b47b15b75cc8b16f861a4abfaa62","schema_version":"1.0","event_id":"sha256:67eb5dd0db7c10a4073c46af07ab156b5f47b47b15b75cc8b16f861a4abfaa62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/bundle.json","state_url":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T03:42:54Z","links":{"resolver":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY","bundle":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/bundle.json","state":"https://pith.science/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSYFM2K4AGRZ4MLWVMJA6NOIQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JSYFM2K4AGRZ4MLWVMJA6NOIQY","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":"17994a52151b8574613d09a63d8b95fb95fb091390e34e8a9379d44aa9b67265","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T22:21:24Z","title_canon_sha256":"d22e2ddd824ce650fb2afa88ac701f6769e301aaa10a2b3a39d81f1e0153e2e2"},"schema_version":"1.0","source":{"id":"1212.0895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0895","created_at":"2026-05-18T03:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0895v1","created_at":"2026-05-18T03:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0895","created_at":"2026-05-18T03:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"JSYFM2K4AGRZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JSYFM2K4AGRZ4MLW","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JSYFM2K4","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:67eb5dd0db7c10a4073c46af07ab156b5f47b47b15b75cc8b16f861a4abfaa62","target":"graph","created_at":"2026-05-18T03:39:07Z","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":"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.","authors_text":"Nikolai K. Krivulin","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T22:21:24Z","title":"The max-plus algebra approach in modelling of queueing networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0895","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:4122d20a4f68de045c9a0b8660710fdcd3ed9e0d5a682e77bf51f6629178eb24","target":"record","created_at":"2026-05-18T03:39:07Z","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":"17994a52151b8574613d09a63d8b95fb95fb091390e34e8a9379d44aa9b67265","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T22:21:24Z","title_canon_sha256":"d22e2ddd824ce650fb2afa88ac701f6769e301aaa10a2b3a39d81f1e0153e2e2"},"schema_version":"1.0","source":{"id":"1212.0895","kind":"arxiv","version":1}},"canonical_sha256":"4cb056695c01a39e3176ab120f35c886305d757bd02982e04f58acd8efc134c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cb056695c01a39e3176ab120f35c886305d757bd02982e04f58acd8efc134c1","first_computed_at":"2026-05-18T03:39:07.013481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:07.013481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z8JwuoZRBfWGAZectJXFhRDFEeiA+PndMw+8s+F1Fw74YNjIpciGvgHqhtef0EtSei9Ivs03F10nksY3lYPlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:07.014110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4122d20a4f68de045c9a0b8660710fdcd3ed9e0d5a682e77bf51f6629178eb24","sha256:67eb5dd0db7c10a4073c46af07ab156b5f47b47b15b75cc8b16f861a4abfaa62"],"state_sha256":"4bf3211c3495ac84e720312314d49f45b26e140008a9ae8b17bb065dfb6e40eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ef4RR5ysSQNLJYyNbXwFszIx0AMLwTNhcsOkxojlE3Om13Q8kPQhhysznoR3CD7AqMUnFk2HONHghgyxn3phDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:42:54.750228Z","bundle_sha256":"f74fc9af7c9e31bb714f64d4f2d50c4a89f471e5510d711acb9b8ce1bb3f392c"}}