{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4SC4ZB3GHRUYOVSCWXZWLVTGQI","short_pith_number":"pith:4SC4ZB3G","canonical_record":{"source":{"id":"1011.5124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:58:03Z","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"title_canon_sha256":"bc2e546cf67e75fe4ad045984e44d20c9e59d178b78c1179462a2e16c05b22cc","abstract_canon_sha256":"026ed6c572378cce834afa83936b7f5cac85380bb7f8fc013ed93f3f22739d23"},"schema_version":"1.0"},"canonical_sha256":"e485cc87663c69875642b5f365d6668203bbf50bc2e039617e69012fff3d8482","source":{"kind":"arxiv","id":"1011.5124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5124","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5124v1","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5124","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"4SC4ZB3GHRUY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4SC4ZB3GHRUYOVSC","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4SC4ZB3G","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4SC4ZB3GHRUYOVSCWXZWLVTGQI","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:58:03Z","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"title_canon_sha256":"bc2e546cf67e75fe4ad045984e44d20c9e59d178b78c1179462a2e16c05b22cc","abstract_canon_sha256":"026ed6c572378cce834afa83936b7f5cac85380bb7f8fc013ed93f3f22739d23"},"schema_version":"1.0"},"canonical_sha256":"e485cc87663c69875642b5f365d6668203bbf50bc2e039617e69012fff3d8482","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:54.761744Z","signature_b64":"//SZaBurI8H6yob++AAXZqhHQ9WtUTJcexxAWVkC8XK9aCoV9CXnf3+sZVOAZDtx1tVsVcSq4Uk725u9UOhpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e485cc87663c69875642b5f365d6668203bbf50bc2e039617e69012fff3d8482","last_reissued_at":"2026-05-18T04:34:54.761362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:54.761362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5124","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":"lih5NJgU5knQIwGBJik0mPc41QgQ1qB4ychbWHV6/LFy7+PqS4Nk70sLe5JkzigoaUcPgnRNT7eoCQj5QLBEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:22:36.968746Z"},"content_sha256":"63e7f5ac13f85f8b80ba56ca1d503ffcfe5e9dd981ba9cd9335d06bfc8c64b9b","schema_version":"1.0","event_id":"sha256:63e7f5ac13f85f8b80ba56ca1d503ffcfe5e9dd981ba9cd9335d06bfc8c64b9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4SC4ZB3GHRUYOVSCWXZWLVTGQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay Constrained Utility Maximization in Multihop Random Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Amir M. Khodaian, Babak H. Khalaj","submitted_at":"2010-11-23T14:58:03Z","abstract_excerpt":"Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in order to optimize performance of such networks, however proposed algorithms result in large transmission delays. In this paper, we will analyze delay in random access multi-hop networks and solve the delay-constrained utility maximization problem. We define the network utility as a combination of rate utility and energy cost functions and solve the following t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5124","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":"VQ7683wquB9JMynIf5/pgPf0jsTYG3N4w9yt7YfekDyzQBao/WZY7jHoI8uG3KN8Nnp444zYN8jtGe7qSfqfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:22:36.969103Z"},"content_sha256":"dfb1ef302408d51a508b5f05c454313adc6cbdc70a0adbf3fbf0e781dbf97c78","schema_version":"1.0","event_id":"sha256:dfb1ef302408d51a508b5f05c454313adc6cbdc70a0adbf3fbf0e781dbf97c78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI/bundle.json","state_url":"https://pith.science/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI/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-28T02:22:36Z","links":{"resolver":"https://pith.science/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI","bundle":"https://pith.science/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI/bundle.json","state":"https://pith.science/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SC4ZB3GHRUYOVSCWXZWLVTGQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4SC4ZB3GHRUYOVSCWXZWLVTGQI","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":"026ed6c572378cce834afa83936b7f5cac85380bb7f8fc013ed93f3f22739d23","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:58:03Z","title_canon_sha256":"bc2e546cf67e75fe4ad045984e44d20c9e59d178b78c1179462a2e16c05b22cc"},"schema_version":"1.0","source":{"id":"1011.5124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5124","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5124v1","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5124","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"4SC4ZB3GHRUY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4SC4ZB3GHRUYOVSC","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4SC4ZB3G","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:dfb1ef302408d51a508b5f05c454313adc6cbdc70a0adbf3fbf0e781dbf97c78","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":"Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in order to optimize performance of such networks, however proposed algorithms result in large transmission delays. In this paper, we will analyze delay in random access multi-hop networks and solve the delay-constrained utility maximization problem. We define the network utility as a combination of rate utility and energy cost functions and solve the following t","authors_text":"Amir M. Khodaian, Babak H. Khalaj","cross_cats":["cs.NI","cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:58:03Z","title":"Delay Constrained Utility Maximization in Multihop Random Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5124","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:63e7f5ac13f85f8b80ba56ca1d503ffcfe5e9dd981ba9cd9335d06bfc8c64b9b","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":"026ed6c572378cce834afa83936b7f5cac85380bb7f8fc013ed93f3f22739d23","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-23T14:58:03Z","title_canon_sha256":"bc2e546cf67e75fe4ad045984e44d20c9e59d178b78c1179462a2e16c05b22cc"},"schema_version":"1.0","source":{"id":"1011.5124","kind":"arxiv","version":1}},"canonical_sha256":"e485cc87663c69875642b5f365d6668203bbf50bc2e039617e69012fff3d8482","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e485cc87663c69875642b5f365d6668203bbf50bc2e039617e69012fff3d8482","first_computed_at":"2026-05-18T04:34:54.761362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:54.761362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"//SZaBurI8H6yob++AAXZqhHQ9WtUTJcexxAWVkC8XK9aCoV9CXnf3+sZVOAZDtx1tVsVcSq4Uk725u9UOhpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:54.761744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63e7f5ac13f85f8b80ba56ca1d503ffcfe5e9dd981ba9cd9335d06bfc8c64b9b","sha256:dfb1ef302408d51a508b5f05c454313adc6cbdc70a0adbf3fbf0e781dbf97c78"],"state_sha256":"1e93646becedd4bed71a3c1f60df25a025a2a7564134e64d15c2b623344066b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxFKHlXX13eTZJj+4SZZYIIdAT0FCQ1SaFoz5Jmi3Tp+7e8H2+iuaOtiNDNKqEqQmfcyNscAg+cfVXRLcy08DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:22:36.971330Z","bundle_sha256":"9d7bd4820b7e357f48f42ec144590c8857f3029a14c9dcd9b4b28e33d6a2feae"}}