{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J7SEL3SDUMZ3GMXAFT6GIP6YSS","short_pith_number":"pith:J7SEL3SD","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"},"canonical_sha256":"4fe445ee43a333b332e02cfc643fd8948c0b255a31caf8ac0295c266f8dbd912","source":{"kind":"arxiv","id":"1212.3682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3682","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3682v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3682","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"J7SEL3SDUMZ3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"J7SEL3SDUMZ3GMXA","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"J7SEL3SD","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J7SEL3SDUMZ3GMXAFT6GIP6YSS","target":"record","payload":{"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"},"canonical_sha256":"4fe445ee43a333b332e02cfc643fd8948c0b255a31caf8ac0295c266f8dbd912","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"},"source_kind":"arxiv","source_id":"1212.3682","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-18T03:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bggmclyRtsJCdqKJjS73t0KQwY807BpnyMLnfr6Bt8dkgzhh6ab87w0SbUacW+nS25gWco52QzjCKNOPPbdzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:15:14.348063Z"},"content_sha256":"1a0b176bdf88e4b6373fcf52fae3d35814134d777ac06127d13e11f493216553","schema_version":"1.0","event_id":"sha256:1a0b176bdf88e4b6373fcf52fae3d35814134d777ac06127d13e11f493216553"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J7SEL3SDUMZ3GMXAFT6GIP6YSS","target":"graph","payload":{"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"},"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-18T03:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQ1DDY/il3BfQB/tzr9UGjG02l3sp5khQt58ADx+alhJbDXzxq289yU+PDfc+36w+cSEoaxPeS7ZEn/ghrGRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:15:14.348433Z"},"content_sha256":"89b002dfa556ec5ea6dc02e12b14c042f63d12ebf9419c0e65413741451fb2a7","schema_version":"1.0","event_id":"sha256:89b002dfa556ec5ea6dc02e12b14c042f63d12ebf9419c0e65413741451fb2a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/bundle.json","state_url":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/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-03T23:15:14Z","links":{"resolver":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS","bundle":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/bundle.json","state":"https://pith.science/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7SEL3SDUMZ3GMXAFT6GIP6YSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J7SEL3SDUMZ3GMXAFT6GIP6YSS","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":"7c9dbe20298bd84677be0b649fcd0befc1944890d368a4fbd938e54976baa277","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-15T13:22:25Z","title_canon_sha256":"5ed6a92072b9b8a5dee4352331ae753df2091567639537d348f9959065e5fc91"},"schema_version":"1.0","source":{"id":"1212.3682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3682","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3682v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3682","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"J7SEL3SDUMZ3","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"J7SEL3SDUMZ3GMXA","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"J7SEL3SD","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:89b002dfa556ec5ea6dc02e12b14c042f63d12ebf9419c0e65413741451fb2a7","target":"graph","created_at":"2026-05-18T03:38:22Z","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 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","authors_text":"Hossein Soltani, Kaveh Khoshkhah, Manouchehr Zaker","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-15T13:22:25Z","title":"Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3682","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:1a0b176bdf88e4b6373fcf52fae3d35814134d777ac06127d13e11f493216553","target":"record","created_at":"2026-05-18T03:38:22Z","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":"7c9dbe20298bd84677be0b649fcd0befc1944890d368a4fbd938e54976baa277","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-15T13:22:25Z","title_canon_sha256":"5ed6a92072b9b8a5dee4352331ae753df2091567639537d348f9959065e5fc91"},"schema_version":"1.0","source":{"id":"1212.3682","kind":"arxiv","version":1}},"canonical_sha256":"4fe445ee43a333b332e02cfc643fd8948c0b255a31caf8ac0295c266f8dbd912","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fe445ee43a333b332e02cfc643fd8948c0b255a31caf8ac0295c266f8dbd912","first_computed_at":"2026-05-18T03:38:22.659108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:22.659108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFefJ61LdrN9ADYuvab3pdL9K4JHurUvqWmUKaOHVOiQ6pgdwwd5kW0zoiSvwxEP1GZQXYj/64TtWUHtzvdSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:22.659779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a0b176bdf88e4b6373fcf52fae3d35814134d777ac06127d13e11f493216553","sha256:89b002dfa556ec5ea6dc02e12b14c042f63d12ebf9419c0e65413741451fb2a7"],"state_sha256":"2ba8124eb2dbc1fb3b7d6101784c63aa50e3d91315439fb5ccc002b569bf03fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0uAy7pqLEQobU4icRXUqzK6fxMgbX0VmsyS69GKKO49xdNAlBqtztFW1UbT+pQMlN8DfYMm8pvAHP/DB5IiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:15:14.350430Z","bundle_sha256":"0b665b37f0b0b8f599524c6ae97dd33e421c77cea09b92e698436c7b45881aad"}}