{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SW6RYHKT63ST3W63H6ZKU6OIMB","short_pith_number":"pith:SW6RYHKT","canonical_record":{"source":{"id":"1902.07856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T03:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"d1f5a69727c2f8a36f53f4efdfa1bf3c729dc679f876abcce487dd52bc7b965b","abstract_canon_sha256":"219c01f542af79a8250a0509b6474a7ce4a7f2cff7aead198bfb168127516538"},"schema_version":"1.0"},"canonical_sha256":"95bd1c1d53f6e53ddbdb3fb2aa79c860504c9363f7cc7e16f9705a18c1a697d7","source":{"kind":"arxiv","id":"1902.07856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07856","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07856v1","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07856","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"SW6RYHKT63ST","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SW6RYHKT63ST3W63","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SW6RYHKT","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SW6RYHKT63ST3W63H6ZKU6OIMB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T03:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"d1f5a69727c2f8a36f53f4efdfa1bf3c729dc679f876abcce487dd52bc7b965b","abstract_canon_sha256":"219c01f542af79a8250a0509b6474a7ce4a7f2cff7aead198bfb168127516538"},"schema_version":"1.0"},"canonical_sha256":"95bd1c1d53f6e53ddbdb3fb2aa79c860504c9363f7cc7e16f9705a18c1a697d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.676977Z","signature_b64":"Mz/xZMCcalOBf4RMkHNUwfY/tMibG6YQyoxN+MYYkew2LW2Hl6/C3DM6t3GuxXDS72zJtnmjIquUErfBeQDwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95bd1c1d53f6e53ddbdb3fb2aa79c860504c9363f7cc7e16f9705a18c1a697d7","last_reissued_at":"2026-05-17T23:53:03.676496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.676496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07856","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-17T23:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/aObu4fk+P0WNEa2LKFCyUoAz0ykCV9AbDvhUhn+dVebS7lIiAlveHVygRct1acvfoaFbG7syOqgBSNpiObtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:47:11.624941Z"},"content_sha256":"831eabf19a1786514ffc038fafe076196af9dd85f8f028e8043f3f85e28b5124","schema_version":"1.0","event_id":"sha256:831eabf19a1786514ffc038fafe076196af9dd85f8f028e8043f3f85e28b5124"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SW6RYHKT63ST3W63H6ZKU6OIMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Markovian Price of Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Haotian Jiang, Sahil Singla, Ziv Scully","submitted_at":"2019-02-21T03:40:09Z","abstract_excerpt":"Suppose there are $n$ Markov chains and we need to pay a per-step \\emph{price} to advance them. The \"destination\" states of the Markov chains contain rewards; however, we can only get rewards for a subset of them that satisfy a combinatorial constraint, e.g., at most $k$ of them, or they are acyclic in an underlying graph. What strategy should we choose to advance the Markov chains if our goal is to maximize the total reward \\emph{minus} the total price that we pay?\n  In this paper we introduce a Markovian price of information model to capture settings such as the above, where the input parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07856","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-17T23:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oE/Z4nbIYnMkPxlrjxEXDY6BCbM21e5dWwccKaKKP3kgiiziZTZVXLUttXq1kiK6qQ93o+fYxP0Rzo/RICZgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:47:11.625516Z"},"content_sha256":"681683b2745de71b51acf08aad7b1e2529a4852731cb7a41bb172e607f59ba3c","schema_version":"1.0","event_id":"sha256:681683b2745de71b51acf08aad7b1e2529a4852731cb7a41bb172e607f59ba3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SW6RYHKT63ST3W63H6ZKU6OIMB/bundle.json","state_url":"https://pith.science/pith/SW6RYHKT63ST3W63H6ZKU6OIMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SW6RYHKT63ST3W63H6ZKU6OIMB/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-27T13:47:11Z","links":{"resolver":"https://pith.science/pith/SW6RYHKT63ST3W63H6ZKU6OIMB","bundle":"https://pith.science/pith/SW6RYHKT63ST3W63H6ZKU6OIMB/bundle.json","state":"https://pith.science/pith/SW6RYHKT63ST3W63H6ZKU6OIMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SW6RYHKT63ST3W63H6ZKU6OIMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SW6RYHKT63ST3W63H6ZKU6OIMB","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":"219c01f542af79a8250a0509b6474a7ce4a7f2cff7aead198bfb168127516538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T03:40:09Z","title_canon_sha256":"d1f5a69727c2f8a36f53f4efdfa1bf3c729dc679f876abcce487dd52bc7b965b"},"schema_version":"1.0","source":{"id":"1902.07856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07856","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07856v1","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07856","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"SW6RYHKT63ST","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SW6RYHKT63ST3W63","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SW6RYHKT","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:681683b2745de71b51acf08aad7b1e2529a4852731cb7a41bb172e607f59ba3c","target":"graph","created_at":"2026-05-17T23:53:03Z","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":"Suppose there are $n$ Markov chains and we need to pay a per-step \\emph{price} to advance them. The \"destination\" states of the Markov chains contain rewards; however, we can only get rewards for a subset of them that satisfy a combinatorial constraint, e.g., at most $k$ of them, or they are acyclic in an underlying graph. What strategy should we choose to advance the Markov chains if our goal is to maximize the total reward \\emph{minus} the total price that we pay?\n  In this paper we introduce a Markovian price of information model to capture settings such as the above, where the input parame","authors_text":"Anupam Gupta, Haotian Jiang, Sahil Singla, Ziv Scully","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T03:40:09Z","title":"The Markovian Price of Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07856","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:831eabf19a1786514ffc038fafe076196af9dd85f8f028e8043f3f85e28b5124","target":"record","created_at":"2026-05-17T23:53:03Z","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":"219c01f542af79a8250a0509b6474a7ce4a7f2cff7aead198bfb168127516538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T03:40:09Z","title_canon_sha256":"d1f5a69727c2f8a36f53f4efdfa1bf3c729dc679f876abcce487dd52bc7b965b"},"schema_version":"1.0","source":{"id":"1902.07856","kind":"arxiv","version":1}},"canonical_sha256":"95bd1c1d53f6e53ddbdb3fb2aa79c860504c9363f7cc7e16f9705a18c1a697d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95bd1c1d53f6e53ddbdb3fb2aa79c860504c9363f7cc7e16f9705a18c1a697d7","first_computed_at":"2026-05-17T23:53:03.676496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:03.676496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mz/xZMCcalOBf4RMkHNUwfY/tMibG6YQyoxN+MYYkew2LW2Hl6/C3DM6t3GuxXDS72zJtnmjIquUErfBeQDwCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:03.676977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:831eabf19a1786514ffc038fafe076196af9dd85f8f028e8043f3f85e28b5124","sha256:681683b2745de71b51acf08aad7b1e2529a4852731cb7a41bb172e607f59ba3c"],"state_sha256":"76019894cfeff82ab174b121a2d932ff5c9a54f4061dcbed9c823ba969e5b4f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/KknNY6S/MAc4d/XUB9FGjJRGOWwYPmm7zQWEQhj4vBlsPOjiGAyhdppiWGZuWouf8XcB1UtNlecVfJOmikDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:47:11.629048Z","bundle_sha256":"3643805b22b879f97543e6fa9e84d3788e4de861b2ebcba62082ba9bc777dc56"}}