{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MXYBPJWTNLD4JDJL3SXGID7SEC","short_pith_number":"pith:MXYBPJWT","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"},"canonical_sha256":"65f017a6d36ac7c48d2bdcae640ff220b419b9daf876028cce3cb2837a8a6cfa","source":{"kind":"arxiv","id":"1711.01635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01635","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01635v1","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01635","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"MXYBPJWTNLD4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MXYBPJWTNLD4JDJL","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MXYBPJWT","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MXYBPJWTNLD4JDJL3SXGID7SEC","target":"record","payload":{"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"},"canonical_sha256":"65f017a6d36ac7c48d2bdcae640ff220b419b9daf876028cce3cb2837a8a6cfa","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"},"source_kind":"arxiv","source_id":"1711.01635","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YSH4sTIPf8wZbChpiIh6WCb8ypTmdR6rXq1IbzGw5Mz5DnATniDzWKHJ9iw66KYgCxWUzZoOBDzyQ+VWKoFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:51:51.808642Z"},"content_sha256":"8d4982ee4274188a6c8f88d3b3f8549e7a303fa4df3f1bf27fc2c97406cb3bbb","schema_version":"1.0","event_id":"sha256:8d4982ee4274188a6c8f88d3b3f8549e7a303fa4df3f1bf27fc2c97406cb3bbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MXYBPJWTNLD4JDJL3SXGID7SEC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxQPTaHCfa3w7r+Vkj2eEbhYpZ8782dU42f0ow6tv6w0w2DMF5gaU/guttxlHOrDno2joq56AAdYJMzC1+2WAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:51:51.808992Z"},"content_sha256":"963e115a3a25bd06af5ae7197e39bb748fc6f45dd6adeaf88a3cda92e23603c5","schema_version":"1.0","event_id":"sha256:963e115a3a25bd06af5ae7197e39bb748fc6f45dd6adeaf88a3cda92e23603c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/bundle.json","state_url":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T08:51:51Z","links":{"resolver":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC","bundle":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/bundle.json","state":"https://pith.science/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXYBPJWTNLD4JDJL3SXGID7SEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MXYBPJWTNLD4JDJL3SXGID7SEC","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":"28733a0422316fb0117d8fa213f2a1fb84543cc4d27d9d1267adb5bef49dcb36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T18:35:09Z","title_canon_sha256":"23a223b2cf5b922f53a9d6e8926e7d3aa51dd6410f1c29a7c806b9302dc0ab12"},"schema_version":"1.0","source":{"id":"1711.01635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01635","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01635v1","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01635","created_at":"2026-05-18T00:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"MXYBPJWTNLD4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MXYBPJWTNLD4JDJL","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MXYBPJWT","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:963e115a3a25bd06af5ae7197e39bb748fc6f45dd6adeaf88a3cda92e23603c5","target":"graph","created_at":"2026-05-18T00:07:11Z","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"},"paper":{"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 ","authors_text":"A. Gaudilliere, C. Melot, F. Castell, L. Avena","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T18:35:09Z","title":"Random Forests and Networks Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01635","kind":"arxiv","version":1},"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:8d4982ee4274188a6c8f88d3b3f8549e7a303fa4df3f1bf27fc2c97406cb3bbb","target":"record","created_at":"2026-05-18T00:07:11Z","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":"28733a0422316fb0117d8fa213f2a1fb84543cc4d27d9d1267adb5bef49dcb36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-05T18:35:09Z","title_canon_sha256":"23a223b2cf5b922f53a9d6e8926e7d3aa51dd6410f1c29a7c806b9302dc0ab12"},"schema_version":"1.0","source":{"id":"1711.01635","kind":"arxiv","version":1}},"canonical_sha256":"65f017a6d36ac7c48d2bdcae640ff220b419b9daf876028cce3cb2837a8a6cfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65f017a6d36ac7c48d2bdcae640ff220b419b9daf876028cce3cb2837a8a6cfa","first_computed_at":"2026-05-18T00:07:11.631584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:11.631584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O/W3XoW1j0GXkYcrkClXchcLQS4DNOtea5C3Dfr2m6nArDcUurCPBMFWO2PIUWMHn0HWi0MXu15JWKfttky8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:11.632198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d4982ee4274188a6c8f88d3b3f8549e7a303fa4df3f1bf27fc2c97406cb3bbb","sha256:963e115a3a25bd06af5ae7197e39bb748fc6f45dd6adeaf88a3cda92e23603c5"],"state_sha256":"e22f6c085241b85ef4f07b2d6e18286be3e564ea9c6374890c3bf15e781ccfe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTiKnYx0IHAFhqe0E5uboglITF8SyBEOojFaideJtP5+f1omb+F5FjkmaBnBd13KSnRa6g6sVRDFrKrZkELUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:51:51.811840Z","bundle_sha256":"9a5dbbbdb007de114345885a1dbb38c92c7e48decf4961331cebf0bfe52cacd2"}}