{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U5HZRJOBFSMIRIW6UUKRXR6CIP","short_pith_number":"pith:U5HZRJOB","canonical_record":{"source":{"id":"1305.3490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-05-15T14:18:11Z","cross_cats_sorted":[],"title_canon_sha256":"b92fa3a8ebc2198414ff2200ee6667a04276c9cf2a20cca55e2f549b570b4d77","abstract_canon_sha256":"937d67431ca54f4f1aef2942079eca39ff247b901e930774c6fb411ceb3c58a5"},"schema_version":"1.0"},"canonical_sha256":"a74f98a5c12c9888a2dea5151bc7c243f04152807f55ccfa6b5482e11ebff3c4","source":{"kind":"arxiv","id":"1305.3490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3490","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3490v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3490","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"U5HZRJOBFSMI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U5HZRJOBFSMIRIW6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U5HZRJOB","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U5HZRJOBFSMIRIW6UUKRXR6CIP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-05-15T14:18:11Z","cross_cats_sorted":[],"title_canon_sha256":"b92fa3a8ebc2198414ff2200ee6667a04276c9cf2a20cca55e2f549b570b4d77","abstract_canon_sha256":"937d67431ca54f4f1aef2942079eca39ff247b901e930774c6fb411ceb3c58a5"},"schema_version":"1.0"},"canonical_sha256":"a74f98a5c12c9888a2dea5151bc7c243f04152807f55ccfa6b5482e11ebff3c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:35.695457Z","signature_b64":"CoN4JiayEfquQTygDNb4D1aPEEfyMoRYAMYGF/A0XB/c2ENwrXnxThCXH2PjM5gE47VeDzawXMjQe7P5+RMCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74f98a5c12c9888a2dea5151bc7c243f04152807f55ccfa6b5482e11ebff3c4","last_reissued_at":"2026-05-18T03:25:35.694854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:35.694854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3490","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:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLb6dbukEUBOxxjo08DrqXLIe1yYFRkjtmbUv8OINXRKobxy/Cncb23SEIEs50YVxTzXJeBaHSpmVwGbdNlrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:32:10.602926Z"},"content_sha256":"c6e448579da4bcdd5ed2f8bf296c6203a030f7fc38828610b3415e0065a7c645","schema_version":"1.0","event_id":"sha256:c6e448579da4bcdd5ed2f8bf296c6203a030f7fc38828610b3415e0065a7c645"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U5HZRJOBFSMIRIW6UUKRXR6CIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stationary analysis of the Shortest Queue First service policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Alain Simonian, Fabrice Guillemin","submitted_at":"2013-05-15T14:18:11Z","abstract_excerpt":"We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two parallel queues and assuming Poisson arrivals and general service time distributions, we first establish the functional equations satisfied by the Laplace transforms of the workloads in each queue. We further specialize these equations to the so-called \"symmetric case\", with same arrival rates and identical exponential service time distributions at each queue; we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3490","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:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqG59gq48bxFNDS1tDcr9q8oX87Kg2lUSJq/8ahWCOeU/cIijSMWvOnPZv/OmSCYB/+51zDYvEFdMPmbpjt5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:32:10.603715Z"},"content_sha256":"06a15af1b4ad0464da557c9bf78479b4aeba01e7db8496ff54b2336e46733bd9","schema_version":"1.0","event_id":"sha256:06a15af1b4ad0464da557c9bf78479b4aeba01e7db8496ff54b2336e46733bd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP/bundle.json","state_url":"https://pith.science/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP/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-06T22:32:10Z","links":{"resolver":"https://pith.science/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP","bundle":"https://pith.science/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP/bundle.json","state":"https://pith.science/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5HZRJOBFSMIRIW6UUKRXR6CIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U5HZRJOBFSMIRIW6UUKRXR6CIP","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":"937d67431ca54f4f1aef2942079eca39ff247b901e930774c6fb411ceb3c58a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-05-15T14:18:11Z","title_canon_sha256":"b92fa3a8ebc2198414ff2200ee6667a04276c9cf2a20cca55e2f549b570b4d77"},"schema_version":"1.0","source":{"id":"1305.3490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3490","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3490v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3490","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"U5HZRJOBFSMI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U5HZRJOBFSMIRIW6","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U5HZRJOB","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:06a15af1b4ad0464da557c9bf78479b4aeba01e7db8496ff54b2336e46733bd9","target":"graph","created_at":"2026-05-18T03:25:35Z","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":"We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two parallel queues and assuming Poisson arrivals and general service time distributions, we first establish the functional equations satisfied by the Laplace transforms of the workloads in each queue. We further specialize these equations to the so-called \"symmetric case\", with same arrival rates and identical exponential service time distributions at each queue; we","authors_text":"Alain Simonian, Fabrice Guillemin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-05-15T14:18:11Z","title":"Stationary analysis of the Shortest Queue First service policy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3490","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:c6e448579da4bcdd5ed2f8bf296c6203a030f7fc38828610b3415e0065a7c645","target":"record","created_at":"2026-05-18T03:25:35Z","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":"937d67431ca54f4f1aef2942079eca39ff247b901e930774c6fb411ceb3c58a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-05-15T14:18:11Z","title_canon_sha256":"b92fa3a8ebc2198414ff2200ee6667a04276c9cf2a20cca55e2f549b570b4d77"},"schema_version":"1.0","source":{"id":"1305.3490","kind":"arxiv","version":1}},"canonical_sha256":"a74f98a5c12c9888a2dea5151bc7c243f04152807f55ccfa6b5482e11ebff3c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a74f98a5c12c9888a2dea5151bc7c243f04152807f55ccfa6b5482e11ebff3c4","first_computed_at":"2026-05-18T03:25:35.694854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.694854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoN4JiayEfquQTygDNb4D1aPEEfyMoRYAMYGF/A0XB/c2ENwrXnxThCXH2PjM5gE47VeDzawXMjQe7P5+RMCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.695457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6e448579da4bcdd5ed2f8bf296c6203a030f7fc38828610b3415e0065a7c645","sha256:06a15af1b4ad0464da557c9bf78479b4aeba01e7db8496ff54b2336e46733bd9"],"state_sha256":"68cf14452e9e68e0ef27e941ca509f6eb8c51885db05157be1a92c4c0495afc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoIMd+BmY2lYR+j/loAbw/q9jczi3z+qJV//4Jb9bywemNu/hWr490SoTDg+bg1WdkziW01N1P6fC3w4zjTcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:32:10.607840Z","bundle_sha256":"1ded42289df3b9601a9e17b638084670c27e9cd2dcc01dbc2fa6a19453080250"}}