{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2VMASS2JRXNJUUALKPEYDSU7BH","short_pith_number":"pith:2VMASS2J","canonical_record":{"source":{"id":"1612.06404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-12-19T21:01:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bfac8f93536a96c766b927cbd52bb36167a60677f7f139c35c483d5cb4211356","abstract_canon_sha256":"218ccfc3951b2756ea7c0b21b47926dca24412e83b24a7faaa1e8cdb789f60f0"},"schema_version":"1.0"},"canonical_sha256":"d558094b498dda9a500b53c981ca9f09d7f4cd9b979935805a16af151858f4e3","source":{"kind":"arxiv","id":"1612.06404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06404","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06404v2","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06404","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"2VMASS2JRXNJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VMASS2JRXNJUUAL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VMASS2J","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2VMASS2JRXNJUUALKPEYDSU7BH","target":"record","payload":{"canonical_record":{"source":{"id":"1612.06404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-12-19T21:01:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bfac8f93536a96c766b927cbd52bb36167a60677f7f139c35c483d5cb4211356","abstract_canon_sha256":"218ccfc3951b2756ea7c0b21b47926dca24412e83b24a7faaa1e8cdb789f60f0"},"schema_version":"1.0"},"canonical_sha256":"d558094b498dda9a500b53c981ca9f09d7f4cd9b979935805a16af151858f4e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:07.287256Z","signature_b64":"r2JmN9NYHZNJxjCekJvpTcd2kZk+PcekYf7Ogj7/xZNEoQ9IJdZLzON+abIasEHaKk7GIGsnYXS706FBWsL9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d558094b498dda9a500b53c981ca9f09d7f4cd9b979935805a16af151858f4e3","last_reissued_at":"2026-05-18T00:11:07.286601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:07.286601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.06404","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:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1Zny7jxYHxs4XxuFc4TPX0dADtvRWLXcp6AMg3oJ5/D1A84oyjpHopiJScLJkXjQGX0yDlJ2tTjSVva7+jhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:55:42.323886Z"},"content_sha256":"72982c460a2a06970d6b518f2a9cc9fee1d7026a18783c49c5995428f660f5ec","schema_version":"1.0","event_id":"sha256:72982c460a2a06970d6b518f2a9cc9fee1d7026a18783c49c5995428f660f5ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2VMASS2JRXNJUUALKPEYDSU7BH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Benjamin Bloem-Reddy, Peter Orbanz","submitted_at":"2016-12-19T21:01:36Z","abstract_excerpt":"We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by permitting the location of a new edge to explicitly depend on the structure of the graph, but being nonetheless statistically and computationally tractable. In the limit of infinite walk length, the model converges to an extension of the preferential attachment model---in this sense, it can be motivated alternatively by asking what preferential attachment is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06404","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:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1v2emoiJmDvOqEMSwO2XDDKHb3Bzx0gGgJPNzyLCN/WqmZHkrlHbn8GRy1mWfurwff5RWJW3+KO5NrKGkkxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:55:42.324234Z"},"content_sha256":"d089848c51b817f887fe6a1337e780cf71872cb03218abf86e25e9f40f9a8479","schema_version":"1.0","event_id":"sha256:d089848c51b817f887fe6a1337e780cf71872cb03218abf86e25e9f40f9a8479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VMASS2JRXNJUUALKPEYDSU7BH/bundle.json","state_url":"https://pith.science/pith/2VMASS2JRXNJUUALKPEYDSU7BH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VMASS2JRXNJUUALKPEYDSU7BH/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-07-08T13:55:42Z","links":{"resolver":"https://pith.science/pith/2VMASS2JRXNJUUALKPEYDSU7BH","bundle":"https://pith.science/pith/2VMASS2JRXNJUUALKPEYDSU7BH/bundle.json","state":"https://pith.science/pith/2VMASS2JRXNJUUALKPEYDSU7BH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VMASS2JRXNJUUALKPEYDSU7BH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2VMASS2JRXNJUUALKPEYDSU7BH","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":"218ccfc3951b2756ea7c0b21b47926dca24412e83b24a7faaa1e8cdb789f60f0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-12-19T21:01:36Z","title_canon_sha256":"bfac8f93536a96c766b927cbd52bb36167a60677f7f139c35c483d5cb4211356"},"schema_version":"1.0","source":{"id":"1612.06404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06404","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06404v2","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06404","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"2VMASS2JRXNJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VMASS2JRXNJUUAL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VMASS2J","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:d089848c51b817f887fe6a1337e780cf71872cb03218abf86e25e9f40f9a8479","target":"graph","created_at":"2026-05-18T00:11:07Z","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 introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by permitting the location of a new edge to explicitly depend on the structure of the graph, but being nonetheless statistically and computationally tractable. In the limit of infinite walk length, the model converges to an extension of the preferential attachment model---in this sense, it can be motivated alternatively by asking what preferential attachment is a","authors_text":"Benjamin Bloem-Reddy, Peter Orbanz","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-12-19T21:01:36Z","title":"Random Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06404","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:72982c460a2a06970d6b518f2a9cc9fee1d7026a18783c49c5995428f660f5ec","target":"record","created_at":"2026-05-18T00:11:07Z","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":"218ccfc3951b2756ea7c0b21b47926dca24412e83b24a7faaa1e8cdb789f60f0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-12-19T21:01:36Z","title_canon_sha256":"bfac8f93536a96c766b927cbd52bb36167a60677f7f139c35c483d5cb4211356"},"schema_version":"1.0","source":{"id":"1612.06404","kind":"arxiv","version":2}},"canonical_sha256":"d558094b498dda9a500b53c981ca9f09d7f4cd9b979935805a16af151858f4e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d558094b498dda9a500b53c981ca9f09d7f4cd9b979935805a16af151858f4e3","first_computed_at":"2026-05-18T00:11:07.286601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:07.286601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r2JmN9NYHZNJxjCekJvpTcd2kZk+PcekYf7Ogj7/xZNEoQ9IJdZLzON+abIasEHaKk7GIGsnYXS706FBWsL9Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:07.287256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72982c460a2a06970d6b518f2a9cc9fee1d7026a18783c49c5995428f660f5ec","sha256:d089848c51b817f887fe6a1337e780cf71872cb03218abf86e25e9f40f9a8479"],"state_sha256":"a4b7ad93331a57a4e479cfd1181bfa74f03d36cc74e6747d698db007c2566f5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTHUJazA+UnjDOGO9jL3xTFOtFV+lvGjmE7EYasAD+Il9VcYpKMaFtTvVdHWkAnZ3zrwxQ+bGH6g57x9StV4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T13:55:42.326617Z","bundle_sha256":"42d2b2d421e364e3dc7871284da56ddfcc1c48ad14c2c615b52e2ec6fb31e0f1"}}