{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:AXZNC7IDETMACE7WHPAKUBWYX3","short_pith_number":"pith:AXZNC7ID","canonical_record":{"source":{"id":"2012.07933","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T20:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"9fe4464cb560382e1929da1a8f38daf9fcde16022e5a65dfcef3313b7fed1d66","abstract_canon_sha256":"efe2efb81c8955d006b8471df1f2ce9720fb0ee318c4f4550bf13d2585d04174"},"schema_version":"1.0"},"canonical_sha256":"05f2d17d0324d80113f63bc0aa06d8befc3b2675d75bc190020dc09173c35f3e","source":{"kind":"arxiv","id":"2012.07933","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07933","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07933v2","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07933","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"AXZNC7IDETMA","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"pith_short_16","alias_value":"AXZNC7IDETMACE7W","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"pith_short_8","alias_value":"AXZNC7ID","created_at":"2026-07-05T02:00:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:AXZNC7IDETMACE7WHPAKUBWYX3","target":"record","payload":{"canonical_record":{"source":{"id":"2012.07933","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T20:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"9fe4464cb560382e1929da1a8f38daf9fcde16022e5a65dfcef3313b7fed1d66","abstract_canon_sha256":"efe2efb81c8955d006b8471df1f2ce9720fb0ee318c4f4550bf13d2585d04174"},"schema_version":"1.0"},"canonical_sha256":"05f2d17d0324d80113f63bc0aa06d8befc3b2675d75bc190020dc09173c35f3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:33.297509Z","signature_b64":"MDo33DWtP9NeFq3goXZaNLdQTlR7tfNyiZWIUBI71ErcU1xOp+3UuywTzr0zO2ZoUVl7HvuBfBtTNLBYE1dmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f2d17d0324d80113f63bc0aa06d8befc3b2675d75bc190020dc09173c35f3e","last_reissued_at":"2026-07-05T02:00:33.297067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:33.297067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.07933","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-07-05T02:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moCDft4rKMoHYIXoBYDMysCDbB0SlB54v7IDS+rf1GDVKm4gj4HDGoIVq7OAlgl9jw6Dw6RKWf9HSJzJqO4CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T20:55:36.821293Z"},"content_sha256":"dfa79e2efc0fbd6bcf0db38a561c0ea524d55677c26e60116d092150458c8db0","schema_version":"1.0","event_id":"sha256:dfa79e2efc0fbd6bcf0db38a561c0ea524d55677c26e60116d092150458c8db0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:AXZNC7IDETMACE7WHPAKUBWYX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Resource Allocation with Stochastic Resource Consumption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiashuo Jiang, Jiawei Zhang","submitted_at":"2020-12-14T20:43:31Z","abstract_excerpt":"We consider an online resource allocation problem where multiple resources, each with an individual initial capacity, are available to serve random requests arriving sequentially over multiple discrete time periods. At each time period, one request arrives and its associated reward and size are drawn independently from a known distribution that could be resource-dependent. Upon its arrival and revealing itself, an online decision has to be made on whether or not to accept the request. If accepted, another online decision should also be made to specify on assigning which resource to serve the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07933","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.07933/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjvtOJrUhndjjwY3aTh4U118FU+DCG+Yyj0c0eqqNSQB5FHMvTAJtx9ys74JxKjLFBCDwRWK6N3UHCmJFdo8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T20:55:36.821674Z"},"content_sha256":"8c7a6a87a8f38bd81b7eec3af9d76be7b4cf1e23933a8ee9c45a1aeb2c63f3dd","schema_version":"1.0","event_id":"sha256:8c7a6a87a8f38bd81b7eec3af9d76be7b4cf1e23933a8ee9c45a1aeb2c63f3dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXZNC7IDETMACE7WHPAKUBWYX3/bundle.json","state_url":"https://pith.science/pith/AXZNC7IDETMACE7WHPAKUBWYX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXZNC7IDETMACE7WHPAKUBWYX3/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-07-10T20:55:36Z","links":{"resolver":"https://pith.science/pith/AXZNC7IDETMACE7WHPAKUBWYX3","bundle":"https://pith.science/pith/AXZNC7IDETMACE7WHPAKUBWYX3/bundle.json","state":"https://pith.science/pith/AXZNC7IDETMACE7WHPAKUBWYX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXZNC7IDETMACE7WHPAKUBWYX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:AXZNC7IDETMACE7WHPAKUBWYX3","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":"efe2efb81c8955d006b8471df1f2ce9720fb0ee318c4f4550bf13d2585d04174","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T20:43:31Z","title_canon_sha256":"9fe4464cb560382e1929da1a8f38daf9fcde16022e5a65dfcef3313b7fed1d66"},"schema_version":"1.0","source":{"id":"2012.07933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07933","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07933v2","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07933","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"AXZNC7IDETMA","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"pith_short_16","alias_value":"AXZNC7IDETMACE7W","created_at":"2026-07-05T02:00:33Z"},{"alias_kind":"pith_short_8","alias_value":"AXZNC7ID","created_at":"2026-07-05T02:00:33Z"}],"graph_snapshots":[{"event_id":"sha256:8c7a6a87a8f38bd81b7eec3af9d76be7b4cf1e23933a8ee9c45a1aeb2c63f3dd","target":"graph","created_at":"2026-07-05T02:00:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.07933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider an online resource allocation problem where multiple resources, each with an individual initial capacity, are available to serve random requests arriving sequentially over multiple discrete time periods. At each time period, one request arrives and its associated reward and size are drawn independently from a known distribution that could be resource-dependent. Upon its arrival and revealing itself, an online decision has to be made on whether or not to accept the request. If accepted, another online decision should also be made to specify on assigning which resource to serve the r","authors_text":"Jiashuo Jiang, Jiawei Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T20:43:31Z","title":"Online Resource Allocation with Stochastic Resource Consumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07933","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:dfa79e2efc0fbd6bcf0db38a561c0ea524d55677c26e60116d092150458c8db0","target":"record","created_at":"2026-07-05T02:00:33Z","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":"efe2efb81c8955d006b8471df1f2ce9720fb0ee318c4f4550bf13d2585d04174","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T20:43:31Z","title_canon_sha256":"9fe4464cb560382e1929da1a8f38daf9fcde16022e5a65dfcef3313b7fed1d66"},"schema_version":"1.0","source":{"id":"2012.07933","kind":"arxiv","version":2}},"canonical_sha256":"05f2d17d0324d80113f63bc0aa06d8befc3b2675d75bc190020dc09173c35f3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05f2d17d0324d80113f63bc0aa06d8befc3b2675d75bc190020dc09173c35f3e","first_computed_at":"2026-07-05T02:00:33.297067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:00:33.297067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MDo33DWtP9NeFq3goXZaNLdQTlR7tfNyiZWIUBI71ErcU1xOp+3UuywTzr0zO2ZoUVl7HvuBfBtTNLBYE1dmDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:00:33.297509Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.07933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfa79e2efc0fbd6bcf0db38a561c0ea524d55677c26e60116d092150458c8db0","sha256:8c7a6a87a8f38bd81b7eec3af9d76be7b4cf1e23933a8ee9c45a1aeb2c63f3dd"],"state_sha256":"5c20a977fcc9cae3162f7ef485d84ec9ea1a3092123833f2a544c36754094f03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLNvxNl5XZ9KVWlscmvuBKNYyLYNNfX98jLSB1qSeypNo1lVJXy8WsyyLdQZT7SlZO4UzV44epTFKr1mg8DtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T20:55:36.824058Z","bundle_sha256":"23638df7442b3955998b5dfb4e35e48fe3c4f8914723a708fc672913908adf06"}}