{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:E63ELKGTPI4GKFMNRMNTQDWBVD","short_pith_number":"pith:E63ELKGT","schema_version":"1.0","canonical_sha256":"27b645a8d37a3865158d8b1b380ec1a8fdc19833e3562ff7b6d03de2af15bfca","source":{"kind":"arxiv","id":"1005.5614","version":1},"attestation_state":"computed","paper":{"title":"Construction et maintien d'une for\\^et couvrante dans un r\\'eseau dynamique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arnaud Casteigts (SITE), Fr\\'ed\\'eric Guinand (LITIS), Serge Chaumette (LaBRI), Yoann Pign\\'e (ILIAS)","submitted_at":"2010-05-31T08:21:22Z","abstract_excerpt":"In this work we introduce the principles of an algorithm that constructs and maintains a spanning forest in a mobile telecommunication network-a MANET. The algorithm is based on the random walk of a token and is entirely decentralized. A probability analysis is performed when the network is static. Then we show that performances can be slightly enhanced when adding a memory process in the walk on the token."},"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":"1005.5614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-05-31T08:21:22Z","cross_cats_sorted":[],"title_canon_sha256":"7c0245fd24f5819c0286a1da2d70ec96657cb8fb2d8e8a89c814f23556524a28","abstract_canon_sha256":"30062343f9651bafd5e0f483c8a21bbe7c0d6de86b4092ba9b7ac5ce6d027dcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:29:51.562105Z","signature_b64":"A/qyw9f16MRfxvDa4knibLqudTnzoD35fX/ewD1hAXI7QBsoNd2Z+uUTHShrXglGRa1+/9f+KwYpKsNBGGgACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b645a8d37a3865158d8b1b380ec1a8fdc19833e3562ff7b6d03de2af15bfca","last_reissued_at":"2026-07-04T17:29:51.561712Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:29:51.561712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction et maintien d'une for\\^et couvrante dans un r\\'eseau dynamique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arnaud Casteigts (SITE), Fr\\'ed\\'eric Guinand (LITIS), Serge Chaumette (LaBRI), Yoann Pign\\'e (ILIAS)","submitted_at":"2010-05-31T08:21:22Z","abstract_excerpt":"In this work we introduce the principles of an algorithm that constructs and maintains a spanning forest in a mobile telecommunication network-a MANET. The algorithm is based on the random walk of a token and is entirely decentralized. A probability analysis is performed when the network is static. Then we show that performances can be slightly enhanced when adding a memory process in the walk on the token."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5614","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1005.5614/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1005.5614","created_at":"2026-07-04T17:29:51.561779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.5614v1","created_at":"2026-07-04T17:29:51.561779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5614","created_at":"2026-07-04T17:29:51.561779+00:00"},{"alias_kind":"pith_short_12","alias_value":"E63ELKGTPI4G","created_at":"2026-07-04T17:29:51.561779+00:00"},{"alias_kind":"pith_short_16","alias_value":"E63ELKGTPI4GKFMN","created_at":"2026-07-04T17:29:51.561779+00:00"},{"alias_kind":"pith_short_8","alias_value":"E63ELKGT","created_at":"2026-07-04T17:29:51.561779+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/E63ELKGTPI4GKFMNRMNTQDWBVD","json":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD.json","graph_json":"https://pith.science/api/pith-number/E63ELKGTPI4GKFMNRMNTQDWBVD/graph.json","events_json":"https://pith.science/api/pith-number/E63ELKGTPI4GKFMNRMNTQDWBVD/events.json","paper":"https://pith.science/paper/E63ELKGT"},"agent_actions":{"view_html":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD","download_json":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD.json","view_paper":"https://pith.science/paper/E63ELKGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.5614&json=true","fetch_graph":"https://pith.science/api/pith-number/E63ELKGTPI4GKFMNRMNTQDWBVD/graph.json","fetch_events":"https://pith.science/api/pith-number/E63ELKGTPI4GKFMNRMNTQDWBVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD/action/storage_attestation","attest_author":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD/action/author_attestation","sign_citation":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD/action/citation_signature","submit_replication":"https://pith.science/pith/E63ELKGTPI4GKFMNRMNTQDWBVD/action/replication_record"}},"created_at":"2026-07-04T17:29:51.561779+00:00","updated_at":"2026-07-04T17:29:51.561779+00:00"}