{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WOECGW3DLSLVLKPYUIWOYIMYXL","short_pith_number":"pith:WOECGW3D","schema_version":"1.0","canonical_sha256":"b388235b635c9755a9f8a22cec2198baff3ba9cdd110689e445727625dad0ebe","source":{"kind":"arxiv","id":"1704.03406","version":1},"attestation_state":"computed","paper":{"title":"Big jobs arrive early: From critical queues to random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gianmarco Bet, Johan S. H. van Leeuwaarden, Remco van der Hofstad","submitted_at":"2017-04-11T16:41:01Z","abstract_excerpt":"We consider a queue to which only a finite pool of $n$ customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement $S$ arrives to the queue after an exponentially distributed time with mean $S^{-\\alpha}$ for some $\\alpha\\in[0,1]$; so larger service requirements trigger customers to join earlier. This finite-pool queue interpolates between two previously studied cases: $\\alpha = 0$ gives the so-called $\\Delta_{(i)}/G/1$ queue and $\\alpha = 1$ is closely related to the exploration process for inhomogeneous random graphs. We consider the a"},"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":"1704.03406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T16:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"fd4e1eb5927106b1cc90b7c38b9b4c522d79167f8711604cb511513c30de1f24","abstract_canon_sha256":"b5533b700a34fe2dbcf7cd577905a49246025b2eb6a7d5e32091eed291a9f667"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:32.575482Z","signature_b64":"nG3lbzjVeQvwDjGC5s7Aocu4LbTenKovzSdoL6hmoXRPPtDWgKgo/u24GZi8zfU5rZALXFGSIvKliMXyGlXQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b388235b635c9755a9f8a22cec2198baff3ba9cdd110689e445727625dad0ebe","last_reissued_at":"2026-05-18T00:46:32.574881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:32.574881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Big jobs arrive early: From critical queues to random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gianmarco Bet, Johan S. H. van Leeuwaarden, Remco van der Hofstad","submitted_at":"2017-04-11T16:41:01Z","abstract_excerpt":"We consider a queue to which only a finite pool of $n$ customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement $S$ arrives to the queue after an exponentially distributed time with mean $S^{-\\alpha}$ for some $\\alpha\\in[0,1]$; so larger service requirements trigger customers to join earlier. This finite-pool queue interpolates between two previously studied cases: $\\alpha = 0$ gives the so-called $\\Delta_{(i)}/G/1$ queue and $\\alpha = 1$ is closely related to the exploration process for inhomogeneous random graphs. We consider the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03406","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":"1704.03406","created_at":"2026-05-18T00:46:32.574989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03406v1","created_at":"2026-05-18T00:46:32.574989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03406","created_at":"2026-05-18T00:46:32.574989+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOECGW3DLSLV","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOECGW3DLSLVLKPY","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOECGW3D","created_at":"2026-05-18T12:31:53.515858+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/WOECGW3DLSLVLKPYUIWOYIMYXL","json":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL.json","graph_json":"https://pith.science/api/pith-number/WOECGW3DLSLVLKPYUIWOYIMYXL/graph.json","events_json":"https://pith.science/api/pith-number/WOECGW3DLSLVLKPYUIWOYIMYXL/events.json","paper":"https://pith.science/paper/WOECGW3D"},"agent_actions":{"view_html":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL","download_json":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL.json","view_paper":"https://pith.science/paper/WOECGW3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03406&json=true","fetch_graph":"https://pith.science/api/pith-number/WOECGW3DLSLVLKPYUIWOYIMYXL/graph.json","fetch_events":"https://pith.science/api/pith-number/WOECGW3DLSLVLKPYUIWOYIMYXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL/action/storage_attestation","attest_author":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL/action/author_attestation","sign_citation":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL/action/citation_signature","submit_replication":"https://pith.science/pith/WOECGW3DLSLVLKPYUIWOYIMYXL/action/replication_record"}},"created_at":"2026-05-18T00:46:32.574989+00:00","updated_at":"2026-05-18T00:46:32.574989+00:00"}