{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XEHTX77R3DZ4N3G7FLPY6GRVOX","short_pith_number":"pith:XEHTX77R","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"},"canonical_sha256":"b90f3bfff1d8f3c6ecdf2adf8f1a3575cb83783ba97bd9277e2ac4062365ac7b","source":{"kind":"arxiv","id":"1104.1696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1696","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1696v1","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1696","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"XEHTX77R3DZ4","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XEHTX77R3DZ4N3G7","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XEHTX77R","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XEHTX77R3DZ4N3G7FLPY6GRVOX","target":"record","payload":{"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"},"canonical_sha256":"b90f3bfff1d8f3c6ecdf2adf8f1a3575cb83783ba97bd9277e2ac4062365ac7b","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"},"source_kind":"arxiv","source_id":"1104.1696","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-18T04:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8miKH5Pa9rYaKNrCO6ZlBYe9+U6eT3FdkNPqmoogjrIl/47VBkK9zRkgrFfhR/aNyCwkBrOURFpPdQPrAIM6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:43:50.132640Z"},"content_sha256":"9a3f3da04f412d1e19e1580577a71689cae0999ddf8613a8d69861f8e31f6a26","schema_version":"1.0","event_id":"sha256:9a3f3da04f412d1e19e1580577a71689cae0999ddf8613a8d69861f8e31f6a26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XEHTX77R3DZ4N3G7FLPY6GRVOX","target":"graph","payload":{"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"},"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-18T04:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpnAAvPF9C2jgRiwt7ggp8TScK8rlyQ4sY9KgxzQYYE08pX65QCug9F+3c1DU7ncd7wUI4leh60oG26+ONFHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:43:50.132989Z"},"content_sha256":"81a02efe4e2b3b550cfa355c9580e96029616d132b2a5a37578b957af28c7a2b","schema_version":"1.0","event_id":"sha256:81a02efe4e2b3b550cfa355c9580e96029616d132b2a5a37578b957af28c7a2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/bundle.json","state_url":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/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-29T15:43:50Z","links":{"resolver":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX","bundle":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/bundle.json","state":"https://pith.science/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEHTX77R3DZ4N3G7FLPY6GRVOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XEHTX77R3DZ4N3G7FLPY6GRVOX","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":"4fb3130d0030cbf0dba321656e24ab579f16813bfe5d53bf1f88cf8440af46da","cross_cats_sorted":["cs.DS","cs.MS","math.FA"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:54:31Z","title_canon_sha256":"9cd04d3a4b207065c42330ad0ffd10ba59ac40f0894bb6583e2f555d2965b974"},"schema_version":"1.0","source":{"id":"1104.1696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1696","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1696v1","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1696","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"XEHTX77R3DZ4","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XEHTX77R3DZ4N3G7","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XEHTX77R","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:81a02efe4e2b3b550cfa355c9580e96029616d132b2a5a37578b957af28c7a2b","target":"graph","created_at":"2026-05-18T04:24:43Z","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":"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","authors_text":"M.B., M.D, Petkovi\\'c, P.S., Stanimirovi\\'c, Tasi\\'c","cross_cats":["cs.DS","cs.MS","math.FA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:54:31Z","title":"Symbolic computation of weighted Moore-Penrose inverse using partitioning method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1696","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:9a3f3da04f412d1e19e1580577a71689cae0999ddf8613a8d69861f8e31f6a26","target":"record","created_at":"2026-05-18T04:24:43Z","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":"4fb3130d0030cbf0dba321656e24ab579f16813bfe5d53bf1f88cf8440af46da","cross_cats_sorted":["cs.DS","cs.MS","math.FA"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:54:31Z","title_canon_sha256":"9cd04d3a4b207065c42330ad0ffd10ba59ac40f0894bb6583e2f555d2965b974"},"schema_version":"1.0","source":{"id":"1104.1696","kind":"arxiv","version":1}},"canonical_sha256":"b90f3bfff1d8f3c6ecdf2adf8f1a3575cb83783ba97bd9277e2ac4062365ac7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b90f3bfff1d8f3c6ecdf2adf8f1a3575cb83783ba97bd9277e2ac4062365ac7b","first_computed_at":"2026-05-18T04:24:43.348415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:43.348415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JWsPI3c9hKHZjrwUGDFben+DqFFZo7aZs9Tv0V0+ZlhuHROsIiHepyODZZ6MGsTJUsoDqiBfai7urflneqNhCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:43.348883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a3f3da04f412d1e19e1580577a71689cae0999ddf8613a8d69861f8e31f6a26","sha256:81a02efe4e2b3b550cfa355c9580e96029616d132b2a5a37578b957af28c7a2b"],"state_sha256":"ab2e134e2a92276b196bd206306a2dd92db26ae5d08fe59a64f6dc4c9990fc74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hx7ToF6Jtp/S/ovNnRxKUUYwgEQNrIGPid1qskg6xxgq6QZ2eMYZJa+dykkoC23ZISkGWcqKDaziiPfQKF4hBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:43:50.134867Z","bundle_sha256":"e5fea3df307601008a186579ed1b888669ccbb441b6e3cab89101012318479c9"}}