{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KY6MYLNWNRHK6RS5PUVYYPSFQZ","short_pith_number":"pith:KY6MYLNW","schema_version":"1.0","canonical_sha256":"563ccc2db66c4eaf465d7d2b8c3e45864119f42a0887adfa0a13ade7f3c673ce","source":{"kind":"arxiv","id":"1601.07932","version":2},"attestation_state":"computed","paper":{"title":"Information-Theoretic Lower Bounds for Recovery of Diffusion Network Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean Honorio, Keehwan Park","submitted_at":"2016-01-28T22:12:06Z","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 "},"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":"1601.07932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-28T22:12:06Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"f623e2a845399e0876499616e458fd377d3385bca79bc5ea13cb1db3c359a0d8","abstract_canon_sha256":"32ad5b6093c3b61c65e46bd91916e95b57ad3f6208587d4e8a65e319111b6011"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.329989Z","signature_b64":"z04itoxaEq89JRhINytIQrR2UqjNuRvD7W4aIbieWsMp4SqSkeWBflrgL6GKDeoTYmy8+VQpazoPozU+XSgMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"563ccc2db66c4eaf465d7d2b8c3e45864119f42a0887adfa0a13ade7f3c673ce","last_reissued_at":"2026-05-17T23:45:10.329329Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.329329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-Theoretic Lower Bounds for Recovery of Diffusion Network Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean Honorio, Keehwan Park","submitted_at":"2016-01-28T22:12:06Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07932","kind":"arxiv","version":2},"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":"1601.07932","created_at":"2026-05-17T23:45:10.329430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07932v2","created_at":"2026-05-17T23:45:10.329430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07932","created_at":"2026-05-17T23:45:10.329430+00:00"},{"alias_kind":"pith_short_12","alias_value":"KY6MYLNWNRHK","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KY6MYLNWNRHK6RS5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KY6MYLNW","created_at":"2026-05-18T12:30:29.479603+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/KY6MYLNWNRHK6RS5PUVYYPSFQZ","json":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ.json","graph_json":"https://pith.science/api/pith-number/KY6MYLNWNRHK6RS5PUVYYPSFQZ/graph.json","events_json":"https://pith.science/api/pith-number/KY6MYLNWNRHK6RS5PUVYYPSFQZ/events.json","paper":"https://pith.science/paper/KY6MYLNW"},"agent_actions":{"view_html":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ","download_json":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ.json","view_paper":"https://pith.science/paper/KY6MYLNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07932&json=true","fetch_graph":"https://pith.science/api/pith-number/KY6MYLNWNRHK6RS5PUVYYPSFQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KY6MYLNWNRHK6RS5PUVYYPSFQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/action/storage_attestation","attest_author":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/action/author_attestation","sign_citation":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/action/citation_signature","submit_replication":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/action/replication_record"}},"created_at":"2026-05-17T23:45:10.329430+00:00","updated_at":"2026-05-17T23:45:10.329430+00:00"}