{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6GIRDNJP2CDXSIUV6UDQH7CYT3","short_pith_number":"pith:6GIRDNJP","canonical_record":{"source":{"id":"1601.06859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T01:04:34Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"463145cb41ff1fc785f0b6fdbfbb811fbc46472d53148cb4ee4d1bb5cee8c3bb","abstract_canon_sha256":"55b79aa4281196a66d725132e3387bc8858e17d739e0fe54bc35a2b3d81983c6"},"schema_version":"1.0"},"canonical_sha256":"f19111b52fd087792295f50703fc589eccc79db31c9e8f70d3610cc54398de97","source":{"kind":"arxiv","id":"1601.06859","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06859","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06859v2","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06859","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"6GIRDNJP2CDX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GIRDNJP2CDXSIUV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GIRDNJP","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6GIRDNJP2CDXSIUV6UDQH7CYT3","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T01:04:34Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"463145cb41ff1fc785f0b6fdbfbb811fbc46472d53148cb4ee4d1bb5cee8c3bb","abstract_canon_sha256":"55b79aa4281196a66d725132e3387bc8858e17d739e0fe54bc35a2b3d81983c6"},"schema_version":"1.0"},"canonical_sha256":"f19111b52fd087792295f50703fc589eccc79db31c9e8f70d3610cc54398de97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:07.402683Z","signature_b64":"fQd8wK6vYWPagElx4qvoS1iENLKDFGMdau5eiYBlD+9QxdvkFIDcGB4qm0OiYyTdj1m0wQizv5fwYZNZP/r6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19111b52fd087792295f50703fc589eccc79db31c9e8f70d3610cc54398de97","last_reissued_at":"2026-05-18T00:51:07.402200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:07.402200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06859","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-05-18T00:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5S+ZmmUfGWXCPOQGkON9l1Kc9TiH76XLgAkoJ+WGwWOz/HN6FTtM9Gt+0R4GZ29Hf0trdGC5QuQqvD3q2TRCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:30:01.260077Z"},"content_sha256":"b9ad515f129d96d63f9a55e2c53837c18946fa4df4d5b696dc4b9dbc8a66e2d3","schema_version":"1.0","event_id":"sha256:b9ad515f129d96d63f9a55e2c53837c18946fa4df4d5b696dc4b9dbc8a66e2d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6GIRDNJP2CDXSIUV6UDQH7CYT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Dynamic Routing for the Wireless Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Daniel S. Menasche, Dennis Goeckel, Mark Shifrin, Omer Gurewitz","submitted_at":"2016-01-26T01:04:34Z","abstract_excerpt":"Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status. For example, the source may choose between a direct route to the destination and a relay-assisted scheme. Clearly, due to the difference in the performance achieved, as well as the resources each scheme uses, a sender might wish to choose the most appropriate one based on its status.\n  In this work, we formulate the problem as a Semi-Markov Decision Process. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06859","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":""},"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-18T00:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPSe2YM0INRPRFscsaov7gN/ZDdErJ00A1351CUTSw7symmgtNszmP/++fZvNI3whVkohn04JQAjRy/lZPr9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:30:01.260444Z"},"content_sha256":"707df4d8108a57baed72cecaf909ff64bffb03de13e13a8fa92cd9c79b065001","schema_version":"1.0","event_id":"sha256:707df4d8108a57baed72cecaf909ff64bffb03de13e13a8fa92cd9c79b065001"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3/bundle.json","state_url":"https://pith.science/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3/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-22T13:30:01Z","links":{"resolver":"https://pith.science/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3","bundle":"https://pith.science/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3/bundle.json","state":"https://pith.science/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GIRDNJP2CDXSIUV6UDQH7CYT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6GIRDNJP2CDXSIUV6UDQH7CYT3","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":"55b79aa4281196a66d725132e3387bc8858e17d739e0fe54bc35a2b3d81983c6","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T01:04:34Z","title_canon_sha256":"463145cb41ff1fc785f0b6fdbfbb811fbc46472d53148cb4ee4d1bb5cee8c3bb"},"schema_version":"1.0","source":{"id":"1601.06859","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06859","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06859v2","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06859","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"6GIRDNJP2CDX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GIRDNJP2CDXSIUV","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GIRDNJP","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:707df4d8108a57baed72cecaf909ff64bffb03de13e13a8fa92cd9c79b065001","target":"graph","created_at":"2026-05-18T00:51:07Z","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":"Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status. For example, the source may choose between a direct route to the destination and a relay-assisted scheme. Clearly, due to the difference in the performance achieved, as well as the resources each scheme uses, a sender might wish to choose the most appropriate one based on its status.\n  In this work, we formulate the problem as a Semi-Markov Decision Process. T","authors_text":"Asaf Cohen, Daniel S. Menasche, Dennis Goeckel, Mark Shifrin, Omer Gurewitz","cross_cats":["cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T01:04:34Z","title":"Optimal Dynamic Routing for the Wireless Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06859","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:b9ad515f129d96d63f9a55e2c53837c18946fa4df4d5b696dc4b9dbc8a66e2d3","target":"record","created_at":"2026-05-18T00:51:07Z","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":"55b79aa4281196a66d725132e3387bc8858e17d739e0fe54bc35a2b3d81983c6","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T01:04:34Z","title_canon_sha256":"463145cb41ff1fc785f0b6fdbfbb811fbc46472d53148cb4ee4d1bb5cee8c3bb"},"schema_version":"1.0","source":{"id":"1601.06859","kind":"arxiv","version":2}},"canonical_sha256":"f19111b52fd087792295f50703fc589eccc79db31c9e8f70d3610cc54398de97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f19111b52fd087792295f50703fc589eccc79db31c9e8f70d3610cc54398de97","first_computed_at":"2026-05-18T00:51:07.402200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:07.402200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fQd8wK6vYWPagElx4qvoS1iENLKDFGMdau5eiYBlD+9QxdvkFIDcGB4qm0OiYyTdj1m0wQizv5fwYZNZP/r6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:07.402683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06859","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9ad515f129d96d63f9a55e2c53837c18946fa4df4d5b696dc4b9dbc8a66e2d3","sha256:707df4d8108a57baed72cecaf909ff64bffb03de13e13a8fa92cd9c79b065001"],"state_sha256":"7a0148bf95d8139e4531effac728d46c0871537e5f19fa6cc5e64c639190820d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGfCHAubuWTDTJgglK4w54ggmUqty6BnaAcFbXAv8kX9qtgMWXcS86G7Tj2Cem1glj8RSR2HUUh5OF7FpZukAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:30:01.262435Z","bundle_sha256":"0b5a90b6de85dcfd49f4b4ead810396dbb5581e72597e9b0da1890f50c2b376d"}}