{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PX6EN33VMN3YNKBY7NUDA3AQV7","short_pith_number":"pith:PX6EN33V","schema_version":"1.0","canonical_sha256":"7dfc46ef75637786a838fb68306c10afdaa2757241c1ea163ac014a4c0adb2de","source":{"kind":"arxiv","id":"1212.4648","version":1},"attestation_state":"computed","paper":{"title":"Algebraic modelling and performance evaluation of acyclic fork-join 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-19T13:09:17Z","abstract_excerpt":"Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are 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":"1212.4648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-19T13:09:17Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e4a9779d466b176f79c9c2ba730ca0c4cb9762cebe494409936823afb510d3fe","abstract_canon_sha256":"e7271d1938c16d91da004d7645daa8a942f0c71f8749e1b05365207e3de2abbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:03.932753Z","signature_b64":"zFkCiTX3n/edkwnyM1lOW6Ao6nRw6Z4IZK2UyCJ7uNM94f9xdLW+akTjk1NaVjD4phIlwngY1gMCUQyfywoiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dfc46ef75637786a838fb68306c10afdaa2757241c1ea163ac014a4c0adb2de","last_reissued_at":"2026-05-18T03:36:03.932074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:03.932074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic modelling and performance evaluation of acyclic fork-join 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-19T13:09:17Z","abstract_excerpt":"Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4648","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.4648","created_at":"2026-05-18T03:36:03.932190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4648v1","created_at":"2026-05-18T03:36:03.932190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4648","created_at":"2026-05-18T03:36:03.932190+00:00"},{"alias_kind":"pith_short_12","alias_value":"PX6EN33VMN3Y","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PX6EN33VMN3YNKBY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PX6EN33V","created_at":"2026-05-18T12:27:18.751474+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/PX6EN33VMN3YNKBY7NUDA3AQV7","json":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7.json","graph_json":"https://pith.science/api/pith-number/PX6EN33VMN3YNKBY7NUDA3AQV7/graph.json","events_json":"https://pith.science/api/pith-number/PX6EN33VMN3YNKBY7NUDA3AQV7/events.json","paper":"https://pith.science/paper/PX6EN33V"},"agent_actions":{"view_html":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7","download_json":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7.json","view_paper":"https://pith.science/paper/PX6EN33V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4648&json=true","fetch_graph":"https://pith.science/api/pith-number/PX6EN33VMN3YNKBY7NUDA3AQV7/graph.json","fetch_events":"https://pith.science/api/pith-number/PX6EN33VMN3YNKBY7NUDA3AQV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7/action/storage_attestation","attest_author":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7/action/author_attestation","sign_citation":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7/action/citation_signature","submit_replication":"https://pith.science/pith/PX6EN33VMN3YNKBY7NUDA3AQV7/action/replication_record"}},"created_at":"2026-05-18T03:36:03.932190+00:00","updated_at":"2026-05-18T03:36:03.932190+00:00"}