{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UT5HGIGHPJOENGR4RAUHUK4GOT","short_pith_number":"pith:UT5HGIGH","schema_version":"1.0","canonical_sha256":"a4fa7320c77a5c469a3c88287a2b8674f5678a476bb82569dae83cbd90bf8349","source":{"kind":"arxiv","id":"1803.05003","version":1},"attestation_state":"computed","paper":{"title":"An algorithm for hiding and recovering data using matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Di\\'ogenes Galetti, Salomon S. Mizrahi","submitted_at":"2018-03-12T16:08:31Z","abstract_excerpt":"We present an algorithm for the recovery of a matrix $\\mathbb{M}$ % (non-singular $\\in $ $\\mathbb{C}^{N\\times N}$) by only being aware of two of its powers, $\\mathbb{M}_{k_{1}}:=\\mathbb{M}^{k_{1}}$ and $\\mathbb{M}% _{k_{2}}:=\\mathbb{M}^{k_{2}}$ ($k_{1}>k_{2}$) whose exponents are positive coprime numbers. The knowledge of the exponents is the key to retrieve matrix $\\mathbb{M}$ out from the two matrices $\\mathbb{M}_{k_{i}}$. The procedure combines products and inversions of matrices, and a few computational steps are needed to get $\\mathbb{M}$, almost independently of the exponents magnitudes."},"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":"1803.05003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-03-12T16:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"4949e2aba1284cd0e198f57c2388addb075934b01a73db16ae6fb2b12f31531a","abstract_canon_sha256":"1a224aea7281f05bac327d9cfee242fb8f407b76aafa7206e23156a52b3ca687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:02.329696Z","signature_b64":"lskG6U2svIVgnjTH8BVtk5wL5U3q6hjk0Ctltv2An7VfN8Ccu3ey5yz4DtLk0whtkJzCOCZrs+9XxKYL/K6VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4fa7320c77a5c469a3c88287a2b8674f5678a476bb82569dae83cbd90bf8349","last_reissued_at":"2026-05-18T00:21:02.329321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:02.329321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm for hiding and recovering data using matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Di\\'ogenes Galetti, Salomon S. Mizrahi","submitted_at":"2018-03-12T16:08:31Z","abstract_excerpt":"We present an algorithm for the recovery of a matrix $\\mathbb{M}$ % (non-singular $\\in $ $\\mathbb{C}^{N\\times N}$) by only being aware of two of its powers, $\\mathbb{M}_{k_{1}}:=\\mathbb{M}^{k_{1}}$ and $\\mathbb{M}% _{k_{2}}:=\\mathbb{M}^{k_{2}}$ ($k_{1}>k_{2}$) whose exponents are positive coprime numbers. The knowledge of the exponents is the key to retrieve matrix $\\mathbb{M}$ out from the two matrices $\\mathbb{M}_{k_{i}}$. The procedure combines products and inversions of matrices, and a few computational steps are needed to get $\\mathbb{M}$, almost independently of the exponents magnitudes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05003","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":""},"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":"1803.05003","created_at":"2026-05-18T00:21:02.329382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05003v1","created_at":"2026-05-18T00:21:02.329382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05003","created_at":"2026-05-18T00:21:02.329382+00:00"},{"alias_kind":"pith_short_12","alias_value":"UT5HGIGHPJOE","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UT5HGIGHPJOENGR4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UT5HGIGH","created_at":"2026-05-18T12:32:56.356000+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/UT5HGIGHPJOENGR4RAUHUK4GOT","json":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT.json","graph_json":"https://pith.science/api/pith-number/UT5HGIGHPJOENGR4RAUHUK4GOT/graph.json","events_json":"https://pith.science/api/pith-number/UT5HGIGHPJOENGR4RAUHUK4GOT/events.json","paper":"https://pith.science/paper/UT5HGIGH"},"agent_actions":{"view_html":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT","download_json":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT.json","view_paper":"https://pith.science/paper/UT5HGIGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05003&json=true","fetch_graph":"https://pith.science/api/pith-number/UT5HGIGHPJOENGR4RAUHUK4GOT/graph.json","fetch_events":"https://pith.science/api/pith-number/UT5HGIGHPJOENGR4RAUHUK4GOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT/action/storage_attestation","attest_author":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT/action/author_attestation","sign_citation":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT/action/citation_signature","submit_replication":"https://pith.science/pith/UT5HGIGHPJOENGR4RAUHUK4GOT/action/replication_record"}},"created_at":"2026-05-18T00:21:02.329382+00:00","updated_at":"2026-05-18T00:21:02.329382+00:00"}