{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YXRIJRYY3D5QF4KTAV2OLBRO7N","short_pith_number":"pith:YXRIJRYY","canonical_record":{"source":{"id":"1410.6397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-23T15:28:54Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"63b223a1143b8fda3a33c7b00bef17f6a3076ef941e3dd09c47f98518536c1fb","abstract_canon_sha256":"a08e5c0cb3a5ffeef2d3a3dfda106ab0c9fe4d1f6aaba79ad8243dc43d6851c4"},"schema_version":"1.0"},"canonical_sha256":"c5e284c718d8fb02f1530574e5862efb73a38c52e898458447f7b19fcd902a9c","source":{"kind":"arxiv","id":"1410.6397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6397","created_at":"2026-05-18T02:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6397v1","created_at":"2026-05-18T02:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6397","created_at":"2026-05-18T02:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"YXRIJRYY3D5Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXRIJRYY3D5QF4KT","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXRIJRYY","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YXRIJRYY3D5QF4KTAV2OLBRO7N","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-23T15:28:54Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"63b223a1143b8fda3a33c7b00bef17f6a3076ef941e3dd09c47f98518536c1fb","abstract_canon_sha256":"a08e5c0cb3a5ffeef2d3a3dfda106ab0c9fe4d1f6aaba79ad8243dc43d6851c4"},"schema_version":"1.0"},"canonical_sha256":"c5e284c718d8fb02f1530574e5862efb73a38c52e898458447f7b19fcd902a9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:30.993548Z","signature_b64":"OsS/xLJrnAWMSl51HT3Pdk1jVN8wBo5eLBkYVhMQekggXeb779vbRot72iwPi3otUd3fa38JYRdRXYJKBe75Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e284c718d8fb02f1530574e5862efb73a38c52e898458447f7b19fcd902a9c","last_reissued_at":"2026-05-18T02:39:30.992947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:30.992947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6397","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-18T02:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwS2G4b/XMbdOBYb9dvXahbW9fzxohdWNKI8LgI8HEuzCtqej5ZK0/7MKqdeD4QDRMNY1G5kDEGm6g8IIFK5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:40:11.973816Z"},"content_sha256":"138b53bc9f71eae726492de923fa76f49fe0868bbe8c35f6bb81e3d3350a6bab","schema_version":"1.0","event_id":"sha256:138b53bc9f71eae726492de923fa76f49fe0868bbe8c35f6bb81e3d3350a6bab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YXRIJRYY3D5QF4KTAV2OLBRO7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Justifying the small-world phenomenon via random recursive trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO"],"primary_cat":"cs.DM","authors_text":"Abbas Mehrabian","submitted_at":"2014-10-23T15:28:54Z","abstract_excerpt":"We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the technique is three-fold: it is quite simple and provides short proofs, it is applicable to a broad variety of models including those incorporating preferential attachment, and it provides bounds with small constants. We illustrate this by proving, for the first time, logarithmic upper bounds for the diameters of the following well known models: the forest fire model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6397","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-18T02:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jmr+PHJP8kWJ7iMd8J3N8xCs/Lx6C8TK3BZxNDJXttLHL4WG0fd/iXrK0RfHvZZjtaBFFxq8VdBLenNJ24KVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:40:11.974213Z"},"content_sha256":"80384323bd587d5b803f85ed5e6015c3c2cc94252863ec5e62c42282e00bc404","schema_version":"1.0","event_id":"sha256:80384323bd587d5b803f85ed5e6015c3c2cc94252863ec5e62c42282e00bc404"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N/bundle.json","state_url":"https://pith.science/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N/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-06-09T16:40:11Z","links":{"resolver":"https://pith.science/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N","bundle":"https://pith.science/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N/bundle.json","state":"https://pith.science/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXRIJRYY3D5QF4KTAV2OLBRO7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YXRIJRYY3D5QF4KTAV2OLBRO7N","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":"a08e5c0cb3a5ffeef2d3a3dfda106ab0c9fe4d1f6aaba79ad8243dc43d6851c4","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-23T15:28:54Z","title_canon_sha256":"63b223a1143b8fda3a33c7b00bef17f6a3076ef941e3dd09c47f98518536c1fb"},"schema_version":"1.0","source":{"id":"1410.6397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6397","created_at":"2026-05-18T02:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6397v1","created_at":"2026-05-18T02:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6397","created_at":"2026-05-18T02:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"YXRIJRYY3D5Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXRIJRYY3D5QF4KT","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXRIJRYY","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:80384323bd587d5b803f85ed5e6015c3c2cc94252863ec5e62c42282e00bc404","target":"graph","created_at":"2026-05-18T02:39: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 a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the technique is three-fold: it is quite simple and provides short proofs, it is applicable to a broad variety of models including those incorporating preferential attachment, and it provides bounds with small constants. We illustrate this by proving, for the first time, logarithmic upper bounds for the diameters of the following well known models: the forest fire model","authors_text":"Abbas Mehrabian","cross_cats":["cs.SI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-23T15:28:54Z","title":"Justifying the small-world phenomenon via random recursive trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6397","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:138b53bc9f71eae726492de923fa76f49fe0868bbe8c35f6bb81e3d3350a6bab","target":"record","created_at":"2026-05-18T02:39: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":"a08e5c0cb3a5ffeef2d3a3dfda106ab0c9fe4d1f6aaba79ad8243dc43d6851c4","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-23T15:28:54Z","title_canon_sha256":"63b223a1143b8fda3a33c7b00bef17f6a3076ef941e3dd09c47f98518536c1fb"},"schema_version":"1.0","source":{"id":"1410.6397","kind":"arxiv","version":1}},"canonical_sha256":"c5e284c718d8fb02f1530574e5862efb73a38c52e898458447f7b19fcd902a9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5e284c718d8fb02f1530574e5862efb73a38c52e898458447f7b19fcd902a9c","first_computed_at":"2026-05-18T02:39:30.992947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:30.992947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OsS/xLJrnAWMSl51HT3Pdk1jVN8wBo5eLBkYVhMQekggXeb779vbRot72iwPi3otUd3fa38JYRdRXYJKBe75Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:30.993548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:138b53bc9f71eae726492de923fa76f49fe0868bbe8c35f6bb81e3d3350a6bab","sha256:80384323bd587d5b803f85ed5e6015c3c2cc94252863ec5e62c42282e00bc404"],"state_sha256":"5036626aec2fc58c4069bbbc23839c888e714185e704388d46a2c3b5c05be8be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+iPKL8ay5zih+Z2AawGFkuhHM7c/dGwHpuAz8PflFmthhv6Xe63NjanIN6mEfVqJ+i2H8y1j3p3usCuHc1lDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:40:11.976187Z","bundle_sha256":"239e00e256367df7906f7dc1a91a540c02e9417e611b90396dd509cbe1ef353a"}}