{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YLGIFCENXVZSU2HVOZZAYR66Q2","short_pith_number":"pith:YLGIFCEN","schema_version":"1.0","canonical_sha256":"c2cc82888dbd732a68f576720c47de86a8bf85feb94042833d4f1382b770f9c7","source":{"kind":"arxiv","id":"1203.1958","version":2},"attestation_state":"computed","paper":{"title":"Numerical computation of convolutions in free probability theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.PR","authors_text":"Raj Rao Nadakuditi, Sheehan Olver","submitted_at":"2012-03-08T23:07:06Z","abstract_excerpt":"We develop a numerical approach for computing the additive, multiplicative and compressive convolution operations from free probability theory. We utilize the regularity properties of free convolution to identify (pairs of) `admissible' measures whose convolution results in a so-called `invertible measure' which is either a smoothly-decaying measure supported on the entire real line (such as the Gaussian) or square-root decaying measure supported on a compact interval (such as the semi-circle). This class of measures is important because these measures along with their Cauchy transforms can be"},"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":"1203.1958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-08T23:07:06Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"a5eb30b98ba6abc11e7258c503b81634328dea4fc001ce1c188c40fd959d4ce6","abstract_canon_sha256":"7397b477adb0fb30b00d98286d450fbda50c3fae281ac493abc2b157fd4be01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:06.469737Z","signature_b64":"XTpfX6InppfMyQxxxNp/jij52o+d/pR/S8nGKcYuZsKk762zTshNUFUqBu9nghEkaeohDVsjGcs81/y40gQQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2cc82888dbd732a68f576720c47de86a8bf85feb94042833d4f1382b770f9c7","last_reissued_at":"2026-05-18T03:18:06.469112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:06.469112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical computation of convolutions in free probability theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.PR","authors_text":"Raj Rao Nadakuditi, Sheehan Olver","submitted_at":"2012-03-08T23:07:06Z","abstract_excerpt":"We develop a numerical approach for computing the additive, multiplicative and compressive convolution operations from free probability theory. We utilize the regularity properties of free convolution to identify (pairs of) `admissible' measures whose convolution results in a so-called `invertible measure' which is either a smoothly-decaying measure supported on the entire real line (such as the Gaussian) or square-root decaying measure supported on a compact interval (such as the semi-circle). This class of measures is important because these measures along with their Cauchy transforms can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1958","kind":"arxiv","version":2},"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":"1203.1958","created_at":"2026-05-18T03:18:06.469216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1958v2","created_at":"2026-05-18T03:18:06.469216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1958","created_at":"2026-05-18T03:18:06.469216+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLGIFCENXVZS","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLGIFCENXVZSU2HV","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLGIFCEN","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.03634","citing_title":"Free Decompression with Algebraic Spectral Curves","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2","json":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2.json","graph_json":"https://pith.science/api/pith-number/YLGIFCENXVZSU2HVOZZAYR66Q2/graph.json","events_json":"https://pith.science/api/pith-number/YLGIFCENXVZSU2HVOZZAYR66Q2/events.json","paper":"https://pith.science/paper/YLGIFCEN"},"agent_actions":{"view_html":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2","download_json":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2.json","view_paper":"https://pith.science/paper/YLGIFCEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1958&json=true","fetch_graph":"https://pith.science/api/pith-number/YLGIFCENXVZSU2HVOZZAYR66Q2/graph.json","fetch_events":"https://pith.science/api/pith-number/YLGIFCENXVZSU2HVOZZAYR66Q2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2/action/storage_attestation","attest_author":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2/action/author_attestation","sign_citation":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2/action/citation_signature","submit_replication":"https://pith.science/pith/YLGIFCENXVZSU2HVOZZAYR66Q2/action/replication_record"}},"created_at":"2026-05-18T03:18:06.469216+00:00","updated_at":"2026-05-18T03:18:06.469216+00:00"}