{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:INMBP6R2MNYIZMJDKPFN55KHJY","short_pith_number":"pith:INMBP6R2","schema_version":"1.0","canonical_sha256":"435817fa3a63708cb12353cadef5474e35a047672e01bc524aa823fffb4333d4","source":{"kind":"arxiv","id":"1708.04585","version":3},"attestation_state":"computed","paper":{"title":"On the Capacity of Fractal D2D Social Networks With Hierarchical Communications","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Honggang Zhang, Rongpeng Li, Ying Chen, Zhifeng Zhao","submitted_at":"2017-08-11T13:19:00Z","abstract_excerpt":"The maximum capacity of fractal D2D (device-to-device) social networks with both direct and hierarchical communications is studied in this paper. Specifically, the fractal networks are characterized by the direct social connection and the self-similarity. Firstly, for a fractal D2D social network with direct social communications, it is proved that the maximum capacity is $ \\Theta\\left(\\frac{1}{\\sqrt{n\\log n}}\\right) $ if a user communicates with one of his/her direct contacts randomly, where $ n $ denotes the total number of users in the network, and it can reach up to $ \\Theta\\left(\\frac{1}{"},"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":"1708.04585","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T13:19:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4690cd40d46c15222bac441312195c291c8cedf6ce5fd92cf9a1a623bc1f720f","abstract_canon_sha256":"b493ac174b309b6acaa2887b9a990b0cbdacecea582cf46c77d3c2bca87df9bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:23.542800Z","signature_b64":"VBMU2AjY7m528W/q2YhyPikH7Z7mcA0TKcF/IkPlH40BiXpQ6xhdk0i14XoaesKo+w5alZy3skh7gLcj6EHxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435817fa3a63708cb12353cadef5474e35a047672e01bc524aa823fffb4333d4","last_reissued_at":"2026-05-18T00:08:23.542099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:23.542099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of Fractal D2D Social Networks With Hierarchical Communications","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Honggang Zhang, Rongpeng Li, Ying Chen, Zhifeng Zhao","submitted_at":"2017-08-11T13:19:00Z","abstract_excerpt":"The maximum capacity of fractal D2D (device-to-device) social networks with both direct and hierarchical communications is studied in this paper. Specifically, the fractal networks are characterized by the direct social connection and the self-similarity. Firstly, for a fractal D2D social network with direct social communications, it is proved that the maximum capacity is $ \\Theta\\left(\\frac{1}{\\sqrt{n\\log n}}\\right) $ if a user communicates with one of his/her direct contacts randomly, where $ n $ denotes the total number of users in the network, and it can reach up to $ \\Theta\\left(\\frac{1}{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04585","kind":"arxiv","version":3},"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":"1708.04585","created_at":"2026-05-18T00:08:23.542212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04585v3","created_at":"2026-05-18T00:08:23.542212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04585","created_at":"2026-05-18T00:08:23.542212+00:00"},{"alias_kind":"pith_short_12","alias_value":"INMBP6R2MNYI","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"INMBP6R2MNYIZMJD","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"INMBP6R2","created_at":"2026-05-18T12:31:21.493067+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/INMBP6R2MNYIZMJDKPFN55KHJY","json":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY.json","graph_json":"https://pith.science/api/pith-number/INMBP6R2MNYIZMJDKPFN55KHJY/graph.json","events_json":"https://pith.science/api/pith-number/INMBP6R2MNYIZMJDKPFN55KHJY/events.json","paper":"https://pith.science/paper/INMBP6R2"},"agent_actions":{"view_html":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY","download_json":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY.json","view_paper":"https://pith.science/paper/INMBP6R2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04585&json=true","fetch_graph":"https://pith.science/api/pith-number/INMBP6R2MNYIZMJDKPFN55KHJY/graph.json","fetch_events":"https://pith.science/api/pith-number/INMBP6R2MNYIZMJDKPFN55KHJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/action/storage_attestation","attest_author":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/action/author_attestation","sign_citation":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/action/citation_signature","submit_replication":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/action/replication_record"}},"created_at":"2026-05-18T00:08:23.542212+00:00","updated_at":"2026-05-18T00:08:23.542212+00:00"}