{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WZ47HSMX7JU7E3OXRTCDFKTKNN","short_pith_number":"pith:WZ47HSMX","schema_version":"1.0","canonical_sha256":"b679f3c997fa69f26dd78cc432aa6a6b67ed94d7a3eeb1f12f588b10aae878d8","source":{"kind":"arxiv","id":"1412.2540","version":1},"attestation_state":"computed","paper":{"title":"Flow coupling and stochastic ordering of throughputs in linear networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Lasse Leskel\\\"a","submitted_at":"2014-12-08T12:33:43Z","abstract_excerpt":"Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network. Classical coupling results on stochastic ordering of network populations require strong monotonicity assumptions which are often violated in practice. However, in most real-world applications we care more about what goes through a network than what sits inside it. This paper describes a new approach for ordering flows instead of populations by augmenting network states with th"},"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":"1412.2540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-08T12:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"a98571630d9022ecb29f5b5cfa07547b9b9ebefd44d904cddd333e9d64e6b2de","abstract_canon_sha256":"0d6612b1e06463a883477201a390d959910431144ffea2123255ffde30833296"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:57.643460Z","signature_b64":"bU7TBZZFBisUI4bH+JqcNiVTXVnvMx7eiskRum9S3cwOZ61fZdv0oFKP1Jkb/26ZB2xDDZLeDK5lUvGXP32dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b679f3c997fa69f26dd78cc432aa6a6b67ed94d7a3eeb1f12f588b10aae878d8","last_reissued_at":"2026-05-18T02:31:57.642906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:57.642906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flow coupling and stochastic ordering of throughputs in linear networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Lasse Leskel\\\"a","submitted_at":"2014-12-08T12:33:43Z","abstract_excerpt":"Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network. Classical coupling results on stochastic ordering of network populations require strong monotonicity assumptions which are often violated in practice. However, in most real-world applications we care more about what goes through a network than what sits inside it. This paper describes a new approach for ordering flows instead of populations by augmenting network states with th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2540","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":"1412.2540","created_at":"2026-05-18T02:31:57.642988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2540v1","created_at":"2026-05-18T02:31:57.642988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2540","created_at":"2026-05-18T02:31:57.642988+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ47HSMX7JU7","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ47HSMX7JU7E3OX","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ47HSMX","created_at":"2026-05-18T12:28:54.890064+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/WZ47HSMX7JU7E3OXRTCDFKTKNN","json":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN.json","graph_json":"https://pith.science/api/pith-number/WZ47HSMX7JU7E3OXRTCDFKTKNN/graph.json","events_json":"https://pith.science/api/pith-number/WZ47HSMX7JU7E3OXRTCDFKTKNN/events.json","paper":"https://pith.science/paper/WZ47HSMX"},"agent_actions":{"view_html":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN","download_json":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN.json","view_paper":"https://pith.science/paper/WZ47HSMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2540&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ47HSMX7JU7E3OXRTCDFKTKNN/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ47HSMX7JU7E3OXRTCDFKTKNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN/action/storage_attestation","attest_author":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN/action/author_attestation","sign_citation":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN/action/citation_signature","submit_replication":"https://pith.science/pith/WZ47HSMX7JU7E3OXRTCDFKTKNN/action/replication_record"}},"created_at":"2026-05-18T02:31:57.642988+00:00","updated_at":"2026-05-18T02:31:57.642988+00:00"}