{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:F3NG63YBDBDA3F5SHIK7J4XM2R","short_pith_number":"pith:F3NG63YB","canonical_record":{"source":{"id":"1107.4662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-07-23T07:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"4edbabe6d70001db08a639511e9e5c351cc0b035f0542a5b4ae58a90b9191307","abstract_canon_sha256":"d4809e88f32d21c6aa8acf6d3bc0e52f3ec5e325a0373c4369327b04a4ec0c01"},"schema_version":"1.0"},"canonical_sha256":"2eda6f6f0118460d97b23a15f4f2ecd44709f3dec55af749b89d2fbb6d2e6125","source":{"kind":"arxiv","id":"1107.4662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4662","created_at":"2026-05-18T04:14:47Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4662v1","created_at":"2026-05-18T04:14:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4662","created_at":"2026-05-18T04:14:47Z"},{"alias_kind":"pith_short_12","alias_value":"F3NG63YBDBDA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F3NG63YBDBDA3F5S","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F3NG63YB","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:F3NG63YBDBDA3F5SHIK7J4XM2R","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-07-23T07:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"4edbabe6d70001db08a639511e9e5c351cc0b035f0542a5b4ae58a90b9191307","abstract_canon_sha256":"d4809e88f32d21c6aa8acf6d3bc0e52f3ec5e325a0373c4369327b04a4ec0c01"},"schema_version":"1.0"},"canonical_sha256":"2eda6f6f0118460d97b23a15f4f2ecd44709f3dec55af749b89d2fbb6d2e6125","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:47.022243Z","signature_b64":"VW+XOq7r4EEc+4BhtZYNQ+m2ZBAqq50RiZPtWanpalT8pMKAUBkQgdQzzjW4t9KKAiMU/5pUQ/FAZr7k3ZAEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eda6f6f0118460d97b23a15f4f2ecd44709f3dec55af749b89d2fbb6d2e6125","last_reissued_at":"2026-05-18T04:14:47.021764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:47.021764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4662","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-18T04:14:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJVvn+U7DClJ7KBDEsifbtRwgM7mIpd9hP7zwKpYJDJT3z3ea8ZNPukuKUtavDlQZhk0SbOJAqHJ532cJ2MsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:41:22.349934Z"},"content_sha256":"2f91668695cbab24ec0702c3b660af7364776b7f45f6ed278afa6c0cbe75f4c4","schema_version":"1.0","event_id":"sha256:2f91668695cbab24ec0702c3b660af7364776b7f45f6ed278afa6c0cbe75f4c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:F3NG63YBDBDA3F5SHIK7J4XM2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random walks in small-world exponential treelike networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Guanrong Chen, Xintong Li, Yuan Lin, Zhongzhi Zhang","submitted_at":"2011-07-23T07:16:04Z","abstract_excerpt":"In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the initial node. We obtain the exact mean trapping time defined as the average of first-passage time (FPT) from all nodes to the trap, which scales linearly with the network order $N$ in large networks. Then, we determine analytically the mean sending time, which is the mean of the FPTs from the initial node to all other nodes, and show that it grows with $N$ in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4662","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-18T04:14:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mW2wmRCLMdWvXEBDULxnu1M5M1iseSBlkMFkdGbQdemgFYjYNKHK4TJboWNPs7HAhfhFgkxQHyD2tgavL6UDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:41:22.350556Z"},"content_sha256":"7d2a91848bdd951555fd109f58c19bb0ca3f27618c3a740c8d65ea5926428992","schema_version":"1.0","event_id":"sha256:7d2a91848bdd951555fd109f58c19bb0ca3f27618c3a740c8d65ea5926428992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3NG63YBDBDA3F5SHIK7J4XM2R/bundle.json","state_url":"https://pith.science/pith/F3NG63YBDBDA3F5SHIK7J4XM2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3NG63YBDBDA3F5SHIK7J4XM2R/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-25T12:41:22Z","links":{"resolver":"https://pith.science/pith/F3NG63YBDBDA3F5SHIK7J4XM2R","bundle":"https://pith.science/pith/F3NG63YBDBDA3F5SHIK7J4XM2R/bundle.json","state":"https://pith.science/pith/F3NG63YBDBDA3F5SHIK7J4XM2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3NG63YBDBDA3F5SHIK7J4XM2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:F3NG63YBDBDA3F5SHIK7J4XM2R","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":"d4809e88f32d21c6aa8acf6d3bc0e52f3ec5e325a0373c4369327b04a4ec0c01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-07-23T07:16:04Z","title_canon_sha256":"4edbabe6d70001db08a639511e9e5c351cc0b035f0542a5b4ae58a90b9191307"},"schema_version":"1.0","source":{"id":"1107.4662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4662","created_at":"2026-05-18T04:14:47Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4662v1","created_at":"2026-05-18T04:14:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4662","created_at":"2026-05-18T04:14:47Z"},{"alias_kind":"pith_short_12","alias_value":"F3NG63YBDBDA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F3NG63YBDBDA3F5S","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F3NG63YB","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:7d2a91848bdd951555fd109f58c19bb0ca3f27618c3a740c8d65ea5926428992","target":"graph","created_at":"2026-05-18T04:14:47Z","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":"In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the initial node. We obtain the exact mean trapping time defined as the average of first-passage time (FPT) from all nodes to the trap, which scales linearly with the network order $N$ in large networks. Then, we determine analytically the mean sending time, which is the mean of the FPTs from the initial node to all other nodes, and show that it grows with $N$ in t","authors_text":"Guanrong Chen, Xintong Li, Yuan Lin, Zhongzhi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-07-23T07:16:04Z","title":"Random walks in small-world exponential treelike networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4662","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:2f91668695cbab24ec0702c3b660af7364776b7f45f6ed278afa6c0cbe75f4c4","target":"record","created_at":"2026-05-18T04:14:47Z","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":"d4809e88f32d21c6aa8acf6d3bc0e52f3ec5e325a0373c4369327b04a4ec0c01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-07-23T07:16:04Z","title_canon_sha256":"4edbabe6d70001db08a639511e9e5c351cc0b035f0542a5b4ae58a90b9191307"},"schema_version":"1.0","source":{"id":"1107.4662","kind":"arxiv","version":1}},"canonical_sha256":"2eda6f6f0118460d97b23a15f4f2ecd44709f3dec55af749b89d2fbb6d2e6125","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2eda6f6f0118460d97b23a15f4f2ecd44709f3dec55af749b89d2fbb6d2e6125","first_computed_at":"2026-05-18T04:14:47.021764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:47.021764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VW+XOq7r4EEc+4BhtZYNQ+m2ZBAqq50RiZPtWanpalT8pMKAUBkQgdQzzjW4t9KKAiMU/5pUQ/FAZr7k3ZAEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:47.022243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f91668695cbab24ec0702c3b660af7364776b7f45f6ed278afa6c0cbe75f4c4","sha256:7d2a91848bdd951555fd109f58c19bb0ca3f27618c3a740c8d65ea5926428992"],"state_sha256":"80a1c91efbfccf6a1610e586d1827e78680fbef7ab20feb59b37e8b2f5a1136d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94okBlEQxpGd86DsUoq5alDmfvv0EGEDRTpyC0eFv1NF0qayIEKE3IKrWLbQdJae/VvuJpmAy82ZkNHgJG09CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:41:22.352723Z","bundle_sha256":"67137a2f5a8b4f38c48ae8de17c81d51d85c7037223133479f56326ec16ca2f2"}}