{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NTVJ6JU3SVXR4NVKY2P7QPOF27","short_pith_number":"pith:NTVJ6JU3","schema_version":"1.0","canonical_sha256":"6cea9f269b956f1e36aac69ff83dc5d7d24e6ce0bc3ab1325b71bda79f37db3d","source":{"kind":"arxiv","id":"1712.06483","version":1},"attestation_state":"computed","paper":{"title":"On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Manouchehr Zaker, Nahideh Asadi","submitted_at":"2017-12-18T15:54:41Z","abstract_excerpt":"Let $G$ be any simple and undirected graph. By a threshold assignment $\\tau$ in $G$ we mean any function $\\tau:V(G)\\rightarrow \\mathbb{N}$ such that $\\tau(v)\\leq d_G(v)$ for any vertex $v$ of $G$. Given a graph $G$ with a threshold assignment $\\tau$, a subset of vertices $M$ is said to be a $\\tau$-monopoly if there exist at least $\\tau(v)$ neighbors in $M$ for any vertex $v \\in V(G) \\setminus M$. Similarly, a subset of vertices $D$ is said to be a $\\tau$-dynamic monopoly if starting with the set $D$ and iteratively adding to the current set further vertices $u$ that have at least $\\tau(u)$ nei"},"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":"1712.06483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-18T15:54:41Z","cross_cats_sorted":[],"title_canon_sha256":"6758fce9d50eb55e9a20c8c86b42494dadaecd9bc1512928f233365408888c2c","abstract_canon_sha256":"db81d1c61096e4aad129f354038b335e94864271df9b3e97215f00e5638753b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:47.721332Z","signature_b64":"600kL1ah79TRUFuia27UTK2NIxGGAEo8nESD3ShaluPuo2rvzW4pjaqMUqa2dETPMC5is0QdmxcSMRXymeHPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cea9f269b956f1e36aac69ff83dc5d7d24e6ce0bc3ab1325b71bda79f37db3d","last_reissued_at":"2026-05-18T00:27:47.720652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:47.720652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Manouchehr Zaker, Nahideh Asadi","submitted_at":"2017-12-18T15:54:41Z","abstract_excerpt":"Let $G$ be any simple and undirected graph. By a threshold assignment $\\tau$ in $G$ we mean any function $\\tau:V(G)\\rightarrow \\mathbb{N}$ such that $\\tau(v)\\leq d_G(v)$ for any vertex $v$ of $G$. Given a graph $G$ with a threshold assignment $\\tau$, a subset of vertices $M$ is said to be a $\\tau$-monopoly if there exist at least $\\tau(v)$ neighbors in $M$ for any vertex $v \\in V(G) \\setminus M$. Similarly, a subset of vertices $D$ is said to be a $\\tau$-dynamic monopoly if starting with the set $D$ and iteratively adding to the current set further vertices $u$ that have at least $\\tau(u)$ nei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06483","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":"1712.06483","created_at":"2026-05-18T00:27:47.720747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06483v1","created_at":"2026-05-18T00:27:47.720747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06483","created_at":"2026-05-18T00:27:47.720747+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTVJ6JU3SVXR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTVJ6JU3SVXR4NVK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTVJ6JU3","created_at":"2026-05-18T12:31:34.259226+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/NTVJ6JU3SVXR4NVKY2P7QPOF27","json":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27.json","graph_json":"https://pith.science/api/pith-number/NTVJ6JU3SVXR4NVKY2P7QPOF27/graph.json","events_json":"https://pith.science/api/pith-number/NTVJ6JU3SVXR4NVKY2P7QPOF27/events.json","paper":"https://pith.science/paper/NTVJ6JU3"},"agent_actions":{"view_html":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27","download_json":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27.json","view_paper":"https://pith.science/paper/NTVJ6JU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06483&json=true","fetch_graph":"https://pith.science/api/pith-number/NTVJ6JU3SVXR4NVKY2P7QPOF27/graph.json","fetch_events":"https://pith.science/api/pith-number/NTVJ6JU3SVXR4NVKY2P7QPOF27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27/action/storage_attestation","attest_author":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27/action/author_attestation","sign_citation":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27/action/citation_signature","submit_replication":"https://pith.science/pith/NTVJ6JU3SVXR4NVKY2P7QPOF27/action/replication_record"}},"created_at":"2026-05-18T00:27:47.720747+00:00","updated_at":"2026-05-18T00:27:47.720747+00:00"}