{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NNF4JGLNRVDKREC3TERLJJUQGR","short_pith_number":"pith:NNF4JGLN","schema_version":"1.0","canonical_sha256":"6b4bc4996d8d46a8905b9922b4a6903459fd83a4074e579f5838ba475364af74","source":{"kind":"arxiv","id":"2606.02464","version":1},"attestation_state":"computed","paper":{"title":"Using memory to control admission to unobservable queues","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Liron Ravner, Refael Hassin","submitted_at":"2026-06-01T16:37:15Z","abstract_excerpt":"We study admission control to an unobservable M/M/1 queue. A memoryless controller can only randomly thin arrivals (random routing, RR). We show that a gated admission (GA) policy, blocking arrivals for a fixed period after each admission, stochastically dominates RR at equal throughput, improving social welfare under any sojourn-based cost. We characterize the welfare-maximizing threshold and define the Price of Forgetting as the welfare ratio. This ratio is unbounded even though the absolute welfare gain stays uniformly bounded."},"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":"2606.02464","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-06-01T16:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"e5af305256b1dbdb4529a41167fa35b22efb00cc432bd6e56ab1106391890023","abstract_canon_sha256":"c89660174e990d48328bb02d4b06bfca18ad9549557ca48112c3a94a48ca3fae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:05:06.955235Z","signature_b64":"mk8FU0sYSil6SoA7rSHNIjbtVoFkzw4Hsar65RaapUML/Wzzr96PQ5SCrtA06SJPUmx3/6l9EWf33VM7z7gvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b4bc4996d8d46a8905b9922b4a6903459fd83a4074e579f5838ba475364af74","last_reissued_at":"2026-06-02T03:05:06.954901Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:05:06.954901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using memory to control admission to unobservable queues","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Liron Ravner, Refael Hassin","submitted_at":"2026-06-01T16:37:15Z","abstract_excerpt":"We study admission control to an unobservable M/M/1 queue. A memoryless controller can only randomly thin arrivals (random routing, RR). We show that a gated admission (GA) policy, blocking arrivals for a fixed period after each admission, stochastically dominates RR at equal throughput, improving social welfare under any sojourn-based cost. We characterize the welfare-maximizing threshold and define the Price of Forgetting as the welfare ratio. This ratio is unbounded even though the absolute welfare gain stays uniformly bounded."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02464","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.02464/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.02464","created_at":"2026-06-02T03:05:06.954956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02464v1","created_at":"2026-06-02T03:05:06.954956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02464","created_at":"2026-06-02T03:05:06.954956+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNF4JGLNRVDK","created_at":"2026-06-02T03:05:06.954956+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNF4JGLNRVDKREC3","created_at":"2026-06-02T03:05:06.954956+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNF4JGLN","created_at":"2026-06-02T03:05:06.954956+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/NNF4JGLNRVDKREC3TERLJJUQGR","json":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR.json","graph_json":"https://pith.science/api/pith-number/NNF4JGLNRVDKREC3TERLJJUQGR/graph.json","events_json":"https://pith.science/api/pith-number/NNF4JGLNRVDKREC3TERLJJUQGR/events.json","paper":"https://pith.science/paper/NNF4JGLN"},"agent_actions":{"view_html":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR","download_json":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR.json","view_paper":"https://pith.science/paper/NNF4JGLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02464&json=true","fetch_graph":"https://pith.science/api/pith-number/NNF4JGLNRVDKREC3TERLJJUQGR/graph.json","fetch_events":"https://pith.science/api/pith-number/NNF4JGLNRVDKREC3TERLJJUQGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR/action/storage_attestation","attest_author":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR/action/author_attestation","sign_citation":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR/action/citation_signature","submit_replication":"https://pith.science/pith/NNF4JGLNRVDKREC3TERLJJUQGR/action/replication_record"}},"created_at":"2026-06-02T03:05:06.954956+00:00","updated_at":"2026-06-02T03:05:06.954956+00:00"}