{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V7SBBW7GDVCOUYCXZN3N6NMWB2","short_pith_number":"pith:V7SBBW7G","schema_version":"1.0","canonical_sha256":"afe410dbe61d44ea6057cb76df35960ea1f802c05c92feeb46214b7f29dc91fd","source":{"kind":"arxiv","id":"1705.09751","version":1},"attestation_state":"computed","paper":{"title":"On the Capacity of Fractal Wireless Networks With Direct Social Interactions","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-05-27T01:33:30Z","abstract_excerpt":"The capacity of a fractal wireless network with direct social interactions is studied in this paper. Specifically, we mathematically formulate the self-similarity of a fractal wireless network by a power-law degree distribution $ P(k) $, and we capture the connection feature between two nodes with degree $ k_{1} $ and $ k_{2} $ by a joint probability distribution $ P(k_{1},k_{2}) $. It is proved that if the source node communicates with one of its direct contacts randomly, the maximum capacity is consistent with the classical result $ \\Theta\\left(\\frac{1}{\\sqrt{n\\log n}}\\right) $ achieved by K"},"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":"1705.09751","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-05-27T01:33:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d825a2e52a18d3bb5ff467230a1be173678dbecbe7c24c76427d789e8c9a13b3","abstract_canon_sha256":"b3a43c5ebdd1d76d2606018d029e5e4fd3fdacf6698409bfde287863817b2780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:34.568838Z","signature_b64":"NB9JdS7wufoWV6beEDm0YYLMN/BiuJpYuQ/4IvxKdgWxO9jI5x5j8UQYxQU8FErutYX3QC7YzODW/77JpXaqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afe410dbe61d44ea6057cb76df35960ea1f802c05c92feeb46214b7f29dc91fd","last_reissued_at":"2026-05-18T00:43:34.568291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:34.568291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of Fractal Wireless Networks With Direct Social Interactions","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-05-27T01:33:30Z","abstract_excerpt":"The capacity of a fractal wireless network with direct social interactions is studied in this paper. Specifically, we mathematically formulate the self-similarity of a fractal wireless network by a power-law degree distribution $ P(k) $, and we capture the connection feature between two nodes with degree $ k_{1} $ and $ k_{2} $ by a joint probability distribution $ P(k_{1},k_{2}) $. It is proved that if the source node communicates with one of its direct contacts randomly, the maximum capacity is consistent with the classical result $ \\Theta\\left(\\frac{1}{\\sqrt{n\\log n}}\\right) $ achieved by K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09751","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":"1705.09751","created_at":"2026-05-18T00:43:34.568363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09751v1","created_at":"2026-05-18T00:43:34.568363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09751","created_at":"2026-05-18T00:43:34.568363+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7SBBW7GDVCO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7SBBW7GDVCOUYCX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7SBBW7G","created_at":"2026-05-18T12:31:49.984773+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/V7SBBW7GDVCOUYCXZN3N6NMWB2","json":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2.json","graph_json":"https://pith.science/api/pith-number/V7SBBW7GDVCOUYCXZN3N6NMWB2/graph.json","events_json":"https://pith.science/api/pith-number/V7SBBW7GDVCOUYCXZN3N6NMWB2/events.json","paper":"https://pith.science/paper/V7SBBW7G"},"agent_actions":{"view_html":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2","download_json":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2.json","view_paper":"https://pith.science/paper/V7SBBW7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09751&json=true","fetch_graph":"https://pith.science/api/pith-number/V7SBBW7GDVCOUYCXZN3N6NMWB2/graph.json","fetch_events":"https://pith.science/api/pith-number/V7SBBW7GDVCOUYCXZN3N6NMWB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2/action/storage_attestation","attest_author":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2/action/author_attestation","sign_citation":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2/action/citation_signature","submit_replication":"https://pith.science/pith/V7SBBW7GDVCOUYCXZN3N6NMWB2/action/replication_record"}},"created_at":"2026-05-18T00:43:34.568363+00:00","updated_at":"2026-05-18T00:43:34.568363+00:00"}