{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZRANIM7P26BLOHCU3QIFVV4UND","short_pith_number":"pith:ZRANIM7P","canonical_record":{"source":{"id":"1011.0653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-02T15:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"9db678162c87a9d6c7873d069f196167468d3ad1f05cb954554eea703f1b1f5c","abstract_canon_sha256":"acb521079f5eab8d9f3b68591908ff25a9b09cb69ab4e5e15b5d11ca28814c2a"},"schema_version":"1.0"},"canonical_sha256":"cc40d433efd782b71c54dc105ad79468e0234e1c419949b28f0c1eef661f21d2","source":{"kind":"arxiv","id":"1011.0653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0653","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0653v1","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0653","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZRANIM7P26BL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZRANIM7P26BLOHCU","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZRANIM7P","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZRANIM7P26BLOHCU3QIFVV4UND","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-02T15:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"9db678162c87a9d6c7873d069f196167468d3ad1f05cb954554eea703f1b1f5c","abstract_canon_sha256":"acb521079f5eab8d9f3b68591908ff25a9b09cb69ab4e5e15b5d11ca28814c2a"},"schema_version":"1.0"},"canonical_sha256":"cc40d433efd782b71c54dc105ad79468e0234e1c419949b28f0c1eef661f21d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:21.149819Z","signature_b64":"kc2erzm5eNNSm667yMnxX9+D28VL0pS3WqrmCyXjMTmIbVOCYAmaPOsJRQPReVL+J8PASht93NZ+oyyp/mJuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc40d433efd782b71c54dc105ad79468e0234e1c419949b28f0c1eef661f21d2","last_reissued_at":"2026-05-18T04:37:21.149368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:21.149368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0653","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:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ypWgHsyhZZZQmzav5ph61Yh9jmYl4sN55a4vJ4kVLES8WI7KJar/naILojLHCEvaoPgAn6CLyJtYD5NI0c42Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:09:58.151306Z"},"content_sha256":"2e071c1d7c3c819316ea41a62110067dbf21319e3da2cb0365fe937b49f1e04d","schema_version":"1.0","event_id":"sha256:2e071c1d7c3c819316ea41a62110067dbf21319e3da2cb0365fe937b49f1e04d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZRANIM7P26BLOHCU3QIFVV4UND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On reversible cascades in scale-free and Erd\\H{o}s-R\\'enyi random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ching-Lueh Chang","submitted_at":"2010-11-02T15:53:53Z","abstract_excerpt":"Consider the following cascading process on a simple undirected graph $G(V,E)$ with diameter $\\Delta$. In round zero, a set $S\\subseteq V$ of vertices, called the seeds, are active. In round $i+1,$ $i\\in\\mathbb{N},$ a non-isolated vertex is activated if at least a $\\rho\\in(\\,0,1\\,]$ fraction of its neighbors are active in round $i$; it is deactivated otherwise. For $k\\in\\mathbb{N},$ let $\\text{min-seed}^{(k)}(G,\\rho)$ be the minimum number of seeds needed to activate all vertices in or before round $k$. This paper derives upper bounds on $\\text{min-seed}^{(k)}(G,\\rho)$. In particular, if $G$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0653","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:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avvo4BdXis8+PBXAFmR/OAzZ1OjWadAglOn/Xl99zg4apZbRsfkmNAGo96Xim4QPReKiMmTymHizw4P/cznlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:09:58.151952Z"},"content_sha256":"1eb843835a817f08c47a4c8b00cee79376c852ee4c7173201f921a77a97d31f1","schema_version":"1.0","event_id":"sha256:1eb843835a817f08c47a4c8b00cee79376c852ee4c7173201f921a77a97d31f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRANIM7P26BLOHCU3QIFVV4UND/bundle.json","state_url":"https://pith.science/pith/ZRANIM7P26BLOHCU3QIFVV4UND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRANIM7P26BLOHCU3QIFVV4UND/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-03T22:09:58Z","links":{"resolver":"https://pith.science/pith/ZRANIM7P26BLOHCU3QIFVV4UND","bundle":"https://pith.science/pith/ZRANIM7P26BLOHCU3QIFVV4UND/bundle.json","state":"https://pith.science/pith/ZRANIM7P26BLOHCU3QIFVV4UND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRANIM7P26BLOHCU3QIFVV4UND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZRANIM7P26BLOHCU3QIFVV4UND","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":"acb521079f5eab8d9f3b68591908ff25a9b09cb69ab4e5e15b5d11ca28814c2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-02T15:53:53Z","title_canon_sha256":"9db678162c87a9d6c7873d069f196167468d3ad1f05cb954554eea703f1b1f5c"},"schema_version":"1.0","source":{"id":"1011.0653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0653","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0653v1","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0653","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZRANIM7P26BL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZRANIM7P26BLOHCU","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZRANIM7P","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:1eb843835a817f08c47a4c8b00cee79376c852ee4c7173201f921a77a97d31f1","target":"graph","created_at":"2026-05-18T04:37:21Z","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":"Consider the following cascading process on a simple undirected graph $G(V,E)$ with diameter $\\Delta$. In round zero, a set $S\\subseteq V$ of vertices, called the seeds, are active. In round $i+1,$ $i\\in\\mathbb{N},$ a non-isolated vertex is activated if at least a $\\rho\\in(\\,0,1\\,]$ fraction of its neighbors are active in round $i$; it is deactivated otherwise. For $k\\in\\mathbb{N},$ let $\\text{min-seed}^{(k)}(G,\\rho)$ be the minimum number of seeds needed to activate all vertices in or before round $k$. This paper derives upper bounds on $\\text{min-seed}^{(k)}(G,\\rho)$. In particular, if $G$ i","authors_text":"Ching-Lueh Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-02T15:53:53Z","title":"On reversible cascades in scale-free and Erd\\H{o}s-R\\'enyi random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0653","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:2e071c1d7c3c819316ea41a62110067dbf21319e3da2cb0365fe937b49f1e04d","target":"record","created_at":"2026-05-18T04:37:21Z","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":"acb521079f5eab8d9f3b68591908ff25a9b09cb69ab4e5e15b5d11ca28814c2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-11-02T15:53:53Z","title_canon_sha256":"9db678162c87a9d6c7873d069f196167468d3ad1f05cb954554eea703f1b1f5c"},"schema_version":"1.0","source":{"id":"1011.0653","kind":"arxiv","version":1}},"canonical_sha256":"cc40d433efd782b71c54dc105ad79468e0234e1c419949b28f0c1eef661f21d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc40d433efd782b71c54dc105ad79468e0234e1c419949b28f0c1eef661f21d2","first_computed_at":"2026-05-18T04:37:21.149368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:21.149368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kc2erzm5eNNSm667yMnxX9+D28VL0pS3WqrmCyXjMTmIbVOCYAmaPOsJRQPReVL+J8PASht93NZ+oyyp/mJuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:21.149819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e071c1d7c3c819316ea41a62110067dbf21319e3da2cb0365fe937b49f1e04d","sha256:1eb843835a817f08c47a4c8b00cee79376c852ee4c7173201f921a77a97d31f1"],"state_sha256":"3234178a532ff98dc9ab9a501eb926e86547a7e15ff4b18ec4f5ff653404bf61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2v2+yLnC/Khx6vfVEV4/KDuob55M4S0IfWueCzeknD4TNI8/PoaCwd/cBcKEmTl+qYAmXSsI029+VtFozDaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:09:58.155003Z","bundle_sha256":"afdd27970bcd1a6b1a5c1726ad6ec969f67f6bfe732c3b9ef37501834aeddf65"}}