{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IFCY7X4EWWPMZGTZRIOQH6XOJH","short_pith_number":"pith:IFCY7X4E","canonical_record":{"source":{"id":"1411.2079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-08T04:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"701e4c32ae43c2b02539fe9e5e87579a373a3a3b88a7f18aa5f0f0ddafc38a03","abstract_canon_sha256":"15b4248b61b864a2640eeb65d2a9b036faad442eae716e87cfb0ab4a734fc137"},"schema_version":"1.0"},"canonical_sha256":"41458fdf84b59ecc9a798a1d03faee49d5645c8c34d52ccf93ef005d40c23552","source":{"kind":"arxiv","id":"1411.2079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2079","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2079v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2079","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"IFCY7X4EWWPM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFCY7X4EWWPMZGTZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFCY7X4E","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IFCY7X4EWWPMZGTZRIOQH6XOJH","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-08T04:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"701e4c32ae43c2b02539fe9e5e87579a373a3a3b88a7f18aa5f0f0ddafc38a03","abstract_canon_sha256":"15b4248b61b864a2640eeb65d2a9b036faad442eae716e87cfb0ab4a734fc137"},"schema_version":"1.0"},"canonical_sha256":"41458fdf84b59ecc9a798a1d03faee49d5645c8c34d52ccf93ef005d40c23552","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:08.713311Z","signature_b64":"KGyZB1lHB8T6v7TdOuX4YW5ARQXhCFQMEwKVoLL86Hj6W28325VHu+aDndrS8HzLOn5+riy/szrLIKTBE3Y4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41458fdf84b59ecc9a798a1d03faee49d5645c8c34d52ccf93ef005d40c23552","last_reissued_at":"2026-05-18T02:38:08.712724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:08.712724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2079","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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxGPacKiIyFs/aYWayZ+MNo83Pip49mmtNTncKPNB/343p0ICn13EpDLSuzlTzD6GmBbfo1n22M1NuHmRbd3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:19:31.951971Z"},"content_sha256":"5e563a004211edc50fb3a7187662f3c5bcef9b5786b96d0dec0a283034523af7","schema_version":"1.0","event_id":"sha256:5e563a004211edc50fb3a7187662f3c5bcef9b5786b96d0dec0a283034523af7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IFCY7X4EWWPMZGTZRIOQH6XOJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitive analysis via benchmark decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Nick Gravin, Ning Chen, Pinyan Lu","submitted_at":"2014-11-08T04:30:45Z","abstract_excerpt":"We propose a uniform approach for the design and analysis of prior-free competitive auctions and online auctions. Our philosophy is to view the benchmark function as a variable parameter of the model and study a broad class of functions instead of a individual target benchmark. We consider a multitude of well-studied auction settings, and improve upon a few previous results.\n  (1) Multi-unit auctions. Given a $\\beta$-competitive unlimited supply auction, the best previously known multi-unit auction is $2\\beta$-competitive. We design a $(1+\\beta)$-competitive auction reducing the ratio from $4."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2079","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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+r6e0dI3j2mbc7XMpCdyG0cTtNOLxCwF2hesURmrqT/Q5z04Dx7JPbtNHAwpdXN19qDI+beBRj4aIM0Y9/uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:19:31.952342Z"},"content_sha256":"34b5f9660c350dc09b0adb3850f3cb3f38f8628881863a44e854dcddd1de8264","schema_version":"1.0","event_id":"sha256:34b5f9660c350dc09b0adb3850f3cb3f38f8628881863a44e854dcddd1de8264"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH/bundle.json","state_url":"https://pith.science/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH/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-28T13:19:31Z","links":{"resolver":"https://pith.science/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH","bundle":"https://pith.science/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH/bundle.json","state":"https://pith.science/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFCY7X4EWWPMZGTZRIOQH6XOJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IFCY7X4EWWPMZGTZRIOQH6XOJH","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":"15b4248b61b864a2640eeb65d2a9b036faad442eae716e87cfb0ab4a734fc137","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-08T04:30:45Z","title_canon_sha256":"701e4c32ae43c2b02539fe9e5e87579a373a3a3b88a7f18aa5f0f0ddafc38a03"},"schema_version":"1.0","source":{"id":"1411.2079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2079","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2079v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2079","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"IFCY7X4EWWPM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFCY7X4EWWPMZGTZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFCY7X4E","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:34b5f9660c350dc09b0adb3850f3cb3f38f8628881863a44e854dcddd1de8264","target":"graph","created_at":"2026-05-18T02:38:08Z","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 propose a uniform approach for the design and analysis of prior-free competitive auctions and online auctions. Our philosophy is to view the benchmark function as a variable parameter of the model and study a broad class of functions instead of a individual target benchmark. We consider a multitude of well-studied auction settings, and improve upon a few previous results.\n  (1) Multi-unit auctions. Given a $\\beta$-competitive unlimited supply auction, the best previously known multi-unit auction is $2\\beta$-competitive. We design a $(1+\\beta)$-competitive auction reducing the ratio from $4.","authors_text":"Nick Gravin, Ning Chen, Pinyan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-08T04:30:45Z","title":"Competitive analysis via benchmark decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2079","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:5e563a004211edc50fb3a7187662f3c5bcef9b5786b96d0dec0a283034523af7","target":"record","created_at":"2026-05-18T02:38:08Z","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":"15b4248b61b864a2640eeb65d2a9b036faad442eae716e87cfb0ab4a734fc137","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-08T04:30:45Z","title_canon_sha256":"701e4c32ae43c2b02539fe9e5e87579a373a3a3b88a7f18aa5f0f0ddafc38a03"},"schema_version":"1.0","source":{"id":"1411.2079","kind":"arxiv","version":1}},"canonical_sha256":"41458fdf84b59ecc9a798a1d03faee49d5645c8c34d52ccf93ef005d40c23552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41458fdf84b59ecc9a798a1d03faee49d5645c8c34d52ccf93ef005d40c23552","first_computed_at":"2026-05-18T02:38:08.712724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:08.712724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KGyZB1lHB8T6v7TdOuX4YW5ARQXhCFQMEwKVoLL86Hj6W28325VHu+aDndrS8HzLOn5+riy/szrLIKTBE3Y4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:08.713311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e563a004211edc50fb3a7187662f3c5bcef9b5786b96d0dec0a283034523af7","sha256:34b5f9660c350dc09b0adb3850f3cb3f38f8628881863a44e854dcddd1de8264"],"state_sha256":"a5fe5616bf9124a43d9bfc5d81ce9fea778428708b6ac1bc5b7e964a12d70929"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZ7S/SqyCQC/lWu2KbcBiuehJtTmzVL13QrwiWenxmYSKwxSmu9cevYyukKdl0gZHjgD7sLR6gY149C6kUKABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:19:31.954532Z","bundle_sha256":"287d1fe824c2b788a6545ff637fe63954787b58c784e49452d90a57a45d30c34"}}