{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MUWJTZVCYLB5WIQWEWKT2BHSFE","short_pith_number":"pith:MUWJTZVC","canonical_record":{"source":{"id":"1112.1136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T01:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"2371dae2df28bd0d1174197c1cf10919faa649d00bd8e48780cd5b33aa122619","abstract_canon_sha256":"a0ddc329ef0aa5bb0a1723466e4b456e6f22fd28faf797cf732c3c69018b822f"},"schema_version":"1.0"},"canonical_sha256":"652c99e6a2c2c3db221625953d04f2293dd30f3fea4f65811425f853e9718a2d","source":{"kind":"arxiv","id":"1112.1136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1136","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1136v1","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1136","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"MUWJTZVCYLB5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MUWJTZVCYLB5WIQW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MUWJTZVC","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MUWJTZVCYLB5WIQWEWKT2BHSFE","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T01:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"2371dae2df28bd0d1174197c1cf10919faa649d00bd8e48780cd5b33aa122619","abstract_canon_sha256":"a0ddc329ef0aa5bb0a1723466e4b456e6f22fd28faf797cf732c3c69018b822f"},"schema_version":"1.0"},"canonical_sha256":"652c99e6a2c2c3db221625953d04f2293dd30f3fea4f65811425f853e9718a2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:56.210005Z","signature_b64":"2kc3uo5Bh6iIrz3ZQf7uDmxLjl8n7lNaQv9hL6a3VyCayJ8NYZbnJYZk2ObPJC3e67AB/oTVOMzRevYDhNHHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"652c99e6a2c2c3db221625953d04f2293dd30f3fea4f65811425f853e9718a2d","last_reissued_at":"2026-05-18T04:06:56.209276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:56.209276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1136","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:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RuwkkZgkZwm7JpImOIVwne3yy+j4ewt8Q5Bhrv8C90XYUqG0H0DLp8C5m+wcbmvYdVXBUgkV2fSykiuKAviAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:47:25.756752Z"},"content_sha256":"9224b8359219dfae7fbe8ef7a07a32e6a7026e654c3561dc1ef8941fa244f130","schema_version":"1.0","event_id":"sha256:9224b8359219dfae7fbe8ef7a07a32e6a7026e654c3561dc1ef8941fa244f130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MUWJTZVCYLB5WIQWEWKT2BHSFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secretary Problems with Convex Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Malec, Seeun Umboh, Shuchi Chawla, Siddharth Barman","submitted_at":"2011-12-06T01:01:44Z","abstract_excerpt":"We consider online resource allocation problems where given a set of requests our goal is to select a subset that maximizes a value minus cost type of objective function. Requests are presented online in random order, and each request possesses an adversarial value and an adversarial size. The online algorithm must make an irrevocable accept/reject decision as soon as it sees each request. The \"profit\" of a set of accepted requests is its total value minus a convex cost function of its total size. This problem falls within the framework of secretary problems. Unlike previous work in that area,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1136","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:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Chi9qzfPm22gy0ipBOWxN1B9lSegw5PTTT/ou5i/xBcKVNwaaz+GfFfW8J4MNvUIPWnZWhko1s71c5x/17/xBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:47:25.757408Z"},"content_sha256":"2c640283da78ee9237734a4184f7b7a0c6d9c60592b410b08c63e492be2a8873","schema_version":"1.0","event_id":"sha256:2c640283da78ee9237734a4184f7b7a0c6d9c60592b410b08c63e492be2a8873"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE/bundle.json","state_url":"https://pith.science/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE/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-31T01:47:25Z","links":{"resolver":"https://pith.science/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE","bundle":"https://pith.science/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE/bundle.json","state":"https://pith.science/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUWJTZVCYLB5WIQWEWKT2BHSFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MUWJTZVCYLB5WIQWEWKT2BHSFE","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":"a0ddc329ef0aa5bb0a1723466e4b456e6f22fd28faf797cf732c3c69018b822f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T01:01:44Z","title_canon_sha256":"2371dae2df28bd0d1174197c1cf10919faa649d00bd8e48780cd5b33aa122619"},"schema_version":"1.0","source":{"id":"1112.1136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1136","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1136v1","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1136","created_at":"2026-05-18T04:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"MUWJTZVCYLB5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MUWJTZVCYLB5WIQW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MUWJTZVC","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:2c640283da78ee9237734a4184f7b7a0c6d9c60592b410b08c63e492be2a8873","target":"graph","created_at":"2026-05-18T04:06:56Z","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 consider online resource allocation problems where given a set of requests our goal is to select a subset that maximizes a value minus cost type of objective function. Requests are presented online in random order, and each request possesses an adversarial value and an adversarial size. The online algorithm must make an irrevocable accept/reject decision as soon as it sees each request. The \"profit\" of a set of accepted requests is its total value minus a convex cost function of its total size. This problem falls within the framework of secretary problems. Unlike previous work in that area,","authors_text":"David Malec, Seeun Umboh, Shuchi Chawla, Siddharth Barman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T01:01:44Z","title":"Secretary Problems with Convex Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1136","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:9224b8359219dfae7fbe8ef7a07a32e6a7026e654c3561dc1ef8941fa244f130","target":"record","created_at":"2026-05-18T04:06:56Z","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":"a0ddc329ef0aa5bb0a1723466e4b456e6f22fd28faf797cf732c3c69018b822f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-06T01:01:44Z","title_canon_sha256":"2371dae2df28bd0d1174197c1cf10919faa649d00bd8e48780cd5b33aa122619"},"schema_version":"1.0","source":{"id":"1112.1136","kind":"arxiv","version":1}},"canonical_sha256":"652c99e6a2c2c3db221625953d04f2293dd30f3fea4f65811425f853e9718a2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"652c99e6a2c2c3db221625953d04f2293dd30f3fea4f65811425f853e9718a2d","first_computed_at":"2026-05-18T04:06:56.209276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:56.209276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2kc3uo5Bh6iIrz3ZQf7uDmxLjl8n7lNaQv9hL6a3VyCayJ8NYZbnJYZk2ObPJC3e67AB/oTVOMzRevYDhNHHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:56.210005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9224b8359219dfae7fbe8ef7a07a32e6a7026e654c3561dc1ef8941fa244f130","sha256:2c640283da78ee9237734a4184f7b7a0c6d9c60592b410b08c63e492be2a8873"],"state_sha256":"06587fe307be955f2cded719e6710c18bacd30f20c11861857a0029cc0394cea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+X8ecW3XZF79jdU4Mcgyi4NDakD7j0C8DGy+astDpo3sjOZCjsTwpadKEyORKpQ3copYvjBuxGdrNlbGbS9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:47:25.760511Z","bundle_sha256":"4db89031c8e850230f8d15ba1cc2a9267fa3386fc60df1ab8aeb7c04a76e3cac"}}