{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MD5L6OK2CSTAQ3CC4JKMZTE7ET","short_pith_number":"pith:MD5L6OK2","canonical_record":{"source":{"id":"1512.00153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T06:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"705baa32d52cf901ac205e37615d23ee8d0fedda14c0b058014793249ce2c6d2","abstract_canon_sha256":"555757f8dc07e67473a4aeafe29272a32650020b0e9b179f402b3b8461427e08"},"schema_version":"1.0"},"canonical_sha256":"60fabf395a14a6086c42e254cccc9f24f71c4199443185791bf5c8a0c990c7b1","source":{"kind":"arxiv","id":"1512.00153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00153","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00153v1","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00153","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"MD5L6OK2CSTA","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MD5L6OK2CSTAQ3CC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MD5L6OK2","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MD5L6OK2CSTAQ3CC4JKMZTE7ET","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T06:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"705baa32d52cf901ac205e37615d23ee8d0fedda14c0b058014793249ce2c6d2","abstract_canon_sha256":"555757f8dc07e67473a4aeafe29272a32650020b0e9b179f402b3b8461427e08"},"schema_version":"1.0"},"canonical_sha256":"60fabf395a14a6086c42e254cccc9f24f71c4199443185791bf5c8a0c990c7b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:32.617607Z","signature_b64":"fGSY5pjXdAwfl68sp8VlLpeRhe1p8uobUNZ4H5lEfdqZCISVWtkOzv2RqYclvgCjtvb6e7fGppMJGK+5FzvOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60fabf395a14a6086c42e254cccc9f24f71c4199443185791bf5c8a0c990c7b1","last_reissued_at":"2026-05-18T01:25:32.617075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:32.617075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00153","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-18T01:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7lPGqtob6oCauRND6hp/9fK0kgfpBVm0QZCrXOFUkcZfEJIPOH6FfnDU8uU+ZRoV8Rkmel9Kh90dMCM3016Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:40:54.646077Z"},"content_sha256":"4197cc79e18c8783f77b7a057a3cdd76f0df0a0fd9a3153208a1b763d965e0c7","schema_version":"1.0","event_id":"sha256:4197cc79e18c8783f77b7a057a3cdd76f0df0a0fd9a3153208a1b763d965e0c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MD5L6OK2CSTAQ3CC4JKMZTE7ET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Budgeted Repeated Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ajil Jalal, Rahul Vaze, Umang Bhaskar","submitted_at":"2015-12-01T06:16:54Z","abstract_excerpt":"A basic combinatorial online resource allocation problem is considered, where multiple servers have individual capacity constraints, and at each time slot, a set of jobs arrives, that have potentially different weights to different servers. At each time slot, a one-to-one matching has to be found between jobs and servers, subject to individual capacity constraints, in an online manner. The objective is to maximize the aggregate weight of jobs allotted to servers, summed across time slots and servers, subject to individual capacity constraints. This problem generalizes the well known adwords pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00153","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-18T01:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzyOMXdPaXXgjMyxLPvvtoSG7XraWN7DNgDuSqbNMomGBHh1scP1pOY0hGRFkXutgSh1ZWERXCTK0KgLnrI2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:40:54.646743Z"},"content_sha256":"7b48e7de8b04e9c40898813aa78aad6388d65de638bd8c679d93ef4efb93c9df","schema_version":"1.0","event_id":"sha256:7b48e7de8b04e9c40898813aa78aad6388d65de638bd8c679d93ef4efb93c9df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET/bundle.json","state_url":"https://pith.science/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET/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-08T01:40:54Z","links":{"resolver":"https://pith.science/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET","bundle":"https://pith.science/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET/bundle.json","state":"https://pith.science/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MD5L6OK2CSTAQ3CC4JKMZTE7ET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MD5L6OK2CSTAQ3CC4JKMZTE7ET","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":"555757f8dc07e67473a4aeafe29272a32650020b0e9b179f402b3b8461427e08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T06:16:54Z","title_canon_sha256":"705baa32d52cf901ac205e37615d23ee8d0fedda14c0b058014793249ce2c6d2"},"schema_version":"1.0","source":{"id":"1512.00153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00153","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00153v1","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00153","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"MD5L6OK2CSTA","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MD5L6OK2CSTAQ3CC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MD5L6OK2","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:7b48e7de8b04e9c40898813aa78aad6388d65de638bd8c679d93ef4efb93c9df","target":"graph","created_at":"2026-05-18T01:25:32Z","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":"A basic combinatorial online resource allocation problem is considered, where multiple servers have individual capacity constraints, and at each time slot, a set of jobs arrives, that have potentially different weights to different servers. At each time slot, a one-to-one matching has to be found between jobs and servers, subject to individual capacity constraints, in an online manner. The objective is to maximize the aggregate weight of jobs allotted to servers, summed across time slots and servers, subject to individual capacity constraints. This problem generalizes the well known adwords pr","authors_text":"Ajil Jalal, Rahul Vaze, Umang Bhaskar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T06:16:54Z","title":"Online Budgeted Repeated Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00153","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:4197cc79e18c8783f77b7a057a3cdd76f0df0a0fd9a3153208a1b763d965e0c7","target":"record","created_at":"2026-05-18T01:25:32Z","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":"555757f8dc07e67473a4aeafe29272a32650020b0e9b179f402b3b8461427e08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T06:16:54Z","title_canon_sha256":"705baa32d52cf901ac205e37615d23ee8d0fedda14c0b058014793249ce2c6d2"},"schema_version":"1.0","source":{"id":"1512.00153","kind":"arxiv","version":1}},"canonical_sha256":"60fabf395a14a6086c42e254cccc9f24f71c4199443185791bf5c8a0c990c7b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60fabf395a14a6086c42e254cccc9f24f71c4199443185791bf5c8a0c990c7b1","first_computed_at":"2026-05-18T01:25:32.617075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:32.617075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fGSY5pjXdAwfl68sp8VlLpeRhe1p8uobUNZ4H5lEfdqZCISVWtkOzv2RqYclvgCjtvb6e7fGppMJGK+5FzvOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:32.617607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4197cc79e18c8783f77b7a057a3cdd76f0df0a0fd9a3153208a1b763d965e0c7","sha256:7b48e7de8b04e9c40898813aa78aad6388d65de638bd8c679d93ef4efb93c9df"],"state_sha256":"7e488f7ed15e793f763941e5d374aba43b9bd2e4e48e1a721c476b9b1b7fabe8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVfvzo1G2IbSeZHXjiyTXqF5XhFpB3LLxcPVqkOoj0Xq3bpYZa00tOHG83eWVfY17o9dS0NsecM6bkYf9y41Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:40:54.649932Z","bundle_sha256":"3782a9d5df95d01a6104ca96e7890272de3e0a4c9f43e9233e6237cd5098236c"}}