{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XEHTX77R3DZ4N3G7FLPY6GRVOX","short_pith_number":"pith:XEHTX77R","schema_version":"1.0","canonical_sha256":"b90f3bfff1d8f3c6ecdf2adf8f1a3575cb83783ba97bd9277e2ac4062365ac7b","source":{"kind":"arxiv","id":"1104.1696","version":1},"attestation_state":"computed","paper":{"title":"Symbolic computation of weighted Moore-Penrose inverse using partitioning method","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DS","cs.MS","math.FA"],"primary_cat":"cs.SC","authors_text":"M.B., M.D, Petkovi\\'c, P.S., Stanimirovi\\'c, Tasi\\'c","submitted_at":"2011-04-09T11:54:31Z","abstract_excerpt":"We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method for computing the weighted Moore-Penrose inverse for constant matrices, originated in Wang and Chen [G.R. Wang, Y.L. Chen, A recursive algorithm for computing the weighted Moore-Penrose inverse AMN, J. Comput. Math. 4 (1986) 74-85], and the partitioning method for computing the Moore-Penr"},"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":"1104.1696","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:54:31Z","cross_cats_sorted":["cs.DS","cs.MS","math.FA"],"title_canon_sha256":"9cd04d3a4b207065c42330ad0ffd10ba59ac40f0894bb6583e2f555d2965b974","abstract_canon_sha256":"4fb3130d0030cbf0dba321656e24ab579f16813bfe5d53bf1f88cf8440af46da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:43.348883Z","signature_b64":"JWsPI3c9hKHZjrwUGDFben+DqFFZo7aZs9Tv0V0+ZlhuHROsIiHepyODZZ6MGsTJUsoDqiBfai7urflneqNhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b90f3bfff1d8f3c6ecdf2adf8f1a3575cb83783ba97bd9277e2ac4062365ac7b","last_reissued_at":"2026-05-18T04:24:43.348415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:43.348415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic computation of weighted Moore-Penrose inverse using partitioning method","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DS","cs.MS","math.FA"],"primary_cat":"cs.SC","authors_text":"M.B., M.D, Petkovi\\'c, P.S., Stanimirovi\\'c, Tasi\\'c","submitted_at":"2011-04-09T11:54:31Z","abstract_excerpt":"We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method for computing the weighted Moore-Penrose inverse for constant matrices, originated in Wang and Chen [G.R. Wang, Y.L. Chen, A recursive algorithm for computing the weighted Moore-Penrose inverse AMN, J. Comput. Math. 4 (1986) 74-85], and the partitioning method for computing the Moore-Penr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1696","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":"1104.1696","created_at":"2026-05-18T04:24:43.348495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1696v1","created_at":"2026-05-18T04:24:43.348495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1696","created_at":"2026-05-18T04:24:43.348495+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEHTX77R3DZ4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEHTX77R3DZ4N3G7","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEHTX77R","created_at":"2026-05-18T12:26:44.992195+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/XEHTX77R3DZ4N3G7FLPY6GRVOX","json":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX.json","graph_json":"https://pith.science/api/pith-number/XEHTX77R3DZ4N3G7FLPY6GRVOX/graph.json","events_json":"https://pith.science/api/pith-number/XEHTX77R3DZ4N3G7FLPY6GRVOX/events.json","paper":"https://pith.science/paper/XEHTX77R"},"agent_actions":{"view_html":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX","download_json":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX.json","view_paper":"https://pith.science/paper/XEHTX77R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1696&json=true","fetch_graph":"https://pith.science/api/pith-number/XEHTX77R3DZ4N3G7FLPY6GRVOX/graph.json","fetch_events":"https://pith.science/api/pith-number/XEHTX77R3DZ4N3G7FLPY6GRVOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/action/storage_attestation","attest_author":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/action/author_attestation","sign_citation":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/action/citation_signature","submit_replication":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/action/replication_record"}},"created_at":"2026-05-18T04:24:43.348495+00:00","updated_at":"2026-05-18T04:24:43.348495+00:00"}