{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:2MWKNAVDRLZBV7XS5XS4WLWI7L","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":"773bba7222da8744768c4badb3ce14340bad8cb151be3dff2e38e9ec1a91a83c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-17T16:07:29Z","title_canon_sha256":"b5cec2cfe1dedd9760799312f63c43b4fc08f8ffe94aaf3f1927916808d7a8be"},"schema_version":"1.0","source":{"id":"0807.2819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.2819","created_at":"2026-07-04T15:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"0807.2819v2","created_at":"2026-07-04T15:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.2819","created_at":"2026-07-04T15:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"2MWKNAVDRLZB","created_at":"2026-07-04T15:13:22Z"},{"alias_kind":"pith_short_16","alias_value":"2MWKNAVDRLZBV7XS","created_at":"2026-07-04T15:13:22Z"},{"alias_kind":"pith_short_8","alias_value":"2MWKNAVD","created_at":"2026-07-04T15:13:22Z"}],"graph_snapshots":[{"event_id":"sha256:d9a66315731fc654be8d075af89ad23a891c20ff22bc212137cc4669df0003cd","target":"graph","created_at":"2026-07-04T15:13:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0807.2819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we consider a simple model of random graph process with {\\it hard} copying as follows: At each time step $t$, with probability $0<\\alpha\\leq 1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added in the manner of {\\it preferential attachment}; or with probability $1-\\alpha$ an existing vertex is copied uniformly at random. In this way, while a vertex with large degree is copied, the number of added edges is its degree and thus the number of added edges is not upper bounded. We prove that, in the case of $\\alpha$ being large enough, the model possesses a mean d","authors_text":"Gao-Rong Ning, Kai-Yuan Cai, Xian-Yuan Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-17T16:07:29Z","title":"The Degree Sequence of a Scale-Free Random Graph Process with Hard Copying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.2819","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:269ff84a04d6327abebffb64f777d8e4bcfb56885f570319a763641a95c32ac5","target":"record","created_at":"2026-07-04T15:13:22Z","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":"773bba7222da8744768c4badb3ce14340bad8cb151be3dff2e38e9ec1a91a83c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-17T16:07:29Z","title_canon_sha256":"b5cec2cfe1dedd9760799312f63c43b4fc08f8ffe94aaf3f1927916808d7a8be"},"schema_version":"1.0","source":{"id":"0807.2819","kind":"arxiv","version":2}},"canonical_sha256":"d32ca682a38af21afef2ede5cb2ec8fac91c906583d7e42641bbe8ceb0fc84e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d32ca682a38af21afef2ede5cb2ec8fac91c906583d7e42641bbe8ceb0fc84e9","first_computed_at":"2026-07-04T15:13:22.274384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:13:22.274384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1x4EU6lnDWsjqwTq3dNpCBB9XuigvGOPs915fP/nZ9hSl9lIms4oJr03TjnYQ7zTmJtsXin7GfphEmEPgkqBBw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:13:22.274762Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.2819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:269ff84a04d6327abebffb64f777d8e4bcfb56885f570319a763641a95c32ac5","sha256:d9a66315731fc654be8d075af89ad23a891c20ff22bc212137cc4669df0003cd"],"state_sha256":"1f410ef433a2002e229aca6c571927868bdf9aceabf37ec9ce7dfcff40711863"}