{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QSMQNA2NH7ETWALTBHYPYDCINK","short_pith_number":"pith:QSMQNA2N","canonical_record":{"source":{"id":"1710.04765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-13T01:04:30Z","cross_cats_sorted":["cs.SI","stat.TH"],"title_canon_sha256":"58482c95fbab94ea3c30b5344998a492410d2e6030adc62ccac0fe9a08ff3d13","abstract_canon_sha256":"6f24ca24093f5953ae2e5e82724d09f4af7408cc12b1cf68573fb5db2a69951e"},"schema_version":"1.0"},"canonical_sha256":"849906834d3fc93b017309f0fc0c486a8d1f831f4a11def3f96aca0c89bb52e5","source":{"kind":"arxiv","id":"1710.04765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04765","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04765v2","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04765","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"QSMQNA2NH7ET","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QSMQNA2NH7ETWALT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QSMQNA2N","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QSMQNA2NH7ETWALTBHYPYDCINK","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-13T01:04:30Z","cross_cats_sorted":["cs.SI","stat.TH"],"title_canon_sha256":"58482c95fbab94ea3c30b5344998a492410d2e6030adc62ccac0fe9a08ff3d13","abstract_canon_sha256":"6f24ca24093f5953ae2e5e82724d09f4af7408cc12b1cf68573fb5db2a69951e"},"schema_version":"1.0"},"canonical_sha256":"849906834d3fc93b017309f0fc0c486a8d1f831f4a11def3f96aca0c89bb52e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.104926Z","signature_b64":"asohBUmhsjXnzuEpntnngmOniZEKMOGoIJF7WRSVDQ16yTd12n6j6m16JMHo3k3ou70CrOGueNFzvulb2oo8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"849906834d3fc93b017309f0fc0c486a8d1f831f4a11def3f96aca0c89bb52e5","last_reissued_at":"2026-05-17T23:58:50.104323Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.104323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04765","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:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pSN5YIJePKqBFwbs7qRUvVdlj23AgKZSxpx+U39De/MXvmkFwfwWfwFNvpjC0hdnvZpMB4uZkXfzui/Ci2vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:17:18.604120Z"},"content_sha256":"577497f53db6bdecf50a21ef8293225c5178aa6a467c9b98e7f6946c04f72077","schema_version":"1.0","event_id":"sha256:577497f53db6bdecf50a21ef8293225c5178aa6a467c9b98e7f6946c04f72077"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QSMQNA2NH7ETWALTBHYPYDCINK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating a network from multiple noisy realizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.TH"],"primary_cat":"math.ST","authors_text":"Can M. Le, Elizaveta Levina, Keith Levin","submitted_at":"2017-10-13T01:04:30Z","abstract_excerpt":"Complex interactions between entities are often represented as edges in a network. In practice, the network is often constructed from noisy measurements and inevitably contains some errors. In this paper we consider the problem of estimating a network from multiple noisy observations where edges of the original network are recorded with both false positives and false negatives. This problem is motivated by neuroimaging applications where brain networks of a group of patients with a particular brain condition could be viewed as noisy versions of an unobserved true network corresponding to the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04765","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:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q670rZc0/26pCOioWI8Eg1GDBE3iwjkBHntNMOtcdnjO6MSrOgDLzV8Gy5CvtY7hjc0zrAS2gPGTpExGJPoJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:17:18.604491Z"},"content_sha256":"a52fddb9af737a959c2d3aa542c0eba5a6c7871d2f198a6a8ab45bb5077492bf","schema_version":"1.0","event_id":"sha256:a52fddb9af737a959c2d3aa542c0eba5a6c7871d2f198a6a8ab45bb5077492bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSMQNA2NH7ETWALTBHYPYDCINK/bundle.json","state_url":"https://pith.science/pith/QSMQNA2NH7ETWALTBHYPYDCINK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSMQNA2NH7ETWALTBHYPYDCINK/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-05T02:17:18Z","links":{"resolver":"https://pith.science/pith/QSMQNA2NH7ETWALTBHYPYDCINK","bundle":"https://pith.science/pith/QSMQNA2NH7ETWALTBHYPYDCINK/bundle.json","state":"https://pith.science/pith/QSMQNA2NH7ETWALTBHYPYDCINK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSMQNA2NH7ETWALTBHYPYDCINK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QSMQNA2NH7ETWALTBHYPYDCINK","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":"6f24ca24093f5953ae2e5e82724d09f4af7408cc12b1cf68573fb5db2a69951e","cross_cats_sorted":["cs.SI","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-13T01:04:30Z","title_canon_sha256":"58482c95fbab94ea3c30b5344998a492410d2e6030adc62ccac0fe9a08ff3d13"},"schema_version":"1.0","source":{"id":"1710.04765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04765","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04765v2","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04765","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"QSMQNA2NH7ET","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QSMQNA2NH7ETWALT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QSMQNA2N","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:a52fddb9af737a959c2d3aa542c0eba5a6c7871d2f198a6a8ab45bb5077492bf","target":"graph","created_at":"2026-05-17T23:58:50Z","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":"Complex interactions between entities are often represented as edges in a network. In practice, the network is often constructed from noisy measurements and inevitably contains some errors. In this paper we consider the problem of estimating a network from multiple noisy observations where edges of the original network are recorded with both false positives and false negatives. This problem is motivated by neuroimaging applications where brain networks of a group of patients with a particular brain condition could be viewed as noisy versions of an unobserved true network corresponding to the d","authors_text":"Can M. Le, Elizaveta Levina, Keith Levin","cross_cats":["cs.SI","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-13T01:04:30Z","title":"Estimating a network from multiple noisy realizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04765","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:577497f53db6bdecf50a21ef8293225c5178aa6a467c9b98e7f6946c04f72077","target":"record","created_at":"2026-05-17T23:58:50Z","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":"6f24ca24093f5953ae2e5e82724d09f4af7408cc12b1cf68573fb5db2a69951e","cross_cats_sorted":["cs.SI","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-13T01:04:30Z","title_canon_sha256":"58482c95fbab94ea3c30b5344998a492410d2e6030adc62ccac0fe9a08ff3d13"},"schema_version":"1.0","source":{"id":"1710.04765","kind":"arxiv","version":2}},"canonical_sha256":"849906834d3fc93b017309f0fc0c486a8d1f831f4a11def3f96aca0c89bb52e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"849906834d3fc93b017309f0fc0c486a8d1f831f4a11def3f96aca0c89bb52e5","first_computed_at":"2026-05-17T23:58:50.104323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:50.104323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"asohBUmhsjXnzuEpntnngmOniZEKMOGoIJF7WRSVDQ16yTd12n6j6m16JMHo3k3ou70CrOGueNFzvulb2oo8Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:50.104926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:577497f53db6bdecf50a21ef8293225c5178aa6a467c9b98e7f6946c04f72077","sha256:a52fddb9af737a959c2d3aa542c0eba5a6c7871d2f198a6a8ab45bb5077492bf"],"state_sha256":"82139a4325e8e6ff568a10361a38e0d2042f4437e25a563bd563d974a5431a07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dvWdRnw2/56lwkST7gjoOryihOhCrS+EviXFJwTVztlQT5qRiGMV3vRuMyWKf54ZxUcecl4nRifwVyzcQzJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:17:18.606636Z","bundle_sha256":"2dc0c89e436cc853a6341f2febe063626729a3089a4022c2dd69a4a7e3df918b"}}