{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KGM4X7MPXMTQTR4WSFNJULBJWY","short_pith_number":"pith:KGM4X7MP","schema_version":"1.0","canonical_sha256":"5199cbfd8fbb2709c796915a9a2c29b6250421d93a34c77d977b2cc5efdc0b42","source":{"kind":"arxiv","id":"2005.07812","version":2},"attestation_state":"computed","paper":{"title":"Recovering Data Permutations from Noisy Observations: The Linear Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Dytso, H. Vincent Poor, Martina Cardone, Minoh Jeong","submitted_at":"2020-05-15T22:30:32Z","abstract_excerpt":"This paper considers a noisy data structure recovery problem. The goal is to investigate the following question: Given a noisy observation of a permuted data set, according to which permutation was the original data sorted? The focus is on scenarios where data is generated according to an isotropic Gaussian distribution, and the noise is additive Gaussian with an arbitrary covariance matrix. This problem is posed within a hypothesis testing framework. The objective is to study the linear regime in which the optimal decoder has a polynomial complexity in the data size, and it declares the permu"},"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":"2005.07812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-15T22:30:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fdc771ee3b1d54840718b6d3d0b6513b656d882de84cbb8adb7f0748685d3de0","abstract_canon_sha256":"82b253ce6c4bf84ea126920661010528c37326ba22a1ba8464bab251581b23f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:20.283712Z","signature_b64":"fKYHShgOfsYLlLcLHwmEXhKWjN2PrTBXOKPXiqIOIJPm1hBIYBT52uGiEaEDvVP1CkZrKlmnhLq91F1E5r02DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5199cbfd8fbb2709c796915a9a2c29b6250421d93a34c77d977b2cc5efdc0b42","last_reissued_at":"2026-07-05T01:53:20.283168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:20.283168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovering Data Permutations from Noisy Observations: The Linear Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Dytso, H. Vincent Poor, Martina Cardone, Minoh Jeong","submitted_at":"2020-05-15T22:30:32Z","abstract_excerpt":"This paper considers a noisy data structure recovery problem. The goal is to investigate the following question: Given a noisy observation of a permuted data set, according to which permutation was the original data sorted? The focus is on scenarios where data is generated according to an isotropic Gaussian distribution, and the noise is additive Gaussian with an arbitrary covariance matrix. This problem is posed within a hypothesis testing framework. The objective is to study the linear regime in which the optimal decoder has a polynomial complexity in the data size, and it declares the permu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07812","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.07812/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":"2005.07812","created_at":"2026-07-05T01:53:20.283230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07812v2","created_at":"2026-07-05T01:53:20.283230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07812","created_at":"2026-07-05T01:53:20.283230+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGM4X7MPXMTQ","created_at":"2026-07-05T01:53:20.283230+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGM4X7MPXMTQTR4W","created_at":"2026-07-05T01:53:20.283230+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGM4X7MP","created_at":"2026-07-05T01:53:20.283230+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/KGM4X7MPXMTQTR4WSFNJULBJWY","json":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY.json","graph_json":"https://pith.science/api/pith-number/KGM4X7MPXMTQTR4WSFNJULBJWY/graph.json","events_json":"https://pith.science/api/pith-number/KGM4X7MPXMTQTR4WSFNJULBJWY/events.json","paper":"https://pith.science/paper/KGM4X7MP"},"agent_actions":{"view_html":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY","download_json":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY.json","view_paper":"https://pith.science/paper/KGM4X7MP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07812&json=true","fetch_graph":"https://pith.science/api/pith-number/KGM4X7MPXMTQTR4WSFNJULBJWY/graph.json","fetch_events":"https://pith.science/api/pith-number/KGM4X7MPXMTQTR4WSFNJULBJWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY/action/storage_attestation","attest_author":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY/action/author_attestation","sign_citation":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY/action/citation_signature","submit_replication":"https://pith.science/pith/KGM4X7MPXMTQTR4WSFNJULBJWY/action/replication_record"}},"created_at":"2026-07-05T01:53:20.283230+00:00","updated_at":"2026-07-05T01:53:20.283230+00:00"}