{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:TC36VLFLBUPFCIES5FVZ3VBGJ6","short_pith_number":"pith:TC36VLFL","schema_version":"1.0","canonical_sha256":"98b7eaacab0d1e512092e96b9dd4264fbee9e0f8faa774b95370131b93043e5f","source":{"kind":"arxiv","id":"0906.3132","version":3},"attestation_state":"computed","paper":{"title":"Constructing matrix geometric means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Federico Poloni","submitted_at":"2009-06-17T10:18:52Z","abstract_excerpt":"In this paper, we analyze the process of \"assembling\" new matrix geometric means from existing ones, through function composition or limit processes. We show that for n=4 a new matrix mean exists which is simpler to compute than the existing ones. Moreover, we show that for n>4 the existing proving strategies cannot provide a mean computationally simpler than the existing ones."},"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":"0906.3132","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-06-17T10:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"50e9ef4e4161e9e35492eb3ac4c8a4ab3051661d475114a3e303d5b6be69b4ad","abstract_canon_sha256":"4aa2e37f82ab379cde013444fc7402f5cb662922b9bb01cd6a3c21e6fc605fa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.279072Z","signature_b64":"/ffkGAWEyTXHkJBW7vk+5DHPoPgAyIYqI3hdzUn4HyKTJ9UTr6R4bfympLLOkE35/BWcuq/aNH5Io98qg/5rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b7eaacab0d1e512092e96b9dd4264fbee9e0f8faa774b95370131b93043e5f","last_reissued_at":"2026-05-18T04:23:22.278512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.278512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing matrix geometric means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Federico Poloni","submitted_at":"2009-06-17T10:18:52Z","abstract_excerpt":"In this paper, we analyze the process of \"assembling\" new matrix geometric means from existing ones, through function composition or limit processes. We show that for n=4 a new matrix mean exists which is simpler to compute than the existing ones. Moreover, we show that for n>4 the existing proving strategies cannot provide a mean computationally simpler than the existing ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3132","kind":"arxiv","version":3},"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":"0906.3132","created_at":"2026-05-18T04:23:22.278590+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.3132v3","created_at":"2026-05-18T04:23:22.278590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3132","created_at":"2026-05-18T04:23:22.278590+00:00"},{"alias_kind":"pith_short_12","alias_value":"TC36VLFLBUPF","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"TC36VLFLBUPFCIES","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"TC36VLFL","created_at":"2026-05-18T12:26:01.383474+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/TC36VLFLBUPFCIES5FVZ3VBGJ6","json":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6.json","graph_json":"https://pith.science/api/pith-number/TC36VLFLBUPFCIES5FVZ3VBGJ6/graph.json","events_json":"https://pith.science/api/pith-number/TC36VLFLBUPFCIES5FVZ3VBGJ6/events.json","paper":"https://pith.science/paper/TC36VLFL"},"agent_actions":{"view_html":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6","download_json":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6.json","view_paper":"https://pith.science/paper/TC36VLFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.3132&json=true","fetch_graph":"https://pith.science/api/pith-number/TC36VLFLBUPFCIES5FVZ3VBGJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/TC36VLFLBUPFCIES5FVZ3VBGJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6/action/storage_attestation","attest_author":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6/action/author_attestation","sign_citation":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6/action/citation_signature","submit_replication":"https://pith.science/pith/TC36VLFLBUPFCIES5FVZ3VBGJ6/action/replication_record"}},"created_at":"2026-05-18T04:23:22.278590+00:00","updated_at":"2026-05-18T04:23:22.278590+00:00"}