{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7ZFKKC2LJN6EUTOL2W5OSWENGS","short_pith_number":"pith:7ZFKKC2L","canonical_record":{"source":{"id":"1011.5122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:49:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ef047860b0b9d2a7754b464aef2eebb5fe891f9c66368a9e149fbef95c9f683","abstract_canon_sha256":"b7296956ddfca8e6aeca2db099be3d1cb669d86439c46a263b499e076c2f4942"},"schema_version":"1.0"},"canonical_sha256":"fe4aa50b4b4b7c4a4dcbd5bae9588d34888bc46fa3263adba4c1bb193c242e7a","source":{"kind":"arxiv","id":"1011.5122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5122","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5122v1","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5122","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"7ZFKKC2LJN6E","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ZFKKC2LJN6EUTOL","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ZFKKC2L","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7ZFKKC2LJN6EUTOL2W5OSWENGS","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:49:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ef047860b0b9d2a7754b464aef2eebb5fe891f9c66368a9e149fbef95c9f683","abstract_canon_sha256":"b7296956ddfca8e6aeca2db099be3d1cb669d86439c46a263b499e076c2f4942"},"schema_version":"1.0"},"canonical_sha256":"fe4aa50b4b4b7c4a4dcbd5bae9588d34888bc46fa3263adba4c1bb193c242e7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:54.772269Z","signature_b64":"7+5OdnROnzXSQG+ZaUe9pZ188mXJvg4T/cXWnWtYSN5MIN8SzaJ6MTwAf5Kk7BAtrHes6Lc4T7DZmegwnOzrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4aa50b4b4b7c4a4dcbd5bae9588d34888bc46fa3263adba4c1bb193c242e7a","last_reissued_at":"2026-05-18T04:34:54.771886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:54.771886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5122","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:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2jwGz11ZJEN7AByG0/viLdqy1nRDGUomLUh21bxH/eA1gSNbvA8rPsJgJzSG28UUYRX+6ThcbeS5nyZ/cM7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:38.909673Z"},"content_sha256":"187b255e525d5fa03db579f749b6207b25b4e18f300961050378e2f6b641c17e","schema_version":"1.0","event_id":"sha256:187b255e525d5fa03db579f749b6207b25b4e18f300961050378e2f6b641c17e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7ZFKKC2LJN6EUTOL2W5OSWENGS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Utility Constrained Energy Minimization In Aloha Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Mahdi Khodaian, Babak H. Khalaj, Mohammad S. Talebi","submitted_at":"2010-11-23T14:49:49Z","abstract_excerpt":"In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in terms of energy consumption and fairness. First, we propose a heuristic power control method that improves throughput, and then we model the Utility Constrained Energy Minimization (UCEM) problem in which the utility constraint takes into account single and multi node performance. UCEM is modeled as a convex optimization problem and Sequential Quadratic Programming (SQP) is used to find optimal transmission probabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5122","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:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvcoGnS0nW3+XzQMZXMVMPV1mJYXFozHVuEwi5xripiPv26NbAF3zr6ykos/Xt8PuOW/mPSP76QYEEFiK7UhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:38.910407Z"},"content_sha256":"12b68e41a38fa1fa9d14df607146209a34ca0536c73c71d83805c6e7049aa931","schema_version":"1.0","event_id":"sha256:12b68e41a38fa1fa9d14df607146209a34ca0536c73c71d83805c6e7049aa931"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS/bundle.json","state_url":"https://pith.science/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS/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-27T22:17:38Z","links":{"resolver":"https://pith.science/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS","bundle":"https://pith.science/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS/bundle.json","state":"https://pith.science/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZFKKC2LJN6EUTOL2W5OSWENGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7ZFKKC2LJN6EUTOL2W5OSWENGS","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":"b7296956ddfca8e6aeca2db099be3d1cb669d86439c46a263b499e076c2f4942","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:49:49Z","title_canon_sha256":"9ef047860b0b9d2a7754b464aef2eebb5fe891f9c66368a9e149fbef95c9f683"},"schema_version":"1.0","source":{"id":"1011.5122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5122","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5122v1","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5122","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"7ZFKKC2LJN6E","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ZFKKC2LJN6EUTOL","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ZFKKC2L","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:12b68e41a38fa1fa9d14df607146209a34ca0536c73c71d83805c6e7049aa931","target":"graph","created_at":"2026-05-18T04:34: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":"In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in terms of energy consumption and fairness. First, we propose a heuristic power control method that improves throughput, and then we model the Utility Constrained Energy Minimization (UCEM) problem in which the utility constraint takes into account single and multi node performance. UCEM is modeled as a convex optimization problem and Sequential Quadratic Programming (SQP) is used to find optimal transmission probabilit","authors_text":"Amir Mahdi Khodaian, Babak H. Khalaj, Mohammad S. Talebi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:49:49Z","title":"Utility Constrained Energy Minimization In Aloha Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5122","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:187b255e525d5fa03db579f749b6207b25b4e18f300961050378e2f6b641c17e","target":"record","created_at":"2026-05-18T04:34: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":"b7296956ddfca8e6aeca2db099be3d1cb669d86439c46a263b499e076c2f4942","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:49:49Z","title_canon_sha256":"9ef047860b0b9d2a7754b464aef2eebb5fe891f9c66368a9e149fbef95c9f683"},"schema_version":"1.0","source":{"id":"1011.5122","kind":"arxiv","version":1}},"canonical_sha256":"fe4aa50b4b4b7c4a4dcbd5bae9588d34888bc46fa3263adba4c1bb193c242e7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe4aa50b4b4b7c4a4dcbd5bae9588d34888bc46fa3263adba4c1bb193c242e7a","first_computed_at":"2026-05-18T04:34:54.771886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:54.771886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7+5OdnROnzXSQG+ZaUe9pZ188mXJvg4T/cXWnWtYSN5MIN8SzaJ6MTwAf5Kk7BAtrHes6Lc4T7DZmegwnOzrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:54.772269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:187b255e525d5fa03db579f749b6207b25b4e18f300961050378e2f6b641c17e","sha256:12b68e41a38fa1fa9d14df607146209a34ca0536c73c71d83805c6e7049aa931"],"state_sha256":"8338774c666f7336a2f26590f2f99bc22aecc540f3777df6474c9d1501fae1b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VWY4gb5/NqxU4EhFGv9Ynp9rcC6Ap3lCtcpcuRTuBErW/eLyOKkGco/PMzaXU70fYEuzO/0dh25/YWufqTWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:17:38.914086Z","bundle_sha256":"66559a3f61d825549be8d0cbcd2c9839e5b04c9c21fdea762613c4cc9da157f0"}}