{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DREWUTNWM4INIFCWURKIH4HVPT","short_pith_number":"pith:DREWUTNW","schema_version":"1.0","canonical_sha256":"1c496a4db66710d41456a45483f0f57cc332d681b0d55731e00e36ce89576bb3","source":{"kind":"arxiv","id":"2409.16822","version":1},"attestation_state":"computed","paper":{"title":"Gripenberg-like algorithm for the lower spectral radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Francesco Paolo Maiale, Nicola Guglielmi","submitted_at":"2024-09-25T11:19:44Z","abstract_excerpt":"This article presents an extended algorithm for computing the lower spectral radius of finite, non-negative matrix sets. Given a set of matrices $\\mathcal{F} = \\{A_1, \\ldots, A_m\\}$, the lower spectral radius represents the minimal growth rate of sequences in the product semigroup generated by $\\mathcal{F}$. This quantity is crucial for characterizing optimal stable trajectories in discrete dynamical systems of the form $x_{k+1} = A_{i_k} x_k$, where $A_{i_k} \\in \\mathcal{F}$ for all $k \\ge 0$. For the well-known joint spectral radius (which represents the highest growth rate), a famous algori"},"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":"2409.16822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-09-25T11:19:44Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"91b32b5b720ed8c1c6b1943df0804f4ead262fa0bab45bd71b4898a297f54ba3","abstract_canon_sha256":"6130364658fb44e2a34b08a41e5a5686cd397b3525477fa611391d1b4601158d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:39.955391Z","signature_b64":"9bkE1IPeTW3QDK5KM8/4ibj4ewi/POzGh0tA/YEy7zT17hlTQ/ZNrykBCsJ/vM6H+CHlaq/4zViAzr5IRCr8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c496a4db66710d41456a45483f0f57cc332d681b0d55731e00e36ce89576bb3","last_reissued_at":"2026-07-05T09:11:39.954841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:39.954841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gripenberg-like algorithm for the lower spectral radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Francesco Paolo Maiale, Nicola Guglielmi","submitted_at":"2024-09-25T11:19:44Z","abstract_excerpt":"This article presents an extended algorithm for computing the lower spectral radius of finite, non-negative matrix sets. Given a set of matrices $\\mathcal{F} = \\{A_1, \\ldots, A_m\\}$, the lower spectral radius represents the minimal growth rate of sequences in the product semigroup generated by $\\mathcal{F}$. This quantity is crucial for characterizing optimal stable trajectories in discrete dynamical systems of the form $x_{k+1} = A_{i_k} x_k$, where $A_{i_k} \\in \\mathcal{F}$ for all $k \\ge 0$. For the well-known joint spectral radius (which represents the highest growth rate), a famous algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.16822","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/2409.16822/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":"2409.16822","created_at":"2026-07-05T09:11:39.954902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.16822v1","created_at":"2026-07-05T09:11:39.954902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.16822","created_at":"2026-07-05T09:11:39.954902+00:00"},{"alias_kind":"pith_short_12","alias_value":"DREWUTNWM4IN","created_at":"2026-07-05T09:11:39.954902+00:00"},{"alias_kind":"pith_short_16","alias_value":"DREWUTNWM4INIFCW","created_at":"2026-07-05T09:11:39.954902+00:00"},{"alias_kind":"pith_short_8","alias_value":"DREWUTNW","created_at":"2026-07-05T09:11:39.954902+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22468","citing_title":"Continuity and approximability of competitive spectral radii","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT","json":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT.json","graph_json":"https://pith.science/api/pith-number/DREWUTNWM4INIFCWURKIH4HVPT/graph.json","events_json":"https://pith.science/api/pith-number/DREWUTNWM4INIFCWURKIH4HVPT/events.json","paper":"https://pith.science/paper/DREWUTNW"},"agent_actions":{"view_html":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT","download_json":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT.json","view_paper":"https://pith.science/paper/DREWUTNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.16822&json=true","fetch_graph":"https://pith.science/api/pith-number/DREWUTNWM4INIFCWURKIH4HVPT/graph.json","fetch_events":"https://pith.science/api/pith-number/DREWUTNWM4INIFCWURKIH4HVPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT/action/storage_attestation","attest_author":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT/action/author_attestation","sign_citation":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT/action/citation_signature","submit_replication":"https://pith.science/pith/DREWUTNWM4INIFCWURKIH4HVPT/action/replication_record"}},"created_at":"2026-07-05T09:11:39.954902+00:00","updated_at":"2026-07-05T09:11:39.954902+00:00"}