{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R3GZ52C5IP4VNQJIFA4RLJS6GB","short_pith_number":"pith:R3GZ52C5","canonical_record":{"source":{"id":"1212.0578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-03T22:37:28Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"10960391dfcbbd4585f6e3e958a9456182a5352a8ed23db6297dea336de208cc","abstract_canon_sha256":"47d4e650d2a6989403e11d225a4fd840d1e0d814bf3a7fc64a41cb06a5c5460b"},"schema_version":"1.0"},"canonical_sha256":"8ecd9ee85d43f956c128283915a65e3079899309872f3cf4d792c7b8ce95a96c","source":{"kind":"arxiv","id":"1212.0578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0578","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0578v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0578","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"R3GZ52C5IP4V","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R3GZ52C5IP4VNQJI","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R3GZ52C5","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R3GZ52C5IP4VNQJIFA4RLJS6GB","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-03T22:37:28Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"10960391dfcbbd4585f6e3e958a9456182a5352a8ed23db6297dea336de208cc","abstract_canon_sha256":"47d4e650d2a6989403e11d225a4fd840d1e0d814bf3a7fc64a41cb06a5c5460b"},"schema_version":"1.0"},"canonical_sha256":"8ecd9ee85d43f956c128283915a65e3079899309872f3cf4d792c7b8ce95a96c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:15.729489Z","signature_b64":"6LDZazIP9bVE4IswnZ93TPKoGQeO54f5R+A2bo1qsjuXpNqpOO6u83JyA42Oz0BL+VPdemWuJmlJ0TScSBtzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ecd9ee85d43f956c128283915a65e3079899309872f3cf4d792c7b8ce95a96c","last_reissued_at":"2026-05-18T03:39:15.728911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:15.728911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0578","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2YNlZHOUgQpvLRstglv37TSfWmldD2irs0zupJv3h3YRnfIaptahG27nBuuwEKk3jW9mtzWpkW9DvLnm4KNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:20:00.682346Z"},"content_sha256":"9cf8d7887cb6baa09d3ffd4b3712cd16a20865857b916ebe2122127e56d7d180","schema_version":"1.0","event_id":"sha256:9cf8d7887cb6baa09d3ffd4b3712cd16a20865857b916ebe2122127e56d7d180"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R3GZ52C5IP4VNQJIFA4RLJS6GB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-plus algebra models 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-03T22:37:28Z","abstract_excerpt":"A class of queueing networks which may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite 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. It is shown how the matrices inherent in particular networks may be calculated from the service times of customers. Since, in general, an explicit dynamic eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0578","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRFdxLF7l7bo3R44Tnd1lrapylY/pktiHMkLL+d2S2V74q/5+yvKSSuoMsod2MiSfrGRyA8UJ9A7/KwqKa04BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:20:00.682702Z"},"content_sha256":"46dfbe1eb75ab975a6db8c1636e799e42f95568fa24b35f5623d5c8c1c6c404b","schema_version":"1.0","event_id":"sha256:46dfbe1eb75ab975a6db8c1636e799e42f95568fa24b35f5623d5c8c1c6c404b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB/bundle.json","state_url":"https://pith.science/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB/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-24T21:20:00Z","links":{"resolver":"https://pith.science/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB","bundle":"https://pith.science/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB/bundle.json","state":"https://pith.science/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3GZ52C5IP4VNQJIFA4RLJS6GB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R3GZ52C5IP4VNQJIFA4RLJS6GB","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":"47d4e650d2a6989403e11d225a4fd840d1e0d814bf3a7fc64a41cb06a5c5460b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-03T22:37:28Z","title_canon_sha256":"10960391dfcbbd4585f6e3e958a9456182a5352a8ed23db6297dea336de208cc"},"schema_version":"1.0","source":{"id":"1212.0578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0578","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0578v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0578","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"R3GZ52C5IP4V","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R3GZ52C5IP4VNQJI","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R3GZ52C5","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:46dfbe1eb75ab975a6db8c1636e799e42f95568fa24b35f5623d5c8c1c6c404b","target":"graph","created_at":"2026-05-18T03:39:15Z","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 may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite 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. It is shown how the matrices inherent in particular networks may be calculated from the service times of customers. Since, in general, an explicit dynamic eq","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-03T22:37:28Z","title":"Max-plus algebra models of queueing networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0578","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:9cf8d7887cb6baa09d3ffd4b3712cd16a20865857b916ebe2122127e56d7d180","target":"record","created_at":"2026-05-18T03:39:15Z","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":"47d4e650d2a6989403e11d225a4fd840d1e0d814bf3a7fc64a41cb06a5c5460b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-03T22:37:28Z","title_canon_sha256":"10960391dfcbbd4585f6e3e958a9456182a5352a8ed23db6297dea336de208cc"},"schema_version":"1.0","source":{"id":"1212.0578","kind":"arxiv","version":1}},"canonical_sha256":"8ecd9ee85d43f956c128283915a65e3079899309872f3cf4d792c7b8ce95a96c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ecd9ee85d43f956c128283915a65e3079899309872f3cf4d792c7b8ce95a96c","first_computed_at":"2026-05-18T03:39:15.728911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:15.728911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LDZazIP9bVE4IswnZ93TPKoGQeO54f5R+A2bo1qsjuXpNqpOO6u83JyA42Oz0BL+VPdemWuJmlJ0TScSBtzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:15.729489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cf8d7887cb6baa09d3ffd4b3712cd16a20865857b916ebe2122127e56d7d180","sha256:46dfbe1eb75ab975a6db8c1636e799e42f95568fa24b35f5623d5c8c1c6c404b"],"state_sha256":"693f829eee6adea1507ef95157ff16c92a199349b51437b560be86ef2028e222"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0eK+ZeW3vTBt/PZz5VIQAR80bfWLwVdMW9aTyQl6tPi2Edx+LU2fcfpO9ZLk4aq1XvycXmo0Btopia9YDQ6QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:20:00.684671Z","bundle_sha256":"e541ea00146364c069a6f0822f4fe34df922d3444a0af5341210c8a5b7d7a992"}}