{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3IWYLL3L334SEPMJ2L74SY6YSY","short_pith_number":"pith:3IWYLL3L","schema_version":"1.0","canonical_sha256":"da2d85af6bdef9223d89d2ffc963d89624577204925016d2250c70b52406afd9","source":{"kind":"arxiv","id":"1809.02491","version":1},"attestation_state":"computed","paper":{"title":"A note on rank constrained solutions to linear matrix equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Shravan Mohan","submitted_at":"2018-09-06T06:18:22Z","abstract_excerpt":"This preliminary note presents a heuristic for determining rank constrained solutions to linear matrix equations (LME). The method proposed here is based on minimizing a non-convex quadratic functional, which will hence-forth be termed as the \\textit{Low-Rank-Functional} (LRF). Although this method lacks a formal proof/comprehensive analysis, for example in terms of a probabilistic guarantee for converging to a solution, the proposed idea is intuitive and has been seen to perform well in simulations. To that end, many numerical examples are provided to corroborate the idea."},"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":"1809.02491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T06:18:22Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"95318221995a624f95fe517a67b68fbf79ab86fb4a194c251cd47713444abfdf","abstract_canon_sha256":"adbb636795d73c38bb67c422b1482af75cb2560b7566cee625e8a7d7b793e7e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:16.963541Z","signature_b64":"nQ4xhTPBsQ7gVpieXkwsWJxcrT2VLJhExdWs6zkXHD3Bo4yt1cOgffkIOtt4N5sGSVZNSYzSpS91O/Do3dwHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da2d85af6bdef9223d89d2ffc963d89624577204925016d2250c70b52406afd9","last_reissued_at":"2026-05-18T00:06:16.963048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:16.963048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on rank constrained solutions to linear matrix equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Shravan Mohan","submitted_at":"2018-09-06T06:18:22Z","abstract_excerpt":"This preliminary note presents a heuristic for determining rank constrained solutions to linear matrix equations (LME). The method proposed here is based on minimizing a non-convex quadratic functional, which will hence-forth be termed as the \\textit{Low-Rank-Functional} (LRF). Although this method lacks a formal proof/comprehensive analysis, for example in terms of a probabilistic guarantee for converging to a solution, the proposed idea is intuitive and has been seen to perform well in simulations. To that end, many numerical examples are provided to corroborate the idea."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02491","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":"1809.02491","created_at":"2026-05-18T00:06:16.963126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02491v1","created_at":"2026-05-18T00:06:16.963126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02491","created_at":"2026-05-18T00:06:16.963126+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IWYLL3L334S","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IWYLL3L334SEPMJ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IWYLL3L","created_at":"2026-05-18T12:32:02.567920+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/3IWYLL3L334SEPMJ2L74SY6YSY","json":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY.json","graph_json":"https://pith.science/api/pith-number/3IWYLL3L334SEPMJ2L74SY6YSY/graph.json","events_json":"https://pith.science/api/pith-number/3IWYLL3L334SEPMJ2L74SY6YSY/events.json","paper":"https://pith.science/paper/3IWYLL3L"},"agent_actions":{"view_html":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY","download_json":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY.json","view_paper":"https://pith.science/paper/3IWYLL3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02491&json=true","fetch_graph":"https://pith.science/api/pith-number/3IWYLL3L334SEPMJ2L74SY6YSY/graph.json","fetch_events":"https://pith.science/api/pith-number/3IWYLL3L334SEPMJ2L74SY6YSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/action/storage_attestation","attest_author":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/action/author_attestation","sign_citation":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/action/citation_signature","submit_replication":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/action/replication_record"}},"created_at":"2026-05-18T00:06:16.963126+00:00","updated_at":"2026-05-18T00:06:16.963126+00:00"}