{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4JEV3YCFAO2WCZNWU67CUKEBYZ","short_pith_number":"pith:4JEV3YCF","canonical_record":{"source":{"id":"1010.4499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-21T15:32:03Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"be209bcd46f65971d67b5e1d4762e4ee4c39fa6b6d6aac0563d58e0509e89ceb","abstract_canon_sha256":"d25cc713a1cf869d82ab803fc5d2c2f9499583f03ffb747521ed5db39865cc91"},"schema_version":"1.0"},"canonical_sha256":"e2495de04503b56165b6a7be2a2881c668b80267607984c2b8aaa8d69eebec35","source":{"kind":"arxiv","id":"1010.4499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.4499","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1010.4499v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4499","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"4JEV3YCFAO2W","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4JEV3YCFAO2WCZNW","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4JEV3YCF","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4JEV3YCFAO2WCZNWU67CUKEBYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1010.4499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-21T15:32:03Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"be209bcd46f65971d67b5e1d4762e4ee4c39fa6b6d6aac0563d58e0509e89ceb","abstract_canon_sha256":"d25cc713a1cf869d82ab803fc5d2c2f9499583f03ffb747521ed5db39865cc91"},"schema_version":"1.0"},"canonical_sha256":"e2495de04503b56165b6a7be2a2881c668b80267607984c2b8aaa8d69eebec35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.898601Z","signature_b64":"C/5NY9ahxFnRZciOhNpS9e7EdW+9fbY3kW2uhIHWFyTi591rkZR8R+p4GRcuiml+++CFFO0FjpWcOmcdKviBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2495de04503b56165b6a7be2a2881c668b80267607984c2b8aaa8d69eebec35","last_reissued_at":"2026-05-18T00:58:43.898069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.898069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.4499","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLfbHyHfKY6LnmyM9YqpmRC67dtgMGHycAhj6gsg3BAXqOstX5rfuolqGD3DXZMTq2DpAo9c0QtDhCQNs9VcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:32:38.573242Z"},"content_sha256":"8c0d8220750524466dd97dec98eff9ff3edf34b0c96a3531d7f39d7b3a32112c","schema_version":"1.0","event_id":"sha256:8c0d8220750524466dd97dec98eff9ff3edf34b0c96a3531d7f39d7b3a32112c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4JEV3YCFAO2WCZNWU67CUKEBYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Are Hj{\\o}rungnes, Merouane Debbah, Tamer Basar, Walid Saad, Zhu Han","submitted_at":"2010-10-21T15:32:03Z","abstract_excerpt":"Autonomous wireless agents such as unmanned aerial vehicles or mobile base stations present a great potential for deployment in next-generation wireless networks. While current literature has been mainly focused on the use of agents within robotics or software applications, we propose a novel usage model for self-organizing agents suited to wireless networks. In the proposed model, a number of agents are required to collect data from several arbitrarily located tasks. Each task represents a queue of packets that require collection and subsequent wireless transmission by the agents to a central"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4499","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIx9Xb1r6XYvOen5sLVU1bP8k9V3GWtsf8Kl/63U9V1z84qkzv6pVxXltXIVGwaczxt3UPqsReMCixo7z1mmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:32:38.573834Z"},"content_sha256":"73f1110fab3ccd7ca45e9ceb38aa12b54a04a0fd356debd8c63680517910a5f8","schema_version":"1.0","event_id":"sha256:73f1110fab3ccd7ca45e9ceb38aa12b54a04a0fd356debd8c63680517910a5f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ/bundle.json","state_url":"https://pith.science/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ/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-31T15:32:38Z","links":{"resolver":"https://pith.science/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ","bundle":"https://pith.science/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ/bundle.json","state":"https://pith.science/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JEV3YCFAO2WCZNWU67CUKEBYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4JEV3YCFAO2WCZNWU67CUKEBYZ","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":"d25cc713a1cf869d82ab803fc5d2c2f9499583f03ffb747521ed5db39865cc91","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-21T15:32:03Z","title_canon_sha256":"be209bcd46f65971d67b5e1d4762e4ee4c39fa6b6d6aac0563d58e0509e89ceb"},"schema_version":"1.0","source":{"id":"1010.4499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.4499","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1010.4499v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4499","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"4JEV3YCFAO2W","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4JEV3YCFAO2WCZNW","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4JEV3YCF","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:73f1110fab3ccd7ca45e9ceb38aa12b54a04a0fd356debd8c63680517910a5f8","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"Autonomous wireless agents such as unmanned aerial vehicles or mobile base stations present a great potential for deployment in next-generation wireless networks. While current literature has been mainly focused on the use of agents within robotics or software applications, we propose a novel usage model for self-organizing agents suited to wireless networks. In the proposed model, a number of agents are required to collect data from several arbitrarily located tasks. Each task represents a queue of packets that require collection and subsequent wireless transmission by the agents to a central","authors_text":"Are Hj{\\o}rungnes, Merouane Debbah, Tamer Basar, Walid Saad, Zhu Han","cross_cats":["cs.GT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-21T15:32:03Z","title":"Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4499","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:8c0d8220750524466dd97dec98eff9ff3edf34b0c96a3531d7f39d7b3a32112c","target":"record","created_at":"2026-05-18T00:58:43Z","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":"d25cc713a1cf869d82ab803fc5d2c2f9499583f03ffb747521ed5db39865cc91","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-21T15:32:03Z","title_canon_sha256":"be209bcd46f65971d67b5e1d4762e4ee4c39fa6b6d6aac0563d58e0509e89ceb"},"schema_version":"1.0","source":{"id":"1010.4499","kind":"arxiv","version":1}},"canonical_sha256":"e2495de04503b56165b6a7be2a2881c668b80267607984c2b8aaa8d69eebec35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2495de04503b56165b6a7be2a2881c668b80267607984c2b8aaa8d69eebec35","first_computed_at":"2026-05-18T00:58:43.898069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.898069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C/5NY9ahxFnRZciOhNpS9e7EdW+9fbY3kW2uhIHWFyTi591rkZR8R+p4GRcuiml+++CFFO0FjpWcOmcdKviBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.898601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.4499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c0d8220750524466dd97dec98eff9ff3edf34b0c96a3531d7f39d7b3a32112c","sha256:73f1110fab3ccd7ca45e9ceb38aa12b54a04a0fd356debd8c63680517910a5f8"],"state_sha256":"68ede59b561f3f3a4df6d76491a4db4498d620f369eed12fcbc30023a755536a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhxWgTUSRzXYmeZbYJvc3aueJnVZ+M7wgGlOYpGYcKQNVXH4wBuRCJpXksQuychB5W+Grmg/dDLPUng5No1tAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:32:38.577360Z","bundle_sha256":"8eabdea3b05509a0ae77e7d502c04e1292518aa16845526105ce116b92f78465"}}