{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NXM253OQ7BZSNYAJMJYBR6QOEM","short_pith_number":"pith:NXM253OQ","canonical_record":{"source":{"id":"1504.01020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-04T16:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c0bcfdfea8d9c6f6b2fdaf7c055fb2c0d37b95531d1835c48e6f6a5796e9c61","abstract_canon_sha256":"59bb9bf74b4c50a9c6c8f1a846033aa4c14ff9088fa87d424e06141d1b472000"},"schema_version":"1.0"},"canonical_sha256":"6dd9aeedd0f87326e009627018fa0e231e44c562a7f523150c2acdac4c09718e","source":{"kind":"arxiv","id":"1504.01020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01020","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01020v1","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01020","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"NXM253OQ7BZS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NXM253OQ7BZSNYAJ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NXM253OQ","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NXM253OQ7BZSNYAJMJYBR6QOEM","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-04T16:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"9c0bcfdfea8d9c6f6b2fdaf7c055fb2c0d37b95531d1835c48e6f6a5796e9c61","abstract_canon_sha256":"59bb9bf74b4c50a9c6c8f1a846033aa4c14ff9088fa87d424e06141d1b472000"},"schema_version":"1.0"},"canonical_sha256":"6dd9aeedd0f87326e009627018fa0e231e44c562a7f523150c2acdac4c09718e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:35.352164Z","signature_b64":"QfaaaOV4nwfRZESV/kaQ42mYilEvQJ/bhbsrDxDpuGjseITOCLP6dkhjTwYz4BkOXIjIOn8oF+SE5w6FmVAsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd9aeedd0f87326e009627018fa0e231e44c562a7f523150c2acdac4c09718e","last_reissued_at":"2026-05-18T02:19:35.351650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:35.351650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01020","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-18T02:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XkBiR0JjaENUt/35Dzdxfl1C2Rz+aW4phL5OXYSsGh0JGMQ0Y2I5lwyloVm70inD2R+vkyl8/2WEWeYzzY9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:00:39.584374Z"},"content_sha256":"e45c5121a47b5ecfcd39eda3f10c094a787ea005957fb2d9a140843a753919f3","schema_version":"1.0","event_id":"sha256:e45c5121a47b5ecfcd39eda3f10c094a787ea005957fb2d9a140843a753919f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NXM253OQ7BZSNYAJMJYBR6QOEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profit Maximizing Prior-free Multi-unit Procurement Auctions with Capacitated Sellers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"(2) Harvard School of Engineering, Applied Sciences, Arupratan Ray (1), Automation, Bangalore, Cambridge, Debmalya Mandal (2), India, Indian Institute of Science, MA), Y. Narahari (1) ((1) Department of Computer Science","submitted_at":"2015-04-04T16:48:13Z","abstract_excerpt":"In this paper, we derive bounds for profit maximizing prior-free procurement auctions where a buyer wishes to procure multiple units of a homogeneous item from n sellers who are strategic about their per unit valuation. The buyer earns the profit by reselling these units in an external consumer market. The paper looks at three scenarios of increasing complexity. First, we look at unit capacity sellers where per unit valuation is private information of each seller and the revenue curve is concave. For this setting, we define two benchmarks. We show that no randomized prior free auction can be c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01020","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-18T02:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8M98OLTuPh3e8j5orcHyIumEj093NgXiS2dQoVfphRfzfrbdTQHSBjNHFnTocvRd+1QlPRXAWS6QU5tpf4VUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:00:39.584731Z"},"content_sha256":"3f427b2f9a699b3d487909d610b9092501a915f4f23faef9e00273ffea93ffa1","schema_version":"1.0","event_id":"sha256:3f427b2f9a699b3d487909d610b9092501a915f4f23faef9e00273ffea93ffa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXM253OQ7BZSNYAJMJYBR6QOEM/bundle.json","state_url":"https://pith.science/pith/NXM253OQ7BZSNYAJMJYBR6QOEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXM253OQ7BZSNYAJMJYBR6QOEM/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-06-05T12:00:39Z","links":{"resolver":"https://pith.science/pith/NXM253OQ7BZSNYAJMJYBR6QOEM","bundle":"https://pith.science/pith/NXM253OQ7BZSNYAJMJYBR6QOEM/bundle.json","state":"https://pith.science/pith/NXM253OQ7BZSNYAJMJYBR6QOEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXM253OQ7BZSNYAJMJYBR6QOEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NXM253OQ7BZSNYAJMJYBR6QOEM","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":"59bb9bf74b4c50a9c6c8f1a846033aa4c14ff9088fa87d424e06141d1b472000","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-04T16:48:13Z","title_canon_sha256":"9c0bcfdfea8d9c6f6b2fdaf7c055fb2c0d37b95531d1835c48e6f6a5796e9c61"},"schema_version":"1.0","source":{"id":"1504.01020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01020","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01020v1","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01020","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"NXM253OQ7BZS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NXM253OQ7BZSNYAJ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NXM253OQ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:3f427b2f9a699b3d487909d610b9092501a915f4f23faef9e00273ffea93ffa1","target":"graph","created_at":"2026-05-18T02:19:35Z","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":"In this paper, we derive bounds for profit maximizing prior-free procurement auctions where a buyer wishes to procure multiple units of a homogeneous item from n sellers who are strategic about their per unit valuation. The buyer earns the profit by reselling these units in an external consumer market. The paper looks at three scenarios of increasing complexity. First, we look at unit capacity sellers where per unit valuation is private information of each seller and the revenue curve is concave. For this setting, we define two benchmarks. We show that no randomized prior free auction can be c","authors_text":"(2) Harvard School of Engineering, Applied Sciences, Arupratan Ray (1), Automation, Bangalore, Cambridge, Debmalya Mandal (2), India, Indian Institute of Science, MA), Y. Narahari (1) ((1) Department of Computer Science","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-04T16:48:13Z","title":"Profit Maximizing Prior-free Multi-unit Procurement Auctions with Capacitated Sellers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01020","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:e45c5121a47b5ecfcd39eda3f10c094a787ea005957fb2d9a140843a753919f3","target":"record","created_at":"2026-05-18T02:19:35Z","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":"59bb9bf74b4c50a9c6c8f1a846033aa4c14ff9088fa87d424e06141d1b472000","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-04T16:48:13Z","title_canon_sha256":"9c0bcfdfea8d9c6f6b2fdaf7c055fb2c0d37b95531d1835c48e6f6a5796e9c61"},"schema_version":"1.0","source":{"id":"1504.01020","kind":"arxiv","version":1}},"canonical_sha256":"6dd9aeedd0f87326e009627018fa0e231e44c562a7f523150c2acdac4c09718e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dd9aeedd0f87326e009627018fa0e231e44c562a7f523150c2acdac4c09718e","first_computed_at":"2026-05-18T02:19:35.351650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:35.351650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QfaaaOV4nwfRZESV/kaQ42mYilEvQJ/bhbsrDxDpuGjseITOCLP6dkhjTwYz4BkOXIjIOn8oF+SE5w6FmVAsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:35.352164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e45c5121a47b5ecfcd39eda3f10c094a787ea005957fb2d9a140843a753919f3","sha256:3f427b2f9a699b3d487909d610b9092501a915f4f23faef9e00273ffea93ffa1"],"state_sha256":"572e87353e970ad977ee582907765a7eb5088f03872c4cf4e613fa36bac8e267"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nI5sMQpLwUNRlc+qg3vLwflgjUR/oQY6qPWIgCusNHyaVLa75FALaBvV/QT9o0BmCk1IW1ZhgNBvyiK3H1t4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:00:39.586615Z","bundle_sha256":"d3409f3b02ccc5417d0d31ca1e14773ae6a3512179a2e777587924f08e9b9c7d"}}