{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6TIJXN7GWZ763XXSYJSIYIGXLP","short_pith_number":"pith:6TIJXN7G","canonical_record":{"source":{"id":"1111.6691","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-29T04:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"92aa8525aa0a65605884419402fd7584fb5dd1b5c8020737a924201d965e8eed","abstract_canon_sha256":"da220e5f394b00dc671930068a31f9ec1a54e2977f7dd6736ba721834f3f5c92"},"schema_version":"1.0"},"canonical_sha256":"f4d09bb7e6b67feddef2c2648c20d75bca6ada39140bb51c7ab857cb896ee486","source":{"kind":"arxiv","id":"1111.6691","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6691","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6691v4","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6691","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"6TIJXN7GWZ76","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6TIJXN7GWZ763XXS","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6TIJXN7G","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6TIJXN7GWZ763XXSYJSIYIGXLP","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6691","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-29T04:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"92aa8525aa0a65605884419402fd7584fb5dd1b5c8020737a924201d965e8eed","abstract_canon_sha256":"da220e5f394b00dc671930068a31f9ec1a54e2977f7dd6736ba721834f3f5c92"},"schema_version":"1.0"},"canonical_sha256":"f4d09bb7e6b67feddef2c2648c20d75bca6ada39140bb51c7ab857cb896ee486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.911883Z","signature_b64":"sLwxW7JCqGGTUFvKCINnqyfgNvD3DN++3ns4IQ0Bp/KmiTA/U+zsR+R1rIQYqZFSIfymRux8HhquclUxh8qTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4d09bb7e6b67feddef2c2648c20d75bca6ada39140bb51c7ab857cb896ee486","last_reissued_at":"2026-05-18T00:55:58.911310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.911310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6691","source_version":4,"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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lil37UTbgZNgQZFvvDBpVafVD196s62/qB0+F5+y8HQJTOGqlzk5xcDnntr12XmQNRjk89/Pvx1bPlgFZ1+UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:46:21.278427Z"},"content_sha256":"48116b7b1484f6364c5ef81dbd52ee68d21abb5886d1c9e2e3b12f99812f063e","schema_version":"1.0","event_id":"sha256:48116b7b1484f6364c5ef81dbd52ee68d21abb5886d1c9e2e3b12f99812f063e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6TIJXN7GWZ763XXSYJSIYIGXLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Albert Sunny, Joy Kuri, Nachiket Sahasrabudhe","submitted_at":"2011-11-29T04:48:36Z","abstract_excerpt":"In this paper, we study the performance of greedy scheduling in multihop wireless networks, where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. The dual can be solved optimally, only with the knowledge of the maximal independent sets in the network. But computation of maximal independent sets is known to be NP-hard. Motivated by this, we propose a distributed greedy heuristic to address the problem of link scheduling. We evaluate the effect of the distributed greedy heuristic on aggregate utility maxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6691","kind":"arxiv","version":4},"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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UNqIrtEJnsfE1fC14WeBEjBXYgiAp8uxr65BirLRnxOhl4sd0aSvgfD7LAB97Y/JH3ya9UIpducrayj9/CjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:46:21.278801Z"},"content_sha256":"9e670727b0985b0e590e115f9166ec652249233eab7ef377309b7471321a8391","schema_version":"1.0","event_id":"sha256:9e670727b0985b0e590e115f9166ec652249233eab7ef377309b7471321a8391"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TIJXN7GWZ763XXSYJSIYIGXLP/bundle.json","state_url":"https://pith.science/pith/6TIJXN7GWZ763XXSYJSIYIGXLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TIJXN7GWZ763XXSYJSIYIGXLP/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-23T21:46:21Z","links":{"resolver":"https://pith.science/pith/6TIJXN7GWZ763XXSYJSIYIGXLP","bundle":"https://pith.science/pith/6TIJXN7GWZ763XXSYJSIYIGXLP/bundle.json","state":"https://pith.science/pith/6TIJXN7GWZ763XXSYJSIYIGXLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TIJXN7GWZ763XXSYJSIYIGXLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6TIJXN7GWZ763XXSYJSIYIGXLP","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":"da220e5f394b00dc671930068a31f9ec1a54e2977f7dd6736ba721834f3f5c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-29T04:48:36Z","title_canon_sha256":"92aa8525aa0a65605884419402fd7584fb5dd1b5c8020737a924201d965e8eed"},"schema_version":"1.0","source":{"id":"1111.6691","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6691","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6691v4","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6691","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"6TIJXN7GWZ76","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6TIJXN7GWZ763XXS","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6TIJXN7G","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:9e670727b0985b0e590e115f9166ec652249233eab7ef377309b7471321a8391","target":"graph","created_at":"2026-05-18T00:55:58Z","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 study the performance of greedy scheduling in multihop wireless networks, where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. The dual can be solved optimally, only with the knowledge of the maximal independent sets in the network. But computation of maximal independent sets is known to be NP-hard. Motivated by this, we propose a distributed greedy heuristic to address the problem of link scheduling. We evaluate the effect of the distributed greedy heuristic on aggregate utility maxim","authors_text":"Albert Sunny, Joy Kuri, Nachiket Sahasrabudhe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-29T04:48:36Z","title":"Approximate Aggregate Utility Maximization in Multi-Hop Wireless Networks using Distributed Greedy Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6691","kind":"arxiv","version":4},"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:48116b7b1484f6364c5ef81dbd52ee68d21abb5886d1c9e2e3b12f99812f063e","target":"record","created_at":"2026-05-18T00:55:58Z","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":"da220e5f394b00dc671930068a31f9ec1a54e2977f7dd6736ba721834f3f5c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-11-29T04:48:36Z","title_canon_sha256":"92aa8525aa0a65605884419402fd7584fb5dd1b5c8020737a924201d965e8eed"},"schema_version":"1.0","source":{"id":"1111.6691","kind":"arxiv","version":4}},"canonical_sha256":"f4d09bb7e6b67feddef2c2648c20d75bca6ada39140bb51c7ab857cb896ee486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4d09bb7e6b67feddef2c2648c20d75bca6ada39140bb51c7ab857cb896ee486","first_computed_at":"2026-05-18T00:55:58.911310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:58.911310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sLwxW7JCqGGTUFvKCINnqyfgNvD3DN++3ns4IQ0Bp/KmiTA/U+zsR+R1rIQYqZFSIfymRux8HhquclUxh8qTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:58.911883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6691","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48116b7b1484f6364c5ef81dbd52ee68d21abb5886d1c9e2e3b12f99812f063e","sha256:9e670727b0985b0e590e115f9166ec652249233eab7ef377309b7471321a8391"],"state_sha256":"95cd43cf2fa855df0932ae29a326cde2ea2ab5a8729f895cfd1fd6bae3f0d0a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jaBBA15TOhmRtVRg9MITdeMF9r1vySZ58jQLVAZTBKCDLcoK1VrIUyB8FyAsFjD0rEJH5ZAXoq6uF9h3aweuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:46:21.280859Z","bundle_sha256":"79791b756a726df7e6bc1e188fa3e27a7baafbb9d940a1611f9eb66a0e79de8d"}}