{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6QEIAAT77ZKMMDKLDTRNAOLICN","short_pith_number":"pith:6QEIAAT7","canonical_record":{"source":{"id":"1009.3961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2010-09-20T22:30:57Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"d013fd0560c64e17ef7db20a63c19ff108752dba5533aa0b4d32f3983c8a05fe","abstract_canon_sha256":"f7ed2d77c073e37d98335ad7995c3d32b6e48a34c0adc456fb456bd3059c8d21"},"schema_version":"1.0"},"canonical_sha256":"f40880027ffe54c60d4b1ce2d03968136edc162327604ced78d3d3db713a4f28","source":{"kind":"arxiv","id":"1009.3961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3961","created_at":"2026-05-18T04:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3961v1","created_at":"2026-05-18T04:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3961","created_at":"2026-05-18T04:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"6QEIAAT77ZKM","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6QEIAAT77ZKMMDKL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6QEIAAT7","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6QEIAAT77ZKMMDKLDTRNAOLICN","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2010-09-20T22:30:57Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"d013fd0560c64e17ef7db20a63c19ff108752dba5533aa0b4d32f3983c8a05fe","abstract_canon_sha256":"f7ed2d77c073e37d98335ad7995c3d32b6e48a34c0adc456fb456bd3059c8d21"},"schema_version":"1.0"},"canonical_sha256":"f40880027ffe54c60d4b1ce2d03968136edc162327604ced78d3d3db713a4f28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:34.839102Z","signature_b64":"WoJi4NC6UIDsf7/snoIsUUK/JR6qAO1jyP632iLEHqUH2n8GwV15wlUKs46FGpN8IIlFpveuYdleUucu/yqPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f40880027ffe54c60d4b1ce2d03968136edc162327604ced78d3d3db713a4f28","last_reissued_at":"2026-05-18T04:40:34.838559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:34.838559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3961","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:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1WB85ytOG3CBMSEgFeRxK+6eCUnKM7JcRIzRVrwpas58qS2i9fwTWHYHSEZsCTZ+cdFn82S/5VrYH77jlvsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:19:19.859195Z"},"content_sha256":"b81d0f33250e6bf619780d6b258cead4c7d8afad59f00823238d9aa46868e8e1","schema_version":"1.0","event_id":"sha256:b81d0f33250e6bf619780d6b258cead4c7d8afad59f00823238d9aa46868e8e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6QEIAAT77ZKMMDKLDTRNAOLICN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of ARQ Protocols in Interference Networks with QoS Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Andrea Goldsmith, Daniel O'Neill, Marco Levorato, Urbashi Mitra","submitted_at":"2010-09-20T22:30:57Z","abstract_excerpt":"We study optimal transmission strategies in interfering wireless networks, under Quality of Service constraints. A buffered, dynamic network with multiple sources is considered, and sources use a retransmission strategy in order to improve packet delivery probability. The optimization problem is formulated as a Markov Decision Process, where constraints and objective functions are ratios of time-averaged cost functions. The optimal strategy is found as the solution of a Linear Fractional Program, where the optimization variables are the steady-state probability of state-action pairs. Numerical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3961","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:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"48ozxRPMsf8KcH9YwQuq7S5BD/33Mn090Qd62MCinmd6yWYPePjNs1dYKb5tiRvHzWpe7mJoD2zV3ir5PsxjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:19:19.859887Z"},"content_sha256":"9cc37a176b138f9e10cd3666f67a4e423102e3c01253b6b9cebcb935a6339313","schema_version":"1.0","event_id":"sha256:9cc37a176b138f9e10cd3666f67a4e423102e3c01253b6b9cebcb935a6339313"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QEIAAT77ZKMMDKLDTRNAOLICN/bundle.json","state_url":"https://pith.science/pith/6QEIAAT77ZKMMDKLDTRNAOLICN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QEIAAT77ZKMMDKLDTRNAOLICN/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-25T22:19:19Z","links":{"resolver":"https://pith.science/pith/6QEIAAT77ZKMMDKLDTRNAOLICN","bundle":"https://pith.science/pith/6QEIAAT77ZKMMDKLDTRNAOLICN/bundle.json","state":"https://pith.science/pith/6QEIAAT77ZKMMDKLDTRNAOLICN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QEIAAT77ZKMMDKLDTRNAOLICN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6QEIAAT77ZKMMDKLDTRNAOLICN","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":"f7ed2d77c073e37d98335ad7995c3d32b6e48a34c0adc456fb456bd3059c8d21","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2010-09-20T22:30:57Z","title_canon_sha256":"d013fd0560c64e17ef7db20a63c19ff108752dba5533aa0b4d32f3983c8a05fe"},"schema_version":"1.0","source":{"id":"1009.3961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3961","created_at":"2026-05-18T04:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3961v1","created_at":"2026-05-18T04:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3961","created_at":"2026-05-18T04:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"6QEIAAT77ZKM","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6QEIAAT77ZKMMDKL","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6QEIAAT7","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:9cc37a176b138f9e10cd3666f67a4e423102e3c01253b6b9cebcb935a6339313","target":"graph","created_at":"2026-05-18T04:40:34Z","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":"We study optimal transmission strategies in interfering wireless networks, under Quality of Service constraints. A buffered, dynamic network with multiple sources is considered, and sources use a retransmission strategy in order to improve packet delivery probability. The optimization problem is formulated as a Markov Decision Process, where constraints and objective functions are ratios of time-averaged cost functions. The optimal strategy is found as the solution of a Linear Fractional Program, where the optimization variables are the steady-state probability of state-action pairs. Numerical","authors_text":"Andrea Goldsmith, Daniel O'Neill, Marco Levorato, Urbashi Mitra","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2010-09-20T22:30:57Z","title":"Optimization of ARQ Protocols in Interference Networks with QoS Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3961","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:b81d0f33250e6bf619780d6b258cead4c7d8afad59f00823238d9aa46868e8e1","target":"record","created_at":"2026-05-18T04:40:34Z","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":"f7ed2d77c073e37d98335ad7995c3d32b6e48a34c0adc456fb456bd3059c8d21","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2010-09-20T22:30:57Z","title_canon_sha256":"d013fd0560c64e17ef7db20a63c19ff108752dba5533aa0b4d32f3983c8a05fe"},"schema_version":"1.0","source":{"id":"1009.3961","kind":"arxiv","version":1}},"canonical_sha256":"f40880027ffe54c60d4b1ce2d03968136edc162327604ced78d3d3db713a4f28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f40880027ffe54c60d4b1ce2d03968136edc162327604ced78d3d3db713a4f28","first_computed_at":"2026-05-18T04:40:34.838559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:34.838559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WoJi4NC6UIDsf7/snoIsUUK/JR6qAO1jyP632iLEHqUH2n8GwV15wlUKs46FGpN8IIlFpveuYdleUucu/yqPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:34.839102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b81d0f33250e6bf619780d6b258cead4c7d8afad59f00823238d9aa46868e8e1","sha256:9cc37a176b138f9e10cd3666f67a4e423102e3c01253b6b9cebcb935a6339313"],"state_sha256":"4eb3e19ea9352b0fab7e5fe3c8ebaac4ace7819286302fd6c6be089a1043ca7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yVy6WBEViXhXd7rHwkPylMLwxfKVKN9cFrpAZsBTeicYIGlcWilqfnaSsbHY1MaZRAtZWJra7mzj8FDipLgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:19:19.863264Z","bundle_sha256":"f82bb489328c1c14d34f8a73675983f3e9ad748d3c47e9e571b19a90095ef9de"}}