{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DKMAEYCEKHP2AFNO7R4V6PXLUZ","short_pith_number":"pith:DKMAEYCE","canonical_record":{"source":{"id":"1609.08375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-09-27T12:30:49Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"e34fd711de219155106407f6460d3039ad97ec645242fc185afa2ddf7ef48600","abstract_canon_sha256":"a46e6fde4f3f7567cb7388f66ce99b88e305934d48046f2a480f73df61a9a0b7"},"schema_version":"1.0"},"canonical_sha256":"1a9802604451dfa015aefc795f3eeba66dbf9146065a080e233100bddabcf608","source":{"kind":"arxiv","id":"1609.08375","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08375","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08375v2","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08375","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"DKMAEYCEKHP2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKMAEYCEKHP2AFNO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKMAEYCE","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DKMAEYCEKHP2AFNO7R4V6PXLUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-09-27T12:30:49Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"e34fd711de219155106407f6460d3039ad97ec645242fc185afa2ddf7ef48600","abstract_canon_sha256":"a46e6fde4f3f7567cb7388f66ce99b88e305934d48046f2a480f73df61a9a0b7"},"schema_version":"1.0"},"canonical_sha256":"1a9802604451dfa015aefc795f3eeba66dbf9146065a080e233100bddabcf608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:30.359948Z","signature_b64":"MTOiMPp26yvQ5HsXyOE8pi6y7MBsNmLteHxMzmlQqlg2y6p5sXmZxzyqAGbHWJfzLs1yIRQito3NYu/rEm54Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a9802604451dfa015aefc795f3eeba66dbf9146065a080e233100bddabcf608","last_reissued_at":"2026-05-18T00:45:30.359438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:30.359438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08375","source_version":2,"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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCJeaNrqY+7+ngvwChd7RNEXldjKPPWkitlep0OTMRjFPF3g9ThonstTZHTacfjcb5cPzFKPRBRAwdeFLfCZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:39:47.040767Z"},"content_sha256":"526b2ee9bcc425b725e128147ede389c3f79262c30a2e1a77b25f652448bb559","schema_version":"1.0","event_id":"sha256:526b2ee9bcc425b725e128147ede389c3f79262c30a2e1a77b25f652448bb559"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DKMAEYCEKHP2AFNO7R4V6PXLUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distribution of first hitting times of non-backtracking random walks on Erd\\H{o}s-R\\'enyi networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Eytan Katzav, Ido Tishby, Ofer Biham","submitted_at":"2016-09-27T12:30:49Z","abstract_excerpt":"We present analytical results for the distribution of first hitting times of non-backtracking random walks on finite Erd\\H{o}s-R\\'enyi networks of $N$ nodes. The walkers hop randomly between adjacent nodes on the network, without stepping back to the previous node, until they hit a node which they have already visited before or get trapped in a dead-end node. At this point, the path is terminated. The length, $d$, of the resulting path, is called the first hitting time. Using recursion equations, we obtain analytical results for the tail distribution of first hitting times, $P(d>\\ell)$, $\\ell="},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08375","kind":"arxiv","version":2},"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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/d1yGpEEQ0ON4Y/lnZTvmls8QEBXWbBQUfCG8XwEfTH3ycG5v546xT5cMMCPOw+fyP4gd1vVCqs8Uht+1fUvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:39:47.041178Z"},"content_sha256":"d0ebe78a49aeb0cf8d7076b20eb324b31f1eb74498a1a22be38a3e631343c17a","schema_version":"1.0","event_id":"sha256:d0ebe78a49aeb0cf8d7076b20eb324b31f1eb74498a1a22be38a3e631343c17a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ/bundle.json","state_url":"https://pith.science/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ/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-27T22:39:47Z","links":{"resolver":"https://pith.science/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ","bundle":"https://pith.science/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ/bundle.json","state":"https://pith.science/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKMAEYCEKHP2AFNO7R4V6PXLUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DKMAEYCEKHP2AFNO7R4V6PXLUZ","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":"a46e6fde4f3f7567cb7388f66ce99b88e305934d48046f2a480f73df61a9a0b7","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-09-27T12:30:49Z","title_canon_sha256":"e34fd711de219155106407f6460d3039ad97ec645242fc185afa2ddf7ef48600"},"schema_version":"1.0","source":{"id":"1609.08375","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08375","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08375v2","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08375","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"DKMAEYCEKHP2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKMAEYCEKHP2AFNO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKMAEYCE","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:d0ebe78a49aeb0cf8d7076b20eb324b31f1eb74498a1a22be38a3e631343c17a","target":"graph","created_at":"2026-05-18T00:45:30Z","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":"We present analytical results for the distribution of first hitting times of non-backtracking random walks on finite Erd\\H{o}s-R\\'enyi networks of $N$ nodes. The walkers hop randomly between adjacent nodes on the network, without stepping back to the previous node, until they hit a node which they have already visited before or get trapped in a dead-end node. At this point, the path is terminated. The length, $d$, of the resulting path, is called the first hitting time. Using recursion equations, we obtain analytical results for the tail distribution of first hitting times, $P(d>\\ell)$, $\\ell=","authors_text":"Eytan Katzav, Ido Tishby, Ofer Biham","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-09-27T12:30:49Z","title":"The distribution of first hitting times of non-backtracking random walks on Erd\\H{o}s-R\\'enyi networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08375","kind":"arxiv","version":2},"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:526b2ee9bcc425b725e128147ede389c3f79262c30a2e1a77b25f652448bb559","target":"record","created_at":"2026-05-18T00:45:30Z","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":"a46e6fde4f3f7567cb7388f66ce99b88e305934d48046f2a480f73df61a9a0b7","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-09-27T12:30:49Z","title_canon_sha256":"e34fd711de219155106407f6460d3039ad97ec645242fc185afa2ddf7ef48600"},"schema_version":"1.0","source":{"id":"1609.08375","kind":"arxiv","version":2}},"canonical_sha256":"1a9802604451dfa015aefc795f3eeba66dbf9146065a080e233100bddabcf608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a9802604451dfa015aefc795f3eeba66dbf9146065a080e233100bddabcf608","first_computed_at":"2026-05-18T00:45:30.359438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:30.359438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MTOiMPp26yvQ5HsXyOE8pi6y7MBsNmLteHxMzmlQqlg2y6p5sXmZxzyqAGbHWJfzLs1yIRQito3NYu/rEm54Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:30.359948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08375","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:526b2ee9bcc425b725e128147ede389c3f79262c30a2e1a77b25f652448bb559","sha256:d0ebe78a49aeb0cf8d7076b20eb324b31f1eb74498a1a22be38a3e631343c17a"],"state_sha256":"c307553e22b68f86ac5adfb1dc758b003f9ab1724462f93c63b27100410b6baa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whmLh2OxTjCbUboKfGau5PMSIAweNJ/XaIfQLKll7PSs3lmO3l5dstdTMBadP5YLFJU+59OnjH4v082JaBRjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:39:47.044665Z","bundle_sha256":"1f50fdecb6690b50c877eff91fea24f91c2e8161b7b312e7ec34b8903185b69d"}}