{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:QRSCADH7CY6GLVKOL6P3SVPYQD","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":"681da3c3219ab669447596a414e9860accc9731c66ed6fd436aab0aa9ea64683","cross_cats_sorted":["cs.CV","cs.NI"],"license":"","primary_cat":"math.CO","submitted_at":"2005-08-09T20:11:27Z","title_canon_sha256":"8b31feab3c5845ed583d212763c1e8d1d81f7c40d4182133a1fc706d7166f552"},"schema_version":"1.0","source":{"id":"math/0508171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0508171","created_at":"2026-07-04T14:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"math/0508171v2","created_at":"2026-07-04T14:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0508171","created_at":"2026-07-04T14:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"QRSCADH7CY6G","created_at":"2026-07-04T14:50:36Z"},{"alias_kind":"pith_short_16","alias_value":"QRSCADH7CY6GLVKO","created_at":"2026-07-04T14:50:36Z"},{"alias_kind":"pith_short_8","alias_value":"QRSCADH7","created_at":"2026-07-04T14:50:36Z"}],"graph_snapshots":[{"event_id":"sha256:e65beafe93edc1cf4177b67ff547de88420b0c50ffcb0a2d37a798ffa49d6343","target":"graph","created_at":"2026-07-04T14:50:36Z","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/0508171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The matrices of spanning rooted forests are studied as a tool for analysing the structure of digraphs and measuring their characteristics. The problems of revealing the basis bicomponents, measuring vertex proximity, and ranking from preference relations / sports competitions are considered. It is shown that the vertex accessibility measure based on spanning forests has a number of desirable properties. An interpretation for the normalized matrix of out-forests in terms of information dissemination is given.\n  Keywords: Laplacian matrix, spanning forest, matrix-forest theorem, proximity measur","authors_text":"Pavel Chebotarev, Rafig Agaev","cross_cats":["cs.CV","cs.NI"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2005-08-09T20:11:27Z","title":"Matrices of Forests and the Analysis of Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0508171","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:388ac6bc78b86c2de32228e6ab5af43030b7085b3d08cd9689846244038b33c7","target":"record","created_at":"2026-07-04T14:50:36Z","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":"681da3c3219ab669447596a414e9860accc9731c66ed6fd436aab0aa9ea64683","cross_cats_sorted":["cs.CV","cs.NI"],"license":"","primary_cat":"math.CO","submitted_at":"2005-08-09T20:11:27Z","title_canon_sha256":"8b31feab3c5845ed583d212763c1e8d1d81f7c40d4182133a1fc706d7166f552"},"schema_version":"1.0","source":{"id":"math/0508171","kind":"arxiv","version":2}},"canonical_sha256":"8464200cff163c65d54e5f9fb955f880f161946b888418af5c8ecf2017187bb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8464200cff163c65d54e5f9fb955f880f161946b888418af5c8ecf2017187bb0","first_computed_at":"2026-07-04T14:50:36.486285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:50:36.486285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wh08b8VASOFjbQCCpJSx/FG8YTyaoAQZEzdMThuBm/Kgnn0Ga9L6M9UW87qppayjMhllcLC4anZqwHW/s79rAA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:50:36.486695Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0508171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:388ac6bc78b86c2de32228e6ab5af43030b7085b3d08cd9689846244038b33c7","sha256:e65beafe93edc1cf4177b67ff547de88420b0c50ffcb0a2d37a798ffa49d6343"],"state_sha256":"1d427aeeed51281229ee53a76ba90658c989b0fe56a6063e075c4331e00d8b20"}