{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:J7SEL3SDUMZ3GMXAFT6GIP6YSS","short_pith_number":"pith:J7SEL3SD","schema_version":"1.0","canonical_sha256":"4fe445ee43a333b332e02cfc643fd8948c0b255a31caf8ac0295c266f8dbd912","source":{"kind":"arxiv","id":"1212.3682","version":1},"attestation_state":"computed","paper":{"title":"Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks","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-12-15T13:22:25Z","abstract_excerpt":"Let $G$ be a directed graph such that the in-degree of any vertex $G$ is at least one. Let also ${\\mathcal{\\tau}}: V(G)\\rightarrow \\Bbb{N}$ be an assignment of thresholds to the vertices of $G$. A subset $M$ of vertices of $G$ is called a dynamic monopoly for $(G,\\tau)$ if the vertex set of $G$ can be partitioned into $D_0\\cup... \\cup D_t$ such that $D_0=M$ and for any $i\\geq 1$ and any $v\\in D_i$, the number of edges from $D_0\\cup... \\cup D_{i-1}$ to $v$ is at least $\\tau(v)$. One of the most applicable and widely studied threshold assignments in directed graphs is strict majority threshold a"},"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":"1212.3682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-15T13:22:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5ed6a92072b9b8a5dee4352331ae753df2091567639537d348f9959065e5fc91","abstract_canon_sha256":"7c9dbe20298bd84677be0b649fcd0befc1944890d368a4fbd938e54976baa277"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.659779Z","signature_b64":"kFefJ61LdrN9ADYuvab3pdL9K4JHurUvqWmUKaOHVOiQ6pgdwwd5kW0zoiSvwxEP1GZQXYj/64TtWUHtzvdSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fe445ee43a333b332e02cfc643fd8948c0b255a31caf8ac0295c266f8dbd912","last_reissued_at":"2026-05-18T03:38:22.659108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.659108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks","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-12-15T13:22:25Z","abstract_excerpt":"Let $G$ be a directed graph such that the in-degree of any vertex $G$ is at least one. Let also ${\\mathcal{\\tau}}: V(G)\\rightarrow \\Bbb{N}$ be an assignment of thresholds to the vertices of $G$. A subset $M$ of vertices of $G$ is called a dynamic monopoly for $(G,\\tau)$ if the vertex set of $G$ can be partitioned into $D_0\\cup... \\cup D_t$ such that $D_0=M$ and for any $i\\geq 1$ and any $v\\in D_i$, the number of edges from $D_0\\cup... \\cup D_{i-1}$ to $v$ is at least $\\tau(v)$. One of the most applicable and widely studied threshold assignments in directed graphs is strict majority threshold a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3682","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":"1212.3682","created_at":"2026-05-18T03:38:22.659227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3682v1","created_at":"2026-05-18T03:38:22.659227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3682","created_at":"2026-05-18T03:38:22.659227+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7SEL3SDUMZ3","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7SEL3SDUMZ3GMXA","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7SEL3SD","created_at":"2026-05-18T12:27:11.947152+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/J7SEL3SDUMZ3GMXAFT6GIP6YSS","json":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS.json","graph_json":"https://pith.science/api/pith-number/J7SEL3SDUMZ3GMXAFT6GIP6YSS/graph.json","events_json":"https://pith.science/api/pith-number/J7SEL3SDUMZ3GMXAFT6GIP6YSS/events.json","paper":"https://pith.science/paper/J7SEL3SD"},"agent_actions":{"view_html":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS","download_json":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS.json","view_paper":"https://pith.science/paper/J7SEL3SD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3682&json=true","fetch_graph":"https://pith.science/api/pith-number/J7SEL3SDUMZ3GMXAFT6GIP6YSS/graph.json","fetch_events":"https://pith.science/api/pith-number/J7SEL3SDUMZ3GMXAFT6GIP6YSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/action/storage_attestation","attest_author":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/action/author_attestation","sign_citation":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/action/citation_signature","submit_replication":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/action/replication_record"}},"created_at":"2026-05-18T03:38:22.659227+00:00","updated_at":"2026-05-18T03:38:22.659227+00:00"}