{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3IWYLL3L334SEPMJ2L74SY6YSY","short_pith_number":"pith:3IWYLL3L","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"},"canonical_sha256":"da2d85af6bdef9223d89d2ffc963d89624577204925016d2250c70b52406afd9","source":{"kind":"arxiv","id":"1809.02491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02491","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02491v1","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02491","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"3IWYLL3L334S","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3IWYLL3L334SEPMJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3IWYLL3L","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3IWYLL3L334SEPMJ2L74SY6YSY","target":"record","payload":{"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"},"canonical_sha256":"da2d85af6bdef9223d89d2ffc963d89624577204925016d2250c70b52406afd9","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"},"source_kind":"arxiv","source_id":"1809.02491","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsaZTDqjvZuzwvre9Qlg7fsIXA8A+uIj0CA4w82XJHg3WsWFXHgs/7P0kJh5iMKUAuo7OEdH/40kQLaHHWilAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:30:18.873921Z"},"content_sha256":"8ecd5d699b04fb8fd03f44671d43645039fc599890a67a5e2d700903c81e010f","schema_version":"1.0","event_id":"sha256:8ecd5d699b04fb8fd03f44671d43645039fc599890a67a5e2d700903c81e010f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3IWYLL3L334SEPMJ2L74SY6YSY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4u7+KXUkZJPNTFTorQHjLGkKBWyWBCgcn8eo5KwwkhZlYOiHSka2SGnYZv4HshvW/9DEpPB6dOZpry+d8FCqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:30:18.874267Z"},"content_sha256":"5f3752951ad6522962c45778c75131fc4245ef552508e1d4c9c4be4e7c826f92","schema_version":"1.0","event_id":"sha256:5f3752951ad6522962c45778c75131fc4245ef552508e1d4c9c4be4e7c826f92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/bundle.json","state_url":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IWYLL3L334SEPMJ2L74SY6YSY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T17:30:18Z","links":{"resolver":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY","bundle":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/bundle.json","state":"https://pith.science/pith/3IWYLL3L334SEPMJ2L74SY6YSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IWYLL3L334SEPMJ2L74SY6YSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3IWYLL3L334SEPMJ2L74SY6YSY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"adbb636795d73c38bb67c422b1482af75cb2560b7566cee625e8a7d7b793e7e5","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T06:18:22Z","title_canon_sha256":"95318221995a624f95fe517a67b68fbf79ab86fb4a194c251cd47713444abfdf"},"schema_version":"1.0","source":{"id":"1809.02491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02491","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02491v1","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02491","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"3IWYLL3L334S","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3IWYLL3L334SEPMJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3IWYLL3L","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:5f3752951ad6522962c45778c75131fc4245ef552508e1d4c9c4be4e7c826f92","target":"graph","created_at":"2026-05-18T00:06:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Shravan Mohan","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T06:18:22Z","title":"A note on rank constrained solutions to linear matrix equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02491","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8ecd5d699b04fb8fd03f44671d43645039fc599890a67a5e2d700903c81e010f","target":"record","created_at":"2026-05-18T00:06:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"adbb636795d73c38bb67c422b1482af75cb2560b7566cee625e8a7d7b793e7e5","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T06:18:22Z","title_canon_sha256":"95318221995a624f95fe517a67b68fbf79ab86fb4a194c251cd47713444abfdf"},"schema_version":"1.0","source":{"id":"1809.02491","kind":"arxiv","version":1}},"canonical_sha256":"da2d85af6bdef9223d89d2ffc963d89624577204925016d2250c70b52406afd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da2d85af6bdef9223d89d2ffc963d89624577204925016d2250c70b52406afd9","first_computed_at":"2026-05-18T00:06:16.963048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:16.963048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nQ4xhTPBsQ7gVpieXkwsWJxcrT2VLJhExdWs6zkXHD3Bo4yt1cOgffkIOtt4N5sGSVZNSYzSpS91O/Do3dwHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:16.963541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ecd5d699b04fb8fd03f44671d43645039fc599890a67a5e2d700903c81e010f","sha256:5f3752951ad6522962c45778c75131fc4245ef552508e1d4c9c4be4e7c826f92"],"state_sha256":"b8ccad101982f3383438afd408833179aa7f7f2a9dd47850c15e306d18f77a44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3zgBnXjqgBlNLT71D0egVSkJUncyTjAxoF9Mx5YyHQA8F2dhDAl9kdFc6AhACFl61U7CfZsqilqgL7cmWHQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:30:18.876251Z","bundle_sha256":"f46ac0b97749d23ae1907a1ebca65a9d0e5ccd3d69148954e1ac2ba6653b2ab9"}}