{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5KIVOULCBQ24DGLLQ44WVWKJTZ","short_pith_number":"pith:5KIVOULC","canonical_record":{"source":{"id":"2001.09611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-27T07:37:33Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"885d06fadcb97ef4ea9756441ab9e6d3a2fba04080ac11344c94aad822ea7054","abstract_canon_sha256":"b180a386fa76822b6de563f66cf7925b1053acac325d4aebbd48dae7bdfc1f9f"},"schema_version":"1.0"},"canonical_sha256":"ea915751620c35c1996b87396ad9499e5a7f337b9a80490cf0ecb41a652a0305","source":{"kind":"arxiv","id":"2001.09611","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.09611","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"arxiv_version","alias_value":"2001.09611v2","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09611","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"pith_short_12","alias_value":"5KIVOULCBQ24","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"pith_short_16","alias_value":"5KIVOULCBQ24DGLL","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"pith_short_8","alias_value":"5KIVOULC","created_at":"2026-07-05T01:58:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5KIVOULCBQ24DGLLQ44WVWKJTZ","target":"record","payload":{"canonical_record":{"source":{"id":"2001.09611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-27T07:37:33Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"885d06fadcb97ef4ea9756441ab9e6d3a2fba04080ac11344c94aad822ea7054","abstract_canon_sha256":"b180a386fa76822b6de563f66cf7925b1053acac325d4aebbd48dae7bdfc1f9f"},"schema_version":"1.0"},"canonical_sha256":"ea915751620c35c1996b87396ad9499e5a7f337b9a80490cf0ecb41a652a0305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:29.568525Z","signature_b64":"BZXkkfTSO6l1jw47xGR2g9Qp3MKnQktUEe/P4HZpvSePq7B60F2BoDnjO5O5WkqxHyFs51F+j75tVyllKbLJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea915751620c35c1996b87396ad9499e5a7f337b9a80490cf0ecb41a652a0305","last_reissued_at":"2026-07-05T01:58:29.568030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:29.568030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.09611","source_version":2,"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-07-05T01:58:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eops1c568LaRSqhzU+Z+CvE827Bc+7Rp2JGFaCk0HtbyoxMhzCu6JOafY3JdUMaM0qYTGsysEUc8Njd1LdaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:17:55.594275Z"},"content_sha256":"0fa4d56f4709d4be5e0ff7e08d0c5cdc1d20dfc8ff854cbed6cf2f711b8145d7","schema_version":"1.0","event_id":"sha256:0fa4d56f4709d4be5e0ff7e08d0c5cdc1d20dfc8ff854cbed6cf2f711b8145d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5KIVOULCBQ24DGLLQ44WVWKJTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Traffic Equations for Fluid Networks with Overflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"E. Lefeber, H. M. Jansen, S. Fleuren, Y. Nazarathy","submitted_at":"2020-01-27T07:37:33Z","abstract_excerpt":"Many real life queueing networks have finite buffers with overflows. To understand the behavior of such networks, we consider traffic equations that generalize the traffic equations of classic open queueing networks where some nodes are potentially overloaded. We present a novel, efficient algorithm for solving the equations for overflow networks together with a sufficient condition for existence and uniqueness of solutions. Our analysis also sharpens results of traffic equations for classic open queueing networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09611","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.09611/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:58:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hmj0d7gXiG8szvldWEC3gBhKJY28Um5rvgikHpSdMJrMBrg0BZaSwtEfS44C9FMD2vkoIsmlpsuoPTZNymt7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:17:55.594649Z"},"content_sha256":"4b9792d6760170898db113e70ddc25cebfb0dd0b33ae9e9566e2f133672d8ad6","schema_version":"1.0","event_id":"sha256:4b9792d6760170898db113e70ddc25cebfb0dd0b33ae9e9566e2f133672d8ad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ/bundle.json","state_url":"https://pith.science/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ/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-08-04T10:17:55Z","links":{"resolver":"https://pith.science/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ","bundle":"https://pith.science/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ/bundle.json","state":"https://pith.science/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KIVOULCBQ24DGLLQ44WVWKJTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5KIVOULCBQ24DGLLQ44WVWKJTZ","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":"b180a386fa76822b6de563f66cf7925b1053acac325d4aebbd48dae7bdfc1f9f","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-27T07:37:33Z","title_canon_sha256":"885d06fadcb97ef4ea9756441ab9e6d3a2fba04080ac11344c94aad822ea7054"},"schema_version":"1.0","source":{"id":"2001.09611","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.09611","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"arxiv_version","alias_value":"2001.09611v2","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09611","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"pith_short_12","alias_value":"5KIVOULCBQ24","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"pith_short_16","alias_value":"5KIVOULCBQ24DGLL","created_at":"2026-07-05T01:58:29Z"},{"alias_kind":"pith_short_8","alias_value":"5KIVOULC","created_at":"2026-07-05T01:58:29Z"}],"graph_snapshots":[{"event_id":"sha256:4b9792d6760170898db113e70ddc25cebfb0dd0b33ae9e9566e2f133672d8ad6","target":"graph","created_at":"2026-07-05T01:58:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.09611/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many real life queueing networks have finite buffers with overflows. To understand the behavior of such networks, we consider traffic equations that generalize the traffic equations of classic open queueing networks where some nodes are potentially overloaded. We present a novel, efficient algorithm for solving the equations for overflow networks together with a sufficient condition for existence and uniqueness of solutions. Our analysis also sharpens results of traffic equations for classic open queueing networks.","authors_text":"E. Lefeber, H. M. Jansen, S. Fleuren, Y. Nazarathy","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-27T07:37:33Z","title":"Traffic Equations for Fluid Networks with Overflows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09611","kind":"arxiv","version":2},"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:0fa4d56f4709d4be5e0ff7e08d0c5cdc1d20dfc8ff854cbed6cf2f711b8145d7","target":"record","created_at":"2026-07-05T01:58:29Z","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":"b180a386fa76822b6de563f66cf7925b1053acac325d4aebbd48dae7bdfc1f9f","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-27T07:37:33Z","title_canon_sha256":"885d06fadcb97ef4ea9756441ab9e6d3a2fba04080ac11344c94aad822ea7054"},"schema_version":"1.0","source":{"id":"2001.09611","kind":"arxiv","version":2}},"canonical_sha256":"ea915751620c35c1996b87396ad9499e5a7f337b9a80490cf0ecb41a652a0305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea915751620c35c1996b87396ad9499e5a7f337b9a80490cf0ecb41a652a0305","first_computed_at":"2026-07-05T01:58:29.568030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:29.568030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZXkkfTSO6l1jw47xGR2g9Qp3MKnQktUEe/P4HZpvSePq7B60F2BoDnjO5O5WkqxHyFs51F+j75tVyllKbLJDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:29.568525Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.09611","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa4d56f4709d4be5e0ff7e08d0c5cdc1d20dfc8ff854cbed6cf2f711b8145d7","sha256:4b9792d6760170898db113e70ddc25cebfb0dd0b33ae9e9566e2f133672d8ad6"],"state_sha256":"4b51b282e1cec7768df214d20f79f69acf2156049674670e11b5c33fb10ef7d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fo9tVL/XAeeRP74+pmggDfn4m58MJ+SP5YuaOy7shwbjcGNbzAfXo5hf/QfHNTDAinow5cKHrVT9DzoKc8L5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T10:17:55.597422Z","bundle_sha256":"baaa36d99901a8973765d67e7de97a207ba8b6feb0af4fa41c800c7b9590f9ec"}}