{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JKKI6QOG44VN7ED2DGVZW73BRP","short_pith_number":"pith:JKKI6QOG","schema_version":"1.0","canonical_sha256":"4a948f41c6e72adf907a19ab9b7f618be955931ce6c0646a003cd858560372a8","source":{"kind":"arxiv","id":"2104.14952","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.14952","created_at":"2026-07-05T04:06:14.851277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14952v1","created_at":"2026-07-05T04:06:14.851277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14952","created_at":"2026-07-05T04:06:14.851277+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKKI6QOG44VN","created_at":"2026-07-05T04:06:14.851277+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKKI6QOG44VN7ED2","created_at":"2026-07-05T04:06:14.851277+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKKI6QOG","created_at":"2026-07-05T04:06:14.851277+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/JKKI6QOG44VN7ED2DGVZW73BRP","json":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP.json","graph_json":"https://pith.science/api/pith-number/JKKI6QOG44VN7ED2DGVZW73BRP/graph.json","events_json":"https://pith.science/api/pith-number/JKKI6QOG44VN7ED2DGVZW73BRP/events.json","paper":"https://pith.science/paper/JKKI6QOG"},"agent_actions":{"view_html":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP","download_json":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP.json","view_paper":"https://pith.science/paper/JKKI6QOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14952&json=true","fetch_graph":"https://pith.science/api/pith-number/JKKI6QOG44VN7ED2DGVZW73BRP/graph.json","fetch_events":"https://pith.science/api/pith-number/JKKI6QOG44VN7ED2DGVZW73BRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/action/storage_attestation","attest_author":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/action/author_attestation","sign_citation":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/action/citation_signature","submit_replication":"https://pith.science/pith/JKKI6QOG44VN7ED2DGVZW73BRP/action/replication_record"}},"created_at":"2026-07-05T04:06:14.851277+00:00","updated_at":"2026-07-05T04:06:14.851277+00:00"}