{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C3VK4LFYG4PMDMY44LM3VNFZWX","short_pith_number":"pith:C3VK4LFY","canonical_record":{"source":{"id":"1405.6138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-23T17:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"a716f7f6190582446886d0ab1c07de21c4a13795b4e30feaee7d011fc64dedd3","abstract_canon_sha256":"e751e23aad8813b53e87cb4361e701e1f97941718c99835925bf3dad50c3a4d1"},"schema_version":"1.0"},"canonical_sha256":"16eaae2cb8371ec1b31ce2d9bab4b9b5e62f8a06e292ab5b06b5f0d0bae109ff","source":{"kind":"arxiv","id":"1405.6138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6138","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6138v1","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6138","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"C3VK4LFYG4PM","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C3VK4LFYG4PMDMY4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C3VK4LFY","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C3VK4LFYG4PMDMY44LM3VNFZWX","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-23T17:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"a716f7f6190582446886d0ab1c07de21c4a13795b4e30feaee7d011fc64dedd3","abstract_canon_sha256":"e751e23aad8813b53e87cb4361e701e1f97941718c99835925bf3dad50c3a4d1"},"schema_version":"1.0"},"canonical_sha256":"16eaae2cb8371ec1b31ce2d9bab4b9b5e62f8a06e292ab5b06b5f0d0bae109ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.012105Z","signature_b64":"kZSFlcpqSGqjc7cc6wjs2uI1KQJwe7pRNtvtVL2FZYthAauyAnfJGxBvYCrln6FH21v5ALkNCgpEyV3DGyJ2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16eaae2cb8371ec1b31ce2d9bab4b9b5e62f8a06e292ab5b06b5f0d0bae109ff","last_reissued_at":"2026-05-18T02:51:14.011388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.011388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6138","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:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhX2E4QIUFPWUYjJU53O9J/wo5BeLd9yTwBDswl/RDXs9E1JLnHaAO3zyeBTxdow2IMJoRqMWpeivMwBHcwvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:21:00.714733Z"},"content_sha256":"441026c7f5c24a7febcb853cb5c0afb1044be6f61f6a7f03109bac633dd24f7a","schema_version":"1.0","event_id":"sha256:441026c7f5c24a7febcb853cb5c0afb1044be6f61f6a7f03109bac633dd24f7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C3VK4LFYG4PMDMY44LM3VNFZWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the largest dynamic monopolies of graphs with a given average threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaveh Khoshkhah, Manouchehr Zaker","submitted_at":"2014-05-23T17:38:31Z","abstract_excerpt":"Let $G$ be a graph and $\\tau$ be an assignment of nonnegative integer thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a $\\tau$-dynamic monopoly, if $V(G)$ can be partitioned into subsets $D_0, D_1, \\ldots, D_k$ such that $D_0=D$ and for any $i\\in \\{0, \\ldots, k-1\\}$, each vertex $v$ in $D_{i+1}$ has at least $\\tau(v)$ neighbors in $D_0\\cup \\ldots \\cup D_i$. Denote the size of smallest $\\tau$-dynamic monopoly by $dyn_{\\tau}(G)$ and the average of thresholds in $\\tau$ by $\\overline{\\tau}$. We show that the values of $dyn_{\\tau}(G)$ over all assignments $\\tau$ with the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6138","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:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3K3QmQD3ADtRiyz6gD9etuyjpn+cDAKYJ57l2tnUJbqfl9YKhsdGR31IZBdVX7MIOmwJlRJO/TDN6Vg8/inAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:21:00.715086Z"},"content_sha256":"d045a3f1adc742041b8d51d4d91b5d36fde8c46d9a4d193e9a84ebb60d0a5fd4","schema_version":"1.0","event_id":"sha256:d045a3f1adc742041b8d51d4d91b5d36fde8c46d9a4d193e9a84ebb60d0a5fd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3VK4LFYG4PMDMY44LM3VNFZWX/bundle.json","state_url":"https://pith.science/pith/C3VK4LFYG4PMDMY44LM3VNFZWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3VK4LFYG4PMDMY44LM3VNFZWX/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-04T06:21:00Z","links":{"resolver":"https://pith.science/pith/C3VK4LFYG4PMDMY44LM3VNFZWX","bundle":"https://pith.science/pith/C3VK4LFYG4PMDMY44LM3VNFZWX/bundle.json","state":"https://pith.science/pith/C3VK4LFYG4PMDMY44LM3VNFZWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3VK4LFYG4PMDMY44LM3VNFZWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C3VK4LFYG4PMDMY44LM3VNFZWX","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":"e751e23aad8813b53e87cb4361e701e1f97941718c99835925bf3dad50c3a4d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-23T17:38:31Z","title_canon_sha256":"a716f7f6190582446886d0ab1c07de21c4a13795b4e30feaee7d011fc64dedd3"},"schema_version":"1.0","source":{"id":"1405.6138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6138","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6138v1","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6138","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"C3VK4LFYG4PM","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C3VK4LFYG4PMDMY4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C3VK4LFY","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d045a3f1adc742041b8d51d4d91b5d36fde8c46d9a4d193e9a84ebb60d0a5fd4","target":"graph","created_at":"2026-05-18T02:51:14Z","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":"Let $G$ be a graph and $\\tau$ be an assignment of nonnegative integer thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a $\\tau$-dynamic monopoly, if $V(G)$ can be partitioned into subsets $D_0, D_1, \\ldots, D_k$ such that $D_0=D$ and for any $i\\in \\{0, \\ldots, k-1\\}$, each vertex $v$ in $D_{i+1}$ has at least $\\tau(v)$ neighbors in $D_0\\cup \\ldots \\cup D_i$. Denote the size of smallest $\\tau$-dynamic monopoly by $dyn_{\\tau}(G)$ and the average of thresholds in $\\tau$ by $\\overline{\\tau}$. We show that the values of $dyn_{\\tau}(G)$ over all assignments $\\tau$ with the s","authors_text":"Kaveh Khoshkhah, Manouchehr Zaker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-23T17:38:31Z","title":"On the largest dynamic monopolies of graphs with a given average threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6138","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:441026c7f5c24a7febcb853cb5c0afb1044be6f61f6a7f03109bac633dd24f7a","target":"record","created_at":"2026-05-18T02:51:14Z","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":"e751e23aad8813b53e87cb4361e701e1f97941718c99835925bf3dad50c3a4d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-23T17:38:31Z","title_canon_sha256":"a716f7f6190582446886d0ab1c07de21c4a13795b4e30feaee7d011fc64dedd3"},"schema_version":"1.0","source":{"id":"1405.6138","kind":"arxiv","version":1}},"canonical_sha256":"16eaae2cb8371ec1b31ce2d9bab4b9b5e62f8a06e292ab5b06b5f0d0bae109ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16eaae2cb8371ec1b31ce2d9bab4b9b5e62f8a06e292ab5b06b5f0d0bae109ff","first_computed_at":"2026-05-18T02:51:14.011388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:14.011388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kZSFlcpqSGqjc7cc6wjs2uI1KQJwe7pRNtvtVL2FZYthAauyAnfJGxBvYCrln6FH21v5ALkNCgpEyV3DGyJ2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:14.012105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:441026c7f5c24a7febcb853cb5c0afb1044be6f61f6a7f03109bac633dd24f7a","sha256:d045a3f1adc742041b8d51d4d91b5d36fde8c46d9a4d193e9a84ebb60d0a5fd4"],"state_sha256":"21a61a7b36dcad36865164119ea59d9546a69b7d0767f8e5183532f4aefdada9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkPZ+5xHQEKT95Hxb4N7fj8djwI10GnI/nAKokaKIB0ZJtzytWTeSeudTSDxFoI4vDzOQfKO/8tEVhkfaadDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:21:00.717070Z","bundle_sha256":"a5503cf0388660fd233efd1c70cf0a4115c0226bbea8b47fbf60f97dbfe3e0ae"}}