{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YA2IZMXLWUYPZUGXS2RJVJNNPX","short_pith_number":"pith:YA2IZMXL","schema_version":"1.0","canonical_sha256":"c0348cb2ebb530fcd0d796a29aa5ad7dc39847ea314e6def60fa7dff9f54f883","source":{"kind":"arxiv","id":"1202.1146","version":1},"attestation_state":"computed","paper":{"title":"On dynamic monopolies of graphs: the average and strict majority thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hossein Soltani, Kaveh Khoshkhah, Manouchehr Zaker","submitted_at":"2012-02-06T14:17:57Z","abstract_excerpt":"Let $G$ be a graph and ${\\mathcal{\\tau}}: V(G)\\rightarrow \\Bbb{N}\\cup \\{0\\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \\tau)$ if the vertices of $G$ can be partitioned into subsets $D_0, D_1,..., D_k$ such that $D_0=D$ and for any $i\\in {0, ..., k-1}$, each vertex $v$ in $D_{i+1}$ has at least $\\tau(v)$ neighbors in $D_0\\cup ... \\cup D_i$. Dynamic monopolies are in fact modeling the irreversible spread of influence in social networks. In this paper we first obtain a lower bound for the smallest size of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1202.1146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-06T14:17:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"59c3b51dccc7736238d5d5db55393f1018bef8f4ce1d161df544b68beadff841","abstract_canon_sha256":"5415736b2901717f8ac4f8e76bd2debbf5cc36219b1822611b3d18ef2072e9d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:55.016902Z","signature_b64":"TmZDPCtSlkO2osv2bsmLJBTssR2aZBGq0/exP2eHtmSWK/pvWRxuT8UgcfrN89qKY8WJ19vyzWv8SNGoIbiGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0348cb2ebb530fcd0d796a29aa5ad7dc39847ea314e6def60fa7dff9f54f883","last_reissued_at":"2026-05-18T04:02:55.016257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:55.016257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On dynamic monopolies of graphs: the average and strict majority thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hossein Soltani, Kaveh Khoshkhah, Manouchehr Zaker","submitted_at":"2012-02-06T14:17:57Z","abstract_excerpt":"Let $G$ be a graph and ${\\mathcal{\\tau}}: V(G)\\rightarrow \\Bbb{N}\\cup \\{0\\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \\tau)$ if the vertices of $G$ can be partitioned into subsets $D_0, D_1,..., D_k$ such that $D_0=D$ and for any $i\\in {0, ..., k-1}$, each vertex $v$ in $D_{i+1}$ has at least $\\tau(v)$ neighbors in $D_0\\cup ... \\cup D_i$. Dynamic monopolies are in fact modeling the irreversible spread of influence in social networks. In this paper we first obtain a lower bound for the smallest size of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1146","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.1146","created_at":"2026-05-18T04:02:55.016341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1146v1","created_at":"2026-05-18T04:02:55.016341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1146","created_at":"2026-05-18T04:02:55.016341+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA2IZMXLWUYP","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA2IZMXLWUYPZUGX","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA2IZMXL","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX","json":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX.json","graph_json":"https://pith.science/api/pith-number/YA2IZMXLWUYPZUGXS2RJVJNNPX/graph.json","events_json":"https://pith.science/api/pith-number/YA2IZMXLWUYPZUGXS2RJVJNNPX/events.json","paper":"https://pith.science/paper/YA2IZMXL"},"agent_actions":{"view_html":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX","download_json":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX.json","view_paper":"https://pith.science/paper/YA2IZMXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1146&json=true","fetch_graph":"https://pith.science/api/pith-number/YA2IZMXLWUYPZUGXS2RJVJNNPX/graph.json","fetch_events":"https://pith.science/api/pith-number/YA2IZMXLWUYPZUGXS2RJVJNNPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX/action/storage_attestation","attest_author":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX/action/author_attestation","sign_citation":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX/action/citation_signature","submit_replication":"https://pith.science/pith/YA2IZMXLWUYPZUGXS2RJVJNNPX/action/replication_record"}},"created_at":"2026-05-18T04:02:55.016341+00:00","updated_at":"2026-05-18T04:02:55.016341+00:00"}