{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:INMBP6R2MNYIZMJDKPFN55KHJY","short_pith_number":"pith:INMBP6R2","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"},"canonical_sha256":"435817fa3a63708cb12353cadef5474e35a047672e01bc524aa823fffb4333d4","source":{"kind":"arxiv","id":"1708.04585","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04585","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04585v3","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04585","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"INMBP6R2MNYI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"INMBP6R2MNYIZMJD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"INMBP6R2","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:INMBP6R2MNYIZMJDKPFN55KHJY","target":"record","payload":{"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"},"canonical_sha256":"435817fa3a63708cb12353cadef5474e35a047672e01bc524aa823fffb4333d4","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"},"source_kind":"arxiv","source_id":"1708.04585","source_version":3,"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:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ihUY4TOIyZILP4aaNSiqTqbFUUxsmPmSV0lbvg3tbRTvMUjilaZ6EeAALdh5hNHvc/3tM1VnT4+WaXFoSWkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:04:03.208104Z"},"content_sha256":"6092d4e6fada246d1a4b4f6dea121dace865e0da2e61370a8b779af8df519243","schema_version":"1.0","event_id":"sha256:6092d4e6fada246d1a4b4f6dea121dace865e0da2e61370a8b779af8df519243"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:INMBP6R2MNYIZMJDKPFN55KHJY","target":"graph","payload":{"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"},"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:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTq67oJI3ZGHjnLLJXEAhgaXSsTuUwxEOjMUxANXcevR3Lh4HZ1peAJDlq7/L8cOe8DvjzrqNwr14KXbPLTfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:04:03.208465Z"},"content_sha256":"f91c53b13ad524251f0dff12792a064c48b8b149762eef74b0e238d6fd870ae4","schema_version":"1.0","event_id":"sha256:f91c53b13ad524251f0dff12792a064c48b8b149762eef74b0e238d6fd870ae4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/bundle.json","state_url":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INMBP6R2MNYIZMJDKPFN55KHJY/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-06-04T18:04:03Z","links":{"resolver":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY","bundle":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/bundle.json","state":"https://pith.science/pith/INMBP6R2MNYIZMJDKPFN55KHJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INMBP6R2MNYIZMJDKPFN55KHJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:INMBP6R2MNYIZMJDKPFN55KHJY","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":"b493ac174b309b6acaa2887b9a990b0cbdacecea582cf46c77d3c2bca87df9bb","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T13:19:00Z","title_canon_sha256":"4690cd40d46c15222bac441312195c291c8cedf6ce5fd92cf9a1a623bc1f720f"},"schema_version":"1.0","source":{"id":"1708.04585","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04585","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04585v3","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04585","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"INMBP6R2MNYI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"INMBP6R2MNYIZMJD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"INMBP6R2","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:f91c53b13ad524251f0dff12792a064c48b8b149762eef74b0e238d6fd870ae4","target":"graph","created_at":"2026-05-18T00:08:23Z","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":"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}{","authors_text":"Honggang Zhang, Rongpeng Li, Ying Chen, Zhifeng Zhao","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T13:19:00Z","title":"On the Capacity of Fractal D2D Social Networks With Hierarchical Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04585","kind":"arxiv","version":3},"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:6092d4e6fada246d1a4b4f6dea121dace865e0da2e61370a8b779af8df519243","target":"record","created_at":"2026-05-18T00:08:23Z","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":"b493ac174b309b6acaa2887b9a990b0cbdacecea582cf46c77d3c2bca87df9bb","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-08-11T13:19:00Z","title_canon_sha256":"4690cd40d46c15222bac441312195c291c8cedf6ce5fd92cf9a1a623bc1f720f"},"schema_version":"1.0","source":{"id":"1708.04585","kind":"arxiv","version":3}},"canonical_sha256":"435817fa3a63708cb12353cadef5474e35a047672e01bc524aa823fffb4333d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"435817fa3a63708cb12353cadef5474e35a047672e01bc524aa823fffb4333d4","first_computed_at":"2026-05-18T00:08:23.542099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:23.542099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VBMU2AjY7m528W/q2YhyPikH7Z7mcA0TKcF/IkPlH40BiXpQ6xhdk0i14XoaesKo+w5alZy3skh7gLcj6EHxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:23.542800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04585","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6092d4e6fada246d1a4b4f6dea121dace865e0da2e61370a8b779af8df519243","sha256:f91c53b13ad524251f0dff12792a064c48b8b149762eef74b0e238d6fd870ae4"],"state_sha256":"4cba37e07f40c465119a5cd1e15c7271ca698aedff70bb70681be84b3dcfdfd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1ygXoP7ElV+dniy2u84aMtn/wQsGlk8ZYf+d/fQ9r8AeabN8kXs6jX5QoaM3EDZS4J+95MNMype090QYBafBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:04:03.210532Z","bundle_sha256":"d74c714cff1792ba2e61ec5857fc207c17c82427dc2f6534cb91547023e7b14f"}}