{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2XVKFHOXCCGYDUS5TI2RVO324I","short_pith_number":"pith:2XVKFHOX","schema_version":"1.0","canonical_sha256":"d5eaa29dd7108d81d25d9a351abb7ae237a3139a0529eac6c6764955fdfd66d9","source":{"kind":"arxiv","id":"2605.30379","version":1},"attestation_state":"computed","paper":{"title":"Algebraic and FFT-Based Methods for Discrete-Time Matrix Convolutions with Applications to Semi-Markov Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.PR"],"primary_cat":"math.NA","authors_text":"L.Kordalis, S.Trevezas","submitted_at":"2026-05-27T19:15:19Z","abstract_excerpt":"We study the convolution product of matrix-valued sequences and its role in the computation of Markov renewal equations. Explicit representations and recursive formulae for the convolutional inverse are derived and used to construct FFT-accelerated convolution and Newton-type inversion schemes, together with a Gauss--Jordan alternative in truncated power-series rings. The proposed framework is also applied to discrete approximations of matrix Stieltjes convolutions, which arise in continuous-time semi-Markov models. These tools are then used for the numerical evaluation of semi-Markov reliabil"},"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":"2605.30379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-27T19:15:19Z","cross_cats_sorted":["cs.NA","math.PR"],"title_canon_sha256":"3da3f62391d6e2cce92899b39867b39611be42dfd2239f07ffa86fd0b08b0676","abstract_canon_sha256":"9019a219e815a729057ad9ca5588ffd5d5322f87663dac280835a2982f6108b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T00:02:08.343523Z","signature_b64":"q/3KEFmASPG282ERMwnbWif/gENU726PsAI8BwmO7rDxJ6x7yIvG9Seb03VQJil3evXTIrv3jkYymi3Pv2WeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5eaa29dd7108d81d25d9a351abb7ae237a3139a0529eac6c6764955fdfd66d9","last_reissued_at":"2026-06-01T00:02:08.342593Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T00:02:08.342593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic and FFT-Based Methods for Discrete-Time Matrix Convolutions with Applications to Semi-Markov Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.PR"],"primary_cat":"math.NA","authors_text":"L.Kordalis, S.Trevezas","submitted_at":"2026-05-27T19:15:19Z","abstract_excerpt":"We study the convolution product of matrix-valued sequences and its role in the computation of Markov renewal equations. Explicit representations and recursive formulae for the convolutional inverse are derived and used to construct FFT-accelerated convolution and Newton-type inversion schemes, together with a Gauss--Jordan alternative in truncated power-series rings. The proposed framework is also applied to discrete approximations of matrix Stieltjes convolutions, which arise in continuous-time semi-Markov models. These tools are then used for the numerical evaluation of semi-Markov reliabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.30379/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.30379","created_at":"2026-06-01T00:02:08.342714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.30379v1","created_at":"2026-06-01T00:02:08.342714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30379","created_at":"2026-06-01T00:02:08.342714+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XVKFHOXCCGY","created_at":"2026-06-01T00:02:08.342714+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XVKFHOXCCGYDUS5","created_at":"2026-06-01T00:02:08.342714+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XVKFHOX","created_at":"2026-06-01T00:02:08.342714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07283","citing_title":"Multi-time Markov renewal chains and stratified renewal theorems","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I","json":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I.json","graph_json":"https://pith.science/api/pith-number/2XVKFHOXCCGYDUS5TI2RVO324I/graph.json","events_json":"https://pith.science/api/pith-number/2XVKFHOXCCGYDUS5TI2RVO324I/events.json","paper":"https://pith.science/paper/2XVKFHOX"},"agent_actions":{"view_html":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I","download_json":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I.json","view_paper":"https://pith.science/paper/2XVKFHOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.30379&json=true","fetch_graph":"https://pith.science/api/pith-number/2XVKFHOXCCGYDUS5TI2RVO324I/graph.json","fetch_events":"https://pith.science/api/pith-number/2XVKFHOXCCGYDUS5TI2RVO324I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I/action/storage_attestation","attest_author":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I/action/author_attestation","sign_citation":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I/action/citation_signature","submit_replication":"https://pith.science/pith/2XVKFHOXCCGYDUS5TI2RVO324I/action/replication_record"}},"created_at":"2026-06-01T00:02:08.342714+00:00","updated_at":"2026-06-01T00:02:08.342714+00:00"}