{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JKKI6QOG44VN7ED2DGVZW73BRP","short_pith_number":"pith:JKKI6QOG","canonical_record":{"source":{"id":"2104.14952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-04-30T12:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"bcc7587cc7d6acb7e90060a911e6e2efd7c2ae85362f168980114c58422eae8e","abstract_canon_sha256":"9076c57affc86f2df61fe451cf7e95a4bf9ed0179a0cd859e898d0f95aa2aab2"},"schema_version":"1.0"},"canonical_sha256":"4a948f41c6e72adf907a19ab9b7f618be955931ce6c0646a003cd858560372a8","source":{"kind":"arxiv","id":"2104.14952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.14952","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"2104.14952v1","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14952","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"JKKI6QOG44VN","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"pith_short_16","alias_value":"JKKI6QOG44VN7ED2","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"pith_short_8","alias_value":"JKKI6QOG","created_at":"2026-07-05T04:06:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JKKI6QOG44VN7ED2DGVZW73BRP","target":"record","payload":{"canonical_record":{"source":{"id":"2104.14952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-04-30T12:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"bcc7587cc7d6acb7e90060a911e6e2efd7c2ae85362f168980114c58422eae8e","abstract_canon_sha256":"9076c57affc86f2df61fe451cf7e95a4bf9ed0179a0cd859e898d0f95aa2aab2"},"schema_version":"1.0"},"canonical_sha256":"4a948f41c6e72adf907a19ab9b7f618be955931ce6c0646a003cd858560372a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:14.851747Z","signature_b64":"NFHHOk3a7frOisJsUYxuzgzhBIqI9TrzLS+jXQcrh8GkMun1HTI1QF+4Jvn9BpmHdXKEnCSTHxq7KPjQcT+HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a948f41c6e72adf907a19ab9b7f618be955931ce6c0646a003cd858560372a8","last_reissued_at":"2026-07-05T04:06:14.851216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:14.851216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.14952","source_version":1,"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-07-05T04:06:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7hUdXCBLn83EcBlg62ghuTZY2yJLNg+metzf7P6vJNU2Oxq+yJjVMTaw2+sIYKKS0cAShqobmpJ++scYt8zBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:18:26.147067Z"},"content_sha256":"e8b62d0732df45ab8d9c13d830adb85f7c9bf7caad1e22e51de75e4fcc3d56fa","schema_version":"1.0","event_id":"sha256:e8b62d0732df45ab8d9c13d830adb85f7c9bf7caad1e22e51de75e4fcc3d56fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JKKI6QOG44VN7ED2DGVZW73BRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Recovery from Unlabeled Noisy Samples","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Eric D. Kolaczyk, Nathaniel Josephs, Wenrui Li","submitted_at":"2021-04-30T12:34:22Z","abstract_excerpt":"There is a growing literature on the statistical analysis of multiple networks in which the network is the fundamental data object. However, most of this work requires networks on a shared set of labeled vertices. In this work, we consider the question of recovering a parent network based on noisy unlabeled samples. We identify a specific regime in the noisy network literature for recovery that is asymptotically unbiased and computationally tractable based on a three-stage recovery procedure: first, we align the networks via a sequential pairwise graph matching procedure; next, we compute the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14952","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.14952/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:06:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMP7/WybUPtwKUqbq6iNpstfWlUsiNqBSBFhjqPq/KGMhUolm7hx7lhrnmRlquvxmsAbFvVSNrPgoJvyV9QaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:18:26.147454Z"},"content_sha256":"bff1a90e82fa74561328bc8e0060bd490b896ab39807815e7b914272d38a946e","schema_version":"1.0","event_id":"sha256:bff1a90e82fa74561328bc8e0060bd490b896ab39807815e7b914272d38a946e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/bundle.json","state_url":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKKI6QOG44VN7ED2DGVZW73BRP/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-07-07T04:18:26Z","links":{"resolver":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP","bundle":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/bundle.json","state":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKKI6QOG44VN7ED2DGVZW73BRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JKKI6QOG44VN7ED2DGVZW73BRP","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":"9076c57affc86f2df61fe451cf7e95a4bf9ed0179a0cd859e898d0f95aa2aab2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-04-30T12:34:22Z","title_canon_sha256":"bcc7587cc7d6acb7e90060a911e6e2efd7c2ae85362f168980114c58422eae8e"},"schema_version":"1.0","source":{"id":"2104.14952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.14952","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"2104.14952v1","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14952","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"JKKI6QOG44VN","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"pith_short_16","alias_value":"JKKI6QOG44VN7ED2","created_at":"2026-07-05T04:06:14Z"},{"alias_kind":"pith_short_8","alias_value":"JKKI6QOG","created_at":"2026-07-05T04:06:14Z"}],"graph_snapshots":[{"event_id":"sha256:bff1a90e82fa74561328bc8e0060bd490b896ab39807815e7b914272d38a946e","target":"graph","created_at":"2026-07-05T04:06:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.14952/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There is a growing literature on the statistical analysis of multiple networks in which the network is the fundamental data object. However, most of this work requires networks on a shared set of labeled vertices. In this work, we consider the question of recovering a parent network based on noisy unlabeled samples. We identify a specific regime in the noisy network literature for recovery that is asymptotically unbiased and computationally tractable based on a three-stage recovery procedure: first, we align the networks via a sequential pairwise graph matching procedure; next, we compute the ","authors_text":"Eric D. Kolaczyk, Nathaniel Josephs, Wenrui Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-04-30T12:34:22Z","title":"Network Recovery from Unlabeled Noisy Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14952","kind":"arxiv","version":1},"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:e8b62d0732df45ab8d9c13d830adb85f7c9bf7caad1e22e51de75e4fcc3d56fa","target":"record","created_at":"2026-07-05T04:06:14Z","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":"9076c57affc86f2df61fe451cf7e95a4bf9ed0179a0cd859e898d0f95aa2aab2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-04-30T12:34:22Z","title_canon_sha256":"bcc7587cc7d6acb7e90060a911e6e2efd7c2ae85362f168980114c58422eae8e"},"schema_version":"1.0","source":{"id":"2104.14952","kind":"arxiv","version":1}},"canonical_sha256":"4a948f41c6e72adf907a19ab9b7f618be955931ce6c0646a003cd858560372a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a948f41c6e72adf907a19ab9b7f618be955931ce6c0646a003cd858560372a8","first_computed_at":"2026-07-05T04:06:14.851216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:14.851216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFHHOk3a7frOisJsUYxuzgzhBIqI9TrzLS+jXQcrh8GkMun1HTI1QF+4Jvn9BpmHdXKEnCSTHxq7KPjQcT+HCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:14.851747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.14952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8b62d0732df45ab8d9c13d830adb85f7c9bf7caad1e22e51de75e4fcc3d56fa","sha256:bff1a90e82fa74561328bc8e0060bd490b896ab39807815e7b914272d38a946e"],"state_sha256":"4e31863e4107254fc3ff46f051dc4e7c3bf4cb52cda85d248584db9f3f852d73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvyv5/T+x7UdeQk+XtZGKj+8oNjqHjF2VKl0o3W+Y3dICAb3QAnYBSRaRiNgAeWDAoppbM1kBMotp+Yl6J4BBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:18:26.149509Z","bundle_sha256":"d95be89cbb8ef646547ca532ab622d382ada4f93228f556e0b19253a2f8ce89f"}}