{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RF6QAXGSFZFJSN2KC5W72W2XSJ","short_pith_number":"pith:RF6QAXGS","schema_version":"1.0","canonical_sha256":"897d005cd22e4a99374a176dfd5b57924165b500e1ad8135743252b73731b638","source":{"kind":"arxiv","id":"1412.3102","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Average Travel Time for Stateless Opportunistic Routing Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Sateeshkrishna Dhuli, Yatindra Nath Singh","submitted_at":"2014-12-09T12:38:22Z","abstract_excerpt":"Wireless network applications, such as, searching, routing, self stabilization and query processing can be modeled as random walks on graphs. Stateless Opportunistic routing technique is a robust distributed routing technique based on random walk approach, where nodes transfer the packets to one of their direct neighbors uniformly, until the packets reach their destinations. Simplicity in execution, fault tolerance, low overhead and robustness to topology changes made it more suitable to wireless sensor networks scenarios. But the main disadvantage of stateless opportunistic routing is estimat"},"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":"1412.3102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-09T12:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"c85721b2687962285274dd08648437a9c9f29ad43ae70cdbd519cc2db34001be","abstract_canon_sha256":"44e90651d7e590bf2c0e800e021cb2186c642484a8f99fa985fecdc0bf6ce926"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:37.565957Z","signature_b64":"ORtJlLEMxV8r4KnsHFZHNLQ65R7qfrRbkq3LH8J0hiNFX+2BUCont2xIRplaK2D9c/o1D06Q+8KlAMNLNNQLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897d005cd22e4a99374a176dfd5b57924165b500e1ad8135743252b73731b638","last_reissued_at":"2026-05-18T02:31:37.565424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:37.565424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Average Travel Time for Stateless Opportunistic Routing Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Sateeshkrishna Dhuli, Yatindra Nath Singh","submitted_at":"2014-12-09T12:38:22Z","abstract_excerpt":"Wireless network applications, such as, searching, routing, self stabilization and query processing can be modeled as random walks on graphs. Stateless Opportunistic routing technique is a robust distributed routing technique based on random walk approach, where nodes transfer the packets to one of their direct neighbors uniformly, until the packets reach their destinations. Simplicity in execution, fault tolerance, low overhead and robustness to topology changes made it more suitable to wireless sensor networks scenarios. But the main disadvantage of stateless opportunistic routing is estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3102","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":"1412.3102","created_at":"2026-05-18T02:31:37.565506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3102v1","created_at":"2026-05-18T02:31:37.565506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3102","created_at":"2026-05-18T02:31:37.565506+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF6QAXGSFZFJ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF6QAXGSFZFJSN2K","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF6QAXGS","created_at":"2026-05-18T12:28:46.137349+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/RF6QAXGSFZFJSN2KC5W72W2XSJ","json":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ.json","graph_json":"https://pith.science/api/pith-number/RF6QAXGSFZFJSN2KC5W72W2XSJ/graph.json","events_json":"https://pith.science/api/pith-number/RF6QAXGSFZFJSN2KC5W72W2XSJ/events.json","paper":"https://pith.science/paper/RF6QAXGS"},"agent_actions":{"view_html":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ","download_json":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ.json","view_paper":"https://pith.science/paper/RF6QAXGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3102&json=true","fetch_graph":"https://pith.science/api/pith-number/RF6QAXGSFZFJSN2KC5W72W2XSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RF6QAXGSFZFJSN2KC5W72W2XSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ/action/storage_attestation","attest_author":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ/action/author_attestation","sign_citation":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ/action/citation_signature","submit_replication":"https://pith.science/pith/RF6QAXGSFZFJSN2KC5W72W2XSJ/action/replication_record"}},"created_at":"2026-05-18T02:31:37.565506+00:00","updated_at":"2026-05-18T02:31:37.565506+00:00"}