{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YMFI7PUN2VW2PNFYVTGEGPD2PH","short_pith_number":"pith:YMFI7PUN","canonical_record":{"source":{"id":"1104.1690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:31:06Z","cross_cats_sorted":["cs.DS","math.FA"],"title_canon_sha256":"19aa5b2265e8aba20d89b8ebbdf0fd547ab74bee62e6ab52a8c83c40628476da","abstract_canon_sha256":"d2019338fee83cf06590ad464166b3c298247a262fb4cfc80f154c5c8fde6a29"},"schema_version":"1.0"},"canonical_sha256":"c30a8fbe8dd56da7b4b8accc433c7a79ff4cc00dac8db29c6a5e9e6d7eafd415","source":{"kind":"arxiv","id":"1104.1690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1690","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1690v1","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1690","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"YMFI7PUN2VW2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YMFI7PUN2VW2PNFY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YMFI7PUN","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YMFI7PUN2VW2PNFYVTGEGPD2PH","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:31:06Z","cross_cats_sorted":["cs.DS","math.FA"],"title_canon_sha256":"19aa5b2265e8aba20d89b8ebbdf0fd547ab74bee62e6ab52a8c83c40628476da","abstract_canon_sha256":"d2019338fee83cf06590ad464166b3c298247a262fb4cfc80f154c5c8fde6a29"},"schema_version":"1.0"},"canonical_sha256":"c30a8fbe8dd56da7b4b8accc433c7a79ff4cc00dac8db29c6a5e9e6d7eafd415","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:43.366833Z","signature_b64":"VQE05ZinzwVGEBIi5sAVsdXo/vojosCnzvFvplQ2xRTqc+ii+ezXAXTf9Qnr5Pioos4MY54v7TioCzNJaW2uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c30a8fbe8dd56da7b4b8accc433c7a79ff4cc00dac8db29c6a5e9e6d7eafd415","last_reissued_at":"2026-05-18T04:24:43.366384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:43.366384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1690","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":"LUFdGasmhcZhUWTRxFzZhAsUZC/6+O1zZa6H26mH6Bd7D/SkkSJyhBp6CyjHCRRYobFTexEryIKC3pXaxaZgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:22:02.771468Z"},"content_sha256":"3978045fef68bae1c27af09d6b682e0d68c36202bfb3391cac1548d18bb57115","schema_version":"1.0","event_id":"sha256:3978045fef68bae1c27af09d6b682e0d68c36202bfb3391cac1548d18bb57115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YMFI7PUN2VW2PNFYVTGEGPD2PH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective partitioning method for computing weighted Moore-Penrose inverse","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DS","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:31:06Z","abstract_excerpt":"We introduce a method and an algorithm for computing the weighted Moore-Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [M.B. Tasic, P.S. Stanimirovic, M.D. Petkovic, Symbolic computation of weighted Moore-Penrose inverse using partitioning method, Appl. Math. Comput. 189 (2007) 615-640] to multiple-variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Also, these methods are generalizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1690","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":"qJqYohDL/dqiZKc5fZBQgx7g5I7MNY3c6yv6eA1+wJiprr+/at/2t7pD5PacHzdqMnt23tigpWiWhRBTpxwNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:22:02.771805Z"},"content_sha256":"3f8a37191621589f6a4902a0835ff6f42d1e36ac8b9508fd6befab2532119a09","schema_version":"1.0","event_id":"sha256:3f8a37191621589f6a4902a0835ff6f42d1e36ac8b9508fd6befab2532119a09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH/bundle.json","state_url":"https://pith.science/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH/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-29T17:22:02Z","links":{"resolver":"https://pith.science/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH","bundle":"https://pith.science/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH/bundle.json","state":"https://pith.science/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMFI7PUN2VW2PNFYVTGEGPD2PH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YMFI7PUN2VW2PNFYVTGEGPD2PH","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":"d2019338fee83cf06590ad464166b3c298247a262fb4cfc80f154c5c8fde6a29","cross_cats_sorted":["cs.DS","math.FA"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:31:06Z","title_canon_sha256":"19aa5b2265e8aba20d89b8ebbdf0fd547ab74bee62e6ab52a8c83c40628476da"},"schema_version":"1.0","source":{"id":"1104.1690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1690","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1690v1","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1690","created_at":"2026-05-18T04:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"YMFI7PUN2VW2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YMFI7PUN2VW2PNFY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YMFI7PUN","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:3f8a37191621589f6a4902a0835ff6f42d1e36ac8b9508fd6befab2532119a09","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 introduce a method and an algorithm for computing the weighted Moore-Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [M.B. Tasic, P.S. Stanimirovic, M.D. Petkovic, Symbolic computation of weighted Moore-Penrose inverse using partitioning method, Appl. Math. Comput. 189 (2007) 615-640] to multiple-variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Also, these methods are generalizatio","authors_text":"M.B, M.D., Petkovi\\'c, P.S., Stanimirovi\\'c, Tasi\\'c","cross_cats":["cs.DS","math.FA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:31:06Z","title":"Effective partitioning method for computing weighted Moore-Penrose inverse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1690","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:3978045fef68bae1c27af09d6b682e0d68c36202bfb3391cac1548d18bb57115","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":"d2019338fee83cf06590ad464166b3c298247a262fb4cfc80f154c5c8fde6a29","cross_cats_sorted":["cs.DS","math.FA"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.SC","submitted_at":"2011-04-09T11:31:06Z","title_canon_sha256":"19aa5b2265e8aba20d89b8ebbdf0fd547ab74bee62e6ab52a8c83c40628476da"},"schema_version":"1.0","source":{"id":"1104.1690","kind":"arxiv","version":1}},"canonical_sha256":"c30a8fbe8dd56da7b4b8accc433c7a79ff4cc00dac8db29c6a5e9e6d7eafd415","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c30a8fbe8dd56da7b4b8accc433c7a79ff4cc00dac8db29c6a5e9e6d7eafd415","first_computed_at":"2026-05-18T04:24:43.366384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:43.366384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQE05ZinzwVGEBIi5sAVsdXo/vojosCnzvFvplQ2xRTqc+ii+ezXAXTf9Qnr5Pioos4MY54v7TioCzNJaW2uBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:43.366833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3978045fef68bae1c27af09d6b682e0d68c36202bfb3391cac1548d18bb57115","sha256:3f8a37191621589f6a4902a0835ff6f42d1e36ac8b9508fd6befab2532119a09"],"state_sha256":"77872d0422ba3e7b4541ec58e496a0fb198b6044cbdc5b79a55188905ff0fe5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSKhr46o1lFqk/xoE9I6/bWh+h1Jxto1stUFMYrZTLQsKzjV5SZtj9GRLwmM3LsO9TvPec98u30d9D1UvcebDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:22:02.773748Z","bundle_sha256":"cc83aba047aa9f91234d38f1fb56a7ca4b5bdf9c3f48092578e0d57063a7dd44"}}