{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:XEJOIILMPMF26JKE3D2KXYSU4E","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":"2564c65ab988cfa3841461ea4f7ad644596260a92df04390985b449fde8333f6","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.DS","submitted_at":"2006-12-27T10:34:57Z","title_canon_sha256":"fa069e5faa50907cbaeafad0e4bd727dd57da6474549a57395fe93e088cf3973"},"schema_version":"1.0","source":{"id":"math/0612778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612778","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612778v1","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612778","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"XEJOIILMPMF2","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"XEJOIILMPMF26JKE","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"XEJOIILM","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:3c55bbcf0676f7f7f5bd19da44b550a5ae2723afee05eb7e476b753cde10451c","target":"graph","created_at":"2026-05-18T04:36:42Z","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":"Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive classes of graphs - for formalizing and studying evolution of complex networks. Our definition of probabilistic inductive class of graphs (PICG) extends the standard notion of inductive class of graphs (ICG) by imposing a probability space. A PICG is given by: (1) class B of initial graphs, the basis of PICG, (2) class R of generating rules, each with distin","authors_text":"Nata\\v{s}a Kej\\v{z}ar, Vladimir Batagelj, Zoran Nikoloski","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.DS","submitted_at":"2006-12-27T10:34:57Z","title":"Probabilistic Inductive Classes of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612778","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:4f4c0226ced1d05aa7d5e59ad4ef609a3e1c234de68febf3fe243becb8d6ee14","target":"record","created_at":"2026-05-18T04:36:42Z","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":"2564c65ab988cfa3841461ea4f7ad644596260a92df04390985b449fde8333f6","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.DS","submitted_at":"2006-12-27T10:34:57Z","title_canon_sha256":"fa069e5faa50907cbaeafad0e4bd727dd57da6474549a57395fe93e088cf3973"},"schema_version":"1.0","source":{"id":"math/0612778","kind":"arxiv","version":1}},"canonical_sha256":"b912e4216c7b0baf2544d8f4abe254e11c3948e6dc6189c4403f58692086137b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b912e4216c7b0baf2544d8f4abe254e11c3948e6dc6189c4403f58692086137b","first_computed_at":"2026-05-18T04:36:42.386373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:42.386373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gPsLjTJ/+cADM6GoMPc9NxbsLsnZcmvcCvbFuwX23RzFuiRLj/WWta6PPFCd1PFfo1CAJ0rspuWj3w2J+4yfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:42.386791Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0612778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f4c0226ced1d05aa7d5e59ad4ef609a3e1c234de68febf3fe243becb8d6ee14","sha256:3c55bbcf0676f7f7f5bd19da44b550a5ae2723afee05eb7e476b753cde10451c"],"state_sha256":"d1426f8aee44d8bc51d2a4b6d5e1f6f455a900dd3f3f923c9bdd07cdcdfcaf09"}