{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7N5IPBOBW24Q7WPWMIXP73F6RI","short_pith_number":"pith:7N5IPBOB","canonical_record":{"source":{"id":"2310.17651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T17:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"e5b706b53d8b83802ff7e493d8eafdf66b3f4796b3da91c957ba291c25179c2d","abstract_canon_sha256":"ba3d73beeed565a55fcf53ee13f4b15f90cd4374308f8d012938364fbee8fc94"},"schema_version":"1.0"},"canonical_sha256":"fb7a8785c1b6b90fd9f6622effecbe8a25e04db20ae97033a6143544bee2ab00","source":{"kind":"arxiv","id":"2310.17651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.17651","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"2310.17651v2","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17651","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"7N5IPBOBW24Q","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"pith_short_16","alias_value":"7N5IPBOBW24Q7WPW","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"pith_short_8","alias_value":"7N5IPBOB","created_at":"2026-07-05T07:05:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7N5IPBOBW24Q7WPWMIXP73F6RI","target":"record","payload":{"canonical_record":{"source":{"id":"2310.17651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T17:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"e5b706b53d8b83802ff7e493d8eafdf66b3f4796b3da91c957ba291c25179c2d","abstract_canon_sha256":"ba3d73beeed565a55fcf53ee13f4b15f90cd4374308f8d012938364fbee8fc94"},"schema_version":"1.0"},"canonical_sha256":"fb7a8785c1b6b90fd9f6622effecbe8a25e04db20ae97033a6143544bee2ab00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:05:50.139786Z","signature_b64":"4xcz3MRty1B8XXzLl8wqvbAPman2Ck/5ZKmHPnaHQhMd04IevT1Nt7wIChEfvp1IZES59VL6uRhE97/Bcj0MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7a8785c1b6b90fd9f6622effecbe8a25e04db20ae97033a6143544bee2ab00","last_reissued_at":"2026-07-05T07:05:50.139306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:05:50.139306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.17651","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-05T07:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OR23s3hyCbjrWk4xMMQ+S4VckjEz6+rhvSZeZsTjMYSOEDTv/w3J9OweyQRM8uU4nSBtAr7K1CyDU6luo0CtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T22:50:33.238453Z"},"content_sha256":"9d8d18ed29d3be39c3262a20b1415d3087a2de020dd143b895d6d4c608a31509","schema_version":"1.0","event_id":"sha256:9d8d18ed29d3be39c3262a20b1415d3087a2de020dd143b895d6d4c608a31509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7N5IPBOBW24Q7WPWMIXP73F6RI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Prediction for Sequential Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Georgy Noarov, Ramya Ramalingam, Stephan Xie","submitted_at":"2023-10-26T17:59:32Z","abstract_excerpt":"We study the problem of making predictions of an adversarially chosen high-dimensional state that are unbiased subject to an arbitrary collection of conditioning events, with the goal of tailoring these events to downstream decision makers. We give efficient algorithms for solving this problem, as well as a number of applications that stem from choosing an appropriate set of conditioning events.\n  For example, we can efficiently make predictions targeted at polynomially many decision makers, giving each of them optimal swap regret if they best-respond to our predictions. We generalize this to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17651","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/2310.17651/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-05T07:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibv7fVzm8N+ufbMhf/icVxT5BA6Hi1B48uVaLFmlsi6JChSQ7E1fd2CPlJ+R2+Vo9QL61Yf+fq7NHeJSt8SgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T22:50:33.238805Z"},"content_sha256":"325aaed943bb6d6409a82095eec53085bbe34c3c75b0d39ec0983dd13e9c49b6","schema_version":"1.0","event_id":"sha256:325aaed943bb6d6409a82095eec53085bbe34c3c75b0d39ec0983dd13e9c49b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N5IPBOBW24Q7WPWMIXP73F6RI/bundle.json","state_url":"https://pith.science/pith/7N5IPBOBW24Q7WPWMIXP73F6RI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N5IPBOBW24Q7WPWMIXP73F6RI/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-13T22:50:33Z","links":{"resolver":"https://pith.science/pith/7N5IPBOBW24Q7WPWMIXP73F6RI","bundle":"https://pith.science/pith/7N5IPBOBW24Q7WPWMIXP73F6RI/bundle.json","state":"https://pith.science/pith/7N5IPBOBW24Q7WPWMIXP73F6RI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N5IPBOBW24Q7WPWMIXP73F6RI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7N5IPBOBW24Q7WPWMIXP73F6RI","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":"ba3d73beeed565a55fcf53ee13f4b15f90cd4374308f8d012938364fbee8fc94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T17:59:32Z","title_canon_sha256":"e5b706b53d8b83802ff7e493d8eafdf66b3f4796b3da91c957ba291c25179c2d"},"schema_version":"1.0","source":{"id":"2310.17651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.17651","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"2310.17651v2","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17651","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"7N5IPBOBW24Q","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"pith_short_16","alias_value":"7N5IPBOBW24Q7WPW","created_at":"2026-07-05T07:05:50Z"},{"alias_kind":"pith_short_8","alias_value":"7N5IPBOB","created_at":"2026-07-05T07:05:50Z"}],"graph_snapshots":[{"event_id":"sha256:325aaed943bb6d6409a82095eec53085bbe34c3c75b0d39ec0983dd13e9c49b6","target":"graph","created_at":"2026-07-05T07:05:50Z","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/2310.17651/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of making predictions of an adversarially chosen high-dimensional state that are unbiased subject to an arbitrary collection of conditioning events, with the goal of tailoring these events to downstream decision makers. We give efficient algorithms for solving this problem, as well as a number of applications that stem from choosing an appropriate set of conditioning events.\n  For example, we can efficiently make predictions targeted at polynomially many decision makers, giving each of them optimal swap regret if they best-respond to our predictions. We generalize this to ","authors_text":"Aaron Roth, Georgy Noarov, Ramya Ramalingam, Stephan Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T17:59:32Z","title":"High-Dimensional Prediction for Sequential Decision Making"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17651","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:9d8d18ed29d3be39c3262a20b1415d3087a2de020dd143b895d6d4c608a31509","target":"record","created_at":"2026-07-05T07:05:50Z","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":"ba3d73beeed565a55fcf53ee13f4b15f90cd4374308f8d012938364fbee8fc94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T17:59:32Z","title_canon_sha256":"e5b706b53d8b83802ff7e493d8eafdf66b3f4796b3da91c957ba291c25179c2d"},"schema_version":"1.0","source":{"id":"2310.17651","kind":"arxiv","version":2}},"canonical_sha256":"fb7a8785c1b6b90fd9f6622effecbe8a25e04db20ae97033a6143544bee2ab00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7a8785c1b6b90fd9f6622effecbe8a25e04db20ae97033a6143544bee2ab00","first_computed_at":"2026-07-05T07:05:50.139306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:05:50.139306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4xcz3MRty1B8XXzLl8wqvbAPman2Ck/5ZKmHPnaHQhMd04IevT1Nt7wIChEfvp1IZES59VL6uRhE97/Bcj0MDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:05:50.139786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.17651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d8d18ed29d3be39c3262a20b1415d3087a2de020dd143b895d6d4c608a31509","sha256:325aaed943bb6d6409a82095eec53085bbe34c3c75b0d39ec0983dd13e9c49b6"],"state_sha256":"c7d7461581995dae59aa725c6acd6b4dd77df9e00f0c5b64a9ee4a5a32d5bad4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elJu4UVjS6FxZ/UvP6ai8rqM0YSSPPp+QYpv4YJs6lOXJpeQ+263HWgG0fporiumJCLosAvDOJRmfWBFuxYJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T22:50:33.240762Z","bundle_sha256":"f57bd6a1c887d3963e05ac08ec58dad51ab75fdbf386f9cd7644fbb73ee40f77"}}