{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Y4I2JFIWS3ONCC6FF2XDBZ6GIJ","short_pith_number":"pith:Y4I2JFIW","schema_version":"1.0","canonical_sha256":"c711a4951696dcd10bc52eae30e7c642610809c3e95e03ea1ba1acd5b602c71c","source":{"kind":"arxiv","id":"1006.0577","version":1},"attestation_state":"computed","paper":{"title":"A Perron iteration for the solution of a quadratic vector equation arising in Markovian Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Beatrice Meini, Federico Poloni","submitted_at":"2010-06-03T08:01:10Z","abstract_excerpt":"We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems."},"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":"1006.0577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-06-03T08:01:10Z","cross_cats_sorted":[],"title_canon_sha256":"604125fa424990094a5c97234f571f9f96bf07ae0ab58bad60f888ab9c7be423","abstract_canon_sha256":"ce6b69ee0972e255d356f71f9cb629457aa37fe9e9227d1a5861f5a0412477b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:35.147645Z","signature_b64":"Z75wWG61tcmpqhdWX+qADfqARjOY5NuAq+Il+gdWTtf1n4nlW1kIydmzZ5i4E41sGF3+fKPQvv9cGVab01LmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c711a4951696dcd10bc52eae30e7c642610809c3e95e03ea1ba1acd5b602c71c","last_reissued_at":"2026-05-18T04:09:35.147165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:35.147165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Perron iteration for the solution of a quadratic vector equation arising in Markovian Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Beatrice Meini, Federico Poloni","submitted_at":"2010-06-03T08:01:10Z","abstract_excerpt":"We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0577","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1006.0577","created_at":"2026-05-18T04:09:35.147234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0577v1","created_at":"2026-05-18T04:09:35.147234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0577","created_at":"2026-05-18T04:09:35.147234+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4I2JFIWS3ON","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4I2JFIWS3ONCC6F","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4I2JFIW","created_at":"2026-05-18T12:26:17.028572+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/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ","json":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ.json","graph_json":"https://pith.science/api/pith-number/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/graph.json","events_json":"https://pith.science/api/pith-number/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/events.json","paper":"https://pith.science/paper/Y4I2JFIW"},"agent_actions":{"view_html":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ","download_json":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ.json","view_paper":"https://pith.science/paper/Y4I2JFIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0577&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/action/storage_attestation","attest_author":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/action/author_attestation","sign_citation":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/action/citation_signature","submit_replication":"https://pith.science/pith/Y4I2JFIWS3ONCC6FF2XDBZ6GIJ/action/replication_record"}},"created_at":"2026-05-18T04:09:35.147234+00:00","updated_at":"2026-05-18T04:09:35.147234+00:00"}