{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MXYBPJWTNLD4JDJL3SXGID7SEC","short_pith_number":"pith:MXYBPJWT","schema_version":"1.0","canonical_sha256":"65f017a6d36ac7c48d2bdcae640ff220b419b9daf876028cce3cb2837a8a6cfa","source":{"kind":"arxiv","id":"1711.01635","version":1},"attestation_state":"computed","paper":{"title":"Random Forests and Networks Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Gaudilliere, C. Melot, F. Castell, L. Avena","submitted_at":"2017-11-05T18:35:09Z","abstract_excerpt":"D. Wilson~\\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works~\\cite{AG1,AG2,ACGM1,ACGM2} we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational "},"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":"1711.01635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T18:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"23a223b2cf5b922f53a9d6e8926e7d3aa51dd6410f1c29a7c806b9302dc0ab12","abstract_canon_sha256":"28733a0422316fb0117d8fa213f2a1fb84543cc4d27d9d1267adb5bef49dcb36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:11.632198Z","signature_b64":"O/W3XoW1j0GXkYcrkClXchcLQS4DNOtea5C3Dfr2m6nArDcUurCPBMFWO2PIUWMHn0HWi0MXu15JWKfttky8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f017a6d36ac7c48d2bdcae640ff220b419b9daf876028cce3cb2837a8a6cfa","last_reissued_at":"2026-05-18T00:07:11.631584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:11.631584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Forests and Networks Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Gaudilliere, C. Melot, F. Castell, L. Avena","submitted_at":"2017-11-05T18:35:09Z","abstract_excerpt":"D. Wilson~\\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works~\\cite{AG1,AG2,ACGM1,ACGM2} we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01635","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":"1711.01635","created_at":"2026-05-18T00:07:11.631664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01635v1","created_at":"2026-05-18T00:07:11.631664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01635","created_at":"2026-05-18T00:07:11.631664+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXYBPJWTNLD4","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXYBPJWTNLD4JDJL","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXYBPJWT","created_at":"2026-05-18T12:31:31.346846+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/MXYBPJWTNLD4JDJL3SXGID7SEC","json":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC.json","graph_json":"https://pith.science/api/pith-number/MXYBPJWTNLD4JDJL3SXGID7SEC/graph.json","events_json":"https://pith.science/api/pith-number/MXYBPJWTNLD4JDJL3SXGID7SEC/events.json","paper":"https://pith.science/paper/MXYBPJWT"},"agent_actions":{"view_html":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC","download_json":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC.json","view_paper":"https://pith.science/paper/MXYBPJWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01635&json=true","fetch_graph":"https://pith.science/api/pith-number/MXYBPJWTNLD4JDJL3SXGID7SEC/graph.json","fetch_events":"https://pith.science/api/pith-number/MXYBPJWTNLD4JDJL3SXGID7SEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/action/storage_attestation","attest_author":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/action/author_attestation","sign_citation":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/action/citation_signature","submit_replication":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/action/replication_record"}},"created_at":"2026-05-18T00:07:11.631664+00:00","updated_at":"2026-05-18T00:07:11.631664+00:00"}