{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OSBGDGUT7DZQEK5GGQQ7WKDSOB","short_pith_number":"pith:OSBGDGUT","canonical_record":{"source":{"id":"1008.1616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-10T01:27:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3add0d56d992075dcff48c37bad2e0815b6391380d77001e8e1970903c649072","abstract_canon_sha256":"9cab608575a27463e5200eab9e7d6f2d9d5d005cb0a38aaf52e839133dbe7b45"},"schema_version":"1.0"},"canonical_sha256":"7482619a93f8f3022ba63421fb2872707a453f1e17ac02313fadd3f18c9f973d","source":{"kind":"arxiv","id":"1008.1616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1616","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1616v1","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1616","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"OSBGDGUT7DZQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OSBGDGUT7DZQEK5G","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OSBGDGUT","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OSBGDGUT7DZQEK5GGQQ7WKDSOB","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-10T01:27:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3add0d56d992075dcff48c37bad2e0815b6391380d77001e8e1970903c649072","abstract_canon_sha256":"9cab608575a27463e5200eab9e7d6f2d9d5d005cb0a38aaf52e839133dbe7b45"},"schema_version":"1.0"},"canonical_sha256":"7482619a93f8f3022ba63421fb2872707a453f1e17ac02313fadd3f18c9f973d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:23.696978Z","signature_b64":"MmMX6JOqeUKPB2/ckguxXTSAtcZjbXCDMMwFs+p5ItjiQwhni3KJhG+twHGJ9n2kXGaeGN2K2TGAZ9v8wSIVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7482619a93f8f3022ba63421fb2872707a453f1e17ac02313fadd3f18c9f973d","last_reissued_at":"2026-05-18T04:42:23.696512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:23.696512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1616","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1odSxTE3lB4v62tsC0rTnpb+ZTVQ5R3d6UHr5NfJhyP1LuZ9wxK/VantdCgSQIREYrq2TwSvguRmZ8eqKobBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:46:30.668604Z"},"content_sha256":"3f26360572ac4815d0e97fd06d3be2eecabc781feacace3373c7b3adbcfc6bb9","schema_version":"1.0","event_id":"sha256:3f26360572ac4815d0e97fd06d3be2eecabc781feacace3373c7b3adbcfc6bb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OSBGDGUT7DZQEK5GGQQ7WKDSOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Eyal Even-dar, S. Muthukrishnan, Sudipto Guha, Tanmoy Chakraborty, Yishay Mansour","submitted_at":"2010-08-10T01:27:48Z","abstract_excerpt":"We design algorithms for computing approximately revenue-maximizing {\\em sequential posted-pricing mechanisms (SPM)} in $K$-unit auctions, in a standard Bayesian model. A seller has $K$ copies of an item to sell, and there are $n$ buyers, each interested in only one copy, who have some value for the item. The seller must post a price for each buyer, the buyers arrive in a sequence enforced by the seller, and a buyer buys the item if its value exceeds the price posted to it. The seller does not know the values of the buyers, but have Bayesian information about them. An SPM specifies the orderin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1616","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANRANIp0tBrQF0hDEb8AgHvQJNSxx6/4smi54ZTi8N0mlRGAyZB9RdS9V5R3fQL+ninMzc0UmdVhnt1r2s2lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:46:30.669137Z"},"content_sha256":"24a3f915b24048c93344cef8ee041969344fd34749dfaa47fa08b032ef059ac7","schema_version":"1.0","event_id":"sha256:24a3f915b24048c93344cef8ee041969344fd34749dfaa47fa08b032ef059ac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB/bundle.json","state_url":"https://pith.science/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T06:46:30Z","links":{"resolver":"https://pith.science/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB","bundle":"https://pith.science/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB/bundle.json","state":"https://pith.science/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSBGDGUT7DZQEK5GGQQ7WKDSOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OSBGDGUT7DZQEK5GGQQ7WKDSOB","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":"9cab608575a27463e5200eab9e7d6f2d9d5d005cb0a38aaf52e839133dbe7b45","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-10T01:27:48Z","title_canon_sha256":"3add0d56d992075dcff48c37bad2e0815b6391380d77001e8e1970903c649072"},"schema_version":"1.0","source":{"id":"1008.1616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1616","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1616v1","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1616","created_at":"2026-05-18T04:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"OSBGDGUT7DZQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OSBGDGUT7DZQEK5G","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OSBGDGUT","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:24a3f915b24048c93344cef8ee041969344fd34749dfaa47fa08b032ef059ac7","target":"graph","created_at":"2026-05-18T04:42:23Z","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"},"paper":{"abstract_excerpt":"We design algorithms for computing approximately revenue-maximizing {\\em sequential posted-pricing mechanisms (SPM)} in $K$-unit auctions, in a standard Bayesian model. A seller has $K$ copies of an item to sell, and there are $n$ buyers, each interested in only one copy, who have some value for the item. The seller must post a price for each buyer, the buyers arrive in a sequence enforced by the seller, and a buyer buys the item if its value exceeds the price posted to it. The seller does not know the values of the buyers, but have Bayesian information about them. An SPM specifies the orderin","authors_text":"Eyal Even-dar, S. Muthukrishnan, Sudipto Guha, Tanmoy Chakraborty, Yishay Mansour","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-10T01:27:48Z","title":"Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1616","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:3f26360572ac4815d0e97fd06d3be2eecabc781feacace3373c7b3adbcfc6bb9","target":"record","created_at":"2026-05-18T04:42:23Z","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":"9cab608575a27463e5200eab9e7d6f2d9d5d005cb0a38aaf52e839133dbe7b45","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-10T01:27:48Z","title_canon_sha256":"3add0d56d992075dcff48c37bad2e0815b6391380d77001e8e1970903c649072"},"schema_version":"1.0","source":{"id":"1008.1616","kind":"arxiv","version":1}},"canonical_sha256":"7482619a93f8f3022ba63421fb2872707a453f1e17ac02313fadd3f18c9f973d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7482619a93f8f3022ba63421fb2872707a453f1e17ac02313fadd3f18c9f973d","first_computed_at":"2026-05-18T04:42:23.696512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:23.696512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MmMX6JOqeUKPB2/ckguxXTSAtcZjbXCDMMwFs+p5ItjiQwhni3KJhG+twHGJ9n2kXGaeGN2K2TGAZ9v8wSIVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:23.696978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f26360572ac4815d0e97fd06d3be2eecabc781feacace3373c7b3adbcfc6bb9","sha256:24a3f915b24048c93344cef8ee041969344fd34749dfaa47fa08b032ef059ac7"],"state_sha256":"31edf5a094af81129c000615cf8cdd7481726bdab55e12ce9a81664a6985efb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QVJCYJ1n215tKPc9WKwrcUongBBXyIA70TT4iGKBWxOK4su38V8xnfSfdtVeSqWYsempOYAS1UdMvaInKZKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:46:30.671420Z","bundle_sha256":"dbb1d4c54591e67c8ecb86cd5ebc3c29f828d8de7c170acec3c0ec87111fd152"}}