{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IFAD35LQWMRKOYQIREDJWNPVSR","short_pith_number":"pith:IFAD35LQ","schema_version":"1.0","canonical_sha256":"41403df570b322a7620889069b35f594445c64d522b0cc25b29c8f7141af5243","source":{"kind":"arxiv","id":"2608.12073","version":1},"attestation_state":"computed","paper":{"title":"Competitive Analysis of Stock-based Thresholds via Prophet Inequalities in Continuous Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiashuo Jiang","submitted_at":"2026-08-12T13:56:24Z","abstract_excerpt":"We study a continuous-time $K$-unit online resource allocation problem with nonhomogeneous Poisson arrivals and time-varying valuation distributions. While the optimal dynamic policy generally depends on both the remaining inventory and the time left in the horizon, we focus on a simpler and practically appealing class of stock-based threshold policies, whose limited number of thresholds depend only on the number of units remaining. We evaluate these policies against the multi-unit prophet benchmark, which selects the best $K$ realized values in hindsight. Our main contribution is a new compet"},"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":"2608.12073","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-08-12T13:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"ab2e1c89cebbfbccb6f29c5b786a8937025b084af2151192f17ca042efd51ed9","abstract_canon_sha256":"4ebb617dee5dab8262f8f3524b15bb067a89ae57b0fde5984a6e49700f472906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:29:25.532710Z","signature_b64":"o/YDl0G6zAkfo/iTt5NSS94K5XbVIuz5qiOZEyuVetM1vpXLu9ShaL3JOkT36ucfU3fDoi7PoTXL2h5mQXvVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41403df570b322a7620889069b35f594445c64d522b0cc25b29c8f7141af5243","last_reissued_at":"2026-08-13T01:29:25.530194Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:29:25.530194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Analysis of Stock-based Thresholds via Prophet Inequalities in Continuous Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiashuo Jiang","submitted_at":"2026-08-12T13:56:24Z","abstract_excerpt":"We study a continuous-time $K$-unit online resource allocation problem with nonhomogeneous Poisson arrivals and time-varying valuation distributions. While the optimal dynamic policy generally depends on both the remaining inventory and the time left in the horizon, we focus on a simpler and practically appealing class of stock-based threshold policies, whose limited number of thresholds depend only on the number of units remaining. We evaluate these policies against the multi-unit prophet benchmark, which selects the best $K$ realized values in hindsight. Our main contribution is a new compet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12073","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/2608.12073/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":"2608.12073","created_at":"2026-08-13T01:29:25.531546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12073v1","created_at":"2026-08-13T01:29:25.531546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12073","created_at":"2026-08-13T01:29:25.531546+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFAD35LQWMRK","created_at":"2026-08-13T01:29:25.531546+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFAD35LQWMRKOYQI","created_at":"2026-08-13T01:29:25.531546+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFAD35LQ","created_at":"2026-08-13T01:29:25.531546+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/IFAD35LQWMRKOYQIREDJWNPVSR","json":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR.json","graph_json":"https://pith.science/api/pith-number/IFAD35LQWMRKOYQIREDJWNPVSR/graph.json","events_json":"https://pith.science/api/pith-number/IFAD35LQWMRKOYQIREDJWNPVSR/events.json","paper":"https://pith.science/paper/IFAD35LQ"},"agent_actions":{"view_html":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR","download_json":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR.json","view_paper":"https://pith.science/paper/IFAD35LQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12073&json=true","fetch_graph":"https://pith.science/api/pith-number/IFAD35LQWMRKOYQIREDJWNPVSR/graph.json","fetch_events":"https://pith.science/api/pith-number/IFAD35LQWMRKOYQIREDJWNPVSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR/action/storage_attestation","attest_author":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR/action/author_attestation","sign_citation":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR/action/citation_signature","submit_replication":"https://pith.science/pith/IFAD35LQWMRKOYQIREDJWNPVSR/action/replication_record"}},"created_at":"2026-08-13T01:29:25.531546+00:00","updated_at":"2026-08-13T01:29:25.531546+00:00"}