{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:AM2K72T5EKQ3QK7EGXMZQUBW7M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"981e1f8ac9b0de90d0b50ddd9fc498e3f8390b14080df5539cb880b93a2b3ede","cross_cats_sorted":["cs.DS","math.AG"],"license":"","primary_cat":"math.CO","submitted_at":"2006-02-03T13:28:50Z","title_canon_sha256":"4ecb674d5274948899af6d6ffbfaa1650520a0ef06b2daffcf202eef30d7655d"},"schema_version":"1.0","source":{"id":"math/0602059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602059","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602059v2","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602059","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_12","alias_value":"AM2K72T5EKQ3","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_16","alias_value":"AM2K72T5EKQ3QK7E","created_at":"2026-07-04T14:53:22Z"},{"alias_kind":"pith_short_8","alias_value":"AM2K72T5","created_at":"2026-07-04T14:53:22Z"}],"graph_snapshots":[{"event_id":"sha256:fd3d13826592c640672e9c1e3c4455f7e5609908ecf4d30c79c94c4e8552efce","target":"graph","created_at":"2026-07-04T14:53:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0602059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Pavel Chebotarev, Rafig Agaev","cross_cats":["cs.DS","math.AG"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2006-02-03T13:28:50Z","title":"The Matrix of Maximum Out Forests of a Digraph and Its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602059","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8130a5bc81431f14f25858c15153fc2eebb7467f339cac9f47a991b65fa4806f","target":"record","created_at":"2026-07-04T14:53:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"981e1f8ac9b0de90d0b50ddd9fc498e3f8390b14080df5539cb880b93a2b3ede","cross_cats_sorted":["cs.DS","math.AG"],"license":"","primary_cat":"math.CO","submitted_at":"2006-02-03T13:28:50Z","title_canon_sha256":"4ecb674d5274948899af6d6ffbfaa1650520a0ef06b2daffcf202eef30d7655d"},"schema_version":"1.0","source":{"id":"math/0602059","kind":"arxiv","version":2}},"canonical_sha256":"0334afea7d22a1b82be435d9985036fb3c8a0e2169245575c30fa77d0332598e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0334afea7d22a1b82be435d9985036fb3c8a0e2169245575c30fa77d0332598e","first_computed_at":"2026-07-04T14:53:22.603779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:53:22.603779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AuXlTjxcNft3/fvo6Ki1B+sb8EHFpUydcmZg1ZWaCbUGS7lg3Xvm8SUieef8tEfSCvx2W1BzNkI4QqI3UiQ8Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:53:22.604172Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0602059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8130a5bc81431f14f25858c15153fc2eebb7467f339cac9f47a991b65fa4806f","sha256:fd3d13826592c640672e9c1e3c4455f7e5609908ecf4d30c79c94c4e8552efce"],"state_sha256":"ff57479f2ef21679630c0740c194f76441ecf6c86453954e44751662be3f7eb9"}