{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2DSMREEKCIEJEUGWOPQFLE72SZ","short_pith_number":"pith:2DSMREEK","schema_version":"1.0","canonical_sha256":"d0e4c8908a12089250d673e05593fa9641c5cce5c0444910eb40d47a5ec19c1a","source":{"kind":"arxiv","id":"1305.6441","version":1},"attestation_state":"computed","paper":{"title":"Matrices of forests, analysis of networks, and ranking problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DM","cs.NI"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2013-05-28T10:43:55Z","abstract_excerpt":"The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic 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 stochastic matrix of out-forests in terms of information dissemination is given."},"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":"1305.6441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-28T10:43:55Z","cross_cats_sorted":["cs.CV","cs.DM","cs.NI"],"title_canon_sha256":"256f3ec8cd7c899274c7e434e2012758c8040b2d88112c04b0e0993935d64207","abstract_canon_sha256":"6bce8c9b5e5bfa4b9485935cd19196212b3066d768c9b8455a87dd04ed24a6dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:40.751547Z","signature_b64":"j1qe4XJcCJpTKFcVZmhcuntVI0r6AWBxcJHfHsHdevETwBMM4mxyAfNCqCbwVlxNyip4PTUl/HrznA6dAjOmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e4c8908a12089250d673e05593fa9641c5cce5c0444910eb40d47a5ec19c1a","last_reissued_at":"2026-05-18T03:24:40.750883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:40.750883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrices of forests, analysis of networks, and ranking problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DM","cs.NI"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2013-05-28T10:43:55Z","abstract_excerpt":"The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic 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 stochastic matrix of out-forests in terms of information dissemination is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6441","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":"1305.6441","created_at":"2026-05-18T03:24:40.750984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6441v1","created_at":"2026-05-18T03:24:40.750984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6441","created_at":"2026-05-18T03:24:40.750984+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DSMREEKCIEJ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DSMREEKCIEJEUGW","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DSMREEK","created_at":"2026-05-18T12:27:30.460161+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/2DSMREEKCIEJEUGWOPQFLE72SZ","json":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ.json","graph_json":"https://pith.science/api/pith-number/2DSMREEKCIEJEUGWOPQFLE72SZ/graph.json","events_json":"https://pith.science/api/pith-number/2DSMREEKCIEJEUGWOPQFLE72SZ/events.json","paper":"https://pith.science/paper/2DSMREEK"},"agent_actions":{"view_html":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ","download_json":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ.json","view_paper":"https://pith.science/paper/2DSMREEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6441&json=true","fetch_graph":"https://pith.science/api/pith-number/2DSMREEKCIEJEUGWOPQFLE72SZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2DSMREEKCIEJEUGWOPQFLE72SZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ/action/storage_attestation","attest_author":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ/action/author_attestation","sign_citation":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ/action/citation_signature","submit_replication":"https://pith.science/pith/2DSMREEKCIEJEUGWOPQFLE72SZ/action/replication_record"}},"created_at":"2026-05-18T03:24:40.750984+00:00","updated_at":"2026-05-18T03:24:40.750984+00:00"}