{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:OVMX5Y3L7TD2AULUWYAHOTJPGT","short_pith_number":"pith:OVMX5Y3L","canonical_record":{"source":{"id":"0812.3447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-18T02:30:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"86959664020663ae8147e5575846d706117b937b2f2d1dd7b900222d6abdb1ea","abstract_canon_sha256":"4696a9264d9aed8b0cd1f67a1b1783fac059b56810b5ca3e0f5cf302097c16ba"},"schema_version":"1.0"},"canonical_sha256":"75597ee36bfcc7a05174b600774d2f34e911bd451b4798048c9a51c4b85ba414","source":{"kind":"arxiv","id":"0812.3447","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.3447","created_at":"2026-05-18T04:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"0812.3447v2","created_at":"2026-05-18T04:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.3447","created_at":"2026-05-18T04:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"OVMX5Y3L7TD2","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"OVMX5Y3L7TD2AULU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"OVMX5Y3L","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:OVMX5Y3L7TD2AULUWYAHOTJPGT","target":"record","payload":{"canonical_record":{"source":{"id":"0812.3447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-18T02:30:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"86959664020663ae8147e5575846d706117b937b2f2d1dd7b900222d6abdb1ea","abstract_canon_sha256":"4696a9264d9aed8b0cd1f67a1b1783fac059b56810b5ca3e0f5cf302097c16ba"},"schema_version":"1.0"},"canonical_sha256":"75597ee36bfcc7a05174b600774d2f34e911bd451b4798048c9a51c4b85ba414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:03.244535Z","signature_b64":"VZPIHuw6za4oMGw3zhAhfmL2sq3HRdk+/tL1w1XleFqFocRB9tVd9dmFAh4D4ZGLMfc+fMuDWAhDzuC3AnVnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75597ee36bfcc7a05174b600774d2f34e911bd451b4798048c9a51c4b85ba414","last_reissued_at":"2026-05-18T04:25:03.244119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:03.244119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0812.3447","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-18T04:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iirWnRNSfd9dPG9wrIhx6QfBu4MQB488kHweLMtgL7Bzi0Avm+oxZxJ4zYSeQPFYBjisvwJQDkEZQeJ0PSv/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:02:28.289690Z"},"content_sha256":"879ef8e295260329a9d536e6f826b5e8a70fdbd287099f793b91a5e3e601ab97","schema_version":"1.0","event_id":"sha256:879ef8e295260329a9d536e6f826b5e8a70fdbd287099f793b91a5e3e601ab97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:OVMX5Y3L7TD2AULUWYAHOTJPGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completion Time Minimization and Robust Power Control in Wireless Packet Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asuman Ozdaglar, Chris T. K. Ng, Muriel Medard","submitted_at":"2008-12-18T02:30:56Z","abstract_excerpt":"A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of all other users. A convex cost function of the completion times of the user packets is minimized by optimally allocating the users' transmission power subject to their respective power constraints. At all ranges of SINR, completion time minimization can be formulated as a convex optimization problem and hence can be efficiently solved. In particular, although the feasible rate region of the wireless network is non-conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.3447","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-18T04:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt8c8i6k4i7dptTWXuLADJDXm2hJDgKDPk3iF2oqSdgqMUWN/11Jnrjk+RNUjD7F6auunm6IyY4UlqSZlpkoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:02:28.290200Z"},"content_sha256":"4d65107581cbae52ee634ca0dc97bada27b219f0b3d8e998c5fcdc805905e9e1","schema_version":"1.0","event_id":"sha256:4d65107581cbae52ee634ca0dc97bada27b219f0b3d8e998c5fcdc805905e9e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT/bundle.json","state_url":"https://pith.science/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT/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-31T08:02:28Z","links":{"resolver":"https://pith.science/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT","bundle":"https://pith.science/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT/bundle.json","state":"https://pith.science/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVMX5Y3L7TD2AULUWYAHOTJPGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:OVMX5Y3L7TD2AULUWYAHOTJPGT","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":"4696a9264d9aed8b0cd1f67a1b1783fac059b56810b5ca3e0f5cf302097c16ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-18T02:30:56Z","title_canon_sha256":"86959664020663ae8147e5575846d706117b937b2f2d1dd7b900222d6abdb1ea"},"schema_version":"1.0","source":{"id":"0812.3447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.3447","created_at":"2026-05-18T04:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"0812.3447v2","created_at":"2026-05-18T04:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.3447","created_at":"2026-05-18T04:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"OVMX5Y3L7TD2","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"OVMX5Y3L7TD2AULU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"OVMX5Y3L","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:4d65107581cbae52ee634ca0dc97bada27b219f0b3d8e998c5fcdc805905e9e1","target":"graph","created_at":"2026-05-18T04:25: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":"A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of all other users. A convex cost function of the completion times of the user packets is minimized by optimally allocating the users' transmission power subject to their respective power constraints. At all ranges of SINR, completion time minimization can be formulated as a convex optimization problem and hence can be efficiently solved. In particular, although the feasible rate region of the wireless network is non-conve","authors_text":"Asuman Ozdaglar, Chris T. K. Ng, Muriel Medard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-18T02:30:56Z","title":"Completion Time Minimization and Robust Power Control in Wireless Packet Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.3447","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:879ef8e295260329a9d536e6f826b5e8a70fdbd287099f793b91a5e3e601ab97","target":"record","created_at":"2026-05-18T04:25: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":"4696a9264d9aed8b0cd1f67a1b1783fac059b56810b5ca3e0f5cf302097c16ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-18T02:30:56Z","title_canon_sha256":"86959664020663ae8147e5575846d706117b937b2f2d1dd7b900222d6abdb1ea"},"schema_version":"1.0","source":{"id":"0812.3447","kind":"arxiv","version":2}},"canonical_sha256":"75597ee36bfcc7a05174b600774d2f34e911bd451b4798048c9a51c4b85ba414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75597ee36bfcc7a05174b600774d2f34e911bd451b4798048c9a51c4b85ba414","first_computed_at":"2026-05-18T04:25:03.244119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:03.244119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZPIHuw6za4oMGw3zhAhfmL2sq3HRdk+/tL1w1XleFqFocRB9tVd9dmFAh4D4ZGLMfc+fMuDWAhDzuC3AnVnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:03.244535Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.3447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:879ef8e295260329a9d536e6f826b5e8a70fdbd287099f793b91a5e3e601ab97","sha256:4d65107581cbae52ee634ca0dc97bada27b219f0b3d8e998c5fcdc805905e9e1"],"state_sha256":"82499530442a924af7fb7c436e09bbde58b7d4afbb60f4ccd86d643dae7d4802"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33PhBddWtvYonyB18GUue4gUfYNCzemKW5n3XcmtNChhHksqD+HFKRhULvY6UbLzNmnEJIOIpB3ty2zaElHvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:02:28.292923Z","bundle_sha256":"cdf4563e4a15637c0a4a73af179311f63afc9c51009370d5f62950f501b11952"}}