{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OUBPIVMEDLEZJ6N2LN44LQSG5B","short_pith_number":"pith:OUBPIVME","schema_version":"1.0","canonical_sha256":"7502f455841ac994f9ba5b79c5c246e85215dcb0e3c1e38978a88bb727fc80d4","source":{"kind":"arxiv","id":"1607.00609","version":2},"attestation_state":"computed","paper":{"title":"Lowest priority waiting time distribution in an accumulating priority L\\'evy queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Liron Ravner, Offer Kella","submitted_at":"2016-07-03T07:53:47Z","abstract_excerpt":"This paper presents a new method for deriving the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive L\\'evy input. The priority of a non-atomic customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. The method relies on the construction of a workload overtaking process and solving a first-passage time problem using an appropriate stopping time."},"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":"1607.00609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-03T07:53:47Z","cross_cats_sorted":[],"title_canon_sha256":"9ae4ade0448d18b59299524174f07b60c01ec92141e1ed2c25446df37c635f9c","abstract_canon_sha256":"fd3cf5d7154a5e41ad5e036fbcccc7f42e1f8462a74f00ee09b1146e91299690"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:40.272636Z","signature_b64":"8YGDBfYe5DyEdrjXmYkYvdxyOKxkX3KLV8u3O5MQsa8bnHOFz0Rv7yqmQAZC7fiiPQiJDmr1936JioVWW15rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7502f455841ac994f9ba5b79c5c246e85215dcb0e3c1e38978a88bb727fc80d4","last_reissued_at":"2026-05-18T00:46:40.272084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:40.272084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lowest priority waiting time distribution in an accumulating priority L\\'evy queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Liron Ravner, Offer Kella","submitted_at":"2016-07-03T07:53:47Z","abstract_excerpt":"This paper presents a new method for deriving the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive L\\'evy input. The priority of a non-atomic customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. The method relies on the construction of a workload overtaking process and solving a first-passage time problem using an appropriate stopping time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00609","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":""},"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":"1607.00609","created_at":"2026-05-18T00:46:40.272166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00609v2","created_at":"2026-05-18T00:46:40.272166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00609","created_at":"2026-05-18T00:46:40.272166+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUBPIVMEDLEZ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUBPIVMEDLEZJ6N2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUBPIVME","created_at":"2026-05-18T12:30:36.002864+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/OUBPIVMEDLEZJ6N2LN44LQSG5B","json":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B.json","graph_json":"https://pith.science/api/pith-number/OUBPIVMEDLEZJ6N2LN44LQSG5B/graph.json","events_json":"https://pith.science/api/pith-number/OUBPIVMEDLEZJ6N2LN44LQSG5B/events.json","paper":"https://pith.science/paper/OUBPIVME"},"agent_actions":{"view_html":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B","download_json":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B.json","view_paper":"https://pith.science/paper/OUBPIVME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00609&json=true","fetch_graph":"https://pith.science/api/pith-number/OUBPIVMEDLEZJ6N2LN44LQSG5B/graph.json","fetch_events":"https://pith.science/api/pith-number/OUBPIVMEDLEZJ6N2LN44LQSG5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B/action/storage_attestation","attest_author":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B/action/author_attestation","sign_citation":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B/action/citation_signature","submit_replication":"https://pith.science/pith/OUBPIVMEDLEZJ6N2LN44LQSG5B/action/replication_record"}},"created_at":"2026-05-18T00:46:40.272166+00:00","updated_at":"2026-05-18T00:46:40.272166+00:00"}