{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2GHVCHP6YG3MOSKSOQA63DN3JG","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":"2939da88e4ab6f7440916aaf02d7376ab16f43a43e808cc26d35e53286591e6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T21:32:47Z","title_canon_sha256":"3787a8382075ee2e8b02f0d316701ee9203533af64d16e4916b1f61a66ff51c8"},"schema_version":"1.0","source":{"id":"2607.01489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01489","created_at":"2026-07-03T00:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01489v1","created_at":"2026-07-03T00:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01489","created_at":"2026-07-03T00:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"2GHVCHP6YG3M","created_at":"2026-07-03T00:17:02Z"},{"alias_kind":"pith_short_16","alias_value":"2GHVCHP6YG3MOSKS","created_at":"2026-07-03T00:17:02Z"},{"alias_kind":"pith_short_8","alias_value":"2GHVCHP6","created_at":"2026-07-03T00:17:02Z"}],"graph_snapshots":[{"event_id":"sha256:595b0d60deaaab8494f6d80c203e472f5b9c71dfaf735a0f78c166a3a0d5b10b","target":"graph","created_at":"2026-07-03T00:17:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.01489/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study admission control and capacity design for automated parcel lockers with multiple parcel and locker sizes. A smaller parcel can use a larger locker, but doing so may block a future larger parcel whose rejection is more costly. We formulate the admission problem as a finite-state, infinite-horizon average-cost Markov decision process and solve small instances exactly by relative value iteration. We analyze the always-accept (AA) policy, which admits every feasible parcel into the remaining compatible capacity, and give a sufficient condition for its optimality. Across two-, three-, and ","authors_text":"Antoine Deza, Carlos An\\'ibal Su\\'arez, Tal Raviv","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T21:32:47Z","title":"Admission and Assortment Optimization for Multi-size Automated Parcel Lockers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01489","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:1d8bd31463918d9842a02c1b484fe314c8817ca889ea43fb4f1acf648d00172c","target":"record","created_at":"2026-07-03T00:17:02Z","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":"2939da88e4ab6f7440916aaf02d7376ab16f43a43e808cc26d35e53286591e6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-01T21:32:47Z","title_canon_sha256":"3787a8382075ee2e8b02f0d316701ee9203533af64d16e4916b1f61a66ff51c8"},"schema_version":"1.0","source":{"id":"2607.01489","kind":"arxiv","version":1}},"canonical_sha256":"d18f511dfec1b6c749527401ed8dbb4992c0e8f23b732d98219bd57539cb1731","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d18f511dfec1b6c749527401ed8dbb4992c0e8f23b732d98219bd57539cb1731","first_computed_at":"2026-07-03T00:17:02.194109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:17:02.194109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u8wNQhMBwDIih/ifS41nT4LrJzhnrZoR/VWSuaQ9zMD1937ifoMlOKlev96NcwK0J1CHuQ0784ErAasDLLEYCg==","signature_status":"signed_v1","signed_at":"2026-07-03T00:17:02.194574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d8bd31463918d9842a02c1b484fe314c8817ca889ea43fb4f1acf648d00172c","sha256:595b0d60deaaab8494f6d80c203e472f5b9c71dfaf735a0f78c166a3a0d5b10b"],"state_sha256":"b83e30aa417a4b4e5306e67dda6add5123c420c00304222b78af63c37c3a22c2"}