{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IRM25YRBYN3RHFC7RPWKBNEH2Z","short_pith_number":"pith:IRM25YRB","schema_version":"1.0","canonical_sha256":"4459aee221c37713945f8beca0b487d67776e064109976f383b618558337240e","source":{"kind":"arxiv","id":"1605.06072","version":2},"attestation_state":"computed","paper":{"title":"Online purchasing under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Frieze, Wesley Pegden","submitted_at":"2016-05-19T18:08:10Z","abstract_excerpt":"Suppose there is a collection $x_1,x_2,\\dots,x_N$ of independent uniform $[0,1]$ random variables, and a hypergraph $\\cF$ of \\emph{target structures} on the vertex set $\\{1,\\dots,N\\}$. We would like to buy a target structure at small cost, but we do not know all the costs $x_i$ ahead of time. Instead, we inspect the random variables $x_i$ one at a time, and after each inspection, choose to either keep the vertex $i$ at cost $x_i$, or reject vertex $i$ forever.\n  In the present paper, we consider the case where $\\{1,\\dots,N\\}$ is the edge-set of some graph, and the target structures are the spa"},"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":"1605.06072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-19T18:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"f36782ad8b2815c98cac0896a8556a3f3c4da65d8dc6bbd99114242fbc7ee995","abstract_canon_sha256":"d4783f469944f000e4043158bd32759563f201c937caa29625a9e8f087aacbfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:08.178130Z","signature_b64":"Rp1wSQRjZEmPpwOPDRPFaWZGjT7mEEvPOtvCGuouliD1jR+qlyRbaexW3ietUr8GsfQBp+BEUoE9hu4HdK2jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4459aee221c37713945f8beca0b487d67776e064109976f383b618558337240e","last_reissued_at":"2026-05-18T00:53:08.177632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:08.177632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online purchasing under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Frieze, Wesley Pegden","submitted_at":"2016-05-19T18:08:10Z","abstract_excerpt":"Suppose there is a collection $x_1,x_2,\\dots,x_N$ of independent uniform $[0,1]$ random variables, and a hypergraph $\\cF$ of \\emph{target structures} on the vertex set $\\{1,\\dots,N\\}$. We would like to buy a target structure at small cost, but we do not know all the costs $x_i$ ahead of time. Instead, we inspect the random variables $x_i$ one at a time, and after each inspection, choose to either keep the vertex $i$ at cost $x_i$, or reject vertex $i$ forever.\n  In the present paper, we consider the case where $\\{1,\\dots,N\\}$ is the edge-set of some graph, and the target structures are the spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06072","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":"1605.06072","created_at":"2026-05-18T00:53:08.177703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06072v2","created_at":"2026-05-18T00:53:08.177703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06072","created_at":"2026-05-18T00:53:08.177703+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRM25YRBYN3R","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRM25YRBYN3RHFC7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRM25YRB","created_at":"2026-05-18T12:30:22.444734+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/IRM25YRBYN3RHFC7RPWKBNEH2Z","json":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z.json","graph_json":"https://pith.science/api/pith-number/IRM25YRBYN3RHFC7RPWKBNEH2Z/graph.json","events_json":"https://pith.science/api/pith-number/IRM25YRBYN3RHFC7RPWKBNEH2Z/events.json","paper":"https://pith.science/paper/IRM25YRB"},"agent_actions":{"view_html":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z","download_json":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z.json","view_paper":"https://pith.science/paper/IRM25YRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06072&json=true","fetch_graph":"https://pith.science/api/pith-number/IRM25YRBYN3RHFC7RPWKBNEH2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/IRM25YRBYN3RHFC7RPWKBNEH2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z/action/storage_attestation","attest_author":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z/action/author_attestation","sign_citation":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z/action/citation_signature","submit_replication":"https://pith.science/pith/IRM25YRBYN3RHFC7RPWKBNEH2Z/action/replication_record"}},"created_at":"2026-05-18T00:53:08.177703+00:00","updated_at":"2026-05-18T00:53:08.177703+00:00"}