{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KY6MYLNWNRHK6RS5PUVYYPSFQZ","short_pith_number":"pith:KY6MYLNW","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"},"canonical_sha256":"563ccc2db66c4eaf465d7d2b8c3e45864119f42a0887adfa0a13ade7f3c673ce","source":{"kind":"arxiv","id":"1601.07932","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KY6MYLNWNRHK6RS5PUVYYPSFQZ","target":"record","payload":{"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"},"canonical_sha256":"563ccc2db66c4eaf465d7d2b8c3e45864119f42a0887adfa0a13ade7f3c673ce","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"},"source_kind":"arxiv","source_id":"1601.07932","source_version":2,"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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hU+vUalFFFk7JwAQ2Cm00sQGdeINqYWPIBdMGW32AqnWbPeuNwEvSQT3CMIct6U6v8E33ROAG8y4aN+SZ67lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:35:01.544124Z"},"content_sha256":"7ec21eab4c953d4f50d08fac4c84952f33fac322e7b478f0615b41332e7c1c94","schema_version":"1.0","event_id":"sha256:7ec21eab4c953d4f50d08fac4c84952f33fac322e7b478f0615b41332e7c1c94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KY6MYLNWNRHK6RS5PUVYYPSFQZ","target":"graph","payload":{"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"},"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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzA/8Tzyg7ylmiOLflEfDOI6uDgWHp8vE5iqo67gHKgXC2p/YQ4eASxDwRJr3MoRot1UxyXJfGJgQSwL4H8mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:35:01.544485Z"},"content_sha256":"30e74b07a227bc983fe12b763bd8570d1fa96de26dddaa7f7360e5fe5f7ba959","schema_version":"1.0","event_id":"sha256:30e74b07a227bc983fe12b763bd8570d1fa96de26dddaa7f7360e5fe5f7ba959"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/bundle.json","state_url":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/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-30T10:35:01Z","links":{"resolver":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ","bundle":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/bundle.json","state":"https://pith.science/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KY6MYLNWNRHK6RS5PUVYYPSFQZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9obB2cyfGKCDRQHTkIbKkWEfR0jQ2fYDBKCcIsYggDitF4Suce6NcwWcvGotDZEMSM3vXPywyyg4SSr8y8fECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T10:35:01.546348Z","bundle_sha256":"0b4b701bb64c1563792b09ddf88e7d9f058f4e8c0df9807391e425d47327ba63"}}