{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K72YR653R2XSJOQB3YRDVWODJI","short_pith_number":"pith:K72YR653","schema_version":"1.0","canonical_sha256":"57f588fbbb8eaf24ba01de223ad9c34a288ada678d575759948bca212c09c8c4","source":{"kind":"arxiv","id":"2008.05395","version":1},"attestation_state":"computed","paper":{"title":"User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.NI","authors_text":"Ahmedin Mohammed Ahmed, Amr Tolba, Feng Xia, Hannan Bin Liaqat, Jianhua Ma, Li Liu, Runhe Huang","submitted_at":"2020-08-09T03:45:29Z","abstract_excerpt":"Traditional ad-hoc network packet scheduling schemes cannot fulfill the requirements of proximity-based ad-hoc social networks (ASNETs) and they do not behave properly in congested environments. To address this issue, we propose a user popularity-based packet scheduling scheme for congestion control in ASNETs called Pop-aware. The proposed algorithm exploits social popularity of sender nodes to prioritize all incoming flows. Pop-aware also provides fairness of service received by each flow. We evaluate the performance of Pop-aware through a series of simulations. In comparison with some existi"},"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":"2008.05395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-08-09T03:45:29Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"260a8dadc86a6a529f84ca52588264175f4a3d94b4f019803770ef65234c8b9c","abstract_canon_sha256":"a1a9f75dd363be352027f770bd5e7e3abb597ec206e924a2384f7f50df64bde6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:46.595386Z","signature_b64":"H41g6XoYjx4BXFk2o+CRtLIjaEgY4Gye/9347xS17Jm8WYY6PBEgxeoliXJD0WWiHusL3t1DHndYIw5kTuHEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57f588fbbb8eaf24ba01de223ad9c34a288ada678d575759948bca212c09c8c4","last_reissued_at":"2026-07-05T01:26:46.594972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:46.594972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.NI","authors_text":"Ahmedin Mohammed Ahmed, Amr Tolba, Feng Xia, Hannan Bin Liaqat, Jianhua Ma, Li Liu, Runhe Huang","submitted_at":"2020-08-09T03:45:29Z","abstract_excerpt":"Traditional ad-hoc network packet scheduling schemes cannot fulfill the requirements of proximity-based ad-hoc social networks (ASNETs) and they do not behave properly in congested environments. To address this issue, we propose a user popularity-based packet scheduling scheme for congestion control in ASNETs called Pop-aware. The proposed algorithm exploits social popularity of sender nodes to prioritize all incoming flows. Pop-aware also provides fairness of service received by each flow. We evaluate the performance of Pop-aware through a series of simulations. In comparison with some existi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05395","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.05395/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.05395","created_at":"2026-07-05T01:26:46.595034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05395v1","created_at":"2026-07-05T01:26:46.595034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05395","created_at":"2026-07-05T01:26:46.595034+00:00"},{"alias_kind":"pith_short_12","alias_value":"K72YR653R2XS","created_at":"2026-07-05T01:26:46.595034+00:00"},{"alias_kind":"pith_short_16","alias_value":"K72YR653R2XSJOQB","created_at":"2026-07-05T01:26:46.595034+00:00"},{"alias_kind":"pith_short_8","alias_value":"K72YR653","created_at":"2026-07-05T01:26:46.595034+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/K72YR653R2XSJOQB3YRDVWODJI","json":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI.json","graph_json":"https://pith.science/api/pith-number/K72YR653R2XSJOQB3YRDVWODJI/graph.json","events_json":"https://pith.science/api/pith-number/K72YR653R2XSJOQB3YRDVWODJI/events.json","paper":"https://pith.science/paper/K72YR653"},"agent_actions":{"view_html":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI","download_json":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI.json","view_paper":"https://pith.science/paper/K72YR653","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05395&json=true","fetch_graph":"https://pith.science/api/pith-number/K72YR653R2XSJOQB3YRDVWODJI/graph.json","fetch_events":"https://pith.science/api/pith-number/K72YR653R2XSJOQB3YRDVWODJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI/action/storage_attestation","attest_author":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI/action/author_attestation","sign_citation":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI/action/citation_signature","submit_replication":"https://pith.science/pith/K72YR653R2XSJOQB3YRDVWODJI/action/replication_record"}},"created_at":"2026-07-05T01:26:46.595034+00:00","updated_at":"2026-07-05T01:26:46.595034+00:00"}