{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OGFIJ5I26FKNHBSXWEJGRFN27D","short_pith_number":"pith:OGFIJ5I2","canonical_record":{"source":{"id":"1109.1606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-08T00:43:42Z","cross_cats_sorted":["cs.NI","math.OC","math.PR"],"title_canon_sha256":"0acdefb6595b3194bf1a884fec4721f3c302e915e9748d0a81a9fb64a882ebb8","abstract_canon_sha256":"9c06a9760cacb6d301eefb7cfebd748df84c505a623bb45c32543c9139494f51"},"schema_version":"1.0"},"canonical_sha256":"718a84f51af154d38657b1126895baf8ec303ca42ee21647274a7726b3c235a8","source":{"kind":"arxiv","id":"1109.1606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1606","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1606v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1606","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"OGFIJ5I26FKN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OGFIJ5I26FKNHBSX","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OGFIJ5I2","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OGFIJ5I26FKNHBSXWEJGRFN27D","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-08T00:43:42Z","cross_cats_sorted":["cs.NI","math.OC","math.PR"],"title_canon_sha256":"0acdefb6595b3194bf1a884fec4721f3c302e915e9748d0a81a9fb64a882ebb8","abstract_canon_sha256":"9c06a9760cacb6d301eefb7cfebd748df84c505a623bb45c32543c9139494f51"},"schema_version":"1.0"},"canonical_sha256":"718a84f51af154d38657b1126895baf8ec303ca42ee21647274a7726b3c235a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:54.808880Z","signature_b64":"s2l67kQJDrlEg4hyRQcn1IaSHYo3O/tD8goCgfyhiHitXdzYXJwxFWknyq6VR3hhGugy3sAZro0Mc1wQbW2/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"718a84f51af154d38657b1126895baf8ec303ca42ee21647274a7726b3c235a8","last_reissued_at":"2026-05-18T04:13:54.808294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:54.808294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1606","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-18T04:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iVu+cgqSM9hJaSwKsp5mgqW1juBbehZx9nqvCvDT2Qvst/Sjf4Aw5UjJvfiSxZteHN68vzXlJAmmnsnGFTOdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:04:23.901462Z"},"content_sha256":"494f7480fcc684a49cb28ebbc1bc21e8d55d41ab3021aea765e5d7002599239b","schema_version":"1.0","event_id":"sha256:494f7480fcc684a49cb28ebbc1bc21e8d55d41ab3021aea765e5d7002599239b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OGFIJ5I26FKNHBSXWEJGRFN27D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning for Combinatorial Network Optimization with Restless Markovian Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC","math.PR"],"primary_cat":"cs.LG","authors_text":"Bhaskar Krishnamachari, Mingyan Liu, Yi Gai","submitted_at":"2011-09-08T00:43:42Z","abstract_excerpt":"Combinatorial network optimization algorithms that compute optimal structures taking into account edge weights form the foundation for many network protocols. Examples include shortest path routing, minimal spanning tree computation, maximum weighted matching on bipartite graphs, etc. We present CLRMR, the first online learning algorithm that efficiently solves the stochastic version of these problems where the underlying edge weights vary as independent Markov chains with unknown dynamics.\n  The performance of an online learning algorithm is characterized in terms of regret, defined as the cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1606","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-18T04:13:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05tQxSIglwnK9Idg8x13PLP6Zp56ESH1uEgJa9yJY31OxJqsm6ruHLCKWxRCem8UFwbLEYzeGCc2FKt9J4jNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:04:23.902134Z"},"content_sha256":"182dd83bd9a9a3337ea4504a53319006080fdb1602ac616a80f35fa10a724e51","schema_version":"1.0","event_id":"sha256:182dd83bd9a9a3337ea4504a53319006080fdb1602ac616a80f35fa10a724e51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGFIJ5I26FKNHBSXWEJGRFN27D/bundle.json","state_url":"https://pith.science/pith/OGFIJ5I26FKNHBSXWEJGRFN27D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGFIJ5I26FKNHBSXWEJGRFN27D/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-30T18:04:23Z","links":{"resolver":"https://pith.science/pith/OGFIJ5I26FKNHBSXWEJGRFN27D","bundle":"https://pith.science/pith/OGFIJ5I26FKNHBSXWEJGRFN27D/bundle.json","state":"https://pith.science/pith/OGFIJ5I26FKNHBSXWEJGRFN27D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGFIJ5I26FKNHBSXWEJGRFN27D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OGFIJ5I26FKNHBSXWEJGRFN27D","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":"9c06a9760cacb6d301eefb7cfebd748df84c505a623bb45c32543c9139494f51","cross_cats_sorted":["cs.NI","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-08T00:43:42Z","title_canon_sha256":"0acdefb6595b3194bf1a884fec4721f3c302e915e9748d0a81a9fb64a882ebb8"},"schema_version":"1.0","source":{"id":"1109.1606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1606","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1606v1","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1606","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"OGFIJ5I26FKN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OGFIJ5I26FKNHBSX","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OGFIJ5I2","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:182dd83bd9a9a3337ea4504a53319006080fdb1602ac616a80f35fa10a724e51","target":"graph","created_at":"2026-05-18T04:13:54Z","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":"Combinatorial network optimization algorithms that compute optimal structures taking into account edge weights form the foundation for many network protocols. Examples include shortest path routing, minimal spanning tree computation, maximum weighted matching on bipartite graphs, etc. We present CLRMR, the first online learning algorithm that efficiently solves the stochastic version of these problems where the underlying edge weights vary as independent Markov chains with unknown dynamics.\n  The performance of an online learning algorithm is characterized in terms of regret, defined as the cu","authors_text":"Bhaskar Krishnamachari, Mingyan Liu, Yi Gai","cross_cats":["cs.NI","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-08T00:43:42Z","title":"Online Learning for Combinatorial Network Optimization with Restless Markovian Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1606","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:494f7480fcc684a49cb28ebbc1bc21e8d55d41ab3021aea765e5d7002599239b","target":"record","created_at":"2026-05-18T04:13:54Z","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":"9c06a9760cacb6d301eefb7cfebd748df84c505a623bb45c32543c9139494f51","cross_cats_sorted":["cs.NI","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-08T00:43:42Z","title_canon_sha256":"0acdefb6595b3194bf1a884fec4721f3c302e915e9748d0a81a9fb64a882ebb8"},"schema_version":"1.0","source":{"id":"1109.1606","kind":"arxiv","version":1}},"canonical_sha256":"718a84f51af154d38657b1126895baf8ec303ca42ee21647274a7726b3c235a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"718a84f51af154d38657b1126895baf8ec303ca42ee21647274a7726b3c235a8","first_computed_at":"2026-05-18T04:13:54.808294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:54.808294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s2l67kQJDrlEg4hyRQcn1IaSHYo3O/tD8goCgfyhiHitXdzYXJwxFWknyq6VR3hhGugy3sAZro0Mc1wQbW2/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:54.808880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:494f7480fcc684a49cb28ebbc1bc21e8d55d41ab3021aea765e5d7002599239b","sha256:182dd83bd9a9a3337ea4504a53319006080fdb1602ac616a80f35fa10a724e51"],"state_sha256":"4fc6a17903bbc18f5e571f9817f16d6939210e442dfceaa76193e3c6559df460"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3B+kmmfmHmMsdPSqbZa+2qvP577s/PI2MrpUCUYyAFOb4Sq84ugTLZR2s9ZnQDGzajL33ZEqLcL//8KCgXb5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:04:23.905951Z","bundle_sha256":"c3b62344972d76e3a11b5147ef34c837d5ea590e47f3bf6febb8cebf2b38e3b4"}}