{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3UXP2RVNIWB7NYHESTYWHQWYXA","short_pith_number":"pith:3UXP2RVN","schema_version":"1.0","canonical_sha256":"dd2efd46ad4583f6e0e494f163c2d8b80d7080bc4a08946fbd9895ee493b7e2b","source":{"kind":"arxiv","id":"1207.6994","version":1},"attestation_state":"computed","paper":{"title":"Random Walks between Leaves of Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cond-mat.dis-nn","authors_text":"David Lancaster","submitted_at":"2012-07-30T16:58:43Z","abstract_excerpt":"We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk.One approach is to label nodes according to both their total degree and the number of links connected to leaf nodes, and as a byproduct we compute the probability of a random node of a scale free network having such a label."},"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":"1207.6994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-07-30T16:58:43Z","cross_cats_sorted":["cs.CY"],"title_canon_sha256":"ad9b8162435b28be83e625c0931a78f30740dc8d160dc2535c962eddceebd402","abstract_canon_sha256":"be911cf08d201101cec3c5fef2d1d8db2f82d5f398b636737f800153f510e44d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:21.993628Z","signature_b64":"Po+qd5+8ZJelXP9vPYqVG9x64opaHG2rE/i4B19Qe36oOYm6adeWf2YPlRmmpwQiGi14swZGg7RJ95FJHTFlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd2efd46ad4583f6e0e494f163c2d8b80d7080bc4a08946fbd9895ee493b7e2b","last_reissued_at":"2026-05-18T01:11:21.993106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:21.993106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Walks between Leaves of Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY"],"primary_cat":"cond-mat.dis-nn","authors_text":"David Lancaster","submitted_at":"2012-07-30T16:58:43Z","abstract_excerpt":"We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk.One approach is to label nodes according to both their total degree and the number of links connected to leaf nodes, and as a byproduct we compute the probability of a random node of a scale free network having such a label."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6994","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":"1207.6994","created_at":"2026-05-18T01:11:21.993183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6994v1","created_at":"2026-05-18T01:11:21.993183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6994","created_at":"2026-05-18T01:11:21.993183+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UXP2RVNIWB7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UXP2RVNIWB7NYHE","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UXP2RVN","created_at":"2026-05-18T12:26:53.410803+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/3UXP2RVNIWB7NYHESTYWHQWYXA","json":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA.json","graph_json":"https://pith.science/api/pith-number/3UXP2RVNIWB7NYHESTYWHQWYXA/graph.json","events_json":"https://pith.science/api/pith-number/3UXP2RVNIWB7NYHESTYWHQWYXA/events.json","paper":"https://pith.science/paper/3UXP2RVN"},"agent_actions":{"view_html":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA","download_json":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA.json","view_paper":"https://pith.science/paper/3UXP2RVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6994&json=true","fetch_graph":"https://pith.science/api/pith-number/3UXP2RVNIWB7NYHESTYWHQWYXA/graph.json","fetch_events":"https://pith.science/api/pith-number/3UXP2RVNIWB7NYHESTYWHQWYXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA/action/storage_attestation","attest_author":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA/action/author_attestation","sign_citation":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA/action/citation_signature","submit_replication":"https://pith.science/pith/3UXP2RVNIWB7NYHESTYWHQWYXA/action/replication_record"}},"created_at":"2026-05-18T01:11:21.993183+00:00","updated_at":"2026-05-18T01:11:21.993183+00:00"}