{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QQFR5ZC5U72PTKHECKWLIGESLE","short_pith_number":"pith:QQFR5ZC5","schema_version":"1.0","canonical_sha256":"840b1ee45da7f4f9a8e412acb418925918492f3ac31716ed3d42ea23d18534a5","source":{"kind":"arxiv","id":"1812.00498","version":2},"attestation_state":"computed","paper":{"title":"Permutations Unlabeled beyond Sampling Unknown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Ivan Dokmani\\'c","submitted_at":"2018-12-03T00:32:38Z","abstract_excerpt":"A recent unlabeled sampling result by Unnikrishnan, Haghighatshoar and Vetterli states that with probability one over iid Gaussian matrices $A$, any $x$ can be uniquely recovered from an unknown permutation of $y = A x$ as soon as $A$ has at least twice as many rows as columns. We show that this condition on $A$ implies something much stronger: that an unknown vector $x$ can be recovered from measurements $y = T A x$, when the unknown $T$ belongs to an arbitrary set of invertible, diagonalizable linear transformations $\\mathcal{T}$. The set $\\mathcal{T}$ can be finite or countably infinite. Wh"},"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":"1812.00498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-03T00:32:38Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"b0034a5c94861b7917ce091d4909157a936663eb2450594a4fc4068750612051","abstract_canon_sha256":"92bb2c8a3ba0c24f1aeb716b13452aa77cf7e990c787335985511f5dfe54f242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:26.076792Z","signature_b64":"vcA2TDWUH2+/oy2hpyiVfMT2PLnTky6Qf8zAD4Fj3bmSy2aw6ICjsf8fD+kAdU/svc4OYVJJOgXIrxxnwdhXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"840b1ee45da7f4f9a8e412acb418925918492f3ac31716ed3d42ea23d18534a5","last_reissued_at":"2026-05-17T23:42:26.076050Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:26.076050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutations Unlabeled beyond Sampling Unknown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Ivan Dokmani\\'c","submitted_at":"2018-12-03T00:32:38Z","abstract_excerpt":"A recent unlabeled sampling result by Unnikrishnan, Haghighatshoar and Vetterli states that with probability one over iid Gaussian matrices $A$, any $x$ can be uniquely recovered from an unknown permutation of $y = A x$ as soon as $A$ has at least twice as many rows as columns. We show that this condition on $A$ implies something much stronger: that an unknown vector $x$ can be recovered from measurements $y = T A x$, when the unknown $T$ belongs to an arbitrary set of invertible, diagonalizable linear transformations $\\mathcal{T}$. The set $\\mathcal{T}$ can be finite or countably infinite. Wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00498","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.00498","created_at":"2026-05-17T23:42:26.076164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00498v2","created_at":"2026-05-17T23:42:26.076164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00498","created_at":"2026-05-17T23:42:26.076164+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQFR5ZC5U72P","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQFR5ZC5U72PTKHE","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQFR5ZC5","created_at":"2026-05-18T12:32:46.962924+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/QQFR5ZC5U72PTKHECKWLIGESLE","json":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE.json","graph_json":"https://pith.science/api/pith-number/QQFR5ZC5U72PTKHECKWLIGESLE/graph.json","events_json":"https://pith.science/api/pith-number/QQFR5ZC5U72PTKHECKWLIGESLE/events.json","paper":"https://pith.science/paper/QQFR5ZC5"},"agent_actions":{"view_html":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE","download_json":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE.json","view_paper":"https://pith.science/paper/QQFR5ZC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00498&json=true","fetch_graph":"https://pith.science/api/pith-number/QQFR5ZC5U72PTKHECKWLIGESLE/graph.json","fetch_events":"https://pith.science/api/pith-number/QQFR5ZC5U72PTKHECKWLIGESLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE/action/storage_attestation","attest_author":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE/action/author_attestation","sign_citation":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE/action/citation_signature","submit_replication":"https://pith.science/pith/QQFR5ZC5U72PTKHECKWLIGESLE/action/replication_record"}},"created_at":"2026-05-17T23:42:26.076164+00:00","updated_at":"2026-05-17T23:42:26.076164+00:00"}