{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KY6MYLNWNRHK6RS5PUVYYPSFQZ","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":"32ad5b6093c3b61c65e46bd91916e95b57ad3f6208587d4e8a65e319111b6011","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-28T22:12:06Z","title_canon_sha256":"f623e2a845399e0876499616e458fd377d3385bca79bc5ea13cb1db3c359a0d8"},"schema_version":"1.0","source":{"id":"1601.07932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07932","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07932v2","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07932","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"KY6MYLNWNRHK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KY6MYLNWNRHK6RS5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KY6MYLNW","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:30e74b07a227bc983fe12b763bd8570d1fa96de26dddaa7f7360e5fe5f7ba959","target":"graph","created_at":"2026-05-17T23:45:10Z","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":"We study the information-theoretic lower bound of the sample complexity of the correct recovery of diffusion network structures. We introduce a discrete-time diffusion model based on the Independent Cascade model for which we obtain a lower bound of order $\\Omega(k \\log p)$, for directed graphs of $p$ nodes, and at most $k$ parents per node. Next, we introduce a continuous-time diffusion model, for which a similar lower bound of order $\\Omega(k \\log p)$ is obtained. Our results show that the algorithm of Pouget-Abadie et al. is statistically optimal for the discrete-time regime. Our work also ","authors_text":"Jean Honorio, Keehwan Park","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-28T22:12:06Z","title":"Information-Theoretic Lower Bounds for Recovery of Diffusion Network Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07932","kind":"arxiv","version":2},"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:7ec21eab4c953d4f50d08fac4c84952f33fac322e7b478f0615b41332e7c1c94","target":"record","created_at":"2026-05-17T23:45:10Z","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":"32ad5b6093c3b61c65e46bd91916e95b57ad3f6208587d4e8a65e319111b6011","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-28T22:12:06Z","title_canon_sha256":"f623e2a845399e0876499616e458fd377d3385bca79bc5ea13cb1db3c359a0d8"},"schema_version":"1.0","source":{"id":"1601.07932","kind":"arxiv","version":2}},"canonical_sha256":"563ccc2db66c4eaf465d7d2b8c3e45864119f42a0887adfa0a13ade7f3c673ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"563ccc2db66c4eaf465d7d2b8c3e45864119f42a0887adfa0a13ade7f3c673ce","first_computed_at":"2026-05-17T23:45:10.329329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.329329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z04itoxaEq89JRhINytIQrR2UqjNuRvD7W4aIbieWsMp4SqSkeWBflrgL6GKDeoTYmy8+VQpazoPozU+XSgMDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.329989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ec21eab4c953d4f50d08fac4c84952f33fac322e7b478f0615b41332e7c1c94","sha256:30e74b07a227bc983fe12b763bd8570d1fa96de26dddaa7f7360e5fe5f7ba959"],"state_sha256":"1ac7c0284dec7f9606fb248f95a950e21a9968b2b73407d5a45c6f8ce10d03cb"}