{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:AM2K72T5EKQ3QK7EGXMZQUBW7M","short_pith_number":"pith:AM2K72T5","schema_version":"1.0","canonical_sha256":"0334afea7d22a1b82be435d9985036fb3c8a0e2169245575c30fa77d0332598e","source":{"kind":"arxiv","id":"math/0602059","version":2},"attestation_state":"computed","paper":{"title":"The Matrix of Maximum Out Forests of a Digraph and Its Applications","license":"","headline":"","cross_cats":["cs.DS","math.AG"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2006-02-03T13:28:50Z","abstract_excerpt":"We study the maximum out forests of a (weighted) digraph and the matrix of maximum out forests. A maximum out forest of a digraph G is a spanning subgraph of G that consists of disjoint diverging trees and has the maximum possible number of arcs. If a digraph contains any out arborescences, then maximum out forests coincide with them. We provide a new proof to the Markov chain tree theorem saying that the matrix of Ces`aro limiting probabilities of an arbitrary stationary finite Markov chain coincides with the normalized matrix of maximum out forests of the weighted digraph that corresponds to"},"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":"math/0602059","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-02-03T13:28:50Z","cross_cats_sorted":["cs.DS","math.AG"],"title_canon_sha256":"4ecb674d5274948899af6d6ffbfaa1650520a0ef06b2daffcf202eef30d7655d","abstract_canon_sha256":"981e1f8ac9b0de90d0b50ddd9fc498e3f8390b14080df5539cb880b93a2b3ede"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:22.604172Z","signature_b64":"AuXlTjxcNft3/fvo6Ki1B+sb8EHFpUydcmZg1ZWaCbUGS7lg3Xvm8SUieef8tEfSCvx2W1BzNkI4QqI3UiQ8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0334afea7d22a1b82be435d9985036fb3c8a0e2169245575c30fa77d0332598e","last_reissued_at":"2026-07-04T14:53:22.603779Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:22.603779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Matrix of Maximum Out Forests of a Digraph and Its Applications","license":"","headline":"","cross_cats":["cs.DS","math.AG"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2006-02-03T13:28:50Z","abstract_excerpt":"We study the maximum out forests of a (weighted) digraph and the matrix of maximum out forests. A maximum out forest of a digraph G is a spanning subgraph of G that consists of disjoint diverging trees and has the maximum possible number of arcs. If a digraph contains any out arborescences, then maximum out forests coincide with them. We provide a new proof to the Markov chain tree theorem saying that the matrix of Ces`aro limiting probabilities of an arbitrary stationary finite Markov chain coincides with the normalized matrix of maximum out forests of the weighted digraph that corresponds to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602059","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0602059/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":"math/0602059","created_at":"2026-07-04T14:53:22.603841+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0602059v2","created_at":"2026-07-04T14:53:22.603841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602059","created_at":"2026-07-04T14:53:22.603841+00:00"},{"alias_kind":"pith_short_12","alias_value":"AM2K72T5EKQ3","created_at":"2026-07-04T14:53:22.603841+00:00"},{"alias_kind":"pith_short_16","alias_value":"AM2K72T5EKQ3QK7E","created_at":"2026-07-04T14:53:22.603841+00:00"},{"alias_kind":"pith_short_8","alias_value":"AM2K72T5","created_at":"2026-07-04T14:53:22.603841+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/AM2K72T5EKQ3QK7EGXMZQUBW7M","json":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M.json","graph_json":"https://pith.science/api/pith-number/AM2K72T5EKQ3QK7EGXMZQUBW7M/graph.json","events_json":"https://pith.science/api/pith-number/AM2K72T5EKQ3QK7EGXMZQUBW7M/events.json","paper":"https://pith.science/paper/AM2K72T5"},"agent_actions":{"view_html":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M","download_json":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M.json","view_paper":"https://pith.science/paper/AM2K72T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0602059&json=true","fetch_graph":"https://pith.science/api/pith-number/AM2K72T5EKQ3QK7EGXMZQUBW7M/graph.json","fetch_events":"https://pith.science/api/pith-number/AM2K72T5EKQ3QK7EGXMZQUBW7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M/action/storage_attestation","attest_author":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M/action/author_attestation","sign_citation":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M/action/citation_signature","submit_replication":"https://pith.science/pith/AM2K72T5EKQ3QK7EGXMZQUBW7M/action/replication_record"}},"created_at":"2026-07-04T14:53:22.603841+00:00","updated_at":"2026-07-04T14:53:22.603841+00:00"}