{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WRRBGQBHAUP33ZWFSHT72TXWK5","short_pith_number":"pith:WRRBGQBH","canonical_record":{"source":{"id":"1805.02526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T13:44:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"670908a2c6216f8d638f329ef48f4ce988c7f5e9894e089a7a2efa496aef0806","abstract_canon_sha256":"dc7b95c4387ffa75a3a9bba6ff6423e544b669ec2518065b8645469b5528068e"},"schema_version":"1.0"},"canonical_sha256":"b462134027051fbde6c591e7fd4ef6575b173007f7ee2deb37682307fb70382d","source":{"kind":"arxiv","id":"1805.02526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02526","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02526v2","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02526","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"WRRBGQBHAUP3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRRBGQBHAUP33ZWF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRRBGQBH","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WRRBGQBHAUP33ZWFSHT72TXWK5","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T13:44:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"670908a2c6216f8d638f329ef48f4ce988c7f5e9894e089a7a2efa496aef0806","abstract_canon_sha256":"dc7b95c4387ffa75a3a9bba6ff6423e544b669ec2518065b8645469b5528068e"},"schema_version":"1.0"},"canonical_sha256":"b462134027051fbde6c591e7fd4ef6575b173007f7ee2deb37682307fb70382d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:24.151276Z","signature_b64":"KTzWS3s5QXStr5guaThdhh3aiAQkZmGSm+kPa2mtUliSZhEiafcLhHj0xEproAvApU214j3y71JDsz/6fRXDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b462134027051fbde6c591e7fd4ef6575b173007f7ee2deb37682307fb70382d","last_reissued_at":"2026-05-17T23:40:24.150555Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:24.150555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02526","source_version":2,"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-17T23:40:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckuYPtTF/rBIVIsrz5/kqSb9KkjHMzRLgBLtb+7h9S4QCxVCKipSSzKPcAHh422Xcelu2DeCxmrOqFRfVvodAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:38:22.051782Z"},"content_sha256":"6961363c9275035626c4101c1d7ba1a9e983bfd1251f4ce056caef7a9e3b1134","schema_version":"1.0","event_id":"sha256:6961363c9275035626c4101c1d7ba1a9e983bfd1251f4ce056caef7a9e3b1134"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WRRBGQBHAUP33ZWFSHT72TXWK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Online Best Reply Algorithm for Resource Allocation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Andreas T\\\"onnis, Daniel Schmand, Max Klimm","submitted_at":"2018-05-07T13:44:15Z","abstract_excerpt":"We study the performance of a best reply algorithm for online resource allocation problems with a diseconomy of scale. In an online resource allocation problem, we are given a set of resources and a set of requests that arrive in an online manner. Each request consists of a set of feasible allocations and an allocation is a set of resources. The total cost of an allocation vector is given by the sum of the resources' costs, where each resource's cost depends on the total load on the resource under the allocation vector. We analyze the natural online procedure where each request is allocated gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02526","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"},"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-17T23:40:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yz3SrUsb2R0GlqWDj6zusIExs124hXUBGcIds/RTT3fcpHeSHiaX6Ib5kmNHDhyPhfduN8NZYhXCdMDUhwe9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:38:22.052128Z"},"content_sha256":"86ec82f864385032a4c2ee97304ee110305c944145f011aa97690974239ff375","schema_version":"1.0","event_id":"sha256:86ec82f864385032a4c2ee97304ee110305c944145f011aa97690974239ff375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRRBGQBHAUP33ZWFSHT72TXWK5/bundle.json","state_url":"https://pith.science/pith/WRRBGQBHAUP33ZWFSHT72TXWK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRRBGQBHAUP33ZWFSHT72TXWK5/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-03T20:38:22Z","links":{"resolver":"https://pith.science/pith/WRRBGQBHAUP33ZWFSHT72TXWK5","bundle":"https://pith.science/pith/WRRBGQBHAUP33ZWFSHT72TXWK5/bundle.json","state":"https://pith.science/pith/WRRBGQBHAUP33ZWFSHT72TXWK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRRBGQBHAUP33ZWFSHT72TXWK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WRRBGQBHAUP33ZWFSHT72TXWK5","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":"dc7b95c4387ffa75a3a9bba6ff6423e544b669ec2518065b8645469b5528068e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T13:44:15Z","title_canon_sha256":"670908a2c6216f8d638f329ef48f4ce988c7f5e9894e089a7a2efa496aef0806"},"schema_version":"1.0","source":{"id":"1805.02526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02526","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02526v2","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02526","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"WRRBGQBHAUP3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRRBGQBHAUP33ZWF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRRBGQBH","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:86ec82f864385032a4c2ee97304ee110305c944145f011aa97690974239ff375","target":"graph","created_at":"2026-05-17T23:40:24Z","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 study the performance of a best reply algorithm for online resource allocation problems with a diseconomy of scale. In an online resource allocation problem, we are given a set of resources and a set of requests that arrive in an online manner. Each request consists of a set of feasible allocations and an allocation is a set of resources. The total cost of an allocation vector is given by the sum of the resources' costs, where each resource's cost depends on the total load on the resource under the allocation vector. We analyze the natural online procedure where each request is allocated gr","authors_text":"Andreas T\\\"onnis, Daniel Schmand, Max Klimm","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T13:44:15Z","title":"The Online Best Reply Algorithm for Resource Allocation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02526","kind":"arxiv","version":2},"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:6961363c9275035626c4101c1d7ba1a9e983bfd1251f4ce056caef7a9e3b1134","target":"record","created_at":"2026-05-17T23:40:24Z","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":"dc7b95c4387ffa75a3a9bba6ff6423e544b669ec2518065b8645469b5528068e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T13:44:15Z","title_canon_sha256":"670908a2c6216f8d638f329ef48f4ce988c7f5e9894e089a7a2efa496aef0806"},"schema_version":"1.0","source":{"id":"1805.02526","kind":"arxiv","version":2}},"canonical_sha256":"b462134027051fbde6c591e7fd4ef6575b173007f7ee2deb37682307fb70382d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b462134027051fbde6c591e7fd4ef6575b173007f7ee2deb37682307fb70382d","first_computed_at":"2026-05-17T23:40:24.150555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:24.150555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KTzWS3s5QXStr5guaThdhh3aiAQkZmGSm+kPa2mtUliSZhEiafcLhHj0xEproAvApU214j3y71JDsz/6fRXDDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:24.151276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6961363c9275035626c4101c1d7ba1a9e983bfd1251f4ce056caef7a9e3b1134","sha256:86ec82f864385032a4c2ee97304ee110305c944145f011aa97690974239ff375"],"state_sha256":"91a60c9320ffc8a0a49bb1dd484f61ba8e08f01c4db9f31aeec0b36a5e793449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQHHCiicA3hdlOe58TftKiXYO45ATegc83lPXTeEKzQ9Lk5d+QlluXBkurHbsCMHl9+y8GrR6ysd0u7u2Gj+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:38:22.054082Z","bundle_sha256":"961c4cdcc9c34684971fc9c57760ca33e1dea7287d7909ce0d99f871ea02a5bf"}}