{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ROKCXGB7KGBKOD7B7EVEYC47FO","short_pith_number":"pith:ROKCXGB7","schema_version":"1.0","canonical_sha256":"8b942b983f5182a70fe1f92a4c0b9f2b9753ce5c06424d1d6d514af6fd2122c5","source":{"kind":"arxiv","id":"1809.00418","version":1},"attestation_state":"computed","paper":{"title":"Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks With Social Relationships","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","math.IT"],"primary_cat":"cs.IT","authors_text":"Cheol Jeong, Won-Yong Shin","submitted_at":"2018-09-03T00:58:13Z","abstract_excerpt":"In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput--delay trade-off for a large wireless ad hoc network formed in the context of social relationships. Instead of randomly picking source--destination pairings, we first consider a distance-based social formation model characterized by the social group density $\\gamma$ and the number of social contacts per node, $q$, where the probability that any two nodes in distance $d$ away from each other are socially connected is assumed to be proportional to $d^{-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.00418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-03T00:58:13Z","cross_cats_sorted":["cs.NI","cs.SI","math.IT"],"title_canon_sha256":"a6ac9c6de14ff75b62b48097d772cc9b85e0786705512f5c1df609d4e9a22f46","abstract_canon_sha256":"7edd0303829f899dcccefdd1701eafd0f6e2094131ea2db448ed3710289d826d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:35.267235Z","signature_b64":"jsIeGYv+K3S3vXAybJz6PTTchP7YMDdC7iizKby4IE8jIUiZgfcFXW5zBrQQmm6yaHdG6LQ/YoXgAFahcpIZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b942b983f5182a70fe1f92a4c0b9f2b9753ce5c06424d1d6d514af6fd2122c5","last_reissued_at":"2026-05-18T00:06:35.266700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:35.266700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks With Social Relationships","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","math.IT"],"primary_cat":"cs.IT","authors_text":"Cheol Jeong, Won-Yong Shin","submitted_at":"2018-09-03T00:58:13Z","abstract_excerpt":"In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput--delay trade-off for a large wireless ad hoc network formed in the context of social relationships. Instead of randomly picking source--destination pairings, we first consider a distance-based social formation model characterized by the social group density $\\gamma$ and the number of social contacts per node, $q$, where the probability that any two nodes in distance $d$ away from each other are socially connected is assumed to be proportional to $d^{-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00418","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.00418","created_at":"2026-05-18T00:06:35.266785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00418v1","created_at":"2026-05-18T00:06:35.266785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00418","created_at":"2026-05-18T00:06:35.266785+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROKCXGB7KGBK","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROKCXGB7KGBKOD7B","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROKCXGB7","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO","json":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO.json","graph_json":"https://pith.science/api/pith-number/ROKCXGB7KGBKOD7B7EVEYC47FO/graph.json","events_json":"https://pith.science/api/pith-number/ROKCXGB7KGBKOD7B7EVEYC47FO/events.json","paper":"https://pith.science/paper/ROKCXGB7"},"agent_actions":{"view_html":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO","download_json":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO.json","view_paper":"https://pith.science/paper/ROKCXGB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00418&json=true","fetch_graph":"https://pith.science/api/pith-number/ROKCXGB7KGBKOD7B7EVEYC47FO/graph.json","fetch_events":"https://pith.science/api/pith-number/ROKCXGB7KGBKOD7B7EVEYC47FO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO/action/storage_attestation","attest_author":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO/action/author_attestation","sign_citation":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO/action/citation_signature","submit_replication":"https://pith.science/pith/ROKCXGB7KGBKOD7B7EVEYC47FO/action/replication_record"}},"created_at":"2026-05-18T00:06:35.266785+00:00","updated_at":"2026-05-18T00:06:35.266785+00:00"}