{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:N52KZ47ANWY7ADESRYWEN74WSB","short_pith_number":"pith:N52KZ47A","canonical_record":{"source":{"id":"0905.3700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-22T15:13:00Z","cross_cats_sorted":["math.CA"],"title_canon_sha256":"7a553fd9041855bb2e47ce998db2c622cd742011991495913fc0e3aec0fd960e","abstract_canon_sha256":"111921ec1cde8f07e13d2c008aad48e7cccd5ab7bec1859ad57cd0628c356228"},"schema_version":"1.0"},"canonical_sha256":"6f74acf3e06db1f00c928e2c46ff96906d4dbeb53531be92abbfa6b2a61ff7fa","source":{"kind":"arxiv","id":"0905.3700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3700","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3700v1","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3700","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"N52KZ47ANWY7","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"N52KZ47ANWY7ADES","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"N52KZ47A","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:N52KZ47ANWY7ADESRYWEN74WSB","target":"record","payload":{"canonical_record":{"source":{"id":"0905.3700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-22T15:13:00Z","cross_cats_sorted":["math.CA"],"title_canon_sha256":"7a553fd9041855bb2e47ce998db2c622cd742011991495913fc0e3aec0fd960e","abstract_canon_sha256":"111921ec1cde8f07e13d2c008aad48e7cccd5ab7bec1859ad57cd0628c356228"},"schema_version":"1.0"},"canonical_sha256":"6f74acf3e06db1f00c928e2c46ff96906d4dbeb53531be92abbfa6b2a61ff7fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:34.448841Z","signature_b64":"XNb83UNUGf1+mjIIDJ5wsDqYrPsxVo5LZRU/WKNgE4Y0oDcbFhLZsr4x1oqb3LzxeMKgONEM7iSdI+h2tGOyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f74acf3e06db1f00c928e2c46ff96906d4dbeb53531be92abbfa6b2a61ff7fa","last_reissued_at":"2026-05-18T04:23:34.448339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:34.448339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.3700","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-18T04:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSSGdRpgGNnjGyycccADjrEktRHIXahpsrEo0qrdbFYzg98lkXyb+QPsMr2TSeTqE0r9/BZydajJ//9rw2EaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:05.158001Z"},"content_sha256":"95c46943f3f0a6cbcd9139b9d46451f811a8da179e62a454ac6bbe35d0a1608d","schema_version":"1.0","event_id":"sha256:95c46943f3f0a6cbcd9139b9d46451f811a8da179e62a454ac6bbe35d0a1608d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:N52KZ47ANWY7ADESRYWEN74WSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Processor Sharing Queue That Models Balking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.PR","authors_text":"Charles Knessl, Johan S. H. van Leeuwaarden, Qiang Zhen","submitted_at":"2009-05-22T15:13:00Z","abstract_excerpt":"We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system \"balks\" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to $n+1$, we obtain explicit expressions for a tagged customer's sojourn time distribution. We consider both the conditional distribution, conditioned on the number of other customers present when the tagged customer arrives, as well as the unconditional distribution. We then evaluate the results in various asymptotic limits. These include large time (tail behavio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3700","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-18T04:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9N45/O04IgBrO9+eoNt5JCRQjgLBwpiNS5/cC2G6U5104We/Ykp2ygNwDyzFkbCLFJpa76qXKoc+XZCzsMeADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:05.158692Z"},"content_sha256":"f37b30b9ef52d4d57fb03169fe44d816e3e74970a5db2212836d1cf70b655afa","schema_version":"1.0","event_id":"sha256:f37b30b9ef52d4d57fb03169fe44d816e3e74970a5db2212836d1cf70b655afa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N52KZ47ANWY7ADESRYWEN74WSB/bundle.json","state_url":"https://pith.science/pith/N52KZ47ANWY7ADESRYWEN74WSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N52KZ47ANWY7ADESRYWEN74WSB/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-05-30T16:33:05Z","links":{"resolver":"https://pith.science/pith/N52KZ47ANWY7ADESRYWEN74WSB","bundle":"https://pith.science/pith/N52KZ47ANWY7ADESRYWEN74WSB/bundle.json","state":"https://pith.science/pith/N52KZ47ANWY7ADESRYWEN74WSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N52KZ47ANWY7ADESRYWEN74WSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:N52KZ47ANWY7ADESRYWEN74WSB","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":"111921ec1cde8f07e13d2c008aad48e7cccd5ab7bec1859ad57cd0628c356228","cross_cats_sorted":["math.CA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-22T15:13:00Z","title_canon_sha256":"7a553fd9041855bb2e47ce998db2c622cd742011991495913fc0e3aec0fd960e"},"schema_version":"1.0","source":{"id":"0905.3700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3700","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3700v1","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3700","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"N52KZ47ANWY7","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"N52KZ47ANWY7ADES","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"N52KZ47A","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:f37b30b9ef52d4d57fb03169fe44d816e3e74970a5db2212836d1cf70b655afa","target":"graph","created_at":"2026-05-18T04:23:34Z","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 consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system \"balks\" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to $n+1$, we obtain explicit expressions for a tagged customer's sojourn time distribution. We consider both the conditional distribution, conditioned on the number of other customers present when the tagged customer arrives, as well as the unconditional distribution. We then evaluate the results in various asymptotic limits. These include large time (tail behavio","authors_text":"Charles Knessl, Johan S. H. van Leeuwaarden, Qiang Zhen","cross_cats":["math.CA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-22T15:13:00Z","title":"On a Processor Sharing Queue That Models Balking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3700","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:95c46943f3f0a6cbcd9139b9d46451f811a8da179e62a454ac6bbe35d0a1608d","target":"record","created_at":"2026-05-18T04:23:34Z","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":"111921ec1cde8f07e13d2c008aad48e7cccd5ab7bec1859ad57cd0628c356228","cross_cats_sorted":["math.CA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-05-22T15:13:00Z","title_canon_sha256":"7a553fd9041855bb2e47ce998db2c622cd742011991495913fc0e3aec0fd960e"},"schema_version":"1.0","source":{"id":"0905.3700","kind":"arxiv","version":1}},"canonical_sha256":"6f74acf3e06db1f00c928e2c46ff96906d4dbeb53531be92abbfa6b2a61ff7fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f74acf3e06db1f00c928e2c46ff96906d4dbeb53531be92abbfa6b2a61ff7fa","first_computed_at":"2026-05-18T04:23:34.448339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:34.448339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XNb83UNUGf1+mjIIDJ5wsDqYrPsxVo5LZRU/WKNgE4Y0oDcbFhLZsr4x1oqb3LzxeMKgONEM7iSdI+h2tGOyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:34.448841Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.3700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95c46943f3f0a6cbcd9139b9d46451f811a8da179e62a454ac6bbe35d0a1608d","sha256:f37b30b9ef52d4d57fb03169fe44d816e3e74970a5db2212836d1cf70b655afa"],"state_sha256":"5fbbc0bc8cfdaab804bc3a6996030fe2ca6287ab68cb45b5b15a80a5421f8eeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5L3dDJaugZEIpUNIWBGbBZFKKkEC6C51eeJdUZ1ex2m0AxFBENpOIPP/kPVOGggcjoXp1OfXYKOEqkxqBIphAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:33:05.162499Z","bundle_sha256":"e0262c27d5fa1537308bc2e63eadd7ac5a4d3195cebae4dbbe33d42064bb2632"}}